An elementary approach to subresultants theory.

DOI10.1016/S0747-7171(02)00135-9zbMath1054.13014OpenAlexW2108371780MaRDI QIDQ1401153

M'hammed El Kahoui

Publication date: 17 August 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(02)00135-9

zbMATH Keywords

subresultant sequencepolynomial determinant

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Computational schemes for subresultant chains, Solving bivariate systems using rational univariate representations, A certified numerical algorithm for the topology of resultant and discriminant curves, Upper bounds on the heights of polynomials and rational fractions from their values, Parallelization of triangular decompositions: techniques and implementation, On k-folding map-germs and hidden symmetries of surfaces in the Euclidean 3-space, A fast randomized geometric algorithm for computing Riemann-Roch spaces, On the irreducibility of multivariate subresultants., Subresultants and locally nilpotent derivations., Separating linear forms and rational univariate representations of bivariate systems, Birational properties of the gap subresultant varieties, Bivariate triangular decompositions in the presence of asymptotes, On the complexity of the Lickteig-Roy subresultant algorithm, Various new expressions for subresultants and their applications, D-resultant and subresultants, Exact, efficient, and complete arrangement computation for cubic curves, Montgomery's method of polynomial selection for the number field sieve, Generic regular decompositions for generic zero-dimensional systems

Cites Work

• Cauchy index computation
• Some tapas of computer algebra
• Subresultants under composition
• New structure theorem for subresultants
• The Habicht approach to subresultants
• Optimizations of the subresultant algorithm
• Semi-algebraic complexity of quotients and sign determination of remainders
• Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
• Spécialisation de la suite de Sturm et sous-résultants (I)
• Spécialisation de la suite de Sturm
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Theory of Subresultants
• A chain rule for subresultants
• Sylvester-Habicht sequences and fast Cauchy index computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item