DeepAI AI Chat
Log In Sign Up

The Method of Gauss-Newton to Compute Power Series Solutions of Polynomial Homotopies

12/15/2016
by   Nathan Bliss, et al.
University of Illinois at Chicago
0

We consider the extension of the method of Gauss-Newton from complex floating-point arithmetic to the field of truncated power series with complex floating-point coefficients. With linearization we formulate a linear system where the coefficient matrix is a series with matrix coefficients, and provide a characterization for when the matrix series is regular based on the algebraic variety of an augmented system. The structure of the linear system leads to a block triangular system. In the regular case, solving the linear system is equivalent to solving a Hermite interpolation problem. We show that this solution has cost cubic in the problem size. In general, at singular points, we rely on methods of tropical algebraic geometry to compute Puiseux series. With a few illustrative examples, we demonstrate the application to polynomial homotopy continuation.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/30/2023

GPU Accelerated Newton for Taylor Series Solutions of Polynomial Homotopies in Multiple Double Precision

A polynomial homotopy is a family of polynomial systems, typically in on...
05/15/2022

Locating the Closest Singularity in a Polynomial Homotopy

A polynomial homotopy is a family of polynomial systems, where the syste...
01/13/2022

The Padé matrix pencil method with spurious pole information assimilation

We present a novel method for calculating Padé approximants that is capa...
03/09/2021

Multiple zeros of nonlinear systems

As an attempt to bridge between numerical analysis and algebraic geometr...
04/13/2018

Runge-Kutta Theory and Constraint Programming

There exist many Runge-Kutta methods (explicit or implicit), more or les...