Authors
Paulina Chin, Robert M Corless, George F Corliss
Publication date
1998/8/1
Book
Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Pages
228-235
Description
We describe algorithms for computing the greatest common divisor (GCD) of two univariate polynomials with inexactlyknown coefficients. Assuming that an estimate for the GCD degree is available (eg, using an SVD-based algorithm), we formulate and solve a nonlinear optimization problem in order to determine the coefficients of the\best" GCD. We discuss various issues related to the implementation of the algorithms and present some preliminary test results.
Total citations
Scholar articles
P Chin, RM Corless, GF Corliss - Proceedings of the 1998 international symposium on …, 1998