An implicit shift bidiagonalization algorithm for ill-posed systems

DOI10.1007/BF01934265zbMath0821.65023OpenAlexW1977271024MaRDI QIDQ1347073

E. Grimme, Åke Björck, Paul Van Dooren

Publication date: 27 September 1995

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934265

zbMATH Keywords

numerical examplesiterative methodsill-posed problemLanczos algorithmgeneralized cross-validationregularization parametersimplicit restartsLanczos bidiagonalization with full reorthogonalizationlarge scale discrete ill-posed linear least squares problems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Related Items

Parameterized eigensolution technique for solving constrained least squares problems^∗, A Hybrid LSMR Algorithm for Large-Scale Tikhonov Regularization, An implicitly restarted block Lanczos bidiagonalization method using Leja shifts, The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data, Lanczos tridiagonalization and core problems, Restarted block Lanczos bidiagonalization methods, Iterative methods for the computation of a few eigenvalues of a large symmetric matrix, Harmonic multi-symplectic Lanczos algorithm for quaternion singular triplets, Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches, Solving large-scale constrained least-squares problems., 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, A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices, CGLS-GCV: A hybrid algorithm for low-rank-deficient problems., GKB-FP: An algorithm for large-scale discrete ill-posed problems, An inner–outer iterative method for edge preservation in image restoration and reconstruction ^*, Low Regularity Primal-Dual Weak Galerkin Finite Element Methods for Ill-Posed Elliptic Cauchy Problems, Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projection, Primal-dual weak Galerkin finite element methods for elliptic Cauchy problems, A STOPPING RULE FOR THE CONJUGATE GRADIENT REGULARIZATION METHOD APPLIED TO INVERSE PROBLEMS IN ACOUSTICS, Large-Scale Inverse Problems in Imaging, An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets, Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, A Framework for Regularization via Operator Approximation, Tikhonov regularization and the L-curve for large discrete ill-posed problems, Regularization tools for training large feed-forward neural networks using automatic differentiation^∗, Large scale least squares scattered data fitting

Uses Software

• LSQR
• Regularization tools
• eigs
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
• A fast ``Monte-Carlo cross-validation procedure for large least squares problems with noisy data
• Accelerated Landweber iterations for the solution of ill-posed equations
• Regularization methods for large-scale problems
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• An implicit restarted Lanczos method for large symmetric eigenvalue problems
• Accurate Singular Values of Bidiagonal Matrices
• Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
• A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix
• A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
• A Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed Problems
• Iterative SVD-Based Methods for Ill-Posed Problems
• Calculating the Singular Values and Pseudo-Inverse of a Matrix