The optimal approximations for solving linear ill-posed problems

DOI10.1006/jcom.2000.0546zbMath1005.65051OpenAlexW2023949524MaRDI QIDQ5938582

No author found.

Publication date: 11 February 2003

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

Full work available at URL: https://doi.org/10.1006/jcom.2000.0546

zbMATH Keywords

projection schemeselfadjoint operatorlinear operator equation of the first kindlinear ill-posed probleminformation complexityoptimal approximation

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Complexity and performance of numerical algorithms (65Y20) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

Related Items (3)

A posteriori parameter choice strategy for fast multiscale methods solving ill-posed integral equations ⋮ On optimization of projection methods for solving some classes of severely ill-posed problems ⋮ Hyperbolic cross and the complexity of various classes of ill-posed linear problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the regularization of projection methods for solving ill-posed problems
• Information complexity of equations of the second kind with compact operators in Hilbert space
• Optimization of projection methods for solving ill-posed problems
• Information complexity of multivariate Fredholm integral equations in Sobolev classes
• The minimal radius of Galerkin information for the Fredholm problem of the first kind
• A generalized projection scheme for solving ill-posed problems
• Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. I
• Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. II

This page was built for publication: The optimal approximations for solving linear ill-posed problems