60 search results - page 1 / 12 » On the Computation of the GCD of 2-D Polynomials |
AMCS
2007
13 years 6 months ago
2007
ICIP
1997
IEEE
14 years 7 months ago
1997
IEEE
In this paper we examine the applicability of the previously proposed Greatest Common Divisor (GCD) method to blind image deconvolution. In this method, the desired image is appro...
ISSAC
2004
Springer
13 years 11 months ago
2004
Springer
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
CAGD
2008
13 years 6 months ago
2008
Three division algorithms are presented for univariate Bernstein polynomials: an algorithm for finding the quotient and remainder of two univariate polynomials, an algorithm for c...
CASC
2010
Springer
13 years 4 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...