• Nie Znaleziono Wyników

(4) On the construction of fundamental matrices of systems of linear differential equations with constantcoefficients

N/A
N/A
Protected

Academic year: 2021

Share "(4) On the construction of fundamental matrices of systems of linear differential equations with constantcoefficients"

Copied!
3
0
0

Pełen tekst

(1)

ANNALES SOCIETAT1S MATHEMATICAE POLONAE Series 1: COMMENTATIONES MATHEMATICAE XXVI (1986) ROCZNIKI POLSKIEGO TOWARZYSTWA MATEMATYCZNEGO

Séria I: PRACE MATEMATYCZNE XXVI (1986)

St a n i s l a w Sz u f l a

(Poznan)

On the construction o f fundamental matrices

o f systems o f linear differential equations with constant coefficients

The purpose of this paper is to present a new simple method for calculating a fundamental matrix of the homogeneous linear differential equation

(1) x’ = Ax,

where A is a matrix of real numbers (a0) with n rows and n columns. In contrast to the known constructions of fundamental matrices (cf. [ 1 ] —[4]), we do not use the Jordan canonical form of A.

We introduce the following notations:

/ — the unit matrix;

wA(X) = det(/4 —//) — the characteristic polynomial of A;

A (A) = (A — Xl f — the matrix (</,,(/.))> where с1у(Х) is the algebraic complement of (/, i)Ah element of A —XI; it is well known that

First we shall prove the following

Le m m a.

Suppose that X0 is a characteristic root of a matrix A with multiplicity k. Then

( 2 ) A( X) ( A- XI ) = { A- XI ) A{ X) = wA(X)I.

Rank A{k ^(Ao) = k.

Proof. The proof proceeds by induction on k.

1° Let к = 1. We choose a nonsingular matrix P such that

(

3

) A — P 1 BP, where

Then

(4) A(X) = P - ' B ( X ) P

(2)

164 S. S z u fla

and (5) Since

(

6

)

B{A) = wc (A)

0 l^o — А) С (Я)

wA(À) = (A0 -A )w c (A), we have wc (A0) # 0. Thus, by (5) and (4), we get

Rank A(A0) = Rank B(A0) = !•

2° Assume now that the lemma is true for some k. Let A0 be a characteristic root of a matrix A with multiplicity k + 1. Choose a nonsingular matrix P in such a way that (3) holds. As

((A0 - A) C (A)f> = (A0 - A) C(k> (A) - /cC(k~ (A ), it follows from (5) that

(7) B{k) (A0) = wc ] (Ao)

0 -A.C‘-»U0)

On the other hand, in view of (6), A0 is a characteristic root of C with multiplicity k. Therefore, owing to our assumption,

Rank C(k~ п(Ао) = к.

Moreover, (A0) Ф 0. By (4) and (7), we conclude that Rank Л(к)(А0) = Rank B(k)(A0) = fc + 1.

This completes the proof.

Our fundamental result is given by the following

T

heorem

. Suppose that A0 is a characteristic root of A with multiplicity k.

Let aJl(A), ..., aj (A) be columns of A (A) such that the corresponding columns of /Tk-1)(A0) are linearly independent (the existence of these columns follows from the above lemma). Then the functions

(8) t - > x m( t ) = X ( k IW ( A 0)f* " i" 1<?v (m = 1, k) i = о V ' /

are linearly independent solutions of (1).

C

o r o l l a r y

. Let Al5 ..., As be the distinct roots of A, and suppose that A, has multiplicity k{ (i = 1, ..., s). Then, by applying the above theorem, for each A, we can calculate k( linearly independent solutions xn , xik. of (1).

Consequently, we obtain a fundamental matrix X of (1), namely

X

( X j i , . . . , -Хцс^ , . . . ,

xsl

, . . . ,

xs^).

(3)

C o n s t r u c t i o n o f f u n d a m e n t a l m a t r ic e s

165

Proof. It follows from (2) that

( A - U ) A ^ { X ) - i A (i- l ) (À) = wÿ(A)/.

As w^^o) = 0 for i = 0, 1, . . к— 1, this implies that

( A - A 01)A(10) = 0 and (A — A01) A(i) (A0) = L4(i-1)(A0) (i = 1, k - l ) .

Hence, putting Bt = Ç ^ ^ (A o ), we have

(.A - A 0I ) B0 = 0 and ( Л - А 0/)В, = ( k - i ) B i. l (i = 1, . . к - 1).

This shows that the function

t - >Z{ t ) = B o t ' - ' + Bt tk~2+ ...

is a solution of the matrix equation Z' — (A — A0 /) Z, so that the function f - Y(c) = Z (t)e i0' = V ("С“ 1')/4"'|(Я„)г‘ - ' - 1

.= (Л * /

satisfies the matrix equation Y' — AY. Consequently, the functions x 1, ..., xk, given by (8), are solutions of (1), because they are corresponding columns of Y. Suppose that these functions are not linearly independent. Then there exist constants ol 1, ..., otk not all zero such that

ai * i ( 0 + ••• + a kxk(t) = 0 for all f.

In particular, for t — 0, we obtain

ai flii_1)(^o)+ ••• +ocka%~1){A0) = 0.

This is impossible, since af~ ^(A q ), ..., af~ ^(A q ) are linearly independent.

References

[1 ] E. A. C o d d in g t o n , N . L e v in s o n , Theory o f ordinary differential equations, N ew Y o r k - T o r o n to -London 1955.

[2 ] N . C e t a je v , Ustoicivost dvizeniTa, M oscow 1965.

[3 ] P. H a r tm a n , Ordinary differential equations, N ew York-London -Sydney 1964.

[4 ] W . W . S t ie p a n o v , Differential equations (Polish), Warsaw 1964.

Cytaty

Powiązane dokumenty

In this paper the Drazin inverse of matrices will be applied to find the solutions of the state equations of descriptor fractional discrete-time linear systems with regular

In this work, the problem of determin- ing an upper bound for the cp-rank of completely posi- tive matrices is reduced to the problem of determining the maximal number of

If the line hits an interior point of a segment γ of Γ, then we continue along the segment γ until we reach the next node, where we follow the procedure described for the first

Math 3CI Even More about solving DiffyQ Symbolicallly Part IV In these problems you are pushed to develop some more symbolic tech- niques for solving ODE’s that extends the

Fundamental solutions to linear partial differential equations with constant coefficients are represented in the form of Laplace type

The study of divisor functions of matrices arose le- gitimately in the context of arithmetic of matrices, and the question of the number of (possibly weighted)

We characterize the linear operators that preserve the zero-term rank of the m × n integer matrices... Introduction

We prove a representation theorem for an arbitrary C 2,1 function, in terms of the fundamental solution of the equation Lu = 01. Such a theorem was proved in an earlier paper for