Multivariate approximation by translates of the Korobov function on Smolyak grids
Dinh Dung, Charles Micchelli

TL;DR
This paper investigates multivariate function approximation on the torus using translates of the Korobov function, employing sparse Smolyak grids to achieve efficient error bounds, especially in the Hilbert space case.
Contribution
It provides new upper bounds for approximation errors using translates of the Korobov function on Smolyak grids, including constructions for the case of Hilbert spaces.
Findings
Established upper bounds for worst-case approximation errors.
Constructed approximation methods based on sparse Smolyak grids.
Provided lower bounds for optimal approximation with Korobov functions.
Abstract
For a set , , of multivariate periodic functions on the torus and a given function , we study the approximation in the -norm of functions by arbitrary linear combinations of translates of . For and , we prove upper bounds of the worst case error of this approximation where is the unit ball in the Korobov space and is the associated Korobov function. To obtain the upper bounds, we construct approximation methods based on sparse Smolyak grids. The case , is especially important since is a reproducing kernel Hilbert space, whose reproducing kernel is a translation kernel determined by . We also provide lower bounds of the optimal…
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 · Advanced Numerical Analysis Techniques
