Subresultants and Reduced Polynomial Remainder Sequences

Cited In (93)

Parallel computation of polynomial GCD and some related parallel computations over abstract fields
Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
Factorization of polynomials over a finite field and the solution of systems of algebraic equations
Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
A cubic Kolmogorov system with six limit cycles
A simple proof of the validity of the reduced prs algorithm
Approximate GCD and its application to ill-conditioned algebraic equations
An algorithm for the complete symmetry classification of differential equations based on Wu's method
Specified precision polynomial root isolation is in NC
Sylvester's double sums: an inductive proof of the general case
An efficient method for analyzing the topology of plane real algebraic curves.
Exact, efficient, and complete arrangement computation for cubic curves
New structure theorem for subresultants
Multivariate subresultants in roots
On the complexity of the Lickteig-Roy subresultant algorithm
Automatic computation of the complete root classification for a parametric polynomial
Computing high precision matrix Padé approximants
Power series remainder sequences and Padé fractions over an integral domain
Recursive polynomial remainder sequence and its subresultants
Sylvester-Habicht sequences and fast Cauchy index computation
A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial
Spécialisation de la suite de Sturm et sous-résultants (I)
Computing the polynomial remainder sequence via Bézout matrices
Double Sylvester sums for subresultants and multi-Schur functions.
A new method for computing polynomial greatest common divisors and polynomial remainder sequences
Subresultants of two Hermite-Laurent series
Certified approximate univariate GCDs
Bounds for resultants of univariate and bivariate polynomials
The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain
Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
Various new expressions for subresultants and their applications
On the location of the zeros of a generalized polynomial
Subresultants revisited.
Solving systems of linear equations over polynomials
Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
Multivariate subresultants using Jouanolou matrices
Analysis of Euclidean algorithms for polynomials over finite fields
Global minimization of rational functions and the nearest GCDs
Computational aspects of deciding if all roots of a polynomial lie within the unit circle
Algebraic phase unwrapping along the real axis: extensions and stabilizations
A chain rule for subresultants
Fast computation of the Bézout and Dixon resultant matrices
Methodologies of Symbolic Computation
Subresultants, Sylvester sums and the rational interpolation problem
A new approach for constructing subresultants
Computer algebra: Past and future
Circuits for computing the GCD of two polynomials over an algebraic number field
An elementary proof of Sylvester's double sums for subresultants
Primitive polynomial remainder sequences in elimination theory
An elementary approach to subresultants theory.
GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
An optimal fraction free Routh array†
Decomposition of algebraic sets and applications to weak centers of cubic systems
Bernstein-Bézoutian matrices
On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
Solving a congruence on a graded algebra by a subresultant sequence and its application
Three new algorithms for multivariate polynomial GCD
D-resultant and subresultants
Theory of multiple polynomial remainder sequence
Differential equations of order two with one singular point
Parameterization of the discriminant set of a polynomial
Computation of the dual of a plane projective curve
Simple algorithms for approximating all roots of a polynomial with real roots
Improved polynomial remainder sequences for Ore polynomials
A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES
Systems of rational polynomial equations have polynomial size approximate zeros on the average
Fraction-free computation of the unit-circle resultant with any singularity profile
Blind image deconvolution via Hankel based method for computing the GCD of polynomials
A condition for multiplicity structure of univariate polynomials
Computing sparse GCD of multivariate polynomials via polynomial interpolation
A subresultant-like theory for Buchberger's procedure
Birational properties of the gap subresultant varieties
An improved EZ-GCD algorithm for multivariate polynomials
Fast norm computation in smooth-degree abelian number fields
A fast parallel sparse polynomial GCD algorithm
A study of approximate polynomials. I: Representation and arithmetic
Parametric ``non-nested discriminants for multiplicities of univariate polynomials
Algebraic Numbers in Isabelle/HOL
Subresultants and locally nilpotent derivations.
Sir Thomas Muir, 1844--1934
Title not available (Why is that?)
A fast version of the Schur-Cohn algorithm.
A New Bound for the Waring Rank of Monomials
Subresultants of several univariate polynomials in Newton basis
Efficient absolute factorization of polynomials with parametric coefficients
Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
Two Variants of Bézout Subresultants for Several Univariate Polynomials
\(\mathbb F_p\) is locally like \(\mathbb C\)
A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)
Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity
A fraction free matrix Berlekamp/Massey algorithm
A fraction-free unit-circle zero location test for a polynomial with any singularity profile
On the complexity of computing the greatest common divisor of several univariate polynomials

This page was built for publication: Subresultants and Reduced Polynomial Remainder Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5532045)