Sciweavers

Share
MICS
2007

Structured Low Rank Approximation of a Bezout Matrix

8 years 11 months ago
Structured Low Rank Approximation of a Bezout Matrix
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.
Dongxia Sun, Lihong Zhi
Added 27 Dec 2010
Updated 27 Dec 2010
Type Journal
Year 2007
Where MICS
Authors Dongxia Sun, Lihong Zhi
Comments (0)
books