A new algorithm for the minimal balanced realization of a transfer function matrix (Q1088954): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6911(87)90005-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011126559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal component analysis in linear systems: Controllability, observability, and model reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal balanced realization of transfer function matrices using Markov parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced realization algorithm for scalar continuous-time systems having simple poles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The singular-value decomposition of an infinite Hankel matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Interpolation in H ∞ / rank
 
Normal rank
Property / cites work
 
Property / cites work: H<sup>∞</sup>-optimal feedback controllers for linear multivariable systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal disturbance reduction in linear multivariable systems / rank
 
Normal rank

Latest revision as of 19:43, 17 June 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
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    minimal balanced realization
    0 references
    singular-value decomposition
    0 references
    infinite block-Hankel matrix
    0 references
    0 references