Partitioning of invariant imbedding systems
The choice of partitioning the system matrix for a system of N linear ordinary differential equations may determine the ease or difficulty of obtaining a solution by the invariant imbedding method of Scott. This paper shows how the configuration and partitioning of the system matrix is reflected in the fundamental matrix. The partitioning of the fundamental matrix is the key to the ease or difficulty of obtaining a solution. If the fundamental matrix is known for a given system matrix configuration and partitioning, then the fundamental matrix associated with a new system matrix configuration may be derived by the same row and column interchanges that transformed the old system matrix into the new system matrix. The fundamental matrix for the new system matrix does not have to be recalculated anew from the Kronecker delta initial conditions.
- A new derivation of the Scott formulation of invariant imbedding
- A theoretical result on the effectiveness of the addition formulae for two-point boundary systems
- scientific article; zbMATH DE number 3425974 (Why is no real title available?)
- On the effectiveness of the inverse Riccati transformation in the matrix case
- On the formulation of invariant imbedding problems
- On the Matrix Riccati Equation
This page was built for publication: Partitioning of invariant imbedding systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073231)
