Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal quadrature for weighted function spaces on multivariate domains (2412.17546v1)

Published 23 Dec 2024 in math.NA and cs.NA

Abstract: Consider the numerical integration $${\rm Int}{\mathbb Sd,w}(f)=\int{\mathbb Sd}f({\bf x})w({\bf x}){\rm d}\sigma({\bf x}) $$ for weighted Sobolev classes $BW_{p,w}r(\mathbb Sd)$ with a Dunkl weight $w$ and weighted Besov classes $BB_\gamma\Theta(L_{p,w}(\mathbb Sd))$ with the generalized smoothness index $\Theta $ and a doubling weight $w$ on the unit sphere $\mathbb Sd$ of the Euclidean space $\mathbb R{d+1}$ in the deterministic and randomized case settings. For $BW_{p,w}r(\mathbb Sd)$ we obtain the optimal quadrature errors in both settings. For $BB_\gamma\Theta(L_{p,w}(\mathbb Sd))$ we use the weighted least $\ell_p$ approximation and the standard Monte Carlo algorithm to obtain upper estimates of the quadrature errors which are optimal if $w$ is an $A_\infty$ weight in the deterministic case setting or if $w$ is a product weight in the randomized case setting. Our results show that randomized algorithms can provide a faster convergence rate than that of the deterministic ones when $p>1$. Similar results are also established on the unit ball and the standard simplex of $\mathbb Rd$.

Summary

We haven't generated a summary for this paper yet.