Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems
Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems
About this item
Full title
Author / Creator
Publisher
New York: Springer-Verlag
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer-Verlag
Subjects
More information
Scope and Contents
Contents
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...
Alternative Titles
Full title
Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_831363973
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_831363973
Other Identifiers
ISSN
1615-3375
E-ISSN
1615-3383
DOI
10.1007/s10208-010-9078-9
