On Correctness of Cauchy problem for a Polynomial Difference Operator with Constant Coefficients Текст научной статьи по специальности «Математика»

Серия «Математика» 2018. Т. 26. С. 3-15

Онлайн-доступ к журналу: http: / / mathizv.isu.ru

ИЗВЕСТИЯ

Иркутского государственного ■университета

УДК 517.55 MSG 30G25

DOI https://doi.Org/10.26516/1997-7670.2018.26.3

On Correctness of Cauchy problem for a Polynomial Difference Operator with Constant Coefficients *

M. S. Apanovich

Krasnoyarsk State Medical University named after Prof. V. F. Voino-Yasenetsky, Krasnoyarsk, Russian Federation

E. K. Leinartas

Institute of Mathematics and Computer Science Siberian Federal University, Krasnoyarsk, Russian Federation

Abstract. The theory of linear difference equations is applied in various areas of mathematics and in the one-dimensional case is quite established. For n > 1, the situation is much more difficult and even for the constant coefficients a general description of the space of solutions of a difference equation is not available.

In the combinatorial analysis, difference equations combined with the method of generating functions produce a powerful tool for investigation of enumeration problems. Another instance when difference equations appear is the discretization of differential equations. In particular, the discretization of the Cauchy-Riemaim equation led to the creation of the theory of discrete analytic functions which found applications in the theory of Riemann surfaces and the combinatorial analysis. The methods of discretization of a differential problem are an important part of the theory of difference schemes and also lead to difference equations. The existence and uniqueness of a solution is one of the main questions in the theory of difference schemes.

Another important question is the stability of a difference equation. For n = 1 and constant coefficients the stability is investigated in the framework of the theory of discrete dynamical systems and is completely defined by the roots of the characteristic polynomial, namely: they all lie in the unit disk.

In the present work, we give two easily verified sufficient conditions on the coefficients of a difference operator which guarantee the correctness of a Cauchy problem.

Keywords: polynomial difference operator, Cauchy problem, correctness.

* The research of the first author was supported by RFBR grant no. 18-31-00232. The research of the second author was supported by RFBR grant no. 18-51-41011 Uzb_t.

M. S. APANOVICH, E. К. LEINARTAS 1. Introduction

The asymptotic behavior of solutions of a difference equation is studied in the framework of the theory of discrete dynamical systems and one of the important notions then is the stability of the system. There are several definitions of stability, but in the case of constant coefficients everything bowls down to the question if the zeros of the characteristic polynomial belong to the unit disk of the complex plane. When it comes to the multi-dimensional case, already the question on the form of additional (¡¡boundary^^, ¡¡initial) conditions for a solution of a difference equation which guarantee its existence and uniqueness is not trivial (cf., e.g., [2;3;5-7; 18]). The difficulties of the formulation of the multi-dimensional version of the condition on the set of zeros of the characteristic polynomial guaranteeing the stability are explained, first of all, by the fact that this set is not discrete. It is an algebraic hyper-surface in the n—dimensional complex space.

A way to overcome these difficulties in the works [4; 10; 13] is based on the observation that the discrete Fourier transforms of some special solutions of a difference equation are rational functions with poles laying in the characteristic set of the difference equation. Some particular instances of such special solutions are: impulsive response in the theory of digital recursive filters (see., [1]), difference Green function of two-layered difference scheme with constant coefficients (see [10]), fundamental solution of a Cauchy problem for a polynomial difference operator [4]. In the present work, we consider the situation when the discrete Fourier transform of the fundamental solution of a difference equation is not a rational function. Such kind of problems arise, for example, in the theory of difference schemes in the case of implicit schemes. We investigate in this situation conditions of correctness for a Cauchy problem using the method of estimation of the norm of the inverse matrix [16; 19].

2. Statement of the problem

For a complex-valued function j(x) of integer variables x = (xi,...,xn) define the shift operators 6j in the variables Xji

