In this paper three stable parallel algorithms for solving dense and tndlagonai systems of lmear equations are discussed The algorithms are based on Givens' reduction of a matrix to the upper triangular form The algorithm for the dense case requires O(n) t ime steps compared to O(n log n) steps for Gausslan ehmmatlon with pivoting (in the absence of certain features of machine logic and hardware) For the trldlagonal case, one of the algorithms presented here is superior to the best previous algorithm in that with a modest increase in time It does not fall if any of the leading pnnclpal submatrlces is singular, the probablhty of overor underflow is minimized, and the error bound does not grow exponentially Furthermore, it is most statable when only a hmtted number of processors ts available.
[1]
J. H. Wilkinson.
The algebraic eigenvalue problem
,
1966
.
[2]
Harold S. Stone,et al.
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
,
1973,
JACM.
[3]
S. Hammarling.
A Note on Modifications to the Givens Plane Rotation
,
1974
.
[4]
L. Csanky,et al.
Fast parallel matrix inversion algorithms
,
1975,
16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[5]
D. Rose,et al.
Extrapolated Fast Direct Algorithms for Elliptic Boundary Value Problems.
,
1976
.
[6]
David J. Kuck,et al.
A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
,
1977,
IEEE Transactions on Computers.