New structure theorem for subresultants
From MaRDI portal
Publication:1569836
DOI10.1006/jsco.1999.0322zbMath0973.12007OpenAlexW2075687165MaRDI QIDQ1569836
Marie-Françoise Roy, Henri Lombardi, Mohab Safey El Din
Publication date: 12 September 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/89611cb64fb3804f89c66f05ef3ff3578208b35a
Related Items
Towards faster real algebraic numbers, Bezout matrices, subresultant polynomials and parameters, Automatic computation of the complete root classification for a parametric polynomial, A new approach for constructing subresultants, Double Sylvester sums for subresultants and multi-Schur functions., An elementary approach to subresultants theory., Subresultants revisited., Subresultants and locally nilpotent derivations., Birational properties of the gap subresultant varieties, An elementary proof of Sylvester's double sums for subresultants, Recursive polynomial remainder sequence and its subresultants, Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor, 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, Division-free computation of subresultants using Bezout matrices, Efficient topology determination of implicitly defined algebraic plane curves., Computation of the dual of a plane projective curve
Cites Work
- Unnamed Item
- Unnamed Item
- Cauchy index computation
- Optimizations of the subresultant algorithm
- Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
- Spécialisation de la suite de Sturm et sous-résultants (I)
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
