A new algorithm for the minimal balanced realization of a transfer function matrix (Q1088954): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:03, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for the minimal balanced realization of a transfer function matrix |
scientific article |
Statements
A new algorithm for the minimal balanced realization of a transfer function matrix (English)
0 references
1987
0 references
A new algorithm is proposed here to obtain a minimal balanced realization directly from the transfer function matrix (TFM). This method which employs the singular-value decomposition (SVD) of an infinite block- Hankel matrix requires neither an initial minimal realization nor the solution of a Lyapunov matrix equation. The formulation is solely in terms of the coefficients of the transfer function matrix.
0 references
algorithm
0 references
minimal balanced realization
0 references
singular-value decomposition
0 references
infinite block-Hankel matrix
0 references
