Approximation of almost solvable bilinear systems
From MaRDI portal
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.
Recommendations
Cites work
- Almost commuting matrices
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 3278338 (Why is no real title available?)
- Invariant subspaces for certain commuting operators on Hilbert space
- On Global Representations of the Solutions of Linear Differential Equations as a Product of Exponentials
Cited in
(6)- scientific article; zbMATH DE number 5628642 (Why is no real title available?)
- scientific article; zbMATH DE number 4020347 (Why is no real title available?)
- scientific article; zbMATH DE number 4108576 (Why is no real title available?)
- Approximation of discrete linear systems based on a dual criterion
- On the complexity of solving generic overdetermined bilinear systems
- Bilinear approximation and applications
This page was built for publication: Approximation of almost solvable bilinear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1070980)