CONPAR 1981: Conpar 81 pp 433-440

# A parallel algorithm for solving band systems and matrix inversion

Parallelism Of Numerical Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 111)

## Abstract

In this paper new parallel algorithms for solving a band system of linear equations with bandwidth 2m+1 and for matrix inversion of such matrix are proposed. The algorithms are based on the simultaneous computation of m band triangular systems differing from each other only at the right-hand side. Thus, a computational complexity of our algorithm for the band system is the same as of a band triangular system solver. A difference is only at the number of processors used. The application of the algorithm for solving the inversion is advantageous if this computation is a part of the solving of system and it is necessary to know only selected rows or columns of the matrix inverse.

## References

1. [1]
Sameh A.H., Kuck D.J., On stable parallel linear system solvers. JACM 25, 1 /1978/, 81–91.
2. [2]
Sameh A.H., Brent R.P., Solving triangular system on a parallel computer. SIAM J. Numer. Anal. 6 /1977/, 1101–1113.
3. [3]
Chen S.C., Kuck D.J., Sameh A.H., Practical parallel band triangular system solvers. ACM Tran. on Math. Software, 3 /1978/, 270–277.
4. [4]
Chen S.CH., Kuck D.J., Time parallel processors bounds for linear recurrence systems. IEEE Trans. on Comp. 24, 7 /1975/, 701–717.
5. [5]
Stone H.S., An efficient parallel algorithm for the solution of a tridiagonal linear system of equations. JACM 20, 1 /1973/, 27–38.
6. [6]
Evans D.J., Hatzopoulos M.A., A parallel linear system solver. Intern. J. Computer Math. 7 /1979/ 227–238.
7. [7]
Bank R.E., Rose D.J., An 0(n2) method for solving constant coefficient boundary value problems in two dimensions. SIAM J. Numer. Anal. 12, 4 /1975/, 529–540.
8. [8]
Buzbee B.L., A capacitance matrix technique. In sparse matrix computations, J.R. Bunch and D.J. Rose, Ed., Academic Press, New York, 1976.Google Scholar