On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation
DOI10.1090/S0025-5718-06-01865-5zbMath1096.65028OpenAlexW1969362075MaRDI QIDQ5470052
Michael Griebel, Henryk Woźniakowski
Publication date: 29 May 2006
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-06-01865-5
reproducing kernel Hilbert spacesoptimal convergence ratemultirate integration and approximationuniversal and nonuniversal algorithms
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Multidimensional problems (41A63) Algorithms for approximation of functions (65D15) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32)
Related Items (2)
Cites Work
- Average case complexity of linear multivariate problems. II: Applications
- Deterministic and stochastic error bounds in numerical analysis
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Numerical integration using sparse grids
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Integration and \(L_ 2\)-approximation: Average case setting with isotropic Wiener measure for smooth functions
- Average-case analysis of numerical problems
- Integration and approximation in arbitrary dimensions
- High dimensional integration of smooth functions over cubes
- Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure
- Sparse grids
- On universal quadrature formulae
- Theory of Reproducing Kernels
- On the power of standard information for weighted approximation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation
