The minimal radius of Galerkin information for severely ill-posed problems
From MaRDI portal
Publication:470255
DOI10.1515/JIP-2013-0035zbMATH Open1299.65308OpenAlexW2334255410MaRDI QIDQ470255FDOQ470255
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
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
Numerical methods for integral equations (65R20) Linear operators and ill-posed problems, regularization (47A52)
Cited In (9)
- An optimal method for recovering the mixed derivative \(f^{(2,2)}\) of bivariate functions
- On optimization of projection methods for solving some classes of severely ill-posed problems
- 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
- Complexity estimates for severely ill-posed problems under a posteriori selection of regularization parameter
- 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)
