On minimization of discrete informaton for solving ill-posed problems

zbMATH Open1164.65020MaRDI QIDQ3607880FDOQ3607880

Authors: Evgeniy A. Volynets, E. A. Luk'yanova 

Publication date: 28 February 2009

Recommendations

• Optimization of projection methods for linear ill-posed problems
• scientific article; zbMATH DE number 2157156
• scientific article; zbMATH DE number 1376714
• On optimization of projection methods for solving some classes of severely ill-posed problems
• On the optimization of projection-iterative methods for the approximate solution of ill-posed problems

zbMATH Keywords

ill-posed problemsnormal solutionprojection methodslinear operator equationsdiscrete informationGalerkin's informationoptimal exactness

Mathematics Subject Classification ID

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

Cited In (8)

• The optimal approximations for solving linear ill-posed problems
• Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case
• The minimal radius of Galerkin information for severely ill-posed problems
• Optimization of projection methods for linear ill-posed problems
• Bounds of Information Expenses in Constructing Projection Methods for Solving Ill-posed Problems
• On the optimization of projection-iterative methods for the approximate solution of ill-posed problems
• Hyperbolic cross and complexity of severely ill-posed problems
• On the conditions of convergence for one class of methods used for the solution of ill-posed problems

This page was built for publication: On minimization of discrete informaton for solving ill-posed problems

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