A parallel algorithm for solving band systems and matrix inversion

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


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Sameh A.H., Kuck D.J., On stable parallel linear system solvers. JACM 25, 1 /1978/, 81–91.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Sameh A.H., Brent R.P., Solving triangular system on a parallel computer. SIAM J. Numer. Anal. 6 /1977/, 1101–1113.CrossRefMathSciNetGoogle Scholar
  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.CrossRefMathSciNetGoogle Scholar
  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.MATHMathSciNetGoogle Scholar
  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.MATHCrossRefGoogle Scholar
  6. [6]
    Evans D.J., Hatzopoulos M.A., A parallel linear system solver. Intern. J. Computer Math. 7 /1979/ 227–238.MATHMathSciNetGoogle Scholar
  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.MATHCrossRefMathSciNetGoogle Scholar
  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

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Ladislav Halada
    • 1
  1. 1.Institute of Technical CyberneticsSlovak Academy of SciencesBratislavaCzechoslovakia

Personalised recommendations