A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time

We describe a deterministic algorithm that computes an approximate root of n complex polynomial equations in n unknowns in average polynomial time with respect to the size of the input, in the Blum–Shub–Smale model with square root. It rests upon a derandomization of an algorithm of Beltrán and Pa...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Foundations of computational mathematics Jg. 17; H. 5; S. 1265 - 1292
1. Verfasser:	Lairez, Pierre
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.10.2017 Springer Nature B.V Springer Verlag
Schlagworte:	Algorithms Applications of Mathematics Computational Complexity Computer Science Economics Linear and Multilinear Algebras Math Applications in Computer Science Mathematics Mathematics and Statistics Matrix Theory Numerical Analysis Polynomials Primary 68Q25 Secondary 65H10 65H20 Polynomial system Homotopy continuation 65Y20 Smale’s 17th problem Derandomization Complexity homotopy continuation complexity derandomization Smale's 17th problem
ISSN:	1615-3375, 1615-3383
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!