On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation

DOI10.1090/S0025-5718-06-01865-5zbMath1096.65028MaRDI QIDQ5470052

Michael Griebel, Henryk Woźniakowski

Publication date: 29 May 2006

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

reproducing kernel Hilbert spaces; optimal convergence rate; multirate integration and approximation; universal and nonuniversal algorithms

Mathematics Subject Classification ID

41A65: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)

41A63: Multidimensional problems

65D15: Algorithms for approximation of functions

41A55: Approximate quadratures

65D32: Numerical quadrature and cubature formulas

Related Items

The power of standard information for multivariate approximation in the randomized setting

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
• 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
• Unnamed Item