Complexity Estimates Depending on Condition and Round-Off Error

Journal of the ACM

Volumn 46, Issue 1, 1999, Pages 113-184

  Cucker, Felipe ^a   Smale, Steve ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Algorithms; Conditioning; Error analysis; F.2.1 Analysis of Algorithms and Problem Complexity : Numerical Algorithms and Problems; Feasibility of polynomial systems; G.1.5 Numerical Analysis : Roots of Nonlinear Equations; Iterative methods; Theory

Indexed keywords

EID: 0001278674     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/300515.300519     Document Type: Article

References (33)

1. ALLGOWER, E., AND GEORG, K. 1990. Numerical Continuation Methods. Springer-Verlag, New York.
2. BALCÁZAR, J., DÍAZ, J., AND GABARRÓ, J. 1988. Structural complexity I. In EATCS Monographs on Theoretical Computer Science, vol. 11. Springer-Verlag, New York.
3. BASU, S., POLLACK, R., AND ROY, M.-F. 1994. On the combinatorial and algebraic complexity of quantifier elimination. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 632-641.
4. BLUM, L., CUCKER, F., SHUB, M., AND SMALE, S. 1998. Complexity and Real Computation. Springer-Verlag, New York.
5. BLUM, L., SHUB, M., AND SMALE, S. 1989. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. AMS 21, 1-46.
6. CAMPBELL, S., AND MEYER, C. 1979. Generalized Inverses of Linear Transformations. Pitman, London.
7. COLLINS, G. 1975. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Lecture Notes in Computer Science, vol. 33. Springer-Verlag, New York, pp. 134-183.
8. CUCKER, F., MONTAÑA, J., AND PARDO, L. 1995. Models for parallel computations with real numbers. In Number Theoretic and Algebraic Methods in Computer Science, I. Shpardinski, ed. World Scientific, River Edge, N.J., pp. 53-63.
9. DEDIEU, J.-P. 1996. Approximate solutions of numerical problems, condition number analysis and condition number theorem. In The Mathematics of Numerical Analysis, J. Renegar, M. Shub, and S. Smale, eds. Lectures in Applied Mathematics, vol. 32. American Mathematical Society, Providence, R.I., pp. 263-283.
10. DEDIEU, J.-P., AND SHUB, M. 1997. Multihomogeneous Newton methods. Preprint.
11. GRAHAM, R., KNUTH, D., AND PATASHNIK, O. 1989. Concrete Mathematics. Addison-Wesley, Reading, Mass.
12. GRIGORIEV, D., AND VOROBJOV, N. 1988. Solving systems of polynomial inequalities in subexponential time. J. Symb. Comput. 5, 37-64.
13. HEINTZ, J., ROY, M.-F., AND SOLERNÓ, P. 1990. Sur la complexité du principe de Tarski-Seidenberg. Bull. Soc. Math. France 118, 101-126.
14. HIGHAM, N. 1996. Accuracy and Stability of Numerical Algorithms. SIAM, New York.
15. MEGIDDO, N. 1993. A general NP-completeness theorem. In From Topology to Computation: Proceedings of the Smalefest, M. Hirsch, J. Marsden, and M. Shub, eds. Springer-Verlag, New York, pp. 432-442.
16. PAPADIMITRIOU, C. 1994. Computational Complexity. Addison-Wesley, Reading, Mass.
17. RENEGAR, J. 1992. On the computational complexity and geometry of the first-order theory of the reals. Part I. J. Symb. Comput. 13, 255-299.
18. SHUB, M. 1994. Mysteries of mathematics and computation. Math. Int. 16, 10-15.
19. SHUB, M., AND SMALE, S. 1993a. Complexity of Bezout's theorem I: Geometric aspects. J. AMS. 6, 459-501.
20. SHUB, M., AND SMALE, S. 1993b. Complexity of Bezout's theorem II: Volumes and probabilities. In Computational Algebraic Geometry, F. Eyssette and A. Galligo, eds. Progress in Mathematics, vol. 109. Birkhäuser, Boston, Mass., pp. 267-285.
21. SHUB, M., AND SMALE, S. 1993c. Complexity of Bezout's theorem III: Condition number and packing. J. Complex. 9, 4-14.
22. SHUB, M., AND SMALE, S. 1994. Complexity of Bezout's theorem V: Polynomial time. Theoret. Comput. Sci. 133, 141-164.
23. SHUB, M., AND SMALE, S. 1996. Complexity of Bezout's theorem IV: Probability of success; extensions. SIAM J. Numer. Anal. 33, 128-148.
24. SMALE, S. 1986. Newton's method estimates from data at one point. In The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics, R. Ewing, K. Gross, and C. Martin, eds. Springer-Verlag, New York.
25. SMALE, S. 1997. Complexity theory and numerical analysis. In Acta Numerica. Cambridge University Press, Cambridge, England, pp. 523-551.
26. TARSKI, A. 1951. A Decision Method for Elementary Algebra and Geometry. University of California Press.
27. TREFETHEN, L., AND BAU, D. III 1997. Numerical Linear Algebra. SlAM, Philadelphia, Pa.
28. TURING, A. 1948. Rounding-off errors in matrix processes. Quart. J. Mech. Appl. Math. 1, 287-308.
29. VON NEUMANN, J., AND GOLDSTINE, H. 1947. Numerical inverting matrices of high order. Bull. AMS. 53, 1021-1099.
30. VON NEUMANN, J., AND GOLDSTINE, H. 1951. Numerical inverting matrices of high order, II. Proc. AMS. 2, 188-202.
31. WILKINSON, J. 1963. Rounding Errors in Algebraic Processes. Prentice-Hall, Englewood Cliffs, New Jersey.
32. WILKINSON, J. 1971. Modern error analysis. SIAM Rev. 13, 548-568.
33. WÜTHRICH, H. 1976. Ein Entscheidungsverfahren für die Theorie der reell-abgeschlossenen Körper. In Komplexität von Entscheidungsproblemen, E. Specker and V. Strassen, eds. Lecture Notes in Computer Science, vol. 43. Springer-Verlag, New York, pp. 138-162.