The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data

DOI10.1007/s10543-009-0239-7zbMath1184.65044OpenAlexW2067461769MaRDI QIDQ2655224

Martin Plešinger, Zdeněk Strakoš, Iveta Hnetynkova

Publication date: 22 January 2010

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-009-0239-7

zbMATH Keywords

regularizationstopping criterianumerical examplesnoise levelGolub-Kahan iterative bidiagonalizationlarge ill-posed problems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Linear equations (linear algebraic aspects) (15A06) Canonical forms, reductions, classification (15A21)

Related Items

Efficient estimation of regularization parameters via downsampling and the singular value expansion, downsampling regularization parameter estimation, A Krylov subspace type method for Electrical Impedance Tomography, Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs, A stopping criterion for iterative regularization methods, A Hybrid LSMR Algorithm for Large-Scale Tikhonov Regularization, Inheritance of the discrete Picard condition in Krylov subspace methods, A note on the Morozov principle via Lagrange duality, Noise representation in residuals of LSQR, LSMR, and CRAIG regularization, Two projection methods for regularized total least squares approximation, Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches, Double precision is not necessary for LSQR for solving discrete linear ill-posed problems, Tikhonov regularization via flexible Arnoldi reduction, Regularization properties of LSQR for linear discrete ill-posed problems in the multiple singular value case and best, near best and general low rank approximations, Hybrid and Iteratively Reweighted Regularization by Unbiased Predictive Risk and Weighted GCV for Projected Systems, Old and new parameter choice rules for discrete ill-posed problems, Some results on the regularization of LSQR for large-scale discrete ill-posed problems, Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems, Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction, GKB-FP: An algorithm for large-scale discrete ill-posed problems, Hybrid Projection Methods with Recycling for Inverse Problems, The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides, Two new efficient iterative regularization methods for image restoration problems, Regularization parameter determination for discrete ill-posed problems, Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems, Hybrid Projection Methods with Recycling for Inverse Problems, The low rank approximations and Ritz values in LSQR for linear discrete ill-posed problem, Iterative hybrid regularization for extremely noisy full models in single particle analysis, A Framework for Regularization via Operator Approximation, Regularization by Inexact Krylov Methods with Applications to Blind Deblurring

Uses Software

• LSQR
• Regularization tools
• UTV
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• L-curve and curvature bounds for Tikhonov regularization
• Computing projections with LSQR
• A weighted-GCV method for Lanczos-hybrid regularization
• Noise propagation in regularizing iterations for image deblurring
• Lanczos tridiagonalization and core problems
• Iterative regularization with minimum-residual methods
• Fast Fourier transforms: A tutorial review and a state of the art
• Model reduction using the Vorobyev moment problem
• A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
• Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
• An implicit shift bidiagonalization algorithm for ill-posed systems
• Tikhonov regularization and the L-curve for large discrete ill-posed problems
• Scaled total least squares fundamentals
• A new stable bidiagonal reduction algorithm
• Estimation of the \(L\)-curve via Lanczos bidiagonalization
• Exploiting residual information in the parameter choice for discrete ill-posed problems
• On sensitivity of Gauss-Christoffel quadrature
• Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
• Near-Optimal Parameters for Tikhonov and Other Regularization Methods
• Using Core Formulations for Ill-posed Linear Systems
• Reconstruction of Single-Grain Orientation Distribution Functions for Crystalline Materials
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• Residual periodograms for choosing regularization parameters for ill-posed problems
• A Useful Form of Unitary Matrix Obtained from Any Sequence of Unit 2-Norm n-Vectors
• A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• On Adaptive Weighted Polynomial Preconditioning for Hermitian Positive Definite Matrices
• Regularization by Truncated Total Least Squares
• Efficient generalized cross-validation with applications to parametric image restoration and resolution enhancement
• Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
• An Algorithm for the Machine Calculation of Complex Fourier Series
• A Projection‐Based Approach to General‐Form Tikhonov Regularization
• Core Problems in Linear Algebraic Systems
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Methods of conjugate gradients for solving linear systems
• Geometry of moment spaces