Certified Numerical Homotopy Tracking

REFERENCES

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