Greatest common divisor of two polynomials
From MaRDI portal
Publication:2537985
DOI10.1016/0024-3795(70)90023-6zbMath0191.32503OpenAlexW2044859896MaRDI QIDQ2537985
Publication date: 1970
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(70)90023-6
Related Items
A composite polynomial zerofinding matrix algorithm, Euclidean remainders for generalized polynomials, Polynomials with respect to a general basis. II: Applications, Comparison of algorithms for calculation of g.c.d. of polynomials, Dyadic feedback laws for linear multivariable systems, A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials, Congenial matrices, A heuristic verification of the degree of the approximate GCD of two univariate polynomials, Stability analysis of Beck's column over a fractional-order hereditary foundation, On the Relation Between Matrices and the Greatest Common Divisor of Polynomials, Norms in polynomial rings, A companion matrix analogue for orthogonal polynomials, Greatest common divisors from generalized sylvester resultant matrices, Greatest common divisor of generalized polynomials and polynomial matrices, On the Bézout construction of the resultant, Location of zeros of a complex polynomial, An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials, Division of generalized polynomials using the comrade matrix, Some topics in algebraic systems theory: a survey†
Cites Work
