A new algorithm for the minimal balanced realization of a transfer function matrix (Q1088954)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new algorithm for the minimal balanced realization of a transfer function matrix |
scientific article; zbMATH DE number 4001947
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for the minimal balanced realization of a transfer function matrix |
scientific article; zbMATH DE number 4001947 |
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
0 references
0 references
0.9885981
0 references
0.97779834
0 references
0.91013527
0 references
0.8985734
0 references
0.88111603
0 references
0.88053274
0 references
0.86930144
0 references
0.8651332
0 references
