Searching. Please wait…
1582
37
171
29406
4423
2606
347
392
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.
Authorship: Beltrán C., Pardo L.M.,
Fuente: Foundations of Computational Mathematics
Publisher: Springer New York LLC
Year of publication: 2011
No. of pages: 35
Publication type: Article
DOI: 10.1007/s10208-010-9078-9
ISSN: 1615-3375,1615-3383
Publication Url: https://doi.org/10.1007/s10208-010-9078-9
SCOPUS
Citations
Google Scholar
Metrics
Read publication
CARLOS BELTRAN ALVAREZ
LUIS MIGUEL PARDO VASALLO
Back