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