Generating approximate parametric roots of parametric polynomials

DOI10.1007/s10479-014-1534-5zbMath1368.12006OpenAlexW2061209995MaRDI QIDQ333108

B. Curtis Eaves, Uriel G. Rothblum

Publication date: 9 November 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1534-5

zbMATH Keywords

sensitivitycomplexityparametric polynomialsalgebraic plane curvesapproximate parametric rootsNewton polygon processPuiseux fields

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Real polynomials: location of zeros (26C10) Non-Archimedean valued fields (12J25) Numerical computation of roots of polynomial equations (65H04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On expansion of algebraic functions in power and Puiseux series. I
• Puiseux expansion for space curves
• The number of roots of a system of equations
• Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods
• Perron-Frobenius theory over real closed fields and fractional power series expansions
• Polynomial Equations and Convex Polytopes
• A Theory on Extending Algorithms for Parametric Problems
• The Asymptotic Theory of Stochastic Games
• All Algebraic Functions Can Be Computed Fast
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• A Polyhedral Method for Solving Sparse Polynomial Systems
• A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function
• Complexity of computation of embedded resolution of algebraic curves