Fast Low Rank Approximation of a Sylvester Matrix by Structured Total Least Norm


The problem of approximating the greatest common divisor(GCD) for polynomials with inexact coefficients can be formulated as a low rank approximation problem with a Sylvester matrix. In this paper, we present an algorithm based on fast Structured Total Least Norm(STLN) for constructing a Sylvester matrix of given lower rank and obtaining the nearest… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics