A parallel algorithm for reducing symmetric banded matrices to tridiagonal form

Journal Article · Mon Nov 01 00:00:00 EST 1993 · SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States)

DOI:https://doi.org/10.1137/0914078· OSTI ID:5673676

Lang, B

An algorithm is presented for reducing symmetric banded matrices to tridiagonal form via Householder transformations. The algorithm is numerically stable and is well suited to parallel execution on distributed memory multiple instruction multiple data (MIMD) computers. Numerical experiments on the iPSC/860 hypercube show that the new method yields nearly full speedup if it is run on multiple processors. In addition, even on a single processor the new method usually will be several times faster than the corresponding EISPACK and LAPACK routines.

• OSTI ID: 5673676
• Journal Information: SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States), Vol. 14:6; ISSN 0196-5204
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
MATRICES
ALGORITHMS
COMPUTER ARCHITECTURE
EIGENVALUES
HYPERCUBE COMPUTERS
PARALLEL PROCESSING
TRANSFORMATIONS
COMPUTERS
MATHEMATICAL LOGIC
PROGRAMMING
990200* - Mathematics & Computers