Early Ending in Homotopy Path-Tracking for Real Roots

DOI10.1007/978-3-319-99957-9_12MaRDI QIDQ6108824zbMATH OpenFDO

Authors Wenyuan Wu, Bican Xia

Publication date 30 June 2023

Published in Artificial Intelligence and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99957-9_12

zbMATH Keywords

homotopy continuation methodpolynomial systemspath trackingheuristic teststop tracking

Mathematics Subject Classification ID

Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Cites work

• scientific article; zbMATH DE number 3666091 (Why is no real title available?)
• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• scientific article; zbMATH DE number 1069614 (Why is no real title available?)
• scientific article; zbMATH DE number 2151204 (Why is no real title available?)
• scientific article; zbMATH DE number 949133 (Why is no real title available?)
• scientific article; zbMATH DE number 2109418 (Why is no real title available?)
• A Method for Computing All Solutions to Systems of Polynomials Equations
• A Polyhedral Method for Solving Sparse Polynomial Systems
• A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems
• A homotopy for solving general polynomial systems that respects m- homogeneous structures
• A new decision method for elementary algebra
• A special homotopy continuation method for a class of polynomial systems
• Adaptive strategies for solving parameterized systems using homotopy continuation
• Algorithm 795
• Bernstein's theorem in affine space
• Cell decomposition of almost smooth real algebraic surfaces
• Coefficient-parameter polynomial continuation
• Critical point computations on smooth varieties, degree and complexity bounds
• Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen
• Finding All Solutions to a System of Polynomial Equations
• Finding all solutions to polynomial systems and other systems of equations
• Finding at least one point in each connected component of a real algebraic set defined by a single equation
• Finding points on real solution components and applications to differential polynomial systems
• Foreword. What is numerical algebraic geometry?
• Generalized polar varieties and an efficient real elimination.
• Generalized polar varieties: geometry and algorithms
• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• Khovanskii-Rolle continuation for real solutions
• Note on the end game in homotopy zero curve tracking
• Numerical algebraic geometry
• Numerically computing real points on algebraic sets
• Numerically solving polynomial systems with Bertini
• Polyhedral end games for polynomial continuation
• Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
• Real Root Isolation of Polynomial Equations Based on Hybrid Computation
• Regeneration homotopies for solving systems of polynomials
• Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
• Solving Real Polynomial Systems with Real Homotopies
• Symbolic homotopy construction
• The GBQ-Algorithm for Constructing Start Systems of Homotopies for Polynomial Systems
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• The number of roots of a system of equations

Cited in

(1)

• A hybrid procedure for finding real points on a real algebraic set

This page was built for publication: Early Ending in Homotopy Path-Tracking for Real Roots

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