On the greatest common divisor of two univariate polynomials, II
A. Schinzel (2001)
Acta Arithmetica
Similarity:
Displaying similar documents to “Approximate polynomial GCD”
On the greatest common divisor of two univariate polynomials, II
A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.
Alkiviadis G. Akritas (1987/88)
Numerische Mathematik
Similarity:
Polynomial operations: Numerical performance in matrix diophantine equation
Ferdinand Kraffer, Soňa Pejchová, Michael Šebek (1994)
Kybernetika
Similarity:
Conjugated and symmetric polynomial equations. I. Continuous-time systems
Jan Ježek (1983)
Kybernetika
Similarity:
2-D polynomial equations
Michael Šebek (1983)
Kybernetika
Similarity:
Approximate stable multidimensional polynomial factorization into linear -D polynomial factors
Nikos E. Mastorakis (1996)
Kybernetika
Similarity:
On the Remainders Obtained in Finding the Greatest Common Divisor of Two Polynomials
Akritas, Alkiviadis, Malaschonok, Gennadi, Vigklas, Panagiotis (2015)
Serdica Journal of Computing
Similarity:
In 1917 Pell (1) and Gordon used sylvester2, Sylvester’s little known and hardly ever used matrix of 1853, to compute(2) the coefficients of a Sturmian remainder — obtained in applying in Q[x], Sturm’s algorithm on two polynomials f, g ∈ Z[x] of degree n — in terms of the determinants (3) of the corresponding submatrices of sylvester2. Thus, they solved a problem that had eluded both J. J. Sylvester, in 1853, and E. B. Van Vleck, in 1900. (4) In this paper we extend the work by Pell...