Adaptive step-size selection for homotopy methods to solve polynomial equations
From MaRDI portal
Publication:4907959
DOI10.1093/imanum/drs007zbMath1266.65080arXiv1104.2084OpenAlexW1763512893MaRDI QIDQ4907959
Gregorio Malajovich, Michael Shub, Jean-Pierre Dedieu
Publication date: 27 February 2013
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.2084
Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Related Items
On the geometry and topology of the solution variety for polynomial system solving, Smale's fundamental theorem of algebra reconsidered, Complexity of path-following methods for the eigenvalue problem, Fast linear homotopy to find approximate zeros of polynomial systems, Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian, Polyhedral homotopies in Cox coordinates, Robust certified numerical homotopy tracking, Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric, Condition length and complexity for the solution of polynomial systems, Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems, Complexity of an Homotopy Method at the Neighbourhood of a Zero
