.png){kind=icon}
.png){kind=icon}
Return
Partial realization and the Euclidean algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/9.763219.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
behavior
Euclidean algorithm
minimal partial realization
row reducedness
shortest linear recurrence relation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
No organization information available