FAQ

Polynomial greatest common divisor

Known as: Greatest common divisor of two polynomials, Euclidean division of polynomials, Greatest common divisior of two polynomials 
In algebra, the greatest common divisor (frequently abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1966-2016
05101519662016

Related topics

Related topics

19 relations
Computer algebra systemEuclidean algorithmExtended Euclidean algorithmFactorization of polynomials
(More)

Related mentions per year

Related mentions per year

1937-2018
19401960198020002020
Polynomial greatest common divisor
Polynomial
Recursion
Resultant
Singular value decomposition
Symbolic computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Greatest common divisor
  • 2014
In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf… (More)
Is this relevant?
2011
2011
The Numerical Greatest Common Divisor of Univariate Polynomials
This paper presents a regularization theory for numerical computation of polynomial greatest common divisors and a convergence… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
2007
2007
Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
The comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is expressed in terms of a general… (More)
Is this relevant?
2004
2004
Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor J… (More)
  • table I
Is this relevant?
2003
2003
Approximate greatest common divisor of polynomials and the structured singular value
In this note the following problem is considered: Given two monic coprime polynomials a(s) and b(s) with real coefficients, find… (More)
Is this relevant?
2000
2000
QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
This paper presents a novel means of computing the greatest common divisor (GCD) of two polynomials with real-valued coefficients… (More)
  • figure 1
  • table I
  • table II
  • figure 2
  • table IV
Is this relevant?
1997
1997
A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials
This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials… (More)
  • figure 2
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Computing with Polynomials Given By Black Boxes for Their Evaluation: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators
Algorithms are developed that adopt a novel implicit representation for multivariate polynomials and rational functions with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1974
1974
Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms
Two Hensel-type univariate polynomial Greatest Common Divisor (GCD) algorithms are presented and compared. The regular linear… (More)
Is this relevant?
Highly Cited
1971
Highly Cited
1971
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
This paper examines the computation of polynomial greatest common divisors by various generalizations of Euclid's algorithm. The… (More)
Is this relevant?