Abstract
In this paper we consider the problem of computing generalized eigenvectors of a matrix pencil in real Schur form. In exact arithmetic, this problem can be solved using substitution. In practice, substitution is vulnerable to floating-point overflow. The robust solvers xtgevc in LAPACK prevent overflow by dynamically scaling the eigenvectors. These subroutines are scalar and sequential codes which compute the eigenvectors one by one. In this paper, we discuss how to derive robust algorithms which are blocked and parallel. The new StarNEig library contains a robust task-parallel solver Zazamoukh which runs on top of StarPU. Our numerical experiments show that Zazamoukh achieves a super-linear speedup compared with dtgevc for sufficiently large matrices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
StarNEig. https://nlafet.github.io/StarNEig/
Anderson, E.: LAPACK Working Note No. 36: Robust Triangular Solves for Use in Condition Estimation. Technical report. CS-UT-CS-91-142, University of Tennessee, Knoxville, TN, USA, August 1991
Anderson, E., et al.: LAPACK Users’ Guide, 3rd edn. SIAM, Philadelphia (1999). https://doi.org/10.1137/1.9780898719604
Augonnet, C., Thibault, S., Namyst, R., Wacrenier, P.A.: StarPU: a unified platform for task scheduling on heterogeneous multicore architectures. CCPE - Spec. Issue: Euro-Par 2009(23), 187–198 (2011). https://doi.org/10.1002/cpe.1631
Baudin, M.: Personal correspondance to C. C. Kjelgaard Mikkelsen (2019)
Baudin, M., Smith, R.L.: Robust Complex Division in Scilab. CoRR abs/1210.4539 (2012). http://arxiv.org/abs/1210.4539
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
Kjelgaard Mikkelsen, C.C., Schwarz, A.B., Karlsson, L.: Parallel robust solution of triangular linear systems. CCPE (2018). https://doi.org/10.1002/cpe.5064
Myllykoski, M., Kjelgaard Mikkelsen, C.C.: Introduction to StarNEig – a task-based library for solving nonsymmetric eigenvalue problems. In: Wyrzykowski, R., et al. (eds.) PPAM 2019, LNCS, vol. 12043, pp. 70–81. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-43229-4_7
Myllykoski, M., Kjelgaard Mikkelsen, C.C., Schwarz, A., Kågström, B.: D2.7 eigenvalue solvers for nonsymmetric problems. Technical report, Umeå University (2019). http://www.nlafet.eu/wp-content/uploads/2019/04/D2.7-EVP-solvers-evaluation-final.pdf
Acknowledgments
This work is part of a project (NLAFET) that has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 671633. This work was supported by the Swedish strategic research programme eSSENCE. We thank the High Performance Computing Center North (HPC2N) at Umeå University for providing computational resources and valuable support during test and performance runs.
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
Kjelgaard Mikkelsen, C.C., Myllykoski, M. (2020). Parallel Robust Computation of Generalized Eigenvectors of Matrix Pencils. 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-43229-4_6
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)