The adaption problem for approximating linear operators

DOI10.1090/S0273-0979-1990-15924-5zbMath0704.65041MaRDI QIDQ3484276

Erich Novak, Mark A. Kon

Publication date: 1990

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Banach spacesHilbert spaceerror boundsfinite-dimensional approximationlinear operators

Mathematics Subject Classification ID

Linear operator approximation theory (47A58) Numerical solutions to equations with linear operators (65J10)

Related Items (3)

Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case ⋮ Joint spectra of Toeplitz operators and optimal recovery of analytic functions ⋮ Generalized adaptive versus nonadaptive recovery from noisy information

Cites Work

• Unnamed Item
• Unnamed Item
• s-numbers in information-based complexity
• How powerful is continuous nonlinear information for linear problems?
• Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
• Recent developments in information-based complexity
• Optimal sequential and non-sequential procedures for evaluating a functional
• On the optimality of linear methods for operator approximation in convex classes of functions

This page was built for publication: The adaption problem for approximating linear operators