Real computations with fake numbers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 55-73

  Cucker, Felipe ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLEXITY THEORY; REAL COMPUTATION; REAL NUMBER; THEORETICAL FOUNDATIONS; THEORY OF COMPUTATION;

AUTOMATA THEORY;

EID: 22644449122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_5     Document Type: Conference Paper

References (36)

1. S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM, 43:1002-1045, 1996.
2. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, 1998.
3. L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the Amer. Math. Soc., 21:1-46, 1989.
4. P. Burgisser, M. Clausen, and A. Shokrollahi. Algebraic Complexity Theory. Springer-Verlag, 1996.
5. F. Cucker. PIR 6= NCIR. Journal of Complexity, 8:230-238, 1992.
6. F. Cucker and S. Smale. Complexity estimates depending on condition and round off error. To appear in Journal of the ACM, 1997.
7. L.S. de Jong. Towards a formal definition of numerical stability. Numer. Math., 28:211-219, 1977.
8. J.W. Demmel. Applied Numerical Linear Algebra. SIAM, 1997.
9. C. Eckart and G. Young. The approximation of one matrix by another of lower rank. Psychometrika, 1:211-218, 1936.
10. H.H. Goldstine. A History of Numerical Analysis from the 16th through the 19th Century. Springer-Verlag, 1977.
11. J. Heintz, M.-F. Roy, and P. Solerno. Sur la complexite du principe de Tarski- Seidenberg. Bulletin de la Societe Mathematique de France, 118:101-126, 1990.
12. N. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, 1996.
13. D. Knuth. The Art of Computer Programming, volume 2, Seminumerical Algorithms. Addison-Wesley, 2 edition, 1981.
14. P. Koiran. The real dimension problem is NPIR-complete. To appear in Journal of Complexity, 1997.
15. A.M. Ostrowski. On two problems in abstract algebra connected with Horner's rule. In Studies in Mathematics and Mechanics presented to Richard von Mises, pages 40-48. Academic Press, 1954.
16. V.Y. Pan. Methods of computing values of polynomials. Russian Math. Surveys, 21:105-136, 1966.
17. J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. Part I Journal of Symbolic Computation, 13:255-299, 1992.
18. J. Renegar. Some perturbation theory for linear programming. Mathematical Programming, 65:73-91, 1994.
19. J. Renegar. Incorporating condition measures into the complexity theory of linear programming. SIAM Journal of Optimization, 5:506-524, 1995.
20. J. Renegar. Linear programming, complexity theory and elementary functional analysis. Mathematical Programming, 70:279-351, 1995.
21. M. Shub and S. Smale. Complexity of Bezout's theorem I: geometric aspects. Journal of the Amer. Math. Soc., 6:459-501, 1993.
22. M. Shub and S. Smale. Complexity of Bezout's theorem II: volumes and probabilities. In F. Eyssette and A. Galligo, editors, Computational Algebraic Geometry, volume 109 of Progress in Mathematics, pages 267-285. Birkhauser, 1993.
23. M. Shub and S. Smale. Complexity of Bezout's theorem III: condition number and packing. Journal of Complexity, 9:4-14, 1993.
24. M. Shub and S. Smale. Complexity of Bezout's theorem V: polynomial time. Theoretical Computer Science, 133:141-164, 1994.
25. M. Shub and S. Smale. Complexity of Bezout's theorem IV: probability of success; extensions. SIAM J. of Numer. Anal., 33:128-148, 1996.
26. S. Smale. The fundamental theorem of algebra and complexity theory. Bulletin of the Amer. Math. Soc., 4:1-36, 1981.
27. S. Smale. Some remarks on the foundations of numerical analysis. SIAM Review, 32:211-220, 1990.
28. S. Smale. Complexity theory and numerical analysis. In A. Iserles, editor, Acta Numerica, pages 523-551. Cambridge University Press, 1997.
29. L.N. Trefethen and D. Bau. Numerical Linear Algebra. SIAM, 1997.
30. L.N. Trefethen and R.S. Schreiber. Average-case stability of Gaussian elimination. SIAM J. Matrix Anal. Appl., 11:335-360, 1990.
31. E. Triesch. A note on a theorem of Blum, Shub, and Smale. Journal of Complexity, 6:166-169, 1990.
32. A.M. Turing. Rounding-off errors in matrix processes. Quart. J. Mech. Appl. Math., 1:287-308, 1948.
33. J. Neumann and H.H. Goldstine. Numerical inverting matrices of high order. Bulletin of the Amer. Math. Soc., 53:1021-1099, 1947.
34. J. Wilkinson. Rounding Errors in Algebraic Processes. Prentice Hall, 1963.
35. J. Wilkinson. Modern error analyis. SIAM Review, 13:548-568, 1971.
36. H. Wozniakowski. Numerical stability for solving non-linear equations. Numer. Math., 27:373-390, 1977.