Linear problems (with extended range) have linear optimal algorithms

DOI10.1007/BF02188168zbMath0637.41024MaRDI QIDQ1099022

Edward W. Packel

Publication date: 1986

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137138

zbMATH Keywords

optimal algorithmlinear algorithm

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Numerical solutions to equations with linear operators (65J10) Algorithms in computer science (68W99) Approximation by arbitrary linear expressions (41A45)

Related Items (7)

Are linear algorithms always good for linear problems? ⋮ On the existence of optimal affine methods for approximating linear functionals ⋮ Recent developments in information-based complexity ⋮ Linearity of algorithms and a result of Ando ⋮ Linear vs. nonlinear algorithms for linear problems ⋮ s-numbers in information-based complexity ⋮ On linearity of spline algorithms

Cites Work

• Best approximation of analytic functions from information about their values at a finite number of points
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear problems (with extended range) have linear optimal algorithms