Do Linear Problems Have Linear Optimal Algorithms?
From MaRDI portal
Publication:3357652
DOI10.1137/1030091zbMath0732.41035OpenAlexW2068169430MaRDI QIDQ3357652
Publication date: 1988
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1030091
Normed linear spaces and Banach spaces; Banach lattices (46B99) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Numerical solutions to equations with linear operators (65J10) Approximation by arbitrary linear expressions (41A45)
Related Items
Learning from non-random data in Hilbert spaces: an optimal recovery perspective, The algorithm designer versus nature: A game-theoretic approach to information-based complexity, Mini-Minimax Uncertainty Quantification for Emulators, Full recovery from point values: an optimal algorithm for Chebyshev approximability prior, Recent developments in information-based complexity, Optimal residual algorithms for linear operator equations, Linearity of algorithms and a result of Ando
