No label defined (Q3706437)
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 3934336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3934336 |
Statements
1985
0 references
numerical example
0 references
invariant imbedding
0 references
orthogonal transformation
0 references
Schur's transformation
0 references
Riccati transformation
0 references
0.8684807419776917
0 references
0.8590480089187622
0 references
0.8554810881614685
0 references
[For the entire collection see Zbl 0549.00025.] This paper concerns a boundary value problem (BVP) for a system of ordinary differential equations of the following form: (1) \(\dot x(\)t)\(=A(t)x(t)+f(t)\), (2) \(B^ 0x(0)+B^ 1x(1)=b\). The method of invariant imbedding is discussed. This method consists of transforming (1) by means of the t-depending matrix T(t) with \(x(t)=T(t)y(t)\) to the form \[ (3)\quad \dot y(t)=C(t)y(t)+g(t)\quad where\quad C=\left[ \begin{matrix} C_{11},\\ 0,\end{matrix} \begin{matrix} C_{12}\\ C_{22}\end{matrix} \right]. \] It is well known that the system (3) enables one to solve the given BVP by two passages \(0\to 1\) and \(1\to 0\) each engaging only a part of equations, naturally given by the decomposition of C. The author observes that such a procedure is well conditioned if \(\sigma (C_{11})\subset {\mathbb{C}}^+\) and \(\sigma (C_{22})\subset {\mathbb{C}}^-\) \(\forall t\in (0,1)\). Hence the transformation T is still not arbitrary (giving (3)), but if possible, it should insure the above conditions to be satisfied. Two possibilities are discussed: 1. An orthogonal transformation T (first introduced by Abramov), starting with Schur's transformation of A(0); 2. A Riccati transformation, which needs in general several intermediate restarts. Two examples are treated.
0 references