A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
Open Access
- 1 January 1998
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 67 (221) , 221-235
Abstract
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical approach, we propose a new chasing algorithm. Although this algorithm has the same sequential computational complexity and backward error properties as the old algorithms, it is better suited for a pipelined approach. The parallel algorithm for this new chasing method is described, with performance results on the Paragon and nCUBE. Comparison results between the old and the new algorithms are also presented.Keywords
This publication has 5 references indexed in Scilit:
- A graph-theoretic model of symmetric givens operations and its implicationsLinear Algebra and its Applications, 1997
- Efficient reduction algorithms for bordered band matricesNumerical Linear Algebra with Applications, 1995
- Parallel tri- and bi-diagonalization of bordered bidiagonal matricesParallel Computing, 1994
- The numerically stable reconstruction of Jacobi matrices from spectral dataNumerische Mathematik, 1984
- On Jacobi rotation patterns1963