The DOI matches its Crossref record.
The probability that a numerical analysis problem is difficult
Open accessAbstract
Numerous problems in numerical analysis, including matrix inversion, eigenvalue calculations and polynomial zerofinding, share the following property: The difficulty of solving a given problem is large when the distance from that problem to the nearest "ill-posed" one is small. For example, the closer a matrix is to the set of non-invertible matrices, the larger its condition number with respect to inversion. We show that the sets of ill-posed problems for matrix inversion, eigenproblems, and polynomial zerofinding all have a common algebraic and geometric structure which lets us compute the probability distribution of the distance from a "random" problem to the set. From this probability distribution we derive, for example, the distribution of the condition number of a random matrix. We examine the relevance of this theory to the analysis and construction of numerical algorithms destined to be run in finite precision arithmetic.
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
Cited by
Eigenvalues and Condition Numbers of Random Matrices
Edelman, A. (1988) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0609045 · Cited by 1,284
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
A Randomized Kaczmarz Algorithm with Exponential Convergence
Strohmer, T., & Vershynin, R. (2009) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9030-4 · Cited by 903
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Spielman, D. A., & Teng, S.-H. (2004) · Journal of the ACM · doi:10.1145/990308.990310 · Cited by 825
Switching Between Diversity and Multiplexing in MIMO Systems
Heath, R. W., & Paulraj, A. J. (2005) · IEEE Transactions on Communications · doi:10.1109/tcomm.2005.849774 · Cited by 414
Metadata
- Authors
- Demmel, J. W.
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 1988
- Volume
- 50
- Issue
- 182
- Pages
- 449-480
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W2089028133
- Cited by
- 221
- References
- 0
- FWCI
- 2.96
- 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: The probability that a numerical analysis problem is difficult. https://app.cochat.ai/papers/10.1090/s0025-5718-1988-0929546-7
- The paper
- Demmel, J. W. (1988). The probability that a numerical analysis problem is difficult. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1988-0929546-7
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.