Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems

Authors:
Carlos Beltrán;Luis Miguel Pardo
Affiliations:
Depto. de Matemáticas, Estadística y Computación, Fac. de Ciencias, Avda. Los Castros s/n, 39005, Santander, Spain;Depto. de Matemáticas, Estadística y Computación, Fac. de Ciencias, Avda. Los Castros s/n, 39005, Santander, Spain
Venue:
Foundations of Computational Mathematics
Year:
2011

Citing 0
Cited 3

The legacy of turing in numerical analysis

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian

Journal of Complexity
An Arithmetic Poisson Formula for the multi-variate resultant

Journal of Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove a new complexity bound, polynomial on the average, for the problem of finding an approximate zero of systems of polynomial equations. The average number of Newton steps required by this method is almost linear in the size of the input (dense encoding). We show that the method can also be used to approximate several or all the solutions of non-degenerate systems, and prove that this last task can be done in running time which is linear in the Bézout number of the system and polynomial in the size of the input, on the average.