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

zbMath1312.65061MaRDI QIDQ2341369

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

zbMATH Keywords

algorithmconvergencepreconditioningsparse matrixsingular 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) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items (11)

A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices ⋮ Majorization bounds for SVD ⋮ Accelerating large partial EVD/SVD calculations by filtered block Davidson methods ⋮ On the regularization of convolutional kernel tensors in neural networks ⋮ Hybrid iterative refined restarted Lanczos bidiagonalization methods ⋮ Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods ⋮ Computing the smallest singular triplets of a large matrix ⋮ Deflation by restriction for the inverse-free preconditioned Krylov subspace method ⋮ PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations ⋮ A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices ⋮ Filtrated Algebraic Subspace Clustering

Uses Software

• JDCG

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