The optimal approximations for solving linear ill-posed problems

DOI10.1006/JCOM.2000.0546MaRDI QIDQ5938582zbMATH OpenOpenAlexFDO

Authors S. G. Solodky

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

information complexitylinear ill-posed problemlinear operator equation of the first kindoptimal approximationprojection schemeselfadjoint operator

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) Complexity and performance of numerical algorithms (65Y20)

Review text

Recently, investigations on the information complexity have received a lot of attention in solving various problems. In this study, by complexity we mean the minimal amount of discrete information required to guarantee a fixed accuracy of an approximated solution to the problem.NEWLINENEWLINENEWLINEThe goal of the paper is the construction of some new projection schemes for the discretization of ill-posed problems, which are optimal on several classes of equations of the first kind. In particular, the author establishes the unexpected effect that the use of selfadjoint approximating operators in the discretization of equations with selfadjoint operators is generally not optimal in the sense of volume of used discrete information.

Recommendations

• On minimization of discrete informaton for solving ill-posed problems
• On optimization of projection methods for solving some classes of severely ill-posed problems
• scientific article; zbMATH DE number 1376714
• Optimization of projection methods for linear ill-posed problems
• On a modification of a projection scheme for solving ill-posed problems

Cites work

• A generalized projection scheme for solving ill-posed problems
• scientific article; zbMATH DE number 4015366 (Why is no real title available?)
• scientific article; zbMATH DE number 3954180 (Why is no real title available?)
• scientific article; zbMATH DE number 3688714 (Why is no real title available?)
• scientific article; zbMATH DE number 50734 (Why is no real title available?)
• scientific article; zbMATH DE number 3461448 (Why is no real title available?)
• scientific article; zbMATH DE number 1156418 (Why is no real title available?)
• scientific article; zbMATH DE number 953016 (Why is no real title available?)
• Information complexity of equations of the second kind with compact operators in Hilbert space
• Information complexity of multivariate Fredholm integral equations in Sobolev classes
• 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
• 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

Cited in

(23)

• Hyperbolic cross and the complexity of various classes of ill-posed linear problems
• Ill-posedness with respect to the solvability in linear optimization
• Optimal finite characterization of linear problems with inexact data
• Optimal discretization of inverse problems in Hilbert scales. Regularization and self-regulari\-za\-tion of projection methods
• On optimization of projection methods for solving some classes of severely ill-posed problems
• An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
• scientific article; zbMATH DE number 4133453 (Why is no real title available?)
• Approximations for ill-posed problems
• scientific article; zbMATH DE number 4203594 (Why is no real title available?)
• On reduction of informational expenses in solving ill-posed problems with not exactly given input data
• scientific article; zbMATH DE number 3905262 (Why is no real title available?)
• An Improved Version of Marti's Method for Solving Ill-Posed Linear Integral Equations
• scientific article; zbMATH DE number 3956824 (Why is no real title available?)
• ON THE SOLUTION OF LINEAR ILL-POSED PROBLEMS ON THE BASIS OF A MODIFIED QUASIOPTIMALITY CRITERION
• scientific article; zbMATH DE number 4038995 (Why is no real title available?)
• A posteriori parameter choice strategy for fast multiscale methods solving ill-posed integral equations
• scientific article; zbMATH DE number 1059229 (Why is no real title available?)
• A new method for solving linear ill-posed problems
• The minimal radius of Galerkin information for severely ill-posed problems
• scientific article; zbMATH DE number 1567825 (Why is no real title available?)
• Analysis of the Minimal Residual Method Applied to Ill Posed Optimality Systems
• An efficient discretization scheme for solving nonlinear ill-posed problems
• Linear Functional Strategy and the Approximate Inverse for Nonlinear Ill-Posed Problems

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

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