The minimal radius of Galerkin information for severely ill-posed problems

DOI10.1515/JIP-2013-0035MaRDI QIDQ470255zbMATH OpenOpenAlexFDO

Authors Sergei G. Solodky, Ganna L. Myleiko

Publication date 12 November 2014

Published in Journal of Inverse and Ill-posed Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/jip-2013-0035

zbMATH Keywords

error estimateGalerkin informationminimal radiusseverely ill-posed problems

Mathematics Subject Classification ID

Numerical methods for integral equations (65R20) Linear operators and ill-posed problems, regularization (47A52)

Recommendations

• Hyperbolic cross and complexity of severely ill-posed problems
• On optimization of projection methods for solving some classes of severely ill-posed problems
• On minimization of discrete informaton for solving ill-posed problems
• Optimization of projection methods for linear ill-posed problems
• The optimal approximations for solving linear ill-posed problems

Cited in

(9)

• Complexity estimates for severely ill-posed problems under a posteriori selection of regularization parameter
• On optimization of projection methods for solving some classes of severely ill-posed problems
• An optimal method for recovering the mixed derivative \(f^{(2,2)}\) of bivariate functions
• The minimal radius of Galerkin information for the problem of numerical differentiation
• On reduction of informational expenses in solving ill-posed problems with not exactly given input data
• An optimal method for high-order mixed derivatives of bivariate functions
• Hyperbolic cross and complexity of severely ill-posed problems
• Hyperbolic cross and the complexity of various classes of ill-posed linear problems
• Optimization of the methods of numerical differentiation for bivariate functions

This page was built for publication: The minimal radius of Galerkin information for severely ill-posed problems

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