The minimal radius of Galerkin information for severely ill-posed problems
From MaRDI portal
Publication:470255
DOI10.1515/JIP-2013-0035zbMath1299.65308OpenAlexW2334255410MaRDI QIDQ470255
Ganna L. Myleiko, Sergei G. Solodky
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
Numerical methods for integral equations (65R20) Linear operators and ill-posed problems, regularization (47A52)
Related Items (5)
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 ⋮ Hyperbolic cross and the complexity of various classes of ill-posed linear problems ⋮ Optimization of the methods of numerical differentiation for bivariate functions ⋮ COMPLEXITY ESTIMATES FOR SEVERELY ILL-POSED PROBLEMS UNDER A POSTERIORI SELECTION OF REGULARIZATION PARAMETER
This page was built for publication: The minimal radius of Galerkin information for severely ill-posed problems
