Balanced minimal realization via singular value decomposition of Sarason operator (Q1108979)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Balanced minimal realization via singular value decomposition of Sarason operator
scientific article

    Statements

    Balanced minimal realization via singular value decomposition of Sarason operator (English)
    0 references
    0 references
    1988
    0 references
    A method is proposed to obtain a balanced minimal realization of a stable rational transfer function matrix. The Allison-Young algorithm for the interpolation problems is directly extended to matrix value cases and is applied in the realization procedure. This method uses the finite matrix of a Sarason operator instead of the infinite block Hankel matrix and the coefficients of the transfer function matrix instead of any initial realization. The advantage of this approach in connection with the solution of \(L^{\infty}\)-optimization problems and the balanced realization is also discussed.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    balanced minimal realization
    0 references
    Allison-Young algorithm
    0 references
    Sarason operator
    0 references
    0 references
    0 references
    0 references