Structured Low Rank Approximation of a Bezout Matrix |
| |
Authors: | Dongxia Sun Lihong Zhi |
| |
Affiliation: | (1) Key Lab of Mathematics Mechanization, AMSS, Beijing, 100080, China |
| |
Abstract: | The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given Bezout matrix a new Bezout matrix of lower rank whose entries are near the corresponding entries of that input matrix. We present an algorithm based on a version of structured nonlinear total least squares (SNTLS) method for computing approximate GCD and demonstrate the practical performance of our algorithm on a diverse set of univariate polynomials. The work is partially supported by a National Key Basic Research Project of China 2004CB318000 and Chinese National Science Foundation under Grant 10401035. |
| |
Keywords: | Primary 68W30 Secondary 65K10 |
本文献已被 SpringerLink 等数据库收录! |