On optimization of projection methods for solving some classes of severely ill-posed problems

DOI10.1080/00036811.2015.1036748zbMath1341.65052OpenAlexW1985118571WikidataQ58304277 ScholiaQ58304277MaRDI QIDQ2805614

No author found.

Publication date: 12 May 2016

Published in: Applicable Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00036811.2015.1036748

zbMATH Keywords

projection schemealgorithmic complexityill-posed problemsGalerkin informationorder estimate

Mathematics Subject Classification ID

Numerical methods for integral equations (65R20) Numerical methods for ill-posed problems for integral equations (65R30) Fredholm integral equations (45B05) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

Related Items (4)

An optimal method for recovering the mixed derivative \(f^{(2,2)}\) of bivariate functions ⋮ An optimal quasi solution for the Cauchy problem for Laplace equation in the framework of inverse ECG ⋮ Hyperbolic cross and the complexity of various classes of ill-posed linear problems ⋮ COMPLEXITY ESTIMATES FOR SEVERELY ILL-POSED PROBLEMS UNDER A POSTERIORI SELECTION OF REGULARIZATION PARAMETER

Cites Work

• On the regularization of projection methods for solving ill-posed problems
• Optimization of projection methods for solving ill-posed problems
• The minimal radius of Galerkin information for the Fredholm problem of the first kind
• What is the complexity of ill-posed problems?
• Tikhonov Regularization for Finitely and Infinitely Smoothing Operators
• Optimality for ill-posed problems under general source conditions
• Discretization strategy for linear ill-posed problems in variable Hilbert scales
• Regularization of exponentially ill-posed problems
• The optimal approximations for solving linear ill-posed problems

This page was built for publication: On optimization of projection methods for solving some classes of severely ill-posed problems