Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. II

DOI10.1007/BF02515229zbMath0941.65050OpenAlexW4234648426MaRDI QIDQ4705305

No author found.

Publication date: 19 December 1999

Published in: Ukrainian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02515229

zbMATH Keywords

regularization methodsincorrect problemsinformational complexityprojection algorithmsFredholm equations of the first kind

Mathematics Subject Classification ID

Numerical methods for integral equations (65R20) Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Fredholm integral equations (45B05) Complexity and performance of numerical algorithms (65Y20) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Related Items (2)

The optimal approximations for solving linear ill-posed problems ⋮ Hyperbolic cross and the complexity of various classes of ill-posed linear problems

This page was built for publication: Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. II