Abstract
The Bartels-Stewart algorithm is a standard approach to solving the dense Sylvester equation. It reduces the problem to the solution of the triangular Sylvester equation. The triangular Sylvester equation is solved with a variant of backward substitution. Backward substitution is prone to overflow. Overflow can be avoided by dynamic scaling of the solution matrix. An algorithm which prevents overflow is said to be robust. The standard library LAPACK contains the robust scalar sequential solver dtrsyl. This paper derives a robust, level-3 BLAS-based task-parallel solver. By adding overflow protection, our robust solver closes the gap between problems solvable by LAPACK and problems solvable by existing non-robust task-parallel solvers. We demonstrate that our robust solver achieves a performance similar to non-robust solvers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bartels, R.H., Stewart, G.W.: Solution of the matrix equation \(AX+XB=C\). Commun. ACM 15(9), 820–826 (1972)
Buttari, A., Langou, J., Kurzak, J., Dongarra, J.: A class of parallel tiled linear algebra algorithms for multicore architectures. Parallel Comput. 35(1), 38–53 (2009)
Chan, E., Van Zee, F.G., Bientinesi, P., Quintana-Orti, E.S., Quintana-Orti, G., Van de Geijn, R.: Supermatrix: a multithreaded runtime scheduling system for algorithms-by-blocks. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel programming, pp. 123–132. ACM (2008)
Cosnard, M., Jeannot, E., Yang, T.: Compact DAG representation and its symbolic scheduling. J. Parallel Distrib. Comput. 64(8), 921–935 (2004)
Drebes, A., Pop, A., Heydemann, K., Cohen, A., Drach, N.: Scalable task parallelism for NUMA: a uniform abstraction for coordinated scheduling and memory management. In: International Conference on Parallel Architecture and Compilation Techniques, pp. 125–137. IEEE (2016)
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. John Hopkins University Press, Baltimore (1996)
Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002)
Jonsson, I., Kågström, B.: Recursive blocked algorithms for solving triangular systems - Part I: one-sided and coupled Sylvester-type matrix equations. ACM TOMS 28(4), 392–415 (2002)
Mikkelsen, C.C.K., Karlsson, L.: Robust solution of triangular linear systems. In: NLAFET Working Note 9 (2017)
Kjelgaard Mikkelsen, C.C., Karlsson, L.: Blocked algorithms for robust solution of triangular linear systems. In: Wyrzykowski, R., Dongarra, J., Deelman, E., Karczewski, K. (eds.) PPAM 2017. LNCS, vol. 10777, pp. 68–78. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-78024-5_7
Perez, J.M., Badia, R.M., Labarta, J.: A dependency-aware task-based programming environment for multi-core architectures. In: 2008 IEEE International Conference on Cluster Computing, pp. 142–151. IEEE (2008)
Quintana-Ortí, E.S., Van De Geijn, R.A.: Formal derivation of algorithms: the triangular Sylvester equation. ACM TOMS 29(2), 218–243 (2003)
Simoncini, V.: Computational methods for linear matrix equations. SIAM Rev. 58(3), 377–441 (2016)
Van Zee, F.G.: libflame: The Complete Reference (version 5.1.0-56) (2009)
Acknowledgements
The authors thank the research group for their support. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 671633. Support was received by eSSENCE, a collaborative e-Science programme funded by the Swedish Government via the Swedish Research Council (VR).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Schwarz, A., Kjelgaard Mikkelsen, C.C. (2020). Robust Task-Parallel Solution of the Triangular Sylvester Equation. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K. (eds) Parallel Processing and Applied Mathematics. PPAM 2019. Lecture Notes in Computer Science(), vol 12043. Springer, Cham. https://doi.org/10.1007/978-3-030-43229-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-43229-4_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43228-7
Online ISBN: 978-3-030-43229-4
eBook Packages: Computer ScienceComputer Science (R0)