Greatest common divisor of two polynomials

DOI10.1016/0024-3795(70)90023-6zbMATH Open0191.32503OpenAlexW2044859896MaRDI QIDQ2537985FDOQ2537985

Authors: Yanyan Li 

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

zbMATH Keywords

commutative algebra

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (20)

• Comparison of algorithms for calculation of g.c.d. of polynomials
• Norms in polynomial rings
• An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
• Stability analysis of Beck's column over a fractional-order hereditary foundation
• Division of generalized polynomials using the comrade matrix
• Location of zeros of a complex polynomial
• Greatest common divisor of generalized polynomials and polynomial matrices
• A composite polynomial zerofinding matrix algorithm
• Euclidean remainders for generalized polynomials
• Polynomials with respect to a general basis. II: Applications
• A heuristic verification of the degree of the approximate GCD of two univariate polynomials
• Greatest common divisors from generalized sylvester resultant matrices
• Congenial matrices
• Subresultants of several univariate polynomials in Newton basis
• On the Relation Between Matrices and the Greatest Common Divisor of Polynomials
• On the Bézout construction of the resultant
• A companion matrix analogue for orthogonal polynomials
• Some topics in algebraic systems theory: a survey†
• Dyadic feedback laws for linear multivariable systems
• A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials

This page was built for publication: Greatest common divisor of two polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2537985)