Approximation of almost solvable bilinear systems (Q1070980): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Global Representations of the Solutions of Linear Differential Equations as a Product of Exponentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost commuting matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5562645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant subspaces for certain commuting operators on Hilbert space / rank
 
Normal rank

Latest revision as of 10:47, 17 June 2024

scientific article
Language Label Description Also known as
English
Approximation of almost solvable bilinear systems
scientific article

    Statements

    Approximation of almost solvable bilinear systems (English)
    0 references
    0 references
    1985
    0 references
    The complexity of the Wei-Norman integration for a bilinear system can be reduced by approximating the associated Lie algebra by one of lower dimension. An algorithm is given for approximating a class of bilinear systems in this way in the case their Lie algebras are almost solvable.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    model reduction
    0 references
    Wei-Norman integration
    0 references
    bilinear system
    0 references
    algorithm
    0 references
    Lie algebras
    0 references
    0 references