Some Remarks on the Foundations of Numerical Analysis
- 1 June 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 32 (2) , 211-220
- https://doi.org/10.1137/1032043
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier eliminationJournal of Symbolic Computation, 1992
- Condition numbers of random matricesJournal of Complexity, 1991
- Topological complexity of a root finding algorithmJournal of Complexity, 1989
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Complexity theory of numerical linear algebraJournal of Computational and Applied Mathematics, 1988
- Bounds for the Degrees in the NullstellensatzAnnals of Mathematics, 1987
- The geometry of III-conditioningJournal of Complexity, 1987
- On the worst-case arithmetic complexity of approximating zeros of polynomialsJournal of Complexity, 1987
- On the efficiency of algorithms of analysisBulletin of the American Mathematical Society, 1985
- The fundamental theorem of algebra and complexity theoryBulletin of the American Mathematical Society, 1981