Abstract
We discuss congruence transformations aimed at simultaneously reducing a pair of symmetric matrices to tridiagonal–tridiagonal form under the very mild assumption that the matrix pencil is regular. We outline the general principles and propose a unified framework for the problem. This allows us to gain new insights, leading to an economical approach that only uses Gauss transformations and orthogonal Householder transformations. Numerical experiments show that the approach is numerically robust and competitive.
Similar content being viewed by others
References
Garvey S.D., Tisseur F., Friswell M.I., Penny J.E.T., Prells U.: Simultaneous tridiagonalization of two symmetric matrices. Int. J. Numer. Meth. Eng. 57(12), 1643–1660 (2003)
Higham, N.J.: The matrix computation toolbox. http://www.maths.manchester.ac.uk/~higham/mctoolbox/
Sidje R.B., Burrage K.: QRT: A QR-based tridiagonalization algorithm for nonsymmetric matrices. SIAM J. Matrix Anal. Appl. 26(3), 878–900 (2005)
Tisseur F.: Tridiagonal–diagonal reduction of symmetric indefinite pairs. SIAM J. Matrix Anal. Appl. 26(1), 215–232 (2004)
Wright, T.G.: EigTool software package. http://web.comlab.ox.ac.uk/pseudospectra/eigtool/
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sidje, R.B. On the simultaneous tridiagonalization of two symmetric matrices. Numer. Math. 118, 549–566 (2011). https://doi.org/10.1007/s00211-010-0357-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00211-010-0357-9