论文信息 - A Parallel Algorithm for Reducing Symmetric Banded Matrices to Tridiagonal Form

A Parallel Algorithm for Reducing Symmetric Banded Matrices to Tridiagonal Form

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.

Bruno Lang | B. Lang

[1] Linda Kaufman,et al. Banded Eigenvalue Solvers on Vector Machines , 1984, TOMS.

[2] Jack J. Dongarra,et al. An extended set of FORTRAN basic linear algebra subprograms , 1988, TOMS.

[3] Jack J. Dongarra,et al. A fully parallel algorithm for the symmetric eigenvalue problem , 1985, PPSC.

[4] H. Y. Chang,et al. A parallel householder tridiagonalization stratagem using scattered row decomposition , 1988 .

[5] H. Rutishauser. On jacobi rotation patterns , 1963 .