A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization

DOI10.1016/j.apnum.2020.06.001zbMath1452.65076arXiv1807.08419OpenAlexW3036332818MaRDI QIDQ2192617

Yanfei Yang, Zhongxiao Jia

Publication date: 17 August 2020

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.08419

zbMATH Keywords

discrepancy principlesemi-convergencejoint bidiagonalizationgeneral-form regularizationlinear discrete ill-posed

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Ill-posedness and regularization problems in numerical linear algebra (65F22) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (8)

The joint bidiagonalization process with partial reorthogonalization ⋮ The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision ⋮ Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair ⋮ A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair ⋮ Thick-restarted joint Lanczos bidiagonalization for the GSVD ⋮ The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations ⋮ 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 ⋮ On choices of formulations of computing the generalized singular value decomposition of a large matrix pair

Uses Software

• LSQR
• Regularization tools
• RestoreTools
• UTV
• IR Tools
• HyBR
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inheritance of the discrete Picard condition in Krylov subspace methods
• Tikhonov regularization based on generalized Krylov subspace methods
• A Golub-Kahan-type reduction method for matrix pairs
• The rate of convergence of conjugate gradients
• Statistical and computational inverse problems.
• Iterative methods for image deblurring: A Matlab object-oriented approach
• Computing the generalized singular values/vectors of large sparse or structured matrix pairs
• Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
• Multidirectional subspace expansion for one-parameter and multiparameter Tikhonov regularization
• Regularization methods for the stable solution of inverse problems
• Regularization tools version \(4.0\) for matlab \(7.3\)
• Hybrid and Iteratively Reweighted Regularization by Unbiased Predictive Risk and Weighted GCV for Projected Systems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• A Krylov Subspace Method for Quadratic Matrix Polynomials with Application to Constrained Least Squares Problems
• Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization
• Efficient generalized Golub–Kahan based methods for dynamic inverse problems
• The low rank approximations and Ritz values in LSQR for linear discrete ill-posed problem
• 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
• Discrete Inverse Problems
• Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems
• A Projection‐Based Approach to General‐Form Tikhonov Regularization
• Least Squares Methods for Ill-Posed Problems with a Prescribed Bound

This page was built for publication: A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization