GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials

Details GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials

2010-07-12

arxiv.org/abs/1007.1836v1

Mathematics

Commutative Algebra

12 pages. To appear Proc. CASC 2010 (Computer Algebra in Scientific Computing), Tsakhkadzor, Armenia, September 2010

Scientific paper

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials and a degree, our algorithm finds a pair of polynomials which has a GCD of the given degree and whose coefficients are perturbed from those in the original inputs, making the perturbations as small as possible, along with the GCD. In our GPGCD method, the problem of approximate GCD is transferred to a constrained minimization problem, then solved with the so-called modified Newton method, which is a generalization of the gradient-projection method, by searching the solution iteratively. In this paper, we extend our method to accept more than two polynomials with the real coefficients as an input.

Affiliated with

Also associated with

No associations

Rating

GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-695623