Skip to main content
Log in

An Extension of the Roots Separation Theorem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Let T n be an n×n unreduced symmetric tridiagonal matrix with eigenvalues λ12<⋅⋅⋅<λ 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 λ1122<⋅⋅⋅<λ 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.J.M. Cuppen, A divide-and-conquer method for the symmetric tridiagonal eigenproblem, Numer. Math. 36 (1981) 177–195.

    Google Scholar 

  2. J.W. Demmel, Applied Numerical Linear Algebra (SIAM, Philadelphia, 1997).

    Google Scholar 

  3. G.M.L. Gladwell, Inverse Problems in Vibration (Martinus Nijhoff, Boston, 1986).

    Google Scholar 

  4. 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.

    Google Scholar 

  5. R.O. Hill, Jr. and B.N. Parlett, Refind interlacing properties, SIAM J. Matrix Anal. Appl. 13(1) (1992) 239–247.

    Google Scholar 

  6. E.-X. Jiang, SymmetricMatrix Computation (Shanghai Science and Technology Press, Shanghai, 1984) (in Chinese).

    Google Scholar 

  7. C.C. Paige, The computation of eigenvalues and eigenvectors of very large sparse matrices, Ph.D. thesis, University of London (1971).

  8. A. Ralston and H.S.Wilf, Mathematical Methods for Diagonal Computers (Wiley, New York, 1968).

    Google Scholar 

  9. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012975710842

Navigation