Subresultants revisited.

DOI10.1016/S0304-3975(02)00639-4zbMath1045.68168OpenAlexW2911377851MaRDI QIDQ1401299

Thomas Lücking, Joachim von zur Gathen

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00639-4

zbMATH Keywords

polynomial computer algebrapolynomial remainder sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items

Subresultants in multiple roots: an extremal case, Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems, Bezout matrices, subresultant polynomials and parameters, Lifting and recombination techniques for absolute factorization, Parameterization of the discriminant set of a polynomial, Algorithms and programs for calculating the roots of polynomial of one or two variables, Subresultants and the Shape Lemma, Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity, High-order lifting for polynomial Sylvester matrices, Parameterization of a set determined by the generalized discriminant of a polynomial, Computation of the resonance set of a polynomial under constraints on its coefficients, A new method to compute the singularities of offsets to rational plane curves, Recursive polynomial remainder sequence and its subresultants, On the complexity of the Lickteig-Roy subresultant algorithm, Various new expressions for subresultants and their applications, Invariant coordinate subspaces of normal form of a system of ordinary differential equations, Exact, efficient, and complete arrangement computation for cubic curves, Scalar \(q\)-subresultants and Dickson matrices, On the asymptotic and practical complexity of solving bivariate systems over the reals, Computation of generalized discriminant of a real polynomial, Division-free computation of subresultants using Bezout matrices

Cites Work

• The search for the maximum of a polynomial
• Subresultants under composition
• A note on subresultants and the Lazard/Rioboo/Trager formula in rational function integration
• New structure theorem for subresultants
• Polynomial algorithms in computer algebra
• The Habicht approach to subresultants
• Optimizations of the subresultant algorithm
• Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
• Johann Faulhaber and Sums of Powers
• Parallel Algorithms for Algebraic Problems
• The Computational Complexity of Continued Fractions
• The Subresultant PRS Algorithm
• Computer Algebra of Polynomials and Rational Functions
• Polynomial Remainder Sequences and Determinants
• Subresultants and Reduced Polynomial Remainder Sequences
• Bigradients and the Problem of Routh and Hurwitz
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants
• The Calculation of Multivariate Polynomial Resultants
• Sylvester-Habicht sequences and fast Cauchy index computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item