On the power of adaption

DOI10.1006/JCOM.1996.0015zbMath0870.65042OpenAlexW2053424134MaRDI QIDQ2565198

Erich Novak

Publication date: 15 January 1997

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1996.0015

zbMATH Keywords

adaptive methodsoptimal error boundsa priori informationnon-numerical methods

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Numerical methods for integral equations (65R20) Numerical computation of solutions to single equations (65H05) Numerical quadrature and cubature formulas (65D32)

Related Items (25)

Local adaption for approximation and minimization of univariate functions ⋮ Rigorous confidence bounds for MCMC under a geometric drift condition ⋮ LINEAR AND NON-LINEAR WAVELET APPROXIMATIONS OF FUNCTIONS OF LIPSCHITZ CLASS AND RELATED CLASSES USING THE HAAR WAVELET SERIES ⋮ Some Results on the Complexity of Numerical Integration ⋮ Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case ⋮ Monte Carlo integration of \(C^r\) functions with adaptive variance reduction: an asymptotic analysis ⋮ A Universal Median Quasi-Monte Carlo Integration ⋮ Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces ⋮ Complexity of approximation of functions of few variables in high dimensions ⋮ Adaptive sensing performance lower bounds for sparse signal detection and support estimation ⋮ Complexity of linear problems with a fixed output basis ⋮ Automatic integration using asymptotically optimal adaptive simpson quadrature ⋮ Simple Monte Carlo and the Metropolis algorithm ⋮ High dimensional numerical problems ⋮ The cost of deterministic, adaptive, automatic algorithms: cones, not balls ⋮ A new algorithm and worst case complexity for Feynman-Kac path integration. ⋮ The power of adaption for approximating functions with singularities ⋮ Optimal approximation of elliptic problems by linear and nonlinear mappings. II ⋮ Tractability of the approximation of high-dimensional rank one tensors ⋮ Recovery algorithms for high-dimensional rank one tensors ⋮ Optimal integration of Lipschitz functions with a Gaussian weight ⋮ Uniform reconstruction of Gaussian processes ⋮ Automatic approximation using asymptotically optimal adaptive interpolation ⋮ Adaption allows efficient integration of functions with unknown singularities ⋮ Adaptive wavelet methods for elliptic operator equations: Convergence rates

This page was built for publication: On the power of adaption