Fast algorithms for zero-dimensional polynomial systems using duality

DOI10.1007/s00200-003-0133-5zbMath1058.68122OpenAlexW1968561983MaRDI QIDQ1422204

Alin Bostan, Bruno Salvy, Éric Schost

Publication date: 5 February 2004

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-003-0133-5

zbMATH Keywords

symbolic computationdualitypolynomial systemgenerating seriesalgebraic computationlinear recurrence sequences

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (10)

Solving bivariate systems using rational univariate representations ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Separating linear forms and rational univariate representations of bivariate systems ⋮ Fast computation of special resultants ⋮ Multilinear polynomial systems: root isolation and bit complexity ⋮ Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin) ⋮ Block-Krylov techniques in the context of sparse-FGLM algorithms ⋮ Computing and using minimal polynomials ⋮ Accelerated tower arithmetic

Uses Software

• FGb
• Kronecker
• Magma
• ISOLATE

This page was built for publication: Fast algorithms for zero-dimensional polynomial systems using duality