A new \(L\)-curve for ill-posed problems

DOI10.1016/j.cam.2007.01.025zbMath1145.65035OpenAlexW2037893344MaRDI QIDQ935810

Hassane Sadok, Lothar Reichel

Publication date: 8 August 2008

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2007.01.025

zbMATH Keywords

Fredholm integral equationnumerical examplesHilbert spacelinear operator equationtruncated singular value decomposition\(L\)-curvecompact linear operatorlinear ill-posed problemtruncation criteriontruncation index

Mathematics Subject Classification ID

Numerical methods for integral equations (65R20) Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Fredholm integral equations (45B05) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Related Items

A stopping criterion for iterative regularization methods ⋮ Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems ⋮ Parameter determination for Tikhonov regularization problems in general form ⋮ Exploiting compression in solving discretized linear systems ⋮ Sparse Bayesian learning for the Laplace transform inversion in dynamic light scattering ⋮ An extrapolated TSVD method for linear discrete ill-posed problems with Kronecker structure ⋮ A new investigation into regularization techniques for the method of fundamental solutions ⋮ Old and new parameter choice rules for discrete ill-posed problems ⋮ Application of fractional derivatives for obtaining new Tikhonov regularization matrices ⋮ FGMRES for linear discrete ill-posed problems ⋮ A new variant of L-curve for Tikhonov regularization ⋮ Regularization parameter determination for discrete ill-posed problems ⋮ Extension of Tikhonov regularization method using linear fractional programming ⋮ Approximate Schur-block ILU preconditioners for regularized solution of discrete ill-posed problems ⋮ Simple stopping criteria for the LSQR method applied to discrete ill-posed problems ⋮ An efficient Gauss-Newton algorithm for solving regularized total least squares problems

Uses Software

• Regularization tools
• corner.m

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• L-curve and curvature bounds for Tikhonov regularization
• Extrapolation techniques for ill-conditioned linear systems
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Multi-parameter regularization techniques for ill-conditioned linear systems
• The triangle method for finding the corner of the L-curve
• Estimation of the \(L\)-curve via Lanczos bidiagonalization
• Iterative methods for ill-posed problems and semiconvergent sequences
• An adaptive pruning algorithm for the discrete L-curve criterion
• Improvement of the resolution of an instrument by numerical solution of an integral equation
• Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
• A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems