.png){kind=icon}
.png){kind=icon}
Return
A fast algorithm for solving the Sylvester structured total least squares problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2007.03.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2007 Elsevier B. V. All rights reserved.
Keywords:
approximate greatest common divisor
Sylvester matrix
structured total least squares
displacement structure
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W
Organization
No organization information available