Abstract
We present recursive blocked algorithms for solving triangular two-sided Sylvester-type matrix equations. Recursion leads to automatic blocking that is variable and “squarish”. The main part of the computations are performed as level 3 general matrix multiply and add (GEMM) operations. This is a continuation of the work presented at the PARA2000 conference ([9]), where we presented results for one-sided Sylvester-type matrix equations. The improvements for two-sided Sylvester-type matrix equations are remarkable, and make a substantial impact on solving unreduced matrix equations problems as well. Uniprocessor and SMP parallel performance results are presented and compared with results from existing LAPACK and SLICOT routines for solving this type of matrix equations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
R.H. Bartels and G.W. Stewart. Algorithm 432: Solution of the Equation AX + XB = C, Comm. ACM, 15(9):820–826, 1972.
K. Dackland and B. Kågström. Blocked Algorithms and Software for Reduction of a Regular Matrix Pair to Generalized Schur Form. ACM Trans. Math. Software, Vol. 25, No. 4, 425–454, 1999.
J.D. Gardiner, A.J. Laub, J.J. Amato, and C.B. Moler. Solution of the Sylvester Matrix Equation AXBt + CXDt = E, ACM Trans. Math. Software, 18:223–231, 1992.
J.D. Gardiner, M.R. Wette, A.J. Laub, J.J. Amato, and C.B. Moler. A Fortran 77 Software Package for Solving the Sylvester Matrix Equation AXBt t + CXDt = E, ACM Trans. Math. Software, 18:232–238, 1992.
G. Golub, S. Nash, and C. Van Loan. A Hessenberg-Schur Method for the Matrix Problem AX + XB = C. IEEE Trans. Autom. Contr., AC-24(6):909–913, 1979.
F. Gustavson. Recursion leads to automatic variable blocking for dense linear algebra. IBM J. Res. Develop, 41(6):737–755, November 1997.
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.
I. Jonsson and B. Kågström. Parallel Triangular Sylvester-type Matrix Equation Solvers for SMP Systems using Recursive Blocking, in Applied Parallel Computing: New Paradigms for HPC Industry and Academia, Lecture Notes in Computer Science, vol. 1947, pp 64–74, Springer Verlag, 2001.
I. Jonsson and B. Kågström. Recursive Blocked Algorithms for Solving Triangular Matrix Equations—Part I: One-Sided and Coupled Sylvester-Type Equations, Report UMINF 01.05, Department of Computing Science, Umeå University, SE-901 87 Umeå, Sweden, 2001. Also published as SLICOT Working Note 2001-4. (submitted to ACM TOMS)
I. Jonsson and B. Kågström. Recursive Blocked Algorithms for Solving Triangular Matrix Equations—Part II: Two-Sided and Generalized Sylvester and Lyapunov Equations, Report UMINF 01.06, Department of Computing Science, Umeå University, SE-901 87 Umeå, Sweden, 2001. Also published as SLICOT Working Note 2001-5. (submitted to A CM TOMS)
B. Kågström and P. Poromaa. Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with sep−1 Estimator. SIAM Journal on Matrix Analysis and Application, 13(1):90–101, January 1992.
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. A CM Trans. Math. Software, 22(1):78–103, March 1996.
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.
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.
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.
SLICOT library and the Numerics in Control Network (NICONET) website: http://www.win.tue.nl/niconet/index.html
G.W. Stewart and J-G. Sun. Matrix Perturbation Theory. Academic Press, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jonsson, I., Kågström, B. (2002). Parallel Two-Sided Sylvester-Type Matrix Equation Solvers for SMP Systems Using Recursive Blocking. In: Fagerholm, J., Haataja, J., Järvinen, J., Lyly, M., Råback, P., Savolainen, V. (eds) Applied Parallel Computing. PARA 2002. Lecture Notes in Computer Science, vol 2367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48051-X_30
Download citation
DOI: https://doi.org/10.1007/3-540-48051-X_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43786-4
Online ISBN: 978-3-540-48051-8
eBook Packages: Springer Book Archive