Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

MICS
2007

favoriteEmaildiscussreport

128views more MICS 2007»

Structured Low Rank Approximation of a Bezout Matrix

13 years 10 months ago

Structured Low Rank Approximation of a Bezout Matrix

Download www.mmrc.iss.ac.cn

The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coeﬃcients 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

Real-time Traffic

Bezout Matrix | Greatest Common Divisor | MICS 2007 | Univariate Polynomials |

claim paper

Related Content

» Fast Algorithms for Bayesian Uncertainty Quantification in LargeScale Linear Inverse Probl...

» A Convex Approach to Low Rank Matrix Approximation with Missing Data

» Noisy matrix decomposition via convex relaxation Optimal rates in high dimensions

» Approximating the Covariance Matrix of GMMs with LowRank Perturbations

» Clustered low rank approximation of graphs in information science applications

» Optimal ColumnBased LowRank Matrix Reconstruction

» Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based...

» LowRank Kernel Matrix Factorization for LargeScale Evolutionary Clustering

» LargeScale Convex Minimization with a LowRank Constraint

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	MICS
Authors	Dongxia Sun, Lihong Zhi

Comments (0)