Parallel SVD computation.

MaRDI QIDQ3456414zbMATH OpenFDO

Authors Petr Kotas, V. Vondrák, Pavel Praks

Publication date 14 December 2015

Full work available at URL http://hdl.handle.net/10338.dmlcz/702748

zbMATH Keywords

bidiagonalizationparallel algorithmssingular value decomposition (SVD)

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Parallel numerical computation (65Y05)

Recommendations

• scientific article; zbMATH DE number 1497146
• Efficient parallel reduction to bidiagonal form.
• A relaxation scheme for increasing the parallelism in Jacobi-SVD
• scientific article; zbMATH DE number 17435
• An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices

Cited in

(4)

• A split-and-merge approach for singular value decomposition of large-scale matrices
• On parallelism of the I-SVD algorithm with a multi-core processor
• Memory hierarchy exploration for accelerating the parallel computation of SVDs
• Parallel (M−N)SVD algorithms on the SIMD computers

Describes a project that uses

Uses Software

• LAPACK

This page was built for publication: Parallel SVD computation.

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