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

DOI10.1080/00036811.2015.1036748MaRDI QIDQ2805614zbMATH OpenOpenAlexWikidataFDO

Authors S. G. Solodky, Ganna L. Myleiko

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

ill-posed problemsprojection schemealgorithmic complexityGalerkin informationorder estimate

Mathematics Subject Classification ID

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

Recommendations

• Bounds of Information Expenses in Constructing Projection Methods for Solving Ill-posed Problems
• Optimization of projection methods for solving ill-posed problems
• The minimal radius of Galerkin information for severely ill-posed problems
• Optimization of projection methods for linear ill-posed problems
• The optimal approximations for solving linear ill-posed problems

Cites work

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

Cited in

(14)

• Complexity estimates for severely ill-posed problems under a posteriori selection of regularization parameter
• An optimal quasi solution for the Cauchy problem for Laplace equation in the framework of inverse ECG
• An optimal method for recovering the mixed derivative \(f^{(2,2)}\) of bivariate functions
• The optimal approximations for solving linear ill-posed problems
• On minimization of discrete informaton for solving ill-posed problems
• Optimization of projection methods for solving ill-posed problems
• The minimal radius of Galerkin information for severely ill-posed problems
• scientific article; zbMATH DE number 1524451 (Why is no real title available?)
• On reduction of informational expenses in solving ill-posed problems with not exactly given input data
• Optimization of projection methods for linear ill-posed problems
• An optimal method for high-order mixed derivatives of bivariate functions
• On the optimization of projection-iterative methods for the approximate solution of ill-posed problems
• Hyperbolic cross and complexity of severely ill-posed problems
• Hyperbolic cross and the complexity of various classes of ill-posed linear problems

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

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