Abstract
We show how to simultaneously reduce a pair of symmetric matrices to tridiagonal form by congruence transformations. No assumptions are made on the non-singularity or definiteness of the two matrices. The reduction follows a strategy similar to the one used for the tridiagonalization of a single symmetric matrix via Householder reflectors. Two algorithms are proposed, one using non-orthogonal rank-one modifications of the identity matrix and the othe, more costly but more stable, using a combination of Householder reflectors and non-orthogonal rank-one modifications of the identity matrix with minimal condition numbers. Each of these tridiagonalization processes requires O(n3) arithmetic operations and respects the symmetry of the problem. We illustrate and compare the two algorithms with some numerical experiments. © 2003 John Wiley and Sons, Ltd.
| Original language | English |
|---|---|
| Pages (from-to) | 1643-1660 |
| Number of pages | 17 |
| Journal | International Journal for Numerical Methods in Engineering |
| Volume | 57 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 28 Jul 2003 |
Keywords
- Generalized eigenvalue problem
- Symmetric matrices
- Symmetric quadratic eigenvalue problem
- Tridiagonalization
Fingerprint
Dive into the research topics of 'Simultaneous tridiagonalization of two symmetric matrices'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver