Pages that link to "Item:Q5532045"

The following pages link to Subresultants and Reduced Polynomial Remainder Sequences (Q5532045):

Displaying 40 items.

• A study of approximate polynomials. I: Representation and arithmetic (Q1895002) (← links)
• Differential equations of order two with one singular point (Q1974707) (← links)
• A fast version of the Schur-Cohn algorithm. (Q1977142) (← links)
• A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
• Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity (Q2188990) (← links)
• A condition for multiplicity structure of univariate polynomials (Q2229732) (← links)
• Multivariate subresultants using Jouanolou matrices (Q2268581) (← links)
• Subresultants of two Hermite-Laurent series (Q2269695) (← links)
• Efficient absolute factorization of polynomials with parametric coefficients (Q2406893) (← links)
• A fraction free matrix Berlekamp/Massey algorithm (Q2435413) (← links)
• Improved polynomial remainder sequences for Ore polynomials (Q2437284) (← links)
• Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
• A subresultant-like theory for Buchberger's procedure (Q2452291) (← links)
• Birational properties of the gap subresultant varieties (Q2456534) (← links)
• An elementary proof of Sylvester's double sums for subresultants (Q2457422) (← links)
• Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
• Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin) (Q2481474) (← links)
• Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
• An improved EZ-GCD algorithm for multivariate polynomials (Q2518611) (← links)
• Sir Thomas Muir, 1844--1934 (Q2575010) (← links)
• Parameterization of the discriminant set of a polynomial (Q2628787) (← links)
• Algebraic Numbers in Isabelle/HOL (Q2829274) (← links)
• Spécialisation de la suite de Sturm et sous-résultants (I) (Q3358238) (← links)
• Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation (Q3598002) (← links)
• An optimal fraction free Routh array† (Q3877516) (← links)
• D-resultant and subresultants (Q4671855) (← links)
• A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES (Q4818602) (← links)
• Fraction-free computation of the unit-circle resultant with any singularity profile (Q4965667) (← links)
• (Q5090939) (← links)
• On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342) (← links)
• A New Bound for the Waring Rank of Monomials (Q5097688) (← links)
• A fraction-free unit-circle zero location test for a polynomial with any singularity profile (Q5378513) (← links)
• Fp is locally like ℂ (Q5494400) (← links)
• A chain rule for subresultants (Q5928472) (← links)
• Sylvester-Habicht sequences and fast Cauchy index computation (Q5929709) (← links)
• Fast norm computation in smooth-degree abelian number fields (Q6142769) (← links)
• Methodologies of Symbolic Computation (Q6163846) (← links)
• Parametric ``non-nested'' discriminants for multiplicities of univariate polynomials (Q6595572) (← links)
• Subresultants of several univariate polynomials in Newton basis (Q6650567) (← links)