fiX) = f{Xh •••) Xj— 1) •••) Xj 1) Xj+li •••) Xn)

and consider the polynomial difference operator of the order m

P(5)= Y, CaS",

where a = (ai,...,an) is a multi-index, |ск| = a\ + ... + ara, 6a = б"1..^^", ca are the constant coefficients of the difference operator. The relation of

the form

P(5)f(x)=g(x), xeZl, (2.1)

is called a difference equation, where f(x) is the unknown function, and g(x) is a function defined on Z™ = Z+ x ... x Z+ and Z+ is the set of non-negative integers.

Conditions guaranteeing the existence and uniqueness of a solution can be stated in various ways (cf., e.g., [2; 18]). In the present work, we define them as follows [5; 7].

For two points x, y of the integer lattice Zn the inequality x ^ y means that Xi ^ yi for i = 1,..., n, and the notation x ^ y means that there exists ¿o € {1, ...,n} such that Xi0 < yi0. Fix a multi-index (3 such that

\f3\ = m and cp / 0, (*)

denote X0)jg = {x € Z™ : x ^ (3} and state the problem:

find a solution f{x) of Eq. (2.1) which for x € X0)jg coincides with a given function <p(x), i.e. satisfies the condition

f(x)=<p(x),x£X0>/3. (2.2)

