The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Perturbation bounds in connection with singular value decomposition
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
Perturbation Theory for Linear Operators
Kato, T. (1995) · Classics in Mathematics · doi:10.1007/978-3-642-66282-9 · Cited by 16,290
Perturbation theory for linear operators
Kato, T. (1966) · Springer eBooks · doi:10.1007/978-3-662-12678-3 · Cited by 7,131
The Rotation of Eigenvectors by a Perturbation. III
Davis, C., & Kahan, W. M. (1970) · SIAM Journal on Numerical Analysis · doi:10.1137/0707001 · Cited by 1,175
SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
MIRSKY, L. (1960) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/11.1.50 · Cited by 611
Perturbation bounds for means of eigenvalues and invariant subspaces
Ruhe, A. (1970) · BIT Numerical Mathematics · doi:10.1007/bf01934203 · Cited by 77
Cited by
The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
Golub, G. H., & Pereyra, V. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710036 · Cited by 1,430
The truncatedSVD as a method for regularization
Hansen, P. C. (1987) · BIT · doi:10.1007/bf01937276 · Cited by 826
Tensor decompositions for learning latent variable models
(2012) · arXiv (Cornell University) · doi:10.5555/2627435.2697055 · Cited by 779
Robust PCA via Outlier Pursuit
Xu, H., Caramanis, C., & Sanghavi, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173156 · Cited by 445
A useful variant of the Davis–Kahan theorem for statisticians
Yu, Y., Wang, T., & Samworth, R. J. (2015) · Biometrika · doi:10.1093/biomet/asv008 · Cited by 441
Metadata
- Authors
- Wedin, P.-Å.
- Venue
- BIT
- Published
- 1972-03
- Volume
- 12
- Issue
- 1
- Pages
- 99-111
- ISSN
- 0006-3835 (ISSN-L)
- 1572-9125
- OpenAlex
- W2046164006
- Cited by
- 460
- References
- 5
- FWCI
- 2.79
- 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
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.