Optimal residual algorithms for linear operator equations

DOI10.1016/0885-064X(91)90003-GzbMath0759.65031OpenAlexW2034237959MaRDI QIDQ1179027

Arthur G. Werschulz

Publication date: 26 June 1992

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(91)90003-g

zbMATH Keywords

Laplace transformBanach spaceill-posed problemoptimal algorithmlinear problemlinear algorithmresidual error bounds

Mathematics Subject Classification ID

Spectrum, resolvent (47A10) Laplace transform (44A10) Numerical methods for integral transforms (65R10) Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Related Items (2)

Are linear algorithms always good for linear problems? ⋮ Linear ill-posed problems are solvable on the average for all Gaussian measures

Cites Work

• Uncertainty in the solution of linear operator equations
• Are linear algorithms always good for linear problems?
• Do Linear Problems Have Linear Optimal Algorithms?
• What is the complexity of ill-posed problems?
• On Finite Laplace Transformation with Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal residual algorithms for linear operator equations