Abstract
RECSY is a library for solving triangular Sylvester-type matrix equations. Its objectives are both speed and reliability. In order to achieve these goals, RECSY is based on novel recursive blocked algorithms, which call high-performance kernels for solving small-sized leaf problems of the recursion tree. In contrast to explicit standard blocking techniques, our recursive approach leads to an automatic variable blocking that has the potential of matching the memory hierarchies of today’s HPC systems. The RECSY library comprises a set of Fortran 90 routines, which uses recursion and OpenMP for shared memory parallelism to solve eight different matrix equations, including continuous-time as well as discrete-time standard and generalized Sylvester and Lyapunov equations. Uniprocessor and SMP parallel performance results of our recursive blocked algorithms and corresponding routines in state-of-the-art libraries LAPACK and SLICOT are presented. The performance improvements of our recursive algorithms are remarkable, including 10-fold speedups compared to standard algorithms.
Chapter PDF
Similar content being viewed by others
Keywords
References
Anderson, E., Bai, Z., Demmel, J., Dongarra, J., DuCroz, J., Greenbaum, A., Hammarling, S., McKenny, A., Ostrouchov, S., Sorensen, D.: LAPACK Users Guide, 3rd edn. SIAM Publications, Philadelphia (1999)
Bartels, R.H., Stewart, G.W.: Algorithm 432: Solution of the Equation AX + XB = C. Comm. ACM 15(9), 820–826 (1972)
Dackland, K., Kågström, B.: Blocked Algorithms and Software for Reduction of a Regular Matrix Pair to Generalized Schur Form. ACM Trans. Math. Software 24(4), 425–454 (1999)
Gardiner, J.D., Laub, A.J., Amato, J.J., Moler, C.B.: Solution of the Sylvester Matrix Equation AXBT + CXDT = E. ACM Trans. Math. Software 18(2), 223–231 (1992)
Gardiner, J.D., Wette, M.R., Laub, A.J., Amato, J.J., Moler, C.B.: A Fortran 77 Software Package for Solving the Sylvester Matrix Equation AXBT +CXDT = E. ACM Trans. Math. Software 18(2), 232–238 (1992)
Jonsson, I., Kågström, B.: Recursive Blocked Algorithms for Solving Triangular Matrix Equations—Part I: One-Sided and Coupled Sylvester-Type Equations, SLICOT Working Note 2001-4
Jonsson, I., Kågström, B.: Recursive Blocked Algorithms for Solving Triangular Matrix Equations—Part II: Two-Sided and Generalized Sylvester and Lyapunov Equations, SLICOT Working Note 2001-5
Jonsson, I., Kågström, B.: Recursive blocked algorithms for solving triangular systems — Part I: One-sided and coupled Sylvester-type matrix equations. ACM Trans. Math. Softw. 28(4), 392–415 (2002)
Jonsson, I., Kågström, B.: Recursive blocked algorithms for solving triangular systems — Part II: Two-sided and generalized Sylvester and Lyapunov matrix equations. ACM Trans. Math. Softw. 28(4), 416–435 (2002)
Kågström, B., Poromaa, P.: 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 (1996)
Kågström, B., Westin, L.: Generalized Schur methods with condition estimators for solving the generalized Sylvester equation. IEEE Trans. Autom. Contr. 34(7), 745–751 (1989)
SLICOT library and the Numerics in Control Network (NICONET) website: http://www.win.tue.nl/niconet/index.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jonsson, I., Kågström, B. (2003). RECSY – A High Performance Library for Sylvester-Type Matrix Equations. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds) Euro-Par 2003 Parallel Processing. Euro-Par 2003. Lecture Notes in Computer Science, vol 2790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45209-6_111
Download citation
DOI: https://doi.org/10.1007/978-3-540-45209-6_111
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40788-1
Online ISBN: 978-3-540-45209-6
eBook Packages: Springer Book Archive