Subspace identification of multivariable linear parameter-varying systems (Q1614299): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Subspace identification of bilinear systems subject to white inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4SID: Subspace algorithms for the identification of combined deterministic-stochastic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of multivariable bilinear state space systems based on subspace techniques and separable least squares optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3830368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of the deterministic part of MIMO state space models given in innovations form from input-output data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying MIMO Hammerstein systems in the context of subspace model identification methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying MIMO Wiener systems using subspace model identification methods / rank
 
Normal rank

Revision as of 15:42, 4 June 2024

scientific article
Language Label Description Also known as
English
Subspace identification of multivariable linear parameter-varying systems
scientific article

    Statements

    Subspace identification of multivariable linear parameter-varying systems (English)
    0 references
    0 references
    0 references
    0 references
    5 September 2002
    0 references
    A subspace identification method is discussed. It deals with multivariable linear parameter-varying state-space systems with affine parameter dependence. To overcome the problem of exponential increase in the number of rows of the data matrices, a selection procedure for reducing their numbers is proposed. An efficient selection algorithm is discussed that does not require the formation of the complete data matrices, but processes them row-by-row. In this way, one avoids the need of constructing the entire data matrix.
    0 references
    system identification
    0 references
    linear parameter-varying systems
    0 references
    data matrix simplification
    0 references
    subspace identification
    0 references
    selection procedure
    0 references

    Identifiers