The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations
From MaRDI portal
Publication:6180360
DOI10.1137/22m1541083arXiv2303.06943OpenAlexW4390950051WikidataQ129750378 ScholiaQ129750378MaRDI QIDQ6180360
Publication date: 19 January 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.06943
GSVDLanczos bidiagonalizationinner iterationjoint bidiagonalizationconvergence and accuracystopping tolerance
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Eigenvalues, singular values, and eigenvectors (15A18) Orthogonalization in numerical linear algebra (65F25) Error analysis and interval analysis (65G99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The joint bidiagonalization process with partial reorthogonalization
- Partial least-squares vs. Lanczos bidiagonalization. I: Analysis of a projection method for multiple regression
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Computing the generalized singular values/vectors of large sparse or structured matrix pairs
- Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
- A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
- The university of Florida sparse matrix collection
- Controlling Inner Iterations in the Jacobi–Davidson Method
- A Useful Form of Unitary Matrix Obtained from Any Sequence of Unit 2-Norm n-Vectors
- Perturbation Analysis for the Generalized Singular Value Problem
- A Note on a Result of Sun Ji-Guang: Sensitivity of the CS and GSV Decompositions
- Towards a Generalized Singular Value Decomposition
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Bounds on Perturbations of Generalized Singular Values and of Associated Subspaces
- Generalizing the Singular Value Decomposition
- Rank-Deficient and Discrete Ill-Posed Problems
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- A Jacobi--Davidson Method for Solving Complex Symmetric Eigenvalue Problems
- Accuracy and Stability of Numerical Algorithms
- Discrete Inverse Problems
- Uniform accuracy of eigenpairs from a shift‐invert Lanczos method
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
- The QR Algorithm Revisited
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Perturbation bounds in connection with singular value decomposition
- Computational Variants of the Lanczos Method for the Eigenproblem
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
