A robust numerical path tracking algorithm for polynomial homotopy continuation
From MaRDI portal
(Redirected from Publication:5146689)
Abstract: We propose a new algorithm for numerical path tracking in polynomial homotopy continuation. The algorithm is `robust' in the sense that it is designed to prevent path jumping and in many cases, it can be used in (only) double precision arithmetic. It is based on an adaptive stepsize predictor that uses Pad'e techniques to detect local difficulties for function approximation and danger for path jumping. We show the potential of the new path tracking algorithm through several numerical examples and compare with existing implementations.
Recommendations
Cites work
- A continuation method based on a high order predictor and an adaptive steplength control
- A Neural Network Modeled by an Adaptive Lotka-Volterra System
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A power series method for computing singular solutions to nonlinear analytic systems
- A stabilized normal form algorithm for generic systems of polynomial equations
- Adaptive Multiprecision Path Tracking
- Algebraic properties of robust Padé approximants
- Algorithm 795
- An algorithm for computing a Padé approximant with minimal degree denominator
- An approach for certifying homotopy continuation paths. Univariate case
- An Interval Step Control for Continuation Methods
- Approximation theory and approximation practice
- Automatic Hessians by reverse accumulation
- Computing singular solutions to nonlinear analytic systems
- Condition. The geometry of numerical algorithms
- Deformation techniques for sparse systems
- Evaluating Derivatives
- Fast Algorithms for Manipulating Formal Power Series
- Fast and Backward Stable Computation of Roots of Polynomials
- Higher Order Predictors and Adaptive Steplength Control in Path Following Algorithms
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- scientific article; zbMATH DE number 3127712 (Why is no real title available?)
- scientific article; zbMATH DE number 3711281 (Why is no real title available?)
- scientific article; zbMATH DE number 3749342 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1069614 (Why is no real title available?)
- scientific article; zbMATH DE number 822685 (Why is no real title available?)
- scientific article; zbMATH DE number 3108610 (Why is no real title available?)
- Introduction to numerical algebraic geometry
- Introduction to Numerical Continuation Methods
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Numerically solving polynomial systems with Bertini
- ON AN INVERSE PROBLEM FOR THEmTH ROW OF THE PADÉ TABLE
- ON THE CONVERGENCE OF GENERALIZED PADÉ APPROXIMANTS OF MEROMORPHIC FUNCTIONS
- On the location of poles of Padé approximants
- Padé approximants and efficient analytic continuation of a power series
- Polyhedral end games for polynomial continuation
- Puiseux expansion for space curves
- Robust certified numerical homotopy tracking
- Robust Padé Approximation via SVD
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
- Sweeping algebraic curves for singular solutions
- Symmetric homotopy construction
- The AAA algorithm for rational approximation
- The convergence of Padé approximants to functions with branch points
- The Holomorphic Embedding Loadflow Method for DC Power Systems and Nonlinear DC Circuits
- The method of Gauss-Newton to compute power series solutions of polynomial homotopies
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- THE POLES OF THEmTH ROW OF THE PADÉ TABLE AND THE SINGULAR POINTS OF A FUNCTION
Cited in
(25)- Robust certified numerical homotopy tracking
- Locating the closest singularity in a polynomial homotopy
- Multigraded Sylvester forms, duality and elimination matrices
- Mixed precision path tracking for polynomial homotopy continuation
- Spherical projective path tracking for homotopy continuation methods
- A novel efficient homotopy continuation method in tracking
- Landau discriminants
- Certified numerical homotopy tracking
- Stepsize control for path tracking
- scientific article; zbMATH DE number 69566 (Why is no real title available?)
- An approach for certifying homotopy continuation paths. Univariate case
- Algebraic compressed sensing
- Contour Integration for Eigenvector Nonlinearities
- Rigid continuation paths II. structured polynomial systems
- \(u\)-generation: solving systems of polynomials equation-by-equation
- Polyhedral homotopies in Cox coordinates
- Efficient path tracking methods
- Graceful bases in solution spaces of differential and difference equations
- Extrapolating solution paths of polynomial homotopies towards singularities with PHCpack and Phcpy
- GPU accelerated Newton for Taylor series solutions of polynomial homotopies in multiple double precision
- Polynomial equations: theory and practice
- Branch points of homotopies: distribution and probability of failure
- Computing Euclidean distance and maximum likelihood retraction maps for constrained optimization
- Validated numerics for algebraic path tracking
- Certified predictor-corrector tracking for Newton homotopies
This page was built for publication: A robust numerical path tracking algorithm for polynomial homotopy continuation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146689)
