Abstract
We prove that rational data of bounded input length are uniformly distributed (in the classical sense of H. Weyl, in [42]) with respect to the probability distribution of condition numbers of numerical analysis. We deal both with condition numbers of linear algebra and with condition numbers for systems of multivariate polynomial equations. For instance, we prove that for a randomly chosen n\times n rational matrix M of bit length O(n 4log n) + log w , the condition number k(M) satisfies k(M) ≤ w n 5/2 with probability at least 1-2w -1 . Similar estimates are established for the condition number μ_ norm of M. Shub and S. Smale when applied to systems of multivariate homogeneous polynomial equations of bounded input length. Finally, we apply these techniques to estimate the probability distribution of the precision (number of bits of the denominator) required to write approximate zeros of systems of multivariate polynomial equations of bounded input length.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
March 7, 2001. Final version received: June 7, 2001.
Rights and permissions
About this article
Cite this article
Castro, D., Montaña, J., Pardo, L. et al. The Distribution of Condition Numbers of Rational Data of Bounded Bit Length. Found. Comput. Math. 2, 1–52 (2002). https://doi.org/10.1007/s002080010017
Published:
Issue Date:
DOI: https://doi.org/10.1007/s002080010017
Key words
- Condition numbers
- Linear algebra
- Multivariate polynomial equations
- Probability and uniform distribution
- Discrepancy bounds
- Approximate zeros
- Height of projective points