If (3 = (m, 0,..., 0) or (3 = (0, ..., 0, m), then, from the point of view of the theory of difference schemes, we have an explisit difference scheme (cf., e.g., [9]). In this case, the solvability and uniqueness of Problem (2.1)-(2.2) are evident.

For other /3 such that \(3\ = m it may happen that the solution is not unique or the problem does not have solutions. Consider, for example, Problem (2.1)-(2.2) for the difference equation (¿f —¿1^2 + ¿2) f{xiV) = g(x,y). As (3 we choose (3 = (1,1), take g(x,y) = 0 and "initial" data /(0, k) = f(k, 0) = 0, k = 0,1,..., then for any constant T the function

T, if (x, y) = (6k -5,3p- 1) or (x, y) = (6k - 4,3p - 2), for k,p = 1,2,...,

f(x, y) = -T, if (x, y) = (6k - 2,3p- 1) or (x, y) = (6k -1,3p- 2), for k,p = 1,2,..., 0, for other points (x, y)

is a solution of Problem (2.1)-(2.2). Since T can be arbitrary, this means that the solution is not unique.

If we take g(x, y) = 1 with the same initial data, then substituting the values (x,y) equal (1,0) and (0,1) to the equation we obtain contradictory equalities /(2,1) - /(1,2) = 1 and /(2,1) - /(1,2) = -1, i.e. Problem (2.1)-(2.2) does not have solutions.

Therefore, the question on conditions for the coefficients ca of the difference operator P(ô) which guarantee the existence and uniqueness of a solution to Problem (2.1)-(2.2) arises.

We call Problem (2.1)-(2.2) the Cauchy problem for the polynomial difference operator P{8), and the function <p{x) the initial data for this problem.

For a function / : Z™ —> C denote WfW^ = sup\f (a;)|.

r7 n

z +

We say (cf., e.g., [8], [10]) that a problem of the form (2.1)-(2.2) for the polynomial difference operator P{8) is correctly stated, if the following conditions hold:

a) the problem is uniquely solvable, i.e. for any initial data <p{x) and right-hand sides g{x) there exists a unique solution;

b) there exists a constant M > 0 such that for any <p{x) and g{x) the following estimate is valid for the norm of the corresponding solution

ll/Wlloo^M(ll^)lloo + ll^)lloo)- (2-3)

Note that when the condition (2.3) is satisfied the difference operator P{8) is called stable.

Thus, the difference problem (2.1)-(2.2) is correctly stated, if it is solvable and stable for any initial data <p{x) and right-hand sides g{x). Note that the condition

M > ic«i (2-4)

is sufficient (see [5], [7]) for the solvability of Problem (2.1)-(2.2). Its form is suggested by the work [11], where it was used to prove the solvability of a version of generalized Cauchy problem for a polynomial difference operator P{D) with initial-boundary conditions of the Riquier type in the class of analytic functions. The coefficients of the power series expansion of the analytic solutions of this problem satisfy relations of the form (2.1)-(2.2).

For the polynomial difference operator P{81,82) = —8\ + ?>8\82 — 8\ — 1, the initial data (p{0, X2) = 1 and <p{x 1, 0) = 1, the right-hand side

io, xi + x2 = 2k + 1, g{x 1,^2) = \ 3, x\ = X2, a solution of Problem (2.1)-(2.2)

[l, X\ + x2 = 2k, X\ / X2,

is the function f{x 1,^2) = S ' Xl ^X2 2A; + 1, Thus, for

I min{x\,X2) + 1, x\ + X2 = 2k.

bounded initial data and right-hand side we obtain an unbounded solution,

i.e. the condition (2.4) ensures the solvability of Problem, (2.1)-(2.2), but

the stability is absent in this case.

For n = 1 the polynomial difference operator has the form P {8) =

Cp8@ + cg_+ ... + Co and the solvability condition (2.4) means that

/3-1

cp / 0. Note that the condition |cg| > ^ |ca| is sufficient for the stability,

a=0

as from this inequality it follows, in view of Rouche's theorem (see [14]), that all the roots of the characteristic polynomial P(z) are located inside the unit disk. We give an analogue of this condition for n > 1.

Theorem 1. Let the coefficients of the polynomial difference operator = ca5a satisfy the condition (*) and the inequality

||a|| i^rri

M > E u, (2.5)

then Problem (2.1)-(2.2) is correct.

Remark 1. Note that in the work [17] the statement of Theorem 1 is proved in the two-dimensional case, and the difference operator, in contrast

m k .

with the present work, has the form P^i,^) = Y 1^2- In addition,

j=0i=0

the initial conditions for it are different from the conditions (2.2).

The geometric interpretation of the condition (2.5) in the theorem is as follows: the points of intersection of the characteristic set

V = {zG Cn : P{z) = 0}

of the difference equation (2.1) with the complex line Zj = t, j = 1, ..., n lie in the unit semi-disk U = {x € Cra : \zj\ < 1, j = 1, ..., n}.

In fact, consider the restriction of the characteristic polynomial P{z) = Y caza to the complex line Zj = t, j = 1, ..., n, t € C: M<l/8|

p(t) = p(t,..., t) = c*tH = E (Ec«)fk-

N<|/8| k=0 \|a|=fc J

From the condition (2.5) it follows, first, that the coefficient ^ ca

|«| = |/3|

under the highest degree [/?[ of the polynomial P(t) is not equal to zero, as otherwise we would have the inequality |cg| ^ S|a|=|/3| a^f5 lc«l- Second, the following inequalities are true

| E c« ^ M ~ E ic«i ^ E E ic«i'

\a\ = \f5\ \a\ = \p\,a^p k=0 \a\=k

from which, in view of Rouche's theorem, we infer that all the roots of the polynomial P{t) lie inside the unit disk.

In the case of real coefficients of the difference operator P(5), a sufficient condition for stability is also provided by the following theorem.

Theorem 2. Let the coefficients ca of the polynomial difference operator P(S) be real and satisfy the conditions:

1) cp > 0 and c„ ^ 0 for all a / /3,

2) for some point A = (Ai, ..., Ara) such that 0 < Aj < 1, j = 1, ..., n the inequality P(A) > 0 is valid,

then Problem (2.1)-(2.2) is correct.

Note that for the difference operator

P(S1}S2) = -25j + 46^2 -261-1

the condition (2.5) is not satisfied, but the conditions of Theorem 2 are valid, and Problem (2.1)-(2.2) is correct.

3. Proofs of Theorems 1 and 2

The proof of solvability for Problem (2.1)-(2.2) in Theorems 1 and 2 is based on the fact (see [5], [7]) that we consider Eqs. (2.1)-(2.2) as an infinite system of linear equations with an infinite number of unknowns /(y)> V £ Z™. After the ordering, it will assume a specific form, namely: each equation of the system will have only a finite number of unknowns. Such a system is consistent if any finite number of equations from this system is consistent (see [12], Lemma 6.3.7). We construct the sequence of sub-systems of the system (2.1)-(2.2) which consist of a finite number of equations and each sub-system contains all the equations of the antecedent sub-system. The consistency of each sub-system from this sequence implies that any finite number of equations from (2.1)-(2.2) is consistent as well.

We order the set Z™ in the uniformly lexicographical way. Take an arbitrary Z+ and construct a sub-system of the system (2.1)-(2.2) of the dimension Np x Np, where Np = is the number of elements of

the set Jp = {y G Z™ : \y\ ^ p}. We will "number" the unknowns f(y) by elements of the set Jp. We "number" the equations by elements of two sets Ip = {x € Z™ : |a;| ^ p — m} and IptP = {¡jl € X0)jg : |/x| ^ p}. If we denote by the number of elements of a finite set M, then it is not difficult to see that + #Ip,p = # JP, in addition we have Ip U IptP = Jp. Since IptP U {/? + Ip} = Jp, we assign to elements of the set IptP the same "numbers" with which they belong to the set Jp, and to elements x of the set Ip the "numbers" with which /3 + x belong to Jp.

