.png){kind=icon}
返回
Partial realization and the Euclidean algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/9.763219.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The authors show how the Euclidean algorithm fits into the behavioral framework of exact modeling and how it computes solutions of the scalar minimal partial realization problem. It turns out that the Euclidean algorithm can be considered as a special instance of Wolovich's procedure (1974) to achieve row reducedness for a given polynomial 2 x 2 matrix. The authors show in detail how this approach yields a parameterization of all minimal solutions in terms of polynomials that are sequentially produced by the Euclidean algorithm.
Keyword:
behavior
Euclidean algorithm
minimal partial realization
row reducedness
shortest linear recurrence relation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
Effect of a single dose of phentolamine and MJ 1999 on aspirin-induced gastric ulceration in rats
PREAI
分享收藏分享收藏
查看更多内容