The Distribution of Condition Numbers of Rational Data of Bounded Bit Length

Foundations of Computational Mathematics

Volumn 2, Issue 1, 2002, Pages 1-52

  Castro, D ^a   Montana J L ^a   Pardo, L M ^a   San Martin J ^a  

^a UNIVERSITY OF CANTABRIA   (Spain)

Author keywords

Approximate zeros; Condition numbers; Discrepancy bounds; Height of projective points; Linear algebra; Multivariate polynomial equations; Probability and uniform distribution

Indexed keywords

ALGEBRA; LINEAR ALGEBRA; MULTIVARIABLE SYSTEMS; NUMBER THEORY; POLYNOMIALS; PROBABILITY;

APPROXIMATE ZEROS; CONDITION NUMBERS; DISCREPANCY BOUNDS; HEIGHT OF PROJECTIVE POINTS; MULTIVARIATE POLYNOMIAL; UNIFORM DISTRIBUTION;

PROBABILITY DISTRIBUTIONS;

EID: 0013026624     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s002080010017     Document Type: Article

References (47)

1. E. Artin, Algebraic Numbers and Algebraic Functions, I, Institute for Mathematics and Mechanics, New York University, New York, 1951.
2. E. Artin, The Gamma Function, Holt, Rinehart and Winston, New York, 1964.
3. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation, Springer-Verlag, New York, 1998. With a foreword by Richard M. Karp.
4. D. Castro, L. M. Pardo, K. Hägele, and J. E. Morais, Kronecker's and Newton's approaches to solving: A first comparison, J. Complexity 17(1) (2001), 212-303.
5. H. Davenport, On a principle of Lipschitz, J. London Math. Soc. 26 (1951), 179-183.
6. M. P. do Carmo, Riemannian Geometry, Birkhäuser, Boston, MA, 1992. Translated from the second Portuguese edition by Francis Flaherty.
7. C. Eckardt and G. Young, The approximation of one matrix by another of lower rank, Psychometrika 1 (1936), 211-218.
8. A. Edelman, Eigenvalues and Condition number of random matrices, PhD thesis, MIT, Cambridge, MA, 1989.
9. A. Edelman, Eigenvalues and condition numbers of random matrices, SIAM J. Matrix Anal. Appl. 9(4) (1988), 543-560.
10. A. Edelman, On the distribution of a scaled condition number. Math. Comp. 58(197) (1992), 185-190.
11. P. Erdös and P. Turán, On a problem in the theory of uniform distribution, I, Nederl. Akad. Wetensch. Proc. 51 (1948), 1146-1154 = Indag. Math. 10 (1948), 370-378.
12. P. Erdös and P. Turán, On a problem in the theory of uniform distribution, I, Nederl. Akad. Wetensch. Proc. 51 (1948), 1146-1154 = Indag. Math. 10 (1948), 370-378.
13. P. Erdös and P. Turán, On a problem in the theory of uniform distribution, II, Nederl. Akad. Wetensch. Proc. 51 (1948), 1262-1269 = Indag. Math. 10 (1948), 406-413.
14. P. Erdös and P. Turán, On a problem in the theory of uniform distribution, II, Nederl. Akad. Wetensch. Proc. 51 (1948), 1262-1269 = Indag. Math. 10 (1948), 406-413.
15. S. Gallot, D. Hulin, and J. Lafontaine, Riemannian Geometry, 2nd ed., Springer-Verlag, Berlin, 1990.
16. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
17. K. Hägele, J. E. Morais, L. M. Pardo, and M. Sombra, On the intrinsic complexity of the arithmetic nullstellensatz, J. Pure Appl. Algebra 146(2) (2000), 103-183.
18. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Clarendon Press, Oxford, UK, 1938.
19. E. Kostlan, Complexity theory of numerical linear algebra, J. Comput. Appl. Math. 22(2-3) (1988), 219-230. Special issue on emerging paradigms in applied mathematical modeling.
20. T. Krick, M. Sombra, and L. M. Pardo, Sharp estimates for the arithmetic nullstellensatz, Duke Math. J. (2001) (to appear).
21. S. Lang, Fundamentals of Diophantine Geometry, Springer-Verlag, New York, 1983.
22. G. Malajovich, Condition number bounds for problems with integer coefficients, J. Complexity 16(3) (2000), 529-551. Complexity Theory, Real Machines, and Homotopy, Oxford University Press, Oxford, 1999.
23. G. Malajovich, Condition number bounds for problems with integer coefficients, J. Complexity 16(3) (2000), 529-551. Complexity Theory, Real Machines, and Homotopy, Oxford University Press, Oxford, 1999.
24. P. J. McCarthy, Algebraic Extensions of Fie Ids, Chelsea, New York, 1976. Reprinting of the 1966 original.
25. J. Milnor, On the Betti numbers of real varieties, Proc. Amer. Math. Soc. 15 (1964), 275-280.
26. L. J. Mordell, On some arithmetical results in the geometry of numbers, Compositio Math. 1 (1934), 248-253.
27. J. Mueller and W. M. Schmidt, On the number of good rational approximations to algebraic numbers, Proc. Amer. Math. Soc. 106(4) (1989), 859-866.
28. O. A. Oleinik, Estimates of the Betti numbers of real algebraic hypersurfaces, Mat. Sb. 70(28) (1951), 635-640.
29. O. A. Oleinik and I. B. Petrovsky, On the topology of real algebraic surfaces, Izv. Akad. Nauk SSSR, in Trans. Amer. Math. Soc. 1 (1962), 399-417.
30. W. M. Schmidt, Heights of algebraic points lying on curves or hypersurfaces, Proc. Amer. Math. Soc. 124(10) (1996), 3003-3013.
31. m, in Number Theory (Paris, 1993-1994), pp. 157-187, Cambridge University Press, Cambridge, UK, 1996.
32. M. Shub and S. Smale, Computational complexity: On the geometry of polynomials and a theory of cost, I. Ann Sci. École Norm. Sup. 18 (1985), 107-142.
33. M. Shub and S. Smale, Complexity of Bézout's theorem, II: Volumes and probabilities, in Proceeding Effective Methods in Algebraic Geometry, Progress in Mathematics, Vol. 109 pp. 267-285, MEGA '92, Nice, Birkhäuser, Boston, MA, 1993.
34. M. Shub and S. Smale, Complexity of Bézout's theorem, V, Polynomial time, Theoret. Comput. Sci. 133 (1994), 141-164.
35. M. Shub and S. Smale, On the existence of generally convergent algorithms, J. Complexity 2(1) (1986), 2-11.
36. M. Shub and S. Smale, Complexity of Bézout's theorem, I, Geometric aspects, J. Amer. Math. Soc. 6(2) (1993), 459-501.
37. M. Shub and S. Smale, Complexity of Bezout's theorem, III, Condition number and packing, J. Complexity 9(1) (1993), 4-14. Festschrift for Joseph F. Traub, Part I.
38. M. Shub and S. Smale, Complexity of Bezout's theorem, IV, Probability of success; extensions, SIAM J. Numer. Anal. 33(1) (1996), 128-148.
39. S. Smale, The fundamental theorem of algebra and complexity theory, Bull. Amer. Math. Soc. (N.S.) 4(1) (1981), 1-36.
40. S. Smale, On the efficiency of algorithms of analysis, Bull. Amer. Math. Soc. (N.S.) 13(2) (1985), 87-121.
41. R. Thom, Sur l'homologie des variétés algébriques réelles. In Differential and Combinatorial Topology (A Symposium in Honor of Marston Morse), pp. 255-265, Princeton University Press, Princeton, NJ, 1965.
42. A. Turing, Rounding-off errors in matrix processes, Quart. J. Mech. Appl. Math. 1 (1948), 287-308.
43. J. D. Vaaler, Some extremal functions in Fourier analysis, Bull. Amer. Math. Soc. (N.S.) 12(2) (1985), 183-216.
44. J. von Neumann, Collected Works, Vol. V: Design of Computers, Theory of Automata and Numerical Analysis, Macmillan, New York, 1963.
45. H. Weyl, Über die gleichverteilung von zahlen modulo 1, Math. Ann. 77 (1916), 313-352.
46. J. H. Wilkinson, Rounding Errors in Algebraic Processes, Prentice-Hall, Englewood Cliffs, NJ, 1963.
47. J. H. Wilkinson, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, UK, 1965.