Computation of the Spectra and Eigenvectors of Large Complex Matrices
One of the critical points in our numerical investigation of the transfer operator is the computation of its eigenvalues. In this section we want to describe briefly what problems arise when computing the eigenvalues of the transfer operator and how we can overcome these problems. To get the best results, both with respect to accuracy and computation time, we had to combine several techniques to produce an optimal algorithm.
- 20.Braman, K., Byers, R., Mathias, R.: The multishift QR algorithm. Part I and II: maintaining well-focused shifts and level 3 performance and aggressive early deflation. SIAM J. Matrix Anal. Appl. 23 (4), 929–973 (2002)Google Scholar
- 41.Fousse, L., Hanrot, G., Lefèvre, V., Pélissier, P., Zimmermann, P.: MPFR: a multiple-precision binary floating-point library with correct rounding. ACM Trans. Math. Softw. 33 (2), 13:1–13:15 (2007)Google Scholar
- 116.Schwarz, H.: Numerische Mathematik. B.G. Teubner Stuttgart (1997)Google Scholar