Are linear algorithms always good for linear problems?

DOI10.1007/BF02188189zbMath0603.65036OpenAlexW1980161684MaRDI QIDQ1082778

Henryk Woźniakowski, Arthur G. Werschulz

Publication date: 1986

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

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

zbMATH Keywords

complexityLaplace transform inversioninformation operatorlinear optimal error algorithmsmildly nonlinear algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General theory of numerical analysis in abstract spaces (65J05) Laplace transform (44A10) Numerical methods for integral transforms (65R10)

Related Items

Recent developments in information-based complexity, Optimal residual algorithms for linear operator equations, Linearity of algorithms and a result of Ando, Complexity of linear problems with a fixed output basis, Linear vs. nonlinear algorithms for linear problems, On linearity of spline algorithms

Cites Work

• Linear problems (with extended range) have linear optimal algorithms
• Optimal residual algorithms for linear operator equations
• Best approximation of analytic functions from information about their values at a finite number of points
• What is the complexity of ill-posed problems?
• On the optimality of linear methods for operator approximation in convex classes of functions
• Unnamed Item
• Unnamed Item