High probability analysis of the condition number of sparse polynomial systems

Theoretical Computer Science

Volumn 315, Issue 2-3, 2004, Pages 525-555

  Malajovich, Gregorio ^a   Rojas, J Maurice ^b  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Condition number; Mixed volume; Polynomial systems; Random; Sparse

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR ALGEBRA; PERTURBATION TECHNIQUES; PROBABILITY; SENSITIVITY ANALYSIS; SET THEORY; THEOREM PROVING;

CONDITION NUMBERS; MIXED VOLUME; POLYNOMIAL SYSTEMS; SPARSE POLYNOMIAL SYSTEMS;

POLYNOMIALS;

EID: 2042436402     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.01.006     Document Type: Article

References (42)

1. Abraham R., Marsden J.E. Foundations of Mechanics. 2nd Edition:1978;Benjamin/Cummings, Advanced Book Program, Reading, MA.
2. Atiyah M.F. Convexity and commuting Hamiltonians. Bull. London Math. Soc. 14(1):1982;1-15.
3. Atiyah M.F. Angular momentum, convex polyhedra and algebraic geometry. Proc. Edinburgh Math. Soc. (2). 26(2):1983;121-133.
4. Avriel M. Nonlinear Programming Analysis and Methods. 1976;Prentice-Hall, Englewood Cliffs, New Jersey.
5. Bernstein D.N. The number of roots of a system of equations. Functional Anal. Appl. 9. 9(3):1975;. (1976) 183-185.
6. Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation. 1998;Springer, New York.
7. Burago Yu.D., Zalgaller V.A. Geometric Inequalities. Grundlehren Der Mathematischen Wissenschaften. Vol. 285:1988;Springer, Berlin.
8. Chern S.S., Chen W.H., Lam K.S. Lectures on Differential Geometry. 1999;World Scientific, River Edge, NJ.
9. J.-P. Dedieu, Approximate Solutions of Numerical Problems, Condition Number Analysis and Condition Number Theorem, The Mathematics of Numerical Analysis (Park City, UT, 1995), American Mathematical Society, Providence, RI, 1996, pp. 263-283.
10. Delzant T. Hamiltoniens périodiques et images convexes de l'application moment. Bull. Soc. Math. France. 116(3):1988;315-339.
11. J.W. Demmel, Applied Numerical Linear Algebra, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1997.
12. Edelman A., Kostlan E. How many zeros of a random polynomial are real? Bull. Amer. Math. Soc. (N.S.). 32(1):1995;1-37.
13. Ewald G. Combinatorial Convexity and Algebraic Geometry. 1996;Springer, New York.
14. M. Gromov, Convex Sets and Kähler Manifolds, Advances in Differential Geometry and Topology, World Scientific Publishing, Teaneck, NJ, 1990, pp. 1-38.
15. n -Spaces, Progress in Mathematics, Vol. 122, Birkhuser Boston, Boston, MA, 1994.
16. Guillemin V., Sternberg S. Convexity properties of the moment mapping. Invent. Math. 67(3):1982;491-513.
17. Huber B., Sturmfels B. A polyhedral method for solving sparse polynomial systems. Math. Comp. 64(212):1995;1541-1555.
18. Kazarnovskii B.Ja. On zeros of exponential sums. Soviet Math. Doklady. 23(2):1981;347-351.
19. Khovanskii A.G. Fewnomials. Translations of Mathematical Monographs. Vol. 88:1991;American Mathematical Society, Providence, Rhode Island.
20. E. Kostlan, On the distribution of roots of random polynomials, from topology to computation; Proceedings of the Smalefest (Berkeley, CA, 1990), Springer, New York, 1993, pp. 419-431.
21. Tien-Yien Li, Xing Li, Finding mixed cells in the mixed volume computation. Found. Comput. Math. 1(2):2001;161-181.
22. G. Malajovich, J.M. Rojas, Random sparse polynomial systems, Math ArXiv preprint NA/0012104 , 2000.
23. G. Malajovich, J.M. Rojas, Polynomial Systems and the Momentum map, in: F. Cucker, J.M. Rojas (Eds.), Foundations of Computational Mathematics, Proceedings of SMALEFEST 2000, World Scientific, Singapore, 2002, pp. 251-266.
24. Malajovich G., Zubelli J. On the geometry of graeffe iteration. Journal of Complexity. 17(3):2001;541-573.
25. Malajovich G., Zubelli J. Tangent graeffe iteration. Numerische Mathematik. 89(4):2001;749-782.
26. McDuff D., Salamon D. Introduction to Symplectic Topology. 2nd Edition:1998;Clarendon Press, Oxford University Press, New York.
27. McLennan A. The expected number of real roots of a multihomogeneous system of polynomial equations. Amer. J. Math. 124(1):2002;49-73.
28. G. Mikhalkin, Amoebas of algebraic varieties, preprint, Mathematics ArXiv AG/0108225, 2001.
29. M. Passare, H. Rullgård, Amoebas, Monge-Ampère measures, and triangulations of the Newton polytope. Research Reports in Mathematics No. 10, Department of Mathematics, Stockholm University, 2000.
30. Rojas J.M. On the average number of real roots of certain random sparse polynomial systems. Lect. Appl. Math. 32:1996;689-699.
31. J.R. Sangwine-Yager, Mixed volumes, Handbook of Convex Geometry, Vol. A, B, North-Holland, Amsterdam, 1993, pp. 43-71.
32. M. Shub, S. Smale, Complexity of Bezout's Theorem. II. Volumes and Probabilities, Computational Algebraic Geometry (Nice, 1992), Birkhäuser Boston, Boston, MA, 1993, pp. 267-285.
33. Shub M., Smale S. Complexity of Bézout's theorem. I, Geometric aspects. J. Amer. Math. Soc. 6(2):1993;459-501.
34. Shub M., Smale S. Complexity of Bezout's theorem. III. Condition number and packing. J. Complexity. 9(1):1993;4-14. (Festschrift for Joseph F. Traub, Part I).
35. Shub M., Smale S. Complexity of Bezout's theorem. V. Polynomial time. Theoret. Comput. Sci. 133(1):1994;141-164.
36. Shub M., Smale S. Complexity of Bezout's theorem. IV. Probability of success; extensions. SIAM J. Numer. Anal. 33(1):1996;128-148.
37. Smale S. Topology and mechanics, I. Invent. Math. 10:1970;305-331.
38. J.-M. Souriau, Structure des systèmes dynamiques, Dunod, Paris, Maîtrises de mathématiques, 1970.
39. Turing A. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 2(42):1936;230-265.
40. Verschelde J., Verlinden P., Cools R. Homotopies exploiting Newton polytopes for solving sparse polynomial systems. SIAM J. Numer. Anal. 31(3):1994;915-930.
41. O. Viro, Dequantization of Real Algebraic Geometry on Logarithmic Paper, European Congress of Mathematics, Vol. I, Barcelona, 2000; Progress in Mathematics, Vol. 201, Birkhuser, Basel, 2001, pp. 135-146.
42. O. Viro, Dequantization of Real Algebraic Geometry on Logarithmic Paper, European Congress of Mathematics, Vol. I, Barcelona, 2000; Progress in Mathematics, Vol. 201, Birkhuser, Basel, 2001, pp. 135-146.