Loading...
Please wait, while we are loading the content...
Similar Documents
A fast algorithm for solving the Sylvester structured total least squares problem (2007)
| Content Provider | CiteSeerX |
|---|---|
| Author | Li, Bingyu Liu, Zhuojun Zhi, Lihong |
| Abstract | In this paper, we develop a fast structured total least squares (STLS) algorithm for computing an approximate greatest common divisor (GCD) of two univariate polynomials. By exploiting the displacement structure of the Sylvester matrix and applying the generalized Schur algorithm, each single iteration of the proposed algorithm has quadratic computational complexity in the degrees of the given polynomials. |
| File Format | |
| Publisher Date | 2007-01-01 |
| Access Restriction | Open |
| Subject Keyword | Square Problem Single Iteration Univariate Polynomial Displacement Structure Approximate Greatest Common Divisor Quadratic Computational Complexity Structured Total Sylvester Matrix Schur Algorithm |
| Content Type | Text |