Abstract
In this paper we study volume estimates in the space of systems of n homegeneous polynomial equations of fixed degrees d i with respect to a natural Hermitian structure on the space of such systems invariant under the action of the unitary group. We show that the average number of real roots of real systems is D 1/2 where D = Π d i is the Be zout number. We estimate the volume of the subspace of badly conditioned problems and show that volume is bounded by a small degree polynomial in n, N and D times the reciprocal of the condition number to the fourth power. Here N is the dimension of the space of systems.
Some of this work was carried out when Shub was visiting the Berkeley Math Department for 2 months in 1992,
Supported partially by NSF funds
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Demmel, J., On condition numbers and the distance to the nearest ill-posed problem, Numerische Math. 51 (1987), 251–289.
Eckart, C. and Young, G., The approximation of one matrix by another of lower rank, Psychometrika 1 (1936), 211–218.
Edelman, A., On the distribution of a scaled condition number, Math. of Comp. 58 (1992), 185–190.
Edelman, A., On the moments of the determinant of a uniformly distributed complex matrix, in preparation (1992a).
Kac, M., On the average number of real roots of a random algebraic equation, Bull. Amer. Math. Soc. 49 (1943), 314–320.
Kostlan, Eric, Random polynomials and the statistical fundamental theorem of algebra, Preprint, Univ. of Hawaii (1987).
Kostlan, E., On the distribution of the roots of random polynomials, to appear in “From Topology to Computation” Proceedings of the Smalefest, Hirsch, M., Marsden, J. and Shub, M. (Eds) (1991).
Morgan, F., Geometric Measure Theory, A Beginners Guide, Academic Press, 1988.
Renegar, J., On the efficiency of Newton’s Method in approximating all zeros of systems of complex polynomials, Math. of Operations Research 12 (1987), 121–148.
Shub, M. and Smale, S., Complexity of Bezout’s Theorem I, Geometric Aspects, Preprint (referred to as [I]) (1991).
Stein, E. and Weiss, G., Introduction to Fourier Analysis on Euclidean Spaces, Princeton Univ. Press, Princeton, NJ, 1971.
Tsuji, M., Potential Theory in Modern Function Theory, Maruzen Co. Ltd., Tokyo, 1959.
Wilkinson, J., Rounding Errors in Algebraic Processes, Prentice Hall, Englewood Cliffs, NJ.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Birkhäuser Boston
About this paper
Cite this paper
Shub, M., Smale, S. (1993). Complexity of Bezout’s Theorem II Volumes and Probabilities. In: Eyssette, F., Galligo, A. (eds) Computational Algebraic Geometry. Progress in Mathematics, vol 109. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-2752-6_19
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2752-6_19
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-7652-4
Online ISBN: 978-1-4612-2752-6
eBook Packages: Springer Book Archive