Optimization of projection methods for solving ill-posed problems
From MaRDI portal
Publication:1895651
DOI10.1007/BF02238096zbMath0830.65044OpenAlexW1554896035MaRDI QIDQ1895651
Publication date: 4 February 1996
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02238096
Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
Related Items (19)
Application of Fourier truncation method to numerical differentiation for bivariate functions ⋮ On adaptive discretization schemes for the solution of ill-posed problems with semiiterative methods ⋮ An optimal method for recovering the mixed derivative \(f^{(2,2)}\) of bivariate functions ⋮ An efficient discretization scheme for solving nonlinear ill-posed problems ⋮ The minimal radius of Galerkin information for the problem of numerical differentiation ⋮ A class of parameter choice strategies for the finite dimensional weighted Tikhonov regularization scheme ⋮ A posteriori parameter choice strategy for fast multiscale methods solving ill-posed integral equations ⋮ On reduction of informational expenses in solving ill-posed problems with not exactly given input data ⋮ On the optimization of projection-iterative methods for the approximate solution of ill-posed problems ⋮ Complexity of projective methods for the solution of ill-posed problems ⋮ ARCANGELI'S DISCREPANCY PRINCIPLE FOR A MODIFIED PROJECTION SCHEME FOR ILL-POSED PROBLEMS ⋮ The optimal approximations for solving linear ill-posed problems ⋮ On the efficient discretization of integral equations of the third kind ⋮ Estimates of efficiency for two methods of stable numerical summation of smooth functions ⋮ A fast multiscale Galerkin method for the first kind ill-posed integral equations via iterated regularization ⋮ On optimization of projection methods for solving some classes of severely ill-posed problems ⋮ A Variant of Projection-Regularization Method for Ill-Posed Linear Operator Equations ⋮ Hyperbolic cross and the complexity of various classes of ill-posed linear problems ⋮ COMPLEXITY ESTIMATES FOR SEVERELY ILL-POSED PROBLEMS UNDER A POSTERIORI SELECTION OF REGULARIZATION PARAMETER
Cites Work
- Unnamed Item
- Unnamed Item
- On the regularization of projection methods for solving ill-posed problems
- The discrepancy principle for a class of regularization methods
- Complexity of the problem of finding the solutions of fredholm equations of the second kind with smooth kernels. I
- Wavelet-Like Bases for the Fast Solution of Second-Kind Integral Equations
This page was built for publication: Optimization of projection methods for solving ill-posed problems
