The DOI matches its Crossref record.
The Rotation of Eigenvectors by a Perturbation. III
Abstract
When a Hermitian linear operator is slightly perturbed, by how much can its invariant subspaces change? Given some approximations to a cluster of neighboring eigenvalues and to the corresponding eigenvectors of a real symmetric matrix, and given an estimate for the gap that separates the cluster from all other eigenvalues, how much can the subspace spanned by the eigenvectors differ from the subspace spanned by our approximations? These questions are closely related; both are investigated here. The difference between the two subspaces is characterized in terms of certain angles through which one subspace must be rotated in order most directly to reach the other. These angles unify the treatment of natural geometric, operator-theoretic and error-analytic questions concerning those subspaces. Sharp bounds upon trigonometric functions of these angles are obtained from the gap and from bounds upon either the perturbation (1st question) or a computable residual (2nd question). An example is included.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 32
- 10.1093/qmath/7.1.76 · doi:10.1093/qmath/7.1.76
- 10.1017/S0305004100032916 · doi:10.1017/s0305004100032916
- Davis Chandler, 1958, Acta Sci. Math. Szeged, 19, 172
- 10.1090/pspum/007/0155837 · DOI
- 10.1016/0022-247X(63)90001-5 · DOI
- 10.1016/0022-247X(65)90066-1 · doi:10.1016/0022-247x(65)90066-1
- Dixmier Jacques, 1948, Revue Sci., 86, 387
- 10.24033/bsmf.1403 · doi:10.24033/bsmf.1403
- Dunford Nelson, 1963, Linear operators. Part II: Spectral theory. Self adjoint operators in Hilbert space
- 10.1002/zamm.19650450107 · doi:10.1002/zamm.19650450107
- Gohberg I. C., 1965, Introduction to the Theory of Non-Self-Adjoins Linear Operators in Hilbert Space
- 10.24033/bsmf.90 · DOI
- Kahan W., 1967, Inclusion theorems for clusters of eigenvalues of Hermitian matrices
- 10.1143/JPSJ.4.334 · DOI
- 10.1007/978-3-642-53393-8 · DOI · Paper page
- Kreinodoťn M. G., 1948, Sbornik Trudov Institute Matematiki Akademii Nauk SSSR, 97
- 10.1007/BF01385896 · doi:10.1007/bf01385896
- 10.1090/S0002-9939-1959-0104167-0 · doi:10.1090/s0002-9939-1959-0104167-0
- 10.1093/qmath/11.1.50 · DOI · Paper page
- Von Neumann J., 1935, Bull. Inst. Math. Mécan. Univ. Kouybycheff Tomsk, 1, 286
- Riesz Frédéric, 1953, Leçons d'analyse fonctionnelle
- 10.1215/S0012-7094-56-02324-9 · doi:10.1215/s0012-7094-56-02324-9
- 10.1007/978-3-642-87652-3 · DOI · Paper page
- Schoute P. H., 1902, Mehrdimensionale Geometrie. I. Teil, Die linearen Räume
- Seidel J., 1955, Nederl. Akad. Wetensch. Proc. Ser. A. 58 = Indag. Math., 17
- Stewart III G. W., 1968, Some topics in numerical analysis
- Suschowk Dietrich, 1956, Bayer. Akad. Wiss. Math.-Nat. Kl. S.-B., 1956
- 10.1090/S0002-9904-1961-10708-8 · doi:10.1090/s0002-9904-1961-10708-8
- Varah J. M., 1967, The computation of bounds for the invariant subspaces of a general matrix operator
- 10.21136/CPM.1962.117452 · doi:10.21136/cpm.1962.117452
- 10.6028/jres.064B.023 · doi:10.6028/jres.064b.023
- 10.2307/2311774 · doi:10.2307/2311774
Cited by
Eigenvalue computation in the 20th century
Golub, G. H., & van der Vorst, H. A. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00413-1 · Cited by 388
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
Chi, Y., Lu, Y. M., & Chen, Y. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2937282 · Cited by 360
Representation learning for dynamic graphs: A survey
Kazemi, S. M., Goel, R., Jain, K., Kobyzev, I., Sethi, A., Forsyth, P., & Poupart, P. (2019) · arXiv · doi:10.48550/arxiv.1905.11485 · Cited by 338
Geometric median and robust estimation in Banach spaces
Minsker, S. (2015) · Bernoulli · doi:10.3150/14-bej645 · Cited by 261
Robust covariance and scatter matrix estimation under Huber’s contamination model
Chen, M., Gao, C., & Ren, Z. (2018) · The Annals of Statistics · doi:10.1214/17-aos1607 · Cited by 146
Metadata
- Authors
- Davis, C., & Kahan, W. M.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1970-03
- Volume
- 7
- Issue
- 1
- Pages
- 1-46
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W1970377488
- Cited by
- 1,175
- References
- 0
- FWCI
- 5.54
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Rotation of Eigenvectors by a Perturbation. III. https://app.cochat.ai/papers/10.1137/0707001
- The paper
- Davis, C., & Kahan, W. M. (1970). The Rotation of Eigenvectors by a Perturbation. III. SIAM Journal on Numerical Analysis. https://doi.org/10.1137/0707001
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
