Parallel triangular sylvester-type matrix equation solvers for SMP systems using recursive blocking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1947, Issue , 2001, Pages 64-73

  Jonsson, Isak ^a   Kågström, Bo ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

Automatic blocking; GEMM based; Level 3 BLAS; Recursion; Superscalar; Sylvester type matrix equations

Indexed keywords

ALGORITHMS;

AUTOMATIC BLOCKING; GEMM-BASED; LEVEL-3 BLAS; RECURSIONS; SUPERSCALAR; SYLVESTER-TYPE MATRICES;

MATRIX ALGEBRA;

EID: 1842832563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70734-4     Document Type: Conference Paper

References (14)

1. E. Anderson, Z. Bai, J. Demmel, J. Dongarra, J. DuCroz, A. Greenbaum, S. Hammarling, A. McKenny, S. Ostrouchov, and D. Sorensen LAPACK Users Guide, Third Edition. SIAM Publications, 1999.
2. E. Elmroth and F. Gustavson. New Serial and Parallel Recursive QR Factorization Algorithms for SMP Systems, In Kågström et al. (eds), Applied Parallel Computing, PARA'98, Lecture Notes in Computer Science, Vol. 1541, pp 120-128, Springer-Verlag, 1998.
3. E. Elmroth and F. Gustavson. Applying Recursion to Serial and Parallel QR Factorization Leads to Better Performance. IBM Journal of Research and Development, 44, No. 4, 605-624, 2000.
4. F. Gustavson. Recursion leads to automatic variable blocking for dense linear algebra. IBM J. Res. Develop, 41(6):737-755, November 1997.
5. F. Gustavson, A. Henriksson, I. Jonsson, B. Kågström and P. Ling. Recursive Blocked Data Formats and BLAS's for Dense Linear Algebra Algorithms. In Kågström et al. (eds), Applied Parallel Computing, PARA'98, Lecture Notes in Computer Science, Vol. 1541, pp 195-206, Springer-Verlag, 1998.
6. F. Gustavson, A. Henriksson, I. Jonsson, B. Kågström and P. Ling. Superscalar GEMM-based Level 3 BLAS - The On-going Evolution of a Portable and High-Performance Library. In Kågström et al. (eds), Applied Parallel Computing, PARA'98, Lecture Notes in Computer Science, Vol. 1541, pp 207-215, Springer-Verlag, 1998.
7. B. Kågström, P. Ling, and C. Van Loan. GEMM-based level 3 BLAS: High-performance model implementations and performance evaluation benchmark. ACM Trans. Math. Software, 24(3):268-302, 1998.
8. B. Kågström, P. Ling, and C. Van Loan. GEMM-based level 3 BLAS: Portability and optimization issues. ACM Trans. Math. Software, 24(3):303-316, 1998.
9. −1 Estimator. SIAM Journal on Matrix Analysis and Application, 13(1):90-101, January 1992.
10. B. Kågström and P. Poromaa. LAPACK-Style Algorithms and Software for Solving the Generalized Sylvester Equation and Estimating the Separation between Regular Matrix Pairs. ACM Trans. Math. Software, 22(1):78-103, March 1996.
11. B. Kågström and P. Poromaa. Computing Eigenspaces with Specified Eigenvalues of a Regular Matrix Pair (A;B) and Condition Estimation: Theory, Algorithms and Software. Numerical Algorithms, 12:369-407, 1996.
12. B. Kågström and L. Westin. Generalized Schur methods with condition estimators for solving the generalized Sylvester equation. IEEE Trans. Autom. Contr., 34(4):745-751, 1989.
13. P. Poromaa. Parallel Algorithms for Triangular Sylvester Equations: Design, Scheduling and Scalability Issues. In Kågström et al. (eds), Applied Parallel Computing, PARA'98, Lecture Notes in Computer Science, Vol. 1541, pp 438-446, Springer- Verlag, 1998.
14. G.W. Stewart and J-G. Sun. Matrix Perturbation Theory. Academic Press, 1990.