Skip to main content
SpringerLink
Log in

A parallel algorithm for solving band systems and matrix inversion

  • Parallelism Of Numerical Algorithms
  • Conference paper
  • First Online:
Conpar 81 (CONPAR 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 111))

Included in the following conference series:

  • 147 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sameh A.H., Kuck D.J., On stable parallel linear system solvers. JACM 25, 1 /1978/, 81–91.

    Article  MATH  MathSciNet  Google Scholar 

  2. Sameh A.H., Brent R.P., Solving triangular system on a parallel computer. SIAM J. Numer. Anal. 6 /1977/, 1101–1113.

    Article  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  4. Chen S.CH., Kuck D.J., Time parallel processors bounds for linear recurrence systems. IEEE Trans. on Comp. 24, 7 /1975/, 701–717.

    MATH  MathSciNet  Google Scholar 

  5. Stone H.S., An efficient parallel algorithm for the solution of a tridiagonal linear system of equations. JACM 20, 1 /1973/, 27–38.

    Article  MATH  Google Scholar 

  6. Evans D.J., Hatzopoulos M.A., A parallel linear system solver. Intern. J. Computer Math. 7 /1979/ 227–238.

    MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Institute of Technical Cybernetics, Slovak Academy of Sciences, 809 31, Bratislava, Czechoslovakia

    Ladislav Halada

Authors
  1. Ladislav Halada
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Brauer P. Brinch Hansen D. Gries C. Moler G. Seegmüller J. Stoer N. Wirth Wolfgang Händler

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Halada, L. (1981). A parallel algorithm for solving band systems and matrix inversion. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105135

Download citation

  • DOI: https://doi.org/10.1007/BFb0105135

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10827-6

  • Online ISBN: 978-3-540-38715-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation