Subresultants and Reduced Polynomial Remainder Sequences

Cited in

(93)

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