Certified predictor-corrector tracking for Newton homotopies

DOI10.1016/J.JSC.2015.07.001zbMATH Open1329.65110OpenAlexW1041626685MaRDI QIDQ898257FDOQ898257

Jonathan D. Hauenstein, Alan C. jun. Liddell

Publication date: 8 December 2015

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2015.07.001

zbMATH Keywords

numerical exampleNewton's methodhomotopy continuationpolynomial systemnumerical algebraic geometryEuler predictoralpha theorycertified trackingNewton corrections

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical computation of roots of polynomial equations (65H04)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• Algorithm 795
• Efficient path tracking methods
• The fundamental theorem of algebra and complexity theory
• On Smale's 17th problem: a probabilistic positive solution
• Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
• Real solutions to systems of polynomial equations and parameter continuation
• Complexity of Bezout's theorem. V: Polynomial time
• Complexity of Bezout's Theorem I: Geometric Aspects
• Robust certified numerical homotopy tracking
• Certified Numerical Homotopy Tracking
• Galois groups of Schubert problems via homotopy computation
• An a posteriori certification algorithm for Newton homotopies
• Numerical algebraic geometry
• Using monodromy to decompose solution sets of polynomial systems into irreducible components

Cited In (10)

• Computing complex and real tropical curves using monodromy
• Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
• Numerical algebraic geometry and semidefinite programming
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
• Solving the area-length systems in discrete gravity using homotopy continuation
• Tensor decomposition and homotopy continuation
• Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
• Rigid continuation paths II. structured polynomial systems
• A lifted square formulation for certifiable Schubert calculus
• Foreword. What is numerical algebraic geometry?

Uses Software

• HOM4PS
• PHCpack
• Bertini
• NAG4M2
• NumericalAlgebraicGeometry

Recommendations

• Title not available (Why is that?) 👍 👎
• Robust certified numerical homotopy tracking 👍 👎
• Certified Numerical Homotopy Tracking 👍 👎
• An a posteriori certification algorithm for Newton homotopies 👍 👎
• Homotopy curve tracking in approximate interior point optimization 👍 👎
• Mixed precision path tracking for polynomial homotopy continuation 👍 👎
• A novel efficient homotopy continuation method in tracking 👍 👎
• Preconditioned Iterative Methods for Homotopy Curve Tracking 👍 👎
• Experiments with Conjugate Gradient Algorithms for Homotopy Curve Tracking 👍 👎
• A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation 👍 👎

This page was built for publication: Certified predictor-corrector tracking for Newton homotopies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898257)