Abstract
In general, when computing the eigenvalues of symmetric matrices, a matrix is tridiagonalized using some orthogonal transformation. The Householder transformation, which is a tridiagonalization method, is accurate and stable for dense matrices, but is not applicable to sparse matrices because of the required memory space. The Lanczos and Arnoldi methods are also used for tridiagonalization and are applicable to sparse matrices, but these methods are sensitive to computational errors. In order to obtain a stable algorithm, it is necessary to apply numerous techniques to the original algorithm, or to simply use accurate arithmetic in the original algorithm. In floating-point arithmetic, computation errors are unavoidable, but can be reduced by using high-precision arithmetic, such as double-double (DD) arithmetic or quad-double (QD) arithmetic. In the present study, we compare double, double-double, and quad-double arithmetic for three tridiagonalization methods; the Householder method, the Lanczos method, and the Arnoldi method. To evaluate the robustness of these methods, we applied them to dense matrices that are appropriate for the Householder method. It was found that using high-precision arithmetic, the Arnoldi method can produce good tridiagonal matrices for some problems whereas the Lanczos method cannot.
References
Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. The Johns Hopkins University Press, Baltimore (2013)
Kikkawa, S., Saito, T., Ishiwata, E., Hasegawa, H.: Development and acceleration of multiple precision arithmetic toolbox MuPAT for Scilab. J. SIAM Lett. 5, 9–12 (2013)
Saito, T., Kikkawa, S., Ishiwata, E., Hasegawa, H.: Effectiveness of sparse data structure for double-double and quad-double arithmetics. In: Wyrzykowski, R., et al. (eds.) Parallel Processing and Applied Mathematics, Part I. Lecture Notes in Computer Science, vol.8384, pp. 1–9. Springer, Berlin/Heidelberg (2014)
Hida, Y., Li, X. S., Bailey, D.H.: Quad-double arithmetic: algorithms, implementation, and application. Technical Report LBNL-46996 (2000)
Dekker, T.J.: A floating-point technique for extending the available precision. Numer. Math. 18, 224–242 (1971)
Demmel, J.W.: Applied Numerical Linear Algebra. SIAM, Philadelphia (1997)
Acknowledgements
The authors would like to thank the reviewers for their careful reading and much helpful suggestions, and Mr. Takeru Shiiba in Tokyo University of Science for his kind support in numerical experiments. The present study was supported by the Grant-in-Aid for Scientific Research (C) No. 25330141 from the Japan Society for the Promotion of Science.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Ino, R., Asami, K., Ishiwata, E., Hasegawa, H. (2017). Comparison of Tridiagonalization Methods Using High-Precision Arithmetic with MuPAT. In: Sakurai, T., Zhang, SL., Imamura, T., Yamamoto, Y., Kuramashi, Y., Hoshi, T. (eds) Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing. EPASA 2015. Lecture Notes in Computational Science and Engineering, vol 117. Springer, Cham. https://doi.org/10.1007/978-3-319-62426-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-62426-6_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62424-2
Online ISBN: 978-3-319-62426-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)