Advertisement

On experiments with a parallel direct solver for diagonally dominant banded linear systems

  • Peter Arbenz
Workshop 07 Parallel Numerical Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1124)

Abstract

We report on numerical experiments that we conducted with a direct algorithm, the single width sparator algorithm, to solve diagonally dominant banded linear systems. With detailed estimations of computation and communication cost we quantitatively analyze their influence on the parallel performance of the algorithm. We report on numerical experiments executed on an Intel Paragon XP/S-22MP.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen. LAPACK Users' Guide. SIAM, Philadelphia, PA, 1992.Google Scholar
  2. 2.
    P. Arbenz and W. Gander. A survey of direct parallel algorithms for banded linear systems. Tech. Report 221, ETH Zürich, Computer Science Department, November 1994. ftp://ftp.inf.ethz.ch/pub/publications/tech-reports/2xx/221.ps.Google Scholar
  3. 3.
    David H. Bailey. RISC microprocessors and scientific computing. In Supercomputing '93, pages 645–654, Los Alamitos, CA, 1993. IEEE Computer Society Press.Google Scholar
  4. 4.
    J. M. Conroy. Parallel algorithms for the solution of narrow banded systems. Appl. Numer. Math., 5:409–421, 1989.CrossRefGoogle Scholar
  5. 5.
    J. J. Dongarra. Performance of various computers using standard linear equation software equations software. Tech. Report CS-89-85, University of Tennessee, Computer Science Department, Knoxville, TN, November 1995.Google Scholar
  6. 6.
    J. J. Dongarra and L. Johnsson. Solving banded systems on a parallel processor. Parallel Computing, 5:219–246, 1987.CrossRefMathSciNetGoogle Scholar
  7. 7.
    J. J. Dongarra and A. H. Sameh. On some parallel banded system solvers. Parallel Computing, 1:223–235, 1984.CrossRefGoogle Scholar
  8. 8.
    G. H. Golub and C. F. van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, MD, 2nd edition, 1989.Google Scholar
  9. 9.
    M. Hegland. Divide and conquer for the solution of banded linear systems. Research report, Computer Sci. Lab. and Centre Math. Appl, Australian National University, Canberra, Australia, 1995. To be published in the Proceedings of the 4th EuroMicro Workshop on Parallel and Distributed Processing, Braga, Portugal, 24–26 January, 1996.Google Scholar
  10. 10.
    R. W. Hockney and C. R. Jesshope. Parallel Computers 2. Adam Hilger, Bristol, 1988.Google Scholar
  11. 11.
    S. L. Johnsson. Solving narrow banded systems on ensemble architectures. ACM Trans. Math. Softw., 11:271–288, 1985.CrossRefGoogle Scholar
  12. 12.
    A. Sameh. Parallel algorithms for structured sparse linear systems. Talk at the ICIAM'95, Hamburg, 3.–7. July 1995.Google Scholar
  13. 13.
    A. Sameh and D. Kuck. On stable parallel linear system solvers. J. ACM, 25:81–91, 1978.CrossRefGoogle Scholar
  14. 14.
    S. J. Wright. Parallel algorithms for banded linear systems. SIAM J. Sci. Stat. Comput., 12:824–842, 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Peter Arbenz
    • 1
  1. 1.Institute of Scientific ComputingSwiss Federal Institute of Technology (ETH)Zürich

Personalised recommendations