An efficient discretization scheme for solving ill-posed problems

DOI10.1016/j.jmaa.2005.06.009zbMath1091.65050OpenAlexW2042566396MaRDI QIDQ819641

M. P. Rajan

Publication date: 29 March 2006

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.06.009

zbMATH Keywords

complexityconvergenceHilbert spacenumerical experimentsprojectionorthonormal basisTikhonov regularizationlinear ill-posed problemsHaar waveletsdiscretization schemeHilbert scaleslinear differentiation operator

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

Related Items

An efficient discrete Landweber iteration for nonlinear problems ⋮ A modified steepest descent scheme for solving a class of parameter identification problems ⋮ A modified convergence analysis for steepest descent scheme for solving nonlinear operator equation ⋮ An efficient discretization scheme for solving nonlinear ill-posed problems ⋮ A posteriori parameter choice with an efficient discretization scheme for solving ill-posed problems

Cites Work

• Unnamed Item
• On the regularization of projection methods for solving ill-posed problems
• Integral equations of the third kind
• An A Posteriori Parameter Choice for Ordinary and Iterated Tikhonov Regularization of Ill-Posed Problems Leading to Optimal Convergence Rates
• On a generalized arcangeli's method for tikhonov regularization with inexact data
• Wavelet-Galerkin methods for ill-posed problems
• An adaptive discretization for Tikhonov-Phillips regularization with a posteriori parameter selection