Optimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ball
Jiansong Li, Heping Wang

TL;DR
This paper analyzes the optimal randomized numerical integration methods for weighted Sobolev and Besov classes on the ball with Jacobi weights, showing that randomness can improve convergence rates over deterministic methods.
Contribution
It derives the order of the optimal quadrature errors in the randomized setting for weighted Sobolev and Besov classes, demonstrating improved convergence compared to deterministic methods.
Findings
Randomized quadrature errors decay as n^{-r/d-1/2+(1/p-1/2)_+}.
Randomness improves convergence rates when p>1.
Optimal error bounds are established for weighted classes on the ball.
Abstract
We consider the numerical integration for the weighted Sobolev classes and the weighted Besov classes in the randomized case setting, where is the classical Jacobi weight on the ball , , , and . For the above two classes, we obtain the orders of the optimal quadrature errors in the randomized case setting are . Compared to the orders of the optimal quadrature errors in the deterministic case setting, randomness can effectively improve the order of convergence when .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Mathematical functions and polynomials · Probabilistic and Robust Engineering Design
