A computational algorithm for the super-optimal solution of the model matching problem (Q1109729): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6911(88)90060-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985801207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748796 / 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
Property / cites work
 
Property / cites work: Singular value decomposition of an infinite block-hankel matrix and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust stabilization of linear multivariable systems: relations to approximation / 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: Fast projection methods for minimal design problems in linear system theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802944 / rank
 
Normal rank

Latest revision as of 18:14, 18 June 2024

scientific article
Language Label Description Also known as
English
A computational algorithm for the super-optimal solution of the model matching problem
scientific article

    Statements

    A computational algorithm for the super-optimal solution of the model matching problem (English)
    0 references
    0 references
    0 references
    1988
    0 references
    We develop a computational algorithm to implement the strengthened minimization technique in the model matching problem which arises in robust controller design and weighted sensitivity minimization. A general algorithm is proposed for constructing unitary matrices and the extremal functions for the \(H^{\infty}\)-optimization problem are diagonalized using the constructed unitary matrices. We impose stronger minimization conditions to force the solution of the optimization problem to be unique and explain their physical significance.
    0 references
    algorithm
    0 references
    model matching
    0 references
    robust controller design
    0 references
    weighted sensitivity minimization
    0 references
    \(H^{\infty }\)-optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references