Bounds of Information Expenses in Constructing Projection Methods for Solving Ill-posed Problems

DOI10.2478/CMAM-2006-0004MaRDI QIDQ5290207zbMATH OpenOpenAlexFDO

Authors Sergei G. Solodky, E. V. Lebedeva

Publication date 27 April 2006

Published in Computational Methods in Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/cmam-2006-0004

zbMATH Keywords

discrepancy principlediscretizationHilbert spaceill-posed problemsnumerical examplesprojection schemeregularization methods

Mathematics Subject Classification ID

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

Recommendations

• Optimization of projection methods for linear ill-posed problems
• On the regularization of projection methods for solving ill-posed problems
• scientific article; zbMATH DE number 2157156
• On minimization of discrete informaton for solving ill-posed problems
• On a modification of a projection scheme for solving ill-posed problems

Cited in

(2)

• On optimization of projection methods for solving some classes of severely ill-posed problems
• On reduction of informational expenses in solving ill-posed problems with not exactly given input data

This page was built for publication: Bounds of Information Expenses in Constructing Projection Methods for Solving Ill-posed Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5290207)