An elementary approach to subresultants theory.

DOI10.1016/S0747-7171(02)00135-9zbMath1054.13014MaRDI 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 sequence; polynomial determinant

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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