First order difference system- existence and uniqueness (Q4372406)
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 1096493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | First order difference system- existence and uniqueness |
scientific article; zbMATH DE number 1096493 |
Statements
First order difference system- existence and uniqueness (English)
0 references
11 December 1997
0 references
matrix difference system
0 references
two-point boundary value problem
0 references
QR-algorithm
0 references
Bartels-Stewart algorithm
0 references
0 references
0.9108770489692688
0 references
Let us consider the matrix difference system \[ T(n+1)=A(n)T(n)B(n)+F(n), \tag{1} \] where \(A(n)\), \(B(n)\) and \(F(n)\) are square matrices whose elements are real or complex functions of integer arguments. In the first part of the paper the general solution of (1) in terms of two fundamental matrix solutions of the systems \(T(n+1)=A(n)T(n)\) and \(T(n+1)=B^*(n)T(n)\) is given. The second part presents criteria for the existence and uniqueness of solutions of two-point boundary value problems associated with (1), satisfying the boundary conditions \[ L_0T(n_0)+L_1T(n_1)=W, \] where \(L_0\) and \(L_1\) are given constant square matrices, and \(n_0<n_1\). The Bartels-Stewart algorithm and the QR-algorithm are used as tools to evaluate the constant matrix embedded between the two known matrices.
0 references