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