A heuristic verification of the degree of the approximate GCD of two univariate polynomials |
| |
| Authors: | Zhe Li Qi Liu |
| |
| Affiliation: | 1. Department of Applied Mathematics, School of Science, Changchun University of Science and Technology, Changchun, 130022, China
2. Key Laboratory of Mathematics Mechanization AMSS, Beijing, 100190, China
|
| |
| Abstract: | We consider the problem of computing verified real interval perturbations of the coefficients of two univariate polynomials such that there exist corresponding perturbed polynomials which have an exact greatest common divisor (GCD) of a given degree k. Based on the certification of the rank deficiency of a submatrix of the Bezout matrix of two univariate polynomials, we propose an algorithm to compute verified real perturbations. Numerical experiments show the performance of our algorithm. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
