.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
approximate greatest common divisor
Sylvester matrix
structured total least squares
displacement structure
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
暂无机构信息
引用论文
Acute Decreases in Sleep Duration Predict In-Season Injuries in Female Youth Soccer Players: A 2-Year Prospective Study.png)
Pediatrics
PediatricsIF0
PREAI
分享收藏
Purification of Human Erythrocyte Transglutaminase by Immunoaffinity Chromatography人红细胞转谷氨酰胺酶的免疫亲和层析纯化
PREAI
分享收藏Competency of Manduca sexta prothoracic glands to synthesize ecdysone during development家蚕蛾(Manduca sexta)前胸腺在发育期间合成蜕皮激素(ecdysone)的能力
PREAI
分享收藏
查看更多内容