Equivalence of regularization and truncated iteration for general ill-posed problems

DOI10.1016/0024-3795(94)00114-6zbMath0849.65021OpenAlexW2040100614MaRDI QIDQ1911416

Reginaldo J. Santos

Publication date: 11 November 1996

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)00114-6

zbMATH Keywords

iterative methodTikhonov regularizationill-posed problemnormal equationsFredholm integral equation of the first kindincomplete-rank matrices

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical methods for integral equations (65R20) Numerical methods for ill-posed problems for integral equations (65R30) Fredholm integral equations (45B05)

Related Items (2)

Asymptotic \(L^\infty\)-based comparison of Tikhonov regularization and Landweber iteration ⋮ The convergence properties for regularized Landweber method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalence of regularization and truncated iteration in the solution of ill-posed image reconstruction problems
• Regularization methods for large-scale problems
• Theory and Methods Related to the Singular-Function Expansion and Landweber’s Iteration for Integral Equations of the First Kind
• The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations
• An Iteration Formula for Fredholm Integral Equations of the First Kind

This page was built for publication: Equivalence of regularization and truncated iteration for general ill-posed problems