A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation

09/11/2019
by   Simon Telen, et al.
0

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é 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.

READ FULL TEXT

page 5

page 12

research
02/21/2020

Robust Numerical Tracking of One Path of a Polynomial Homotopy on Parallel Shared Memory Computers

We consider the problem of tracking one solution path defined by a polyn...
research
08/30/2023

A spectrum adaptive kernel polynomial method

The kernel polynomial method (KPM) is a powerful numerical method for ap...
research
02/06/2018

Resilient Blocks for Summarising Distributed Data

Summarising distributed data is a central routine for parallel programmi...
research
04/12/2021

A stochastic homotopy tracking algorithm for parametric systems of nonlinear equations

The homotopy continuation method has been widely used in solving paramet...
research
05/25/2023

Polylogarithmic Approximation for Robust s-t Path

The paper revisits the robust s-t path problem, one of the most fundamen...
research
03/27/2009

A Combinatorial Algorithm to Compute Regularization Paths

For a wide variety of regularization methods, algorithms computing the e...

Please sign up or login with your details

Forgot password? Click here to reset