Rigid continuation paths II. structured polynomial systems

This work studies the average complexity of solving structured polynomial systems that are characterised by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that computes, with high probability, an approximate zero of a polynomi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Forum of Mathematics, Pi Ročník 11
Hlavní autori:	Bürgisser, Peter, Cucker, Felipe, Lairez, Pierre
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.01.2023 Cambridge Univ Press
Predmet:	65H10 65H20 65Y20 68Q25 Algebra Algebraic Geometry Algorithms Approximation Complexity Computational Mathematics Computer Science Mathematics Numerical Analysis Polynomials Symbolic Computation 68Q25 65H10 65Y20 65H20
ISSN:	2050-5086, 2050-5086
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!