Certified numerical homotopy tracking

Experimental Mathematics

Volumn 21, Issue 1, 2012, Pages 69-83

  Beltrán, Carlos ^a   Leykin, Anton ^b  

^a UNIVERSITY OF CANTABRIA   (Spain)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximate zero; Certified algorithms; Complexity; Computational aspects of algebraic geometry; Continual methods; Homotopy methods; Systems of equations

Indexed keywords

EID: 84866517015     PISSN: 10586458     EISSN: 1944950X     Source Type: Journal    
DOI: 10.1080/10586458.2011.606184     Document Type: Article

References (28)

1. D. J. Bates, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler. "Bertini: Software for Numerical Algebraic Geometry." Available online (http://www.nd.edu/~sommese/bertini), 2011.
2. C. Beltrán. "A Continuation Method to Solve Polynomial Systems, and Its Complexity." Numerische Mathematik 117:1 (2011), 89-113.
3. C. Beltrán and A. Leykin. "Robust Certified Numerical Homotopy Tracking." arXiv: 1105.5992, 2012.
4. C. Beltrán and L. M. Pardo. "On Smale's 17th Problem: A Probabilistic Positive Solution." Found. Comput. Math. 8:1 (2008), 1-43.
5. C. Beltrán and L. M. Pardo. "Smale's 17th Problem: Average Polynomial Time to Compute Affine and Projective Solutions." J. Amer. Math. Soc. 22 (2009), 363-385.
6. C. Beltrán and L. M. Pardo. "Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems." Foundations of Computational Mathematics 11:1 (2011), 95-129.
7. C. Beltrán and M. Shub. "A Note on the Finite Variance of the Averaging Function for Polynomial System Solving." Found. Comput. Math. 10 (2010), 115-125.
8. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer, 1998.
9. P. Bürgisser and F. Cucker. "On a Problem Posed by Steve Smale." To appear in Annals of Mathematics, 2012.
10. J.-P. Dedieu, G. Malajovich, and M. Shub. "Adaptative Step Size Selection for Homotopy Methods to Solve Polynomial Equations," To appear, 2012.
11. J. D. Hauenstein and F. Sottile. "alphaCertified: Certifying Solutions to Polynomial Systems." To appear in ACM Transactions on Mathematical Software.
12. B. Huber and B. Sturmfels. "A Polyhedral Method for Solving Sparse Polynomial Systems." Math. Comp., 64:212 (1995), 1541-1555.
13. B. Huber, F. Sottile, and B. Sturmfels. "Numerical Schubert Calculus." J. Symbolic Comput. 26:6 (1998), 767-788.
14. T. L. Lee, T. Y. Li, and C. H. Tsai. "Hom4ps-2.0: A Software Package for Solving Polynomial Systems by the Polyhedral Homotopy Continuation Method." Available online (http://hom4ps.math.msu.edu/HOM4PS soft.htm), 2011.
15. A. Leykin. "Numerical Algebraic Geometry." JSAG 3 (2011), 5-10.
16. A. Leykin and F. Sottile. "Galois Groups of Schubert Problems via Homotopy Computation." Math. Comp. 78:267 (2009), 1749-1765.
17. A. Leykin, J. Verschelde, and A. Zhao. "Newton's Method with Deflation for Isolated Singularities of Polynomial Systems." Theoretical Computer Science 359:1-3 (2006), 111-122.
18. A. Leykin, J. Verschelde, and A. Zhao. "Higher-Order Deflation for Polynomial Systems with Isolated Singular Solutions." In Algorithms in Algebraic Geometry, IMA Vol. Math. Appl. 146, pp. 79-97. Springer, 2008.
19. F. Mezzadri. "How to Generate Random Matrices from the Classical Compact Groups." Notices of the American Mathematical Society 54:5 (2007), 592-604.
20. M. Shub. "Some Remarks on Bézout's Theorem and Complexity Theory." In From Topology to Computation: Proceedings of the Smalefest (Berkeley, CA, 1990), pp. 443-455. Springer, 1993.
21. M. Shub. "Complexity of Bézout's Theorem. VI: Geodesics in the Condition (Number) Metric." Found. Comput. Math. 9:2 (2009), 171-178.
22. M. Shub and S. Smale. "Complexity of Bézout's Theorem. I. Geometric Aspects." J. Amer. Math. Soc. 6:2 (1993), 459-501.
23. M. Shub and S. Smale. "Complexity of Bézout's Theorem. V. Polynomial Time." Theoret. Comput. Sci. 133:1 (1994), Selected papers of the Workshop on Continuous Algorithms and Complexity (Barcelona, 1993), 141-164.
24. S. Smale. "Newton's Method Estimates from Data at One Point." In The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics (Laramie, Wyo., 1985), pp. 185-196. Springer, 1986.
25. A. J. Sommese and C. W. Wampler. The Numerical Solution of Systems of Polynomials. World Scientific, 2005.
26. A. J. Sommese, J. Verschelde, and C. W. Wampler. "Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components." SIAM J. Numer. Anal. 38:6 (2001), 2022-2046.
27. J. Verschelde. "Algorithm 795: PHCpack: A General-Purpose Solver for Polynomial Systems by Homotopy Continuation." ACM Trans. Math. Softw. 25:2 (1999), 251-276.
28. K. Zyczkowski and M. Kus. "Random Unitary Matrices" (English summary). J. Phys. A 133:27 (1994), 4235-4245.