Advertisement

A ScaLAPACK-style algorithm for reducing a regular matrix pair to block Hessenberg-triangular form

  • Krister Dackland
  • Bo Kågström
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1541)

Abstract

A parallel algorithm for reduction of a regular matrix pair (A, B) to block Hessenberg-triangular form is presented. It is shown how a sequential elementwise algorithm can be reorganized in terms of blocked factorizations and matrix-matrix operations. Moreover, this LAPACK-style algorithm is straightforwardly extended to a parallel algorithm for a rectangular 2D processor grid using parallel kernels from ScaLAPACK. A hierarchical performance model is derived and used for algorithm analysis and selection of optimal blocking parameters and grid sizes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Berry, J. Dongarra and Y. Kim. A Highly Parallel Algorithm for the Reduction of a Nonsymmetric Matrix to Block Upper-Hessenberg From. Parallel Computing, Vol. 21, No. 8, pp 1189–1212, 1995.MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    S. Blackford, J. Choi, A. Clearly, E. D’Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petit, K. Stanley, D. Walker, and R.C. Whaley. ScaLAPACK Users’ Guide. SIAM Publications, Philadelphia, 1997.MATHGoogle Scholar
  3. 3.
    K. Dackland and B. Kågström. Reduction of a Regular Matrix Pair (A, B) to Block Hessenberg-Trinngular Form. In Dongarra et.al., editors, Applied Parallel Computing: Computations in Physics, Chemistry and Engineering Scienc, pages 125–133, Berlin, 1995. Springer-Verlag. Lecture Notes in Computer Science, Vol. 1041, Proceedings, Lyngby, Denmark.Google Scholar
  4. 4.
    K. Dackland and B. Kågström. An Hierarchical Approach for Performance Analysis of ScaLAPACK-based Routines Using the Distributed Linear Algebra Machine. In Dongarra et.al., editors, Applied Parallel Computing: Computations in Physics, Chemistry and Engineering Science, pages 187–195, Berlin, 1996. Springer-Verlag. Lecture Notes in Computer Science, Vol. 1184, Proceedings, Lyngby, Denmark.Google Scholar
  5. 5.
    K. Dackland. Parallel Reduction of a Regular Matrix Pair to Block Hessenberg-Triangular Form-Algorithm Design and Performance Modeling. Report UMINF-98.09, Department of Computing Science, Umeå University, S-901 87 Umeå, 1998.Google Scholar
  6. 6.
    W. Enright and S. Serbin. A Note on the Efficient Solution of Matrix Pencil Systems. BIT, 18:276–281, 1978.MATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    G. H. Golub and C. F. Van Loan. Matrix Computations, Second Edition, The John Hopkins University Press, Baltimore, Maryland, 1989.Google Scholar
  8. 8.
    C. B. Moler and G. W. Stewart. An Algorithm for Generalized Matrix Eigenvalue Problems. SIAM J. Num. Anal., 10:241–256, 1973.MATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    R. Schreiber and C. Van Loan. A Storage Efficient WY Representation for Products of Householder Transformations. SIAM J. Sci. and Stat. Comp., 10:53–57, 1989.MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Krister Dackland
    • 1
  • Bo Kågström
    • 1
  1. 1.Department of Computing Science and HPC2NUmeå UniversityUmeåSweden

Personalised recommendations