Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method

MaRDI QIDQ2341369zbMATH OpenFDO

Authors Qiao Liang, Qiang Ye

Publication date 24 April 2015

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/ETNA/volumes/2011-2020/vol42/abstract_vol42_pp197-221.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

convergencesparse matrixpreconditioningalgorithmsingular valuesnumerical testrobust incomplete factorizationincomplete QR factorizationinverse-free preconditioned Krylov subspace method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Recommendations

• Computing the smallest singular triplets of a large matrix
• A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
• A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
• Approximating dominant singular triplets of large sparse matrices via modified moments
• Two refined Lanczos algorithms for computing the largest/smallest singular values and associated singular vectors of a large matrix

Cited in

(14)

• scientific article; zbMATH DE number 741161 (Why is no real title available?)
• On the regularization of convolutional kernel tensors in neural networks
• A posteriori computation of the singular vectors in a preconditioned Jacobi SVD algorithm
• Majorization bounds for SVD
• Computing the smallest singular triplets of a large matrix
• scientific article; zbMATH DE number 4112144 (Why is no real title available?)
• Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods
• Deflation by restriction for the inverse-free preconditioned Krylov subspace method
• Filtrated algebraic subspace clustering
• Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
• Hybrid iterative refined restarted Lanczos bidiagonalization methods
• A Golub-Kahan Davidson method for accurately computing a few singular triplets of large sparse matrices
• A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
• PRIMME\_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations

Describes a project that uses

Uses Software

• JDCG

This page was built for publication: Computing singular values of large matrices with an inverse-free preconditioned Krylov subspace method

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