Consider a system of equations with a finite number of ordered unknowns /(y)> y € JP of the form

^ caf(x + a) = g{x), x € Ip, (3.1)

fip) = € Ip,p- (3-2)

Denote by Ap the matrices of the system of equations (3.1)-(3.2) and by detAp their determinants.

Example 1. For n = 2, consider the difference operator

P(S 1,62) = C2,oSj + + Co,2^2 + cl,0^1 + Co,1^2 + C0)0,

where m = 2, /3 = (1,1). For p = 2 the system of equations (3.1)-(3.2) will have the form

C2,o f(x + 2, y) + citif(x + l,y + l) + confix, y + 2) + +ci,of(x + 1,2/)+ co,if(x, y + 1) + co,of(x, y) = g(x, y), (3.3)

(x,y) e l2,

f{x,y) = <p(x,y), (x,y) € /(1,1),2- (3.4)

It has six unknowns /(yx, y2), (yi, y2) € J2 = {(0, 0), (1, 0), (0, 1),

(2.0), (1,1), (0,2)}. Eqs. (3.3) are numbered by elements of the set I2 = {(0,0), (1,0) (0,1)} and Eqs. (3.4) by elements of the set

= {(0,0), (1,0), (0,1)}.

Since the union is disjoint, the points with the coordinates (x, y)

and (x, y) are considered to be different.

The determinant of the system of equations (3.3)-(3.4) has the form

0 0 0 0 0 1 0 0 0 0

0 1 0 0 0 00 100'

Cl,0 Co,l C2,0 Ci;i Co,2 0 0 0 0 1

Let 11-A|loo = maxJ2 \aij\ be the maximum-norm of a matrix A and dei j=1

note (see [16], [19]) by Ri(A) = \au\ — Y \aij\> i = 1, 2, ...n, the magnitude

i+i

of diagonal dominance in each row, also we set R*(A) = min RAA). If

lsiisira

R*{A) ^ 0, then A is a diagonally dominant matrix.

Proof of Theorem 1. Under assumptions of Theorem 1, the main diagonal of the determinants detAp of the matrices Ap of the system of equations

(3.1)-(3.2) contains units and an allocated coefficient eg. If the condition (2.5) is fulfilled, for any pe Z+ the magnitudes of diagonal dominance in the rows with "numbers" p € IptP are equal to R^(AP) = 1 and in the

detA2 =

1

0 0 0

C0,0 0

