Subresultants and Reduced Polynomial Remainder Sequences
From MaRDI portal
Publication:5532045
DOI10.1145/321371.321381zbMath0152.35403OpenAlexW2100279776WikidataQ127770731 ScholiaQ127770731MaRDI QIDQ5532045
Publication date: 1967
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321371.321381
Related Items (89)
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 ⋮ A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial ⋮ Specified precision polynomial root isolation is in NC ⋮ Computing sparse GCD of multivariate polynomials via polynomial interpolation ⋮ Solving systems of linear equations over polynomials ⋮ A cubic Kolmogorov system with six limit cycles ⋮ Parameterization of the discriminant set of a polynomial ⋮ Primitive polynomial remainder sequences in elimination theory ⋮ Automatic computation of the complete root classification for a parametric polynomial ⋮ Decomposition of algebraic sets and applications to weak centers of cubic systems ⋮ The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain ⋮ A study of approximate polynomials. I: Representation and arithmetic ⋮ Computer algebra: Past and future ⋮ A simple proof of the validity of the reduced prs algorithm ⋮ Bounds for resultants of univariate and bivariate polynomials ⋮ Multivariate subresultants in roots ⋮ Certified approximate univariate GCDs ⋮ Algebraic phase unwrapping along the real axis: extensions and stabilizations ⋮ A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES ⋮ Parallel computation of polynomial GCD and some related parallel computations over abstract fields ⋮ A new approach for constructing subresultants ⋮ Bernstein-Bézoutian matrices ⋮ Efficient absolute factorization of polynomials with parametric coefficients ⋮ GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation ⋮ Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation ⋮ On the complexity of computing the greatest common divisor of several univariate polynomials ⋮ A New Bound for the Waring Rank of Monomials ⋮ Double Sylvester sums for subresultants and multi-Schur functions. ⋮ Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity ⋮ A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs) ⋮ An elementary approach to subresultants theory. ⋮ Subresultants revisited. ⋮ Sylvester's double sums: an inductive proof of the general case ⋮ Fast norm computation in smooth-degree abelian number fields ⋮ Methodologies of Symbolic Computation ⋮ A fraction free matrix Berlekamp/Massey algorithm ⋮ Improved polynomial remainder sequences for Ore polynomials ⋮ Analysis of Euclidean algorithms for polynomials over finite fields ⋮ A fraction-free unit-circle zero location test for a polynomial with any singularity profile ⋮ Computing the polynomial remainder sequence via Bézout matrices ⋮ Subresultants and locally nilpotent derivations. ⋮ A subresultant-like theory for Buchberger's procedure ⋮ Circuits for computing the GCD of two polynomials over an algebraic number field ⋮ Subresultants, Sylvester sums and the rational interpolation problem ⋮ Birational properties of the gap subresultant varieties ⋮ An elementary proof of Sylvester's double sums for subresultants ⋮ Differential equations of order two with one singular point ⋮ A condition for multiplicity structure of univariate polynomials ⋮ A fast version of the Schur-Cohn algorithm. ⋮ 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 ⋮ Recursive polynomial remainder sequence and its subresultants ⋮ Three new algorithms for multivariate polynomial GCD ⋮ A fast parallel sparse polynomial GCD algorithm ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ A chain rule for subresultants ⋮ Sylvester-Habicht sequences and fast Cauchy index computation ⋮ Global minimization of rational functions and the nearest GCDs ⋮ Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin) ⋮ Computing high precision matrix Padé approximants ⋮ Various new expressions for subresultants and their applications ⋮ Solving a congruence on a graded algebra by a subresultant sequence and its application ⋮ An algorithm for the complete symmetry classification of differential equations based on Wu's method ⋮ D-resultant and subresultants ⋮ Multivariate subresultants using Jouanolou matrices ⋮ Computational aspects of deciding if all roots of a polynomial lie within the unit circle ⋮ Subresultants of two Hermite-Laurent series ⋮ Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation ⋮ Unnamed Item ⋮ Spécialisation de la suite de Sturm et sous-résultants (I) ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ An optimal fraction free Routh array† ⋮ An improved EZ-GCD algorithm for multivariate polynomials ⋮ Fraction-free computation of the unit-circle resultant with any singularity profile ⋮ On the location of the zeros of a generalized polynomial ⋮ Power series remainder sequences and Padé fractions over an integral domain ⋮ Simple algorithms for approximating all roots of a polynomial with real roots ⋮ Algebraic Numbers in Isabelle/HOL ⋮ A new method for computing polynomial greatest common divisors and polynomial remainder sequences ⋮ An efficient method for analyzing the topology of plane real algebraic curves. ⋮ New structure theorem for subresultants ⋮ Fp is locally like ℂ ⋮ Sir Thomas Muir, 1844--1934 ⋮ Fast computation of the Bézout and Dixon resultant matrices ⋮ Computation of the dual of a plane projective curve ⋮ Systems of rational polynomial equations have polynomial size approximate zeros on the average
This page was built for publication: Subresultants and Reduced Polynomial Remainder Sequences
