Abstract
Let T n be an n×n unreduced symmetric tridiagonal matrix with eigenvalues λ1<λ2<⋅⋅⋅<λ n and W k is an (n−1)×(n−1) submatrix by deleting the kth row and the kth column from T n , k=1,2,...,n. Let μ1≤μ2≤⋅⋅⋅≤μ n−1 be the eigenvalues of W k . It is proved that if W k has no multiple eigenvalue, then λ1<μ1<λ2<μ2<⋅⋅⋅<λ n−1<μ n−1<λ n ; otherwise if μ i =μ i+1 is a multiple eigenvalue of W k , then the above relationship still holds except that the inequality μ i <λ i+1<μ i+1 is replaced by μ i =λ i+1=μ i+1.
Similar content being viewed by others
References
J.J.M. Cuppen, A divide-and-conquer method for the symmetric tridiagonal eigenproblem, Numer. Math. 36 (1981) 177–195.
J.W. Demmel, Applied Numerical Linear Algebra (SIAM, Philadelphia, 1997).
G.M.L. Gladwell, Inverse Problems in Vibration (Martinus Nijhoff, Boston, 1986).
M. Gu and S.C. Eisenstat, A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem, SIAM. J. Matrix Anal. Appl. 16(1) (1995) 172–191.
R.O. Hill, Jr. and B.N. Parlett, Refind interlacing properties, SIAM J. Matrix Anal. Appl. 13(1) (1992) 239–247.
E.-X. Jiang, SymmetricMatrix Computation (Shanghai Science and Technology Press, Shanghai, 1984) (in Chinese).
C.C. Paige, The computation of eigenvalues and eigenvectors of very large sparse matrices, Ph.D. thesis, University of London (1971).
A. Ralston and H.S.Wilf, Mathematical Methods for Diagonal Computers (Wiley, New York, 1968).
D.C. Sorensen and P.T.P. Tang, On the orthogonality of eigenvectors computed by divide-and-conquer techniques, SIAM J. Numer. Anal. 28 (1991) 1752–1775.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jiang, E. An Extension of the Roots Separation Theorem. Annals of Operations Research 103, 315–327 (2001). https://doi.org/10.1023/A:1012975710842
Issue Date:
DOI: https://doi.org/10.1023/A:1012975710842