Computing the generalized singular values/vectors of large sparse or structured matrix pairs

DOI10.1007/S002110050175zbMATH Open0856.65041OpenAlexW2000512102MaRDI QIDQ1923328FDOQ1923328

Authors: Hongyuan Zha 

Publication date: 24 February 1997

Published in: Numerische Mathematik (Search for Journal in Brave)

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

Recommendations

• scientific article
• A Jacobi-Davidson type method for the generalized singular value problem
• Computing the Generalized Singular Value Decomposition
• A Tangent Algorithm for Computing the Generalized Singular Value Decomposition

zbMATH Keywords

numerical resultsalgorithmCS decompositionLanczos bidiagonalizationlinear least squares problemgeneralized singular valuessparse or structural matrix pair

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cited In (17)

• The joint bidiagonalization process with partial reorthogonalization
• Two projection methods for regularized total least squares approximation
• A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
• An iterative method for Tikhonov regularization with a general linear regularization operator
• On choices of formulations of computing the generalized singular value decomposition of a large matrix pair
• The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations
• The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
• Title not available (Why is that?)
• Randomized GCUR decompositions
• Tikhonov regularization via flexible Arnoldi reduction
• A Jacobi-Davidson type method for the generalized singular value problem
• 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
• A Generalized CUR Decomposition for Matrix Pairs
• Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
• Necessary Conditions and Tight Two-level Convergence Bounds for Parareal and Multigrid Reduction in Time
• Thick-restarted joint Lanczos bidiagonalization for the GSVD

This page was built for publication: Computing the generalized singular values/vectors of large sparse or structured matrix pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923328)