Optimizations of the subresultant algorithm

DOI10.1016/S0022-4049(98)00081-4zbMath0941.65044OpenAlexW2070866504MaRDI QIDQ1963982

Lionel Ducos

Publication date: 7 August 2000

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-4049(98)00081-4

zbMATH Keywords

greatest common divisorpolynomialssubresultant algorithm

Mathematics Subject Classification ID

Related Items (23)

Towards faster real algebraic numbers ⋮ Computational schemes for subresultant chains ⋮ Algorithms for computing triangular decomposition of polynomial systems ⋮ An elementary approach to subresultants theory. ⋮ Subresultants revisited. ⋮ Levelwise construction of a single cylindrical algebraic cell ⋮ Birational properties of the gap subresultant varieties ⋮ Recursive polynomial remainder sequence and its subresultants ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} ⋮ Properties of regular systems and algorithmic improvements for regular decomposition ⋮ Basic Polynomial Algebra Subprograms ⋮ Thomas Decomposition of Algebraic and Differential Systems ⋮ D-resultant and subresultants ⋮ Topics in computational algebraic number theory ⋮ Subresultants of two Hermite-Laurent series ⋮ An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions ⋮ A verified implementation of algebraic numbers in Isabelle/HOL ⋮ New structure theorem for subresultants ⋮ Computing differential characteristic sets by change of ordering ⋮ Division-free computation of subresultants using Bezout matrices ⋮ Subresultant chains using Bézout matrices ⋮ Computation of the dual of a plane projective curve

This page was built for publication: Optimizations of the subresultant algorithm