The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Computing a nearest symmetric positive semidefinite matrix
Open accessOverview
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Numerical Recipes, The Art of Scientific Computing
Press, W. H., Flannery, B. P., Teukolsky, S. A., Vetterling, W. T., & Gould, H. (1987) · American Journal of Physics · doi:10.1119/1.14981 · Cited by 10,024
Levary, R. R. (1982) · European Journal of Operational Research · doi:10.1016/0377-2217(82)90093-5 · Cited by 4,158
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Dongarra, J. J., Moler, C. B., Bunch, J. R., & Stewart, G. W. (1979) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971811 · Cited by 1,738
Introduction to applied mathematics.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90036-4 · Cited by 1,495
Numerical recipes: The art of scientific computing
DAVIDROPER, L. (1987) · Bulletin of Mathematical Biology · doi:10.1016/s0092-8240(87)90019-x · Cited by 1,424
The Symmetric Eigenvalue Problem.
Wilkinson, J. H., & Parlett, B. N. (1981) · Mathematics of Computation · doi:10.2307/2007453 · Cited by 1,186
Computing the Polar Decomposition—with Applications
Higham, N. J. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907079 · Cited by 427
Self-citationOn condition numbers and the distance to the nearest ill-posed problem
Demmel, J. W. (1987) · Numerische Mathematik · doi:10.1007/bf01400115 · Cited by 302
Cited by
TEASER: Fast and Certifiable Point Cloud Registration
Yang, H., Shi, J., & Carlone, L. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3033695 · Cited by 895
Designing structured tight frames via an alternating projection method
Tropp, J. A., Dhillon, I. S., Heath, R. W., & Strohmer, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839492 · Cited by 494
Iterative Methods for Fixed Point Problems in Hilbert Spaces
Cegielski, A. (2013) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-30901-4 · Cited by 318
Higham, N. J. (2009) · WIREs Computational Statistics · doi:10.1002/wics.18 · Cited by 152
Self-citationApplication of fermionic marginal constraints to hybrid quantum algorithms
Rubin, N. C., Babbush, R., & McClean, J. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aab919 · Cited by 152
Metadata
- Authors
- Higham, N. J.
- Venue
- Linear Algebra and its Applications
- Publisher
- Elsevier BV
- Published
- 1988-05
- Volume
- 103
- Pages
- 103-118
- ISSN
- 0024-3795 (ISSN-L)
- OpenAlex
- W2072863821
- Cited by
- 698
- References
- 13
- FWCI
- 4.43
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computing a nearest symmetric positive semidefinite matrix. https://app.cochat.ai/papers/10.1016/0024-3795(88)90223-6
- The paper
- Higham, N. J. (1988). Computing a nearest symmetric positive semidefinite matrix. Linear Algebra and its Applications. https://doi.org/10.1016/0024-3795(88)90223-6
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.
