Asymptotic Theory of Filtering for Linear Operator Equations with Discrete Noisy Data

DOI10.2307/2008324zbMATH Open0687.65122OpenAlexW4239053270MaRDI QIDQ4206367FDOQ4206367

Author name not available (Why is that?)

Publication date: 1987

Full work available at URL: https://doi.org/10.2307/2008324

Recommendations

• Assessing regularised solutions
• Convergence rates for moment collocation solutions of linear operator equations
• scientific article; zbMATH DE number 4016057
• Convergence Rates for Regularized Solutions
• Convergence rates for regularized solutions of integral equations from discrete noisy data

zbMATH Keywords

asymptoticconvergenceTikhonov regularizationHilbert spaceregularization methodill-posed problemLandweber iterationtruncated singular value decompositionfiltering methodsfirst kinddiscrete noisy dataFredholm integral equations of the

Mathematics Subject Classification ID

Numerical methods for integral equations (65R20) Equations and inequalities involving linear operators, with vector unknowns (47A50) Fredholm integral equations (45B05) Numerical solutions to equations with linear operators (65J10)

Cited In (3)

• Learning a function from noisy samples at a finite sparse set of points
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Convergence of non-linear diagonal frame filtering for regularizing inverse problems

This page was built for publication: Asymptotic Theory of Filtering for Linear Operator Equations with Discrete Noisy Data

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