Efficient parallel reduction to bidiagonal form
Authors:
- Benedikt GroßerBGBenedikt Großer
- Bruno LangBLBruno Lang
- 1 September 1999
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 25 (8) , 969-986
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Experiments with Parallel One - Sided and Two - Sided Algorithms for SVD1999
- BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS I: HYPERCUBES AND RINGS*Parallel Algorithms and Applications, 1999
- ScaLAPACK: a portable linear algebra library for distributed memory computers — design issues and performanceComputer Physics Communications, 1996
- A proposal for a set of parallel basic linear algebra subprograms1996
- The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal formNumerical Algorithms, 1995
- A parallel algorithm for the reduction of a nonsymmetric matrix to block upper-Hessenberg formParallel Computing, 1995
- Design and Implementation of the ScaLAPACK LU, QR, and Cholesky Factorization RoutinesScientific Programming, 1995
- A set of level 3 basic linear algebra subprogramsACM Transactions on Mathematical Software, 1990
- Computing the singular value decomposition on a distributed system of vector processorsParallel Computing, 1989
- The WY Representation for Products of Householder MatricesSIAM Journal on Scientific and Statistical Computing, 1987