Robust algorithms for generalized Pham systems

DOI10.1007/s00037-009-0268-2zbMath1213.14115OpenAlexW2060956339MaRDI QIDQ626616

Ezequiel Dratman, Ariel Waissbein, Guillermo Matera

Publication date: 18 February 2011

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-009-0268-2

zbMATH Keywords

complexityprobabilistic algorithmspolynomial system solvingstraight line programBezout numbergeneralized Pham system

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Computational aspects of algebraic curves (14Q05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Formal power series rings (13F25)

Related Items (2)

On the solution of the polynomial systems arising in the discretization of certain ODEs ⋮ Approximation of the solution of certain nonlinear ODEs with linear complexity

This page was built for publication: Robust algorithms for generalized Pham systems