A partition method for solving block pentadiagonal linear system on intel hypercube iPSC/860

  • Ladislav Halada
  • Mária Lucká
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1127)


We present a parallel partition algorithm for the solution of block pentadiagonal linear systems suitable for computation on computers with distributed memory. The method belongs to the direct methods and is based on the partition method derived in [1] for non-block banded matrices. The parallelization is achieved by dividing of the original block matrix into large blocks that can be processed almost independently. The time measurement results achieved by implementation of this method in the message passing Fortran on Intel hypercube iPSC/860 have shown a dependence of the effectivity of the implementation on the size of the large blocks.


  1. 1.
    Meier, U.: A Parallel Partition Method for Solving Banded Systems of Linear Equations, Parallel Computing 2 (1985), 33–43MathSciNetGoogle Scholar
  2. 2.
    Mattor, N. et all: Algorithm for Solving Tridiagonal Matrix Problems in Parallel, Parallel Computing 21 (1995), 1769–1782Google Scholar
  3. 3.
    Johnson, L.: Solving Tridiagonal Systems on Ensemble Architectures, SIAM J.Sci.Stat. Comput., 8, 354–392Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Ladislav Halada
    • 1
  • Mária Lucká
    • 2
  1. 1.Dep. of MathematicsSlovak Technical UniversityBratislavaSlovak Republic
  2. 2.Institute for Control Theory and RoboticsSlovak Academy of SciencesBratislavaSlovak Republic

Personalised recommendations