Using Pentangular Factorizations for the Reduction to Banded Form

Authors:
B. Großer;Bruno Lang
Affiliations:
-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 8
Cited 0

The WY representation for products of householder matrices

SIAM Journal on Scientific and Statistical Computing - Papers from the Second Conference on Parallel Processing for Scientific Computin
A storage-efficient WY representation for products of householder transformations

SIAM Journal on Scientific and Statistical Computing
A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
A parallel algorithm for the reduction of a nonsymmetric matrix to block upper-Hessenberg form

Parallel Computing
Parallel reduction of banded matrices to bidiagonal form

Parallel Computing
A Proposal for a Set of Parallel Basic Linear Algebra Subprograms

PARA '95 Proceedings of the Second International Workshop on Applied Parallel Computing, Computations in Physics, Chemistry and Engineering Science
LAPACK Working Note 94: A User''s Guide to the BLACS v1.0

LAPACK Working Note 94: A User''s Guide to the BLACS v1.0
Design and Implementation of the ScaLAPACK LU, QR, and Cholesky Factorization Routines

Scientific Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most methods for computing the singular value decomposition (SVD) first bidiagonalize the matrix. The ScaLAPACK implementation of the blocked reduction of a general dense matrix to bidiagonal form performs about one half of the operations with BLAS3. If we subdivide the task into two stages dense 驴 banded and banded 驴 bidiagonal, we can increase the portion of matrix-matrix operations and expect higher performance. We give an overview of different techniques for the first stage.