An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices

DOI10.1007/s002110050093zbMath0823.65040OpenAlexW2077352756MaRDI QIDQ1347046

Noah H. Rhee, Zhonggang Zeng, Tien-Yien Li

Publication date: 2 April 1995

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

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

zbMATH Keywords

singular value decompositioneigenvaluesparallel computationnumerical comparisonsbidiagonal matricessymmetric tridiagonal matrixLaguerre iterationdivide and conquer type algorithmsplit merge algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Related Items

Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems ⋮ One-sided reduction to bidiagonal form

Uses Software

• LAPACK
• pchip