Partitioning of invariant imbedding systems (Q1073231)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3944310
Language Label Description Also known as
default for all languages
No label defined
    English
    Partitioning of invariant imbedding systems
    scientific article; zbMATH DE number 3944310

      Statements

      Partitioning of invariant imbedding systems (English)
      0 references
      0 references
      1984
      0 references
      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.
      0 references
      first order differential equation
      0 references
      invariant imbedding method of Scott
      0 references
      fundamental matrix
      0 references
      Kronecker delta initial conditions
      0 references

      Identifiers