Comparingparameter choice methods for regularization of ill-posed problems

F Bauer, MA Lukas - Mathematics and Computers in Simulation, 2011 - Elsevier
In the literature on regularization, many different parameter choice methods have been
proposed in both deterministic and stochastic settings. However, based on the available …

Computational methods for large-scale inverse problems: a survey on hybrid projection methods

J Chung, S Gazzola - Siam Review, 2024 - SIAM
This paper surveys an important class of methods that combine iterative projection methods
and variational regularization methods for large-scale inverse problems. Iterative methods …

[LIBRO][B] Numerical methods for least squares problems

Å Björck - 2024 - SIAM
Excerpt More than 25 years have passed since the first edition of this book was published in
1996. Least squares and least-norm problems have become more significant with every …

[LIBRO][B] Orthogonal polynomials: computation and approximation

W Gautschi - 2004 - books.google.com
This is the first book on constructive methods for, and applications of orthogonal
polynomials, and the first available collection of relevant Matlab codes. The book begins …

[LIBRO][B] Matrices, moments and quadrature with applications

GH Golub, G Meurant - 2009 - books.google.com
This computationally oriented book describes and explains the mathematical relationships
among matrices, moments, orthogonal polynomials, quadrature rules, and the Lanczos and …

Old and new parameter choice rules for discrete ill-posed problems

L Reichel, G Rodriguez - Numerical Algorithms, 2013 - Springer
Linear discrete ill-posed problems are difficult to solve numerically because their solution is
very sensitive to perturbations, which may stem from errors in the data and from round-off …

[HTML][HTML] An adaptive pruning algorithm for the discrete L-curve criterion

PC Hansen, TK Jensen, G Rodriguez - Journal of computational and …, 2007 - Elsevier
We describe a robust and adaptive implementation of the L-curve criterion. The algorithm
locates the corner of a discrete L-curve which is a log–log plot of corresponding residual …

Tikhonov regularization of large linear problems

D Calvetti, L Reichel - BIT Numerical Mathematics, 2003 - Springer
Many numerical methods for the solution of linear ill-posed problems apply Tikhonov
regularization. This paper presents a new numerical method, based on Lanczos …

Reducing errors in the GRACE gravity solutions using regularization

H Save, S Bettadpur, BD Tapley - Journal of Geodesy, 2012 - Springer
The nature of the gravity field inverse problem amplifies the noise in the GRACE data, which
creeps into the mid and high degree and order harmonic coefficients of the Earth's monthly …

The triangle method for finding the corner of the L-curve

JL Castellanos, S Gómez, V Guerra - Applied Numerical Mathematics, 2002 - Elsevier
The Conjugate Gradient Method (CG) has an intrinsic regularization property when applied
to systems of linear equations with ill-conditioned matrices. This regularization property is …