rows with "numbers" x € Ip are equal to Rx (Ap) = [eg| — ^ lc«l- These

a^fi

magnitudes do not depend on p. Therefore,

R* (Ap) = min ^ 1, \cfi\ - Y \ca\ } ф 0 = E*,

where E* does not depend on p. Since Ap are diagonally dominant matrices, we see that detAp ф 0 for any p and Problem (2.1)-(2.2) has a unique solution.

To prove the stability, we need an estimate for the norm of the matrices A'1 which are inverses for the matrices Ap of the sub-systems (3.1)-(3.2). For the diagonally dominant matrices Ap the following estimate is valid (see [16], [19])

И V II oo ^ v >

Consider the vector fp with the coordinates f(y), у € Jp and the vector hp with the coordinates g(x), <f(n), where x € Ip, /л € IptP, ЦЛ-рЦ^ ^ Шх)]]^ + [[^(ж)!!^ for all p. We write the systems (3.1)-(3.2) in the form Apfp = hp, where detAp ф 0, and find fp = A~lhp. Taking into account (3.5) we estimate the norm fp:

\\fp\L = IIVMco < IML Halloo < ж ИМ«, < ^машнп + мх^и,

where M = Since the last inequality is valid for any p, we have [[/[[^ ^

M (||5,(^)|loo + ll^lloo) and, consequently, Problem (2.1)-(2.2) is stable.

□

Proof of Theorem 2. One can directly verify that f(x) is a solution of Problem (2.1)-(2.2) if and only if f (x) = А = (Ль ..., Ara), A j ф0, j = 1, ..., n is a solution of the problem

Y Ca\aRx + a)= g(x), x € Z™, (3.6)

fix) = ф(х), x € X0/i, (3.7)

where g(x) = ф(х) =

The sequence of sub-systems of the infinite system of equations (3.6)-(3.7) constructed as in Theorem 1 for p € Z+ has the form

Y с«Аж/(ж + a) = g{x), x € Ip, (3.8)

f{n) = <p(n), H&IpiP. (3.9)

The magnitudes of diagonal dominance of the matrices Ap of the system (3.8)-(3.9) in the rows with "numbers" p € IptP are equal to RM (^p) = 1 and in the rows with "numbers" x € Ip are equal to

rx (4) = M^I - Eic«A"i =c^ + Ec«a" = p(A) >

aji/3 aji/3

Hence, E* (A,) = mm{l,P(A)} = R* / 0 and E* does not depend onp,

Ap are diagonally dominant matrices. Similarly to the proof of Theorem 1, this implies that Problem (2.1)-(2.2) is solvable.

To prove the stability of Problem (2.1)-(2.2) we invoke one of the results of the work [4], namely: the stability of Problem (2.1)-(2.2) is equivalent to the absolute summability of the fundamental solution, i.e. to the convergence of the series ^ \Pp{x)\.

ikSZ™

The solution Vp (x) of Problem, (2.1)-(2.2) with the initial data <p(x) =0

{1, x = 0, ' ' is called fundamental.

0 2 x -J— 0

The stability of Problem (3.6)-(3.7) implies the absolute summability of the fundamental solution V¡3 (x). Since Vp (x) = ^^, the series ^

absolutely converges. In view of Abel's lemma ( [15]), the absolute convergence of the series Y Pfi (x) zX a point z° implies its absolute convergence

in the polydisk jz : \zj\ < z° ,j = l,...,n|. By the assumption of the theorem we have 0 < Xj ^ 1. Therefore, the series YPfi (x) zX absolutely

icisO

converges at the point z° = and hence at the point 2 =

(1, ..., 1). Thus, the fundamental solution Vp{x) of Problem (2.1)-(2.2)

is absolutely summable, which implies the stability of Problem (2.1)-(2.2).

□

4. Conclusion

In the present work, sufficient conditions (Theorems 1 and 2) for the correctness of a Cauchy problem for a polynomial difference operator with constant coefficients are proven.

The proof of solvability of the Cauchy problem is based on the property of diagonal dominance of matrices. The stability of the Cauchy problem is

proved using the method of estimation of the norm of the inverse matrix. The assumptions of Theorem 2 do not allow to obtain estimates for the norm of the inverse matrix. Hence, in Theorem 2 one employs methods of the discrete Fourier transform of the fundamental solution of the difference operator.

References

1. Dadzhion D., Mersero R. Tsifrovaya obrabotka mnogomernykh signalov [Digital processing of multidimensional signals]. Moscow, Mir Publ., 1988, 488 p. (in Russian)

2. Leinartas E.K. Multiple Laurent series and fundamental solutions of linear difference equations. Siberian Mathematical Journal, 2007, vol. 48, no. 2, pp. 268-272. https://doi.org/10.1007/sll202-007-0026-0

3. Leinartas E.K., Lyapin A.P. О ratsional'nosti mnogomernykh vozvratnykh stepen-nykh ryadov [On rationality multidimentional recursive power series]. Journal of Siberian Federal University, 2009, vol. 2, no. 4, pp. 449-455. (in Russian)

4. Leynartas E.K. Stability of the Cauchy problem for a multidimensional difference operator and the amoeba of the characteristic set. Siberian Mathematical Journal, 2011, vol. 52, no. 5, pp. 864-870. https://doi.org/10.1134/S0037446611050119

5. Leynartas E.K., Rogozina M.S. Solvability of the Cauchy problem for a polynomial difference operator and monomial bases for the quotients of a polynomial ring. Siberian Mathematical Journal, 2015, vol. 56, no. 1, pp. 92-100. https://doi.org/10.1134/S0037446615010097

6. Nekrasova T.I. Ob ierarkhii proizvodyashchikh funktsiy resheniy mnogomernykh raznostnykh uravneniy [On the Hierarchy of Generating Functions for Solutions of Multidimensional Difference Equations]. The Bulletin of Irkutsk State University. Series Ma,them,a,tics, 2014, vol. 9, pp. 91-102. (in Russian)

7. Rogozina M.S. О razreshimosti zadachi Koshi dlya polinomiaPnogo raznostnogo operatora [On the solvability of the Cauchy problem for a polynomial difference operator]. Vestnik NGU. Serija: Matematika, mehanika, informatika [Bulletin of NSU. Series: Mathematics, Mechanics, Informatics], 2014, vol. 14, no. 3, pp. 83-94. https://doi.org/10.1007/sl0958-016-2749-6

8. Rjaben'kiy V.S., Filippov A.F. Ob ustoychivosti raznostnykh uravneniy [On the stability of difference equations]. Moscow, Gosudarstvennoe izdatel'stvo tekhniko-teoreticheskoy literatury, 1956, 174 p. (in Russian)

9. Samarskiy A.A. Teoriya raznostnykh skhem [Theory of difference schemes]. Moscow, Nauka Publ., 1977, 656 p. (in Russian)

10. Fedoryuk M.V. Asimptotika: integraly i ryady [Asymptotics. Integrals and series]. Moscow, Nauka Publ., 1987, 546 p.

11. Hormander L. Lineynye differentsial'nye operatory s chastnymi proizvodnymi [Linear Differential Operators with Partial Derivatives]. Moscow, Mir Publ., 1965. 379 p. (in Russian)

12. Hormander L. Vvedenie v teoriyu funktsiy neskol'kikh kompleksnykh peremennykh [An introduction to complex analysis in several variables]. Moscow, Mir Publ., 1968, 280 p. (in Russian)

13. Tsikh A.K. Conditions for absolute convergence of the taylor coefficient series of a meromorphic function of two variables. Ma,them,a,tics of the USSR-Sbornik, 1993, vol. 74, no. 2, pp. 337-360.

http://dx.doi.org/10.1070/SM1993v074n02ABEH003350

14. Shabat B.V. Vvedenie v kompleksnyy analiz. Funktsii odnogo peremennogo [An introduction to complex analysis. Functions of one variable]. Moscow, Lenand Publ., 2015, 336 p. (in Russian)

15. Shabat B.V. Vvedenie v kompleksnyy analiz. Funktsii neskol'kikh peremennykh [An introduction to complex analysis. Functions of several variables]. Moscow, Lenand Publ., 2015, 464 p. (in Russian)

16. Ahlberg J.H., Nilson E.N. Convergence properties of the spline fit. J.SIAM, 1963, vol.11, no. 1, pp. 95-104. https://doi.org/10.1137/0111007

17. Apanovich M.S., Leinartas E.K. Correctness of a Two-dimensional Cauchy Problem for a Polynomial Difference Operator with Constant Coefficients. Journal of Siberian Federal University. Ma,them,a,tics & Physics, 2017, vol.10, no. 2, pp. 199-205. https://doi.org/10.17516/1997-1397-2017-10-2-199-205

18. Bousquet-Melou M., Petkovsek M. Linear recurrences with constant coefficients: the multivariate case. Discrete Ma,them,a,tics, 2000, vol. 225, pp. 51-75. https: //doi.org/10.1016/S0012-365X(00)00147-3

19. Taussky O. A recurring theorem on determinants. The Am,erican Mathematical Monthly, 1949, vol. 56, no. 10, pp. 672-676. https://doi.org/10.1080/00029890.1949.11990209

Marina Apanovich, Candidate of Sciences (Physics and Mathematics), Krasnoyarsk State Medical University named after Prof. V. F. Voino-Yasenetsky, 1, Partizan Zheleznyak st., Krasnoyarsk, 660022, Russian Federation, tel.: 89835085562 (e-mail: rogozina.marina@mail.ru)

Evgeny Leinartas, Doctor of Sciences (Physics and Mathematics), Associate Professor, Institute of Mathematics and Computer Science, Siberian Federal University, 79, Svobodny pr., Krasnoyarsk, 660041, Russian Federation, tel.: 89138325015 (e-mail: lein@mail.ru)

Received 19.07.18

О корректности задачи Коши для полиномиального разностного оператора с постоянными коэффициентами

М. С. Апанович

Красноярский государственный медицинский, университет им. профессора В. Ф. Войно-Ясенецкого Минздрава России, Красноярск, Российская Федерация

Е. К. Лейнартас

Сибирский федеральный университет, Красноярск, Российская Федерация

Аннотация. Теория линейных разностных уравнений применяется в различных областях математики и в одномерном случае имеет вполне завершенный вид. Для п > 1 ситуация значительно сложнее и даже для постоянных коэффициентов общего описания пространства решений разностного уравнения нет.

В комбинаторном анализе разностные уравнения в сочетании с методом производящих функций дают мощный аппарат исследования перечислительных задач.

Другой источник появления разностных уравнений - дискретизация дифференциальных уравнений. Так, дискретизация уравнения Коши - Римана привела к созданию теории дискретных аналитических функций, которая нашла применение в теории римановых поверхностей и комбинаторном анализе. Методы дискретизации дифференциальной задачи являются важной составной частью теории разностных схем и также приводят к разностным уравнениям. Вопрос о существовании и единственности решения относится к числу основных в теории разностных схем.

Другим важнейшим вопросом является вопрос об устойчивости разностного уравнения. Для п = 1 и постоянных коэффициентов устойчивость исследуется в рамках теории дискретных динамических систем и полностью определяется корнями характеристического многочлена, а именно: все они лежат в единичном круге.

В данной работе приведены два просто проверяемых достаточных условия на коэффициенты разностного оператора, обеспечивающие корректность задачи Коши.

Ключевые слова: полиномиальный разностный оператор, задача Коши, корректность.

Список литературы

1. Даджион Д. Цифровая обработка многомерных сигналов. М. : Мир, 1988. 488 с.

2. Лейнартас Е. К. Кратные ряды Лорана и фундаментальные решения линейных разностных уравнений // Сиб. мат. журн. 2007. Т. 48, № 2. С. 335-341.

3. Лейнартас Е. К., Ляпин А. П. О рациональности многомерных возвратных степенных рядов // Журн. Сиб. федер. ун-та. 2009. Т. 2, № 4. С. 449-455.

4. Лейнартас Е. К. Устойчивость задачи Коши для многомерного разностного оператора и амеба характеристического множества // Сиб. мат. журн. 2011. Т. 50, № 5. С. 387-393.

5. Лейнартас Е. К., Рогозина М. С. Разрешимость задачи Коши для полиномиального разностного оператора и мономиальные базисы факторов в кольце полиномов // Сиб. мат. журн. 2015. Т. 56, № 1. С. 111-121.

6. Некрасова Т. И. Об иерархии производящих функций решений многомерных разностных уравнений // Изв. Иркут. гос. ун-та. Сер. Математика. 2014. Т. 9. С. 91-102.

7. Рогозина М. С. О разрешимости задачи Коши для полиномиального разностного оператора // Вестн. НГУ. Сер. Математика, механика, информатика. 2014. Т. 14, № 3. С. 83-94.

8. Рябенький В. С., Филиппов А. Ф. Об устойчивости разностных уравнений. М. : Гос. изд-во техн.-теорет. лит., 1956. 174 с.

9. Самарский А. А. Теория разностных схем. М. : Наука, 1977. 656 с.

10. Федорюк М. В. Асимптотика: интегралы и ряды. М. : Наука, 1987. 546 с.

11. Хермандер Л. Линейные дифференциальные операторы с частными производными. М. : Мир, 1965. 379 с.

12. Хермандер Л. Введение в теорию функций нескольких комплексных переменных. М. : Мир, 1968. 280 с.

13. Цих А. К. Условия абсолютной сходимости ряда из коэффициентов Тейлора мероморфных функций двух переменных // Мат. сб. 1991. Т. 182, № 11. С. 1588-1612.

14. Шабат Б. В. Введение в комплексный анализ. Функции одного переменного. М. : Ленанд, 2015. 336 с.

15. Шабат Б. В. Введение в комплексный анализ. Функции нескольких переменных. М. : Ленанд, 2015. 464 с.

16. Ahlberg J. Н., Nilson Е. N. Convergence properties of the spline fit // J. SIAM. 1963. Vol. 11, N 1. P. 95-104. https://doi.org/10.1137/0111007

17. Apanovich M. S., Leinartas E. K. Correctness of a Two-dimensional Cauchy Problem for a Polynomial Difference Operator with Constant Coefficients // Journal of Siberian Federal University. Mathematics & Physics. 2017. Vol. 10, N 2. P. 199-205. https://doi.org/10.17516/1997-1397-2017-10-2-199-205

18. Bousquet-Melou M., Petkovsek M. Linear recurrences with constant coefficients: the multivariate case // Discrete Mathematics. 2000. Vol. 225. P. 51-75. https://doi.org/10.1016/S0012-365X(00) 00147-3

19. Taussky O. A recurring theorem on determinants // The American Mathematical Monthly. 1949. Vol. 56, N 10. P. 672-676. https://doi.org/10.1080/00029890.1949.11990209

Марина Степановна Апанович, кандидат физико-математических наук, Красноярский государственный медицинский университет им. профессора В. Ф. Войно-Ясенецкого Минздрава России, Российская Федерация, 660022, г. Красноярск, ул. Партизана Железняка, 1, тел.: 89835085562

Евгений Константинович Лейнартас, доктор физико-математических наук, профессор, Институт математики и фундаментальной информатики, Сибирский федеральный университет, Российская Федерация, 660041, г. Красноярск, пр. Свободный, 79, тел.: 89138325015 (e-mail: lein@mail.ru)

Поступила в редакцию 19.07.18