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

DOI10.1007/S002110050175MaRDI QIDQ1923328zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• scientific article; zbMATH DE number 4143344
• 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

Cited in

(19)

• The joint bidiagonalization process with partial reorthogonalization
• Thick-restarted joint Lanczos bidiagonalization for the GSVD
• Two projection methods for regularized total least squares approximation
• Double-variable trace maximization for extreme generalized singular quartets of a matrix pair: a geometric method
• A generalized CUR decomposition for matrix pairs
• Necessary conditions and tight two-level convergence bounds for parareal and multigrid reduction in time
• 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
• Tikhonov regularization via flexible Arnoldi reduction
• The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations
• The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
• scientific article; zbMATH DE number 4143344 (Why is no real title available?)
• Randomized GCUR decompositions
• 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
• Subspace iteration method for generalized singular values
• Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations

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)