The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Unitary Triangularization of a Nonsymmetric Matrix
Open accessAbstract
International audience
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The Topology of Fibre Bundles.
Steenrod, N. E. (1951) · Cited by 2,216
The Topology of Fibre Bundles. (PMS-14)
Steenrod, N. (1951) · Princeton University Press eBooks · doi:10.1515/9781400883875 · Cited by 1,294
Cited by
Calculating the Singular Values and Pseudo-Inverse of a Matrix
Golub, G., & Kahan, W. (1965) · Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis · doi:10.1137/0702016 · Cited by 1,786
Stimulated Raman adiabatic passage in physics, chemistry, and beyond
Vitanov, N. V., Rangelov, A. A., Shore, B. W., & Bergmann, K. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015006 · Cited by 872
Numerical methods for solving linear least squares problems
Golub, G. (1965) · Numerische Mathematik · doi:10.1007/bf01436075 · Cited by 849
González, S., García, S., Del Ser, J., Rokach, L., & Herrera, F. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.07.007 · Cited by 582
Towards a Generalized Singular Value Decomposition
Paige, C. C., & Saunders, M. A. (1981) · SIAM Journal on Numerical Analysis · doi:10.1137/0718026 · Cited by 555
Edelman, A., & Rao, N. R. (2005) · Acta Numerica · doi:10.1017/s0962492904000236 · Cited by 526
Linear least squares solutions by householder transformations
Businger, P., & Golub, G. H. (1965) · Numerische Mathematik · doi:10.1007/bf01436084 · Cited by 508
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
“A few years later, Householder, in 1958 [63], discovered that complete columns of A could be reduced to zero, outside the tridiagonal part, by the more e cient Householder re ections.”
BackgroundMIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Björck, Å. (1990) · Handbook of Numerical Analysis · doi:10.1016/s1570-8659(05)80036-5 · Cited by 313
Knuth, D. E. (1994) · The Electronic Journal of Combinatorics · doi:10.37236/1193 · Cited by 296
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization
Davis, T. A. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049670 · Cited by 271
On the Evolution of Structure in Aminoacyl-tRNA Synthetases
O'Donoghue, P., & Luthey-Schulten, Z. (2003) · Microbiology and Molecular Biology Reviews · doi:10.1128/mmbr.67.4.550-573.2003 · Cited by 266
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps
Dao, T., Sohoni, N. S., Gu, A., Eichhorn, M., Blonder, A., Leszczynski, M., Rudra, A., & Ré, C. (2020) · arXiv · doi:10.48550/arxiv.2012.14966 · Cited by 21
Metadata
- Authors
- Householder, A. S.
- Venue
- Journal of the ACM
- Published
- 1958-10
- Volume
- 5
- Issue
- 4
- Pages
- 339-342
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2092590148
- Cited by
- 629
- References
- 2
- FWCI
- 4.66
- Type
- journal article
- Language
- en
- Open access
- bronze
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.