CC BY
8
УДК 517.55
On the Correctness of Polynomial Difference Operators
Marina S. Rogozina*
Krasnoyarsk State Medical University Partizana Zheleznyaka, 1, Krasnoyarsk, 660022
Russia
Received 10.09.2015, received in revised form 17.10.2015, accepted 01.11.2015 The correctness Cauchy problem is explored for a polynomial difference operator. The easily verifiable sufficient condition correctness for the Cauchy problem for a polynomial difference operator with constant coefficients is proved whose characteristic polynomial is homogeneous.
Keywords: polynomial difference operator, Cauchy problem, correctness. DOI: 10.17516/1997-1397-2015-8-4-437-441
Difference equations arise in various areas of mathematics. Together with the method of generating functions, they yield a powerful machinery for studying enumeration problems in combinatorial analysis (see, e.g. [1]). Another source of difference equations is the discretization of differential equations. For instance, the discretization of Cauchy-Riemann equations led to the appearance of the theory of discrete analytic functions (see, e.g. [2, 3]) which found applications in the theory of Reimannian surfaces and combinatorial analysis (see, e.g. [4, 5]). The methods of discretization of a differential problem comprise an important part of the theory of difference schemes, and they also lead to difference equations (see, e.g. [6]). The theory of difference schemes is exploring ways of constructing difference schemes, explores the challenges posed difference and the convergence of the solution of the difference problem to the solution of the original differential problem, engaged justification of algorithms for solving problems of difference. An important place among these are correct.
We define the shift operators Sj with respect to the variables xj: Sj f (x) = f (xi, ..., Xj-i, xj + 1, xj+i, ..., xn), and polynomial difference operator of the form
P(S)= J2 cvV
<m
where m is an order polynomial difference operator and cv are coefficients of the difference operator, 5 = S, S2, ..., Sn), v = (v1, v2, ..., vn) and Sv = SV1 ¿V2 ... . Let us consider the difference equation of the form
P(S)f (x)= g(x), x € X, (1)
where f (x) is unknown function and g(x) is a function defined on some fixed set X c Zn. Let us select a subset X0 c X of the «initial» («boundary») points from the set X. Let us formulate the problem.
Find a function f (x) that satisfies the equation (1) and coincides with the given function on set X0
f (x) = y(x), x € Xo. (2)
* [email protected] © Siberian Federal University. All rights reserved
v
The problem (1)-(2) is called the Cauchy problem for a polynomial difference operatorP (S).
Let us denote \\f || = sup \f (x)\ for a function f : X ^ C .
X
It is said (see, e.g. [7]) that the problem of the form (1)-(2) for a polynomial difference operator P (S) posed, if the following conditions are satisfied:
a) the problem is uniquely solvable for any initial data ^ (x) and right-hand sides g(x);
b) there are constants M\ > 0, M2 > 0 such that for any g(x) and p(x) the estimate
\\f (x)\\ < M1 ||g(x)\\ + M2 y(x)\\ . (3)
Note that if the condition b) the difference operator P (S) it said to be stable.
Thus, the difference problem (1)-(2) posed, if for any ^ and g It has a unique solution and is stable.
Stability problems of the form (1)-(2) in the case of a single variable is studied in the framework of the theory of discrete dynamical systems and digital recursive filters (see, e.g. [8,9]). Various options for determining the stability of homogeneous linear differential equations with constant coefficients mean that all the roots of the characteristic equation do not exceed one, and if the root of the module is equal to one, it is simple. For the inhomogeneous equation stability criterion is that the roots of the module is less than one.
In the multidimensional case, the existence and uniqueness of the solution of the problem depends on all objects involved in its formulation: the difference operator P(S), sets X and X0. Here are some typical situations.
The first of these, appearing usually in combinatorial analysis X = Z+ And the choice of the set on which the initial data X0 depends on the properties of the characteristic polynomial P.
In the second case X = {x G Zn, xn > 0} and as the set X0 C X take X0 = {x G X : xn =0, 1, ..., m — 1} and the characteristic polynomial is a monomial of degree m older one of the variables. In [10] to study the stability of multilayer homogeneous difference schemes of this type of theory is used amoebas of algebraic hypersurfaces. The notion of an amoeba allows us to formulate a multi-dimensional analogue of the condition that all the roots of the characteristic polynomial lie in the unit circle, i.e. stability conditions for multidimensional difference schemes.
In this paper we consider a polynomial difference operator of order m
P (S)= £ c,Sa, (4)
\v\=m
where Sv = SV1 ... S"Vn for a multi-index v = (v1, ..., vn), with\v\ = v^ + ... + vn, and cv are some coefficients on the difference operator. Consider the difference equations of the form
P(S)f (x) = g(x), x G Z+, (5)
where f (x) is unknown, while the function g(x) on Z+ = Z+ x ... x Z+ is known, here Z+ stands
for the set of nonnegative integers.
Given two points x and y of the integer lattice Zn the inequality x > y means that xi > yi for i = 1, ..., n, while x ^ y means that there is i0 G {1, ..., n} with xi0 < yi0. Let us fix a multi-index ¡3 such that
m h
cß = 0. (*)
Put X0^ = {x G Z+ : x ^ ¡} and formulate the problem.
Find a function f (x) that satisfies the equation (5) and coincides with the given function (x), for x € X0,p, i.e.
f (x) = p(x), x € Xo,j3. (6)
If ¡3 = (m,..., 0) and ¡3 = (0,..., m) then conditions (6) is called the type conditions Riquier. It is true (see [11]) easily verifiable sufficient condition for solvability of the problem (5)-(6).
If the coefficients of the homogeneous component of highest degree satisfy
\cp I > E ICv \, (7)
v=p,\v\=m
then the problem (5)-(6) has the unique solution.
Condition (7) ensures the solvability of the Cauchy problem with initial data type (6). However, it generally should not be resistance problem.
Example. For a polynomial difference operator P(Si, S2) = S1S2 — 2 let us consider the difference equation of the form (S1S2 — 2)f (x, y) = 0 with initial data f (0, 0) = 1, f (0, y) = 0, y > 0,
f 2k,x = y = k, k € Z f (x, 0) = 0, x > 0. The solution to this problem is a function of f = <
0, x = y,
that is obviously unbounded, so the problem is unstable.
However, we have shown that if the characteristic polynomial P(z) = ^ Cv Z is homoge-
v=m
neous, then the condition (7) should also stability.
In the case of the solvability of the problem (5)-(6) fundamental solution plays an important role, as it can be expressed through any decision (see, e.g. [10,12,13]).
Definition 1. The fundamental solution of the problem (5)-(6) is a solution of Vp (x) to the equation P(S)Vp (x) = S0(x) satisfying the initial conditions Vp(x) = 0 for x € X0,p where
¡0, if x = 0, S0(x) = \l,ifx = 0.
First, we note that in the case where the characteristic polynomial P (z) is homogeneous the
fundamental solution has the form Vp (x) = — S0 (x — ¡3).
cp
Indeed, for x > 0 we have
1 1 c
P (5)— ¿0 (x — ¡3) = —Y cvSv¿0 (x — ¡3)= V ^¿0 (x + v — 3).
CP cP ii ii cP
\v\=m \v\=m
If v = ¡3 then at least one of the differences vj — ¡3j > 0 and xj > 0 so S0 (x + v — ¡3) =0 and hence
P(S)—¿0 (x — ¡3) = cp¿0(x) = ¿0(x).
cp cp
Next to x € X0pp we have x ^ 0, x ^ ¡3 therefore x — 3 ^ 0, i.e. xj — ¡3j < 0 for some j j,
then Vp(x) = — ¿0 (x — ¡3) = 0. cp
The main result of this work.
Theorem. If a polynomial difference operator of the form (4) and the condition (7), the problem (5)-(6) is correct.
Proof. We use the following formula (see. [13])
f (x)= J2 cv Pp (x + v - k), (8)
to solve the problem (5)-(6).
Let us show that in the formula (8) the number of terms is finite. By the definition of fundamental solution,Pp(x) = 0 for x ^ ¡3. Therefore, in the expression for f (x) we sum over k and v with x + v — k ^ 3, i.e. k ^ x + v — ¡. For fixed x and 3 the system of inequalities k ^ 0, k ^ x + v — 3 and 0 ^ ^ m determines a bounded set in R" x R". Verify that f (x) defined in (8) satisfies (5). Indeed, for x > 0 we have
P(S)f (x)= J2 f(k)J2 Cv¿c(x + v — k).
Since v ^ k, there is j with vj — yj > 0, hence xj + vj — yj > 0 and then S0(x + v — y) = 0, Therefore, P(S)f (x) = 0.
It remains to verify f(x) in (8) satisfies (6).
For v ^ k we have x + v — k ^ x, and since x ^ 3, it follows that Pp(x + v — k) = 0. Then we can express f(x) as
f (x) = XI ¥(k) Cv Pp (x + v — k) = ^(k)So (x — k) = y(k).
Thus, in the formula (8) for solutions f(x) problem (5)-(6) the number of terms is finite but generally speaking, depends on the x. Let us show, that in the case where the characteristic polynomial P(z) difference equation (5) is homogeneous, the number of terms will not depend on the x.
Let us fix x ^ 0 in the formula (8) are the sum of multi-index k and v such that
k > 0, k ^ v ^ k, v > 0. (**)
and k — v = x — 3.
Since the characteristic polynomial P(z) is homogeneous of degree m m then for all j the inequality vj < m and by (**) the inequality kj > 0. On the plane R;j k. of variable vj, kj let us consider the equation of the line kj — vj = const. The number of lattice points in the intersection of this line with the plane {(vj,kj) : 0 < vj < m} equal to (m + 1) for any value of the constant. It follows that for any x the number of solutions of equations kj — vj = xj — 3j satisfying (**) are less than (m +1). A number of solutions v, k system of equations k — v = x — 3 are not more than (m + 1)", i.e. it does not depend on the x.
Let us prove the stability of the problem (5)-(6). We use the formula (8) for the solution of the problem (5)-(6).
\fMi <
Cv Pß (x + V - k)
v^k
k>0, k
^ E \v(k)\Y;\Cv Pß (x + V - k)\ .
v^k
k>0, kj
Since the characteristic polynomial is homogeneous, the fundamental solution has the form
Pp (x) = — So (x — 3). We find that cp
If (x)| < ^ lv(k)l £ ^S(x + v — k) < C • (m + 1)" . This means stability of the problem (5)-(6). □
References
[1] R.Stanley, Enumerative Combinatorics, Cambridge University Press, 1999.
[2] R.J.Duffin, Basic Properties of Discrete Analytic Functions, Duke Math. J., 23(1956),
335-363.
[3] R.J.Duffin, Potential theory on rhombic lattice, J. Combinatorial Theory, 5(1968), 258-272.
[4] O.A.Danilov, Lagrange Interpolating Formula for Discrete Analytic Function, Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Infor-matika, 8(2008), no.4, 33-39 (in Russian).
[5] O.A.Danilov, A.D.Mednykh, Discrete Analytical Functions of Several Variables and Taylor Expansion, Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 9(2009), no. 2, 38-46 (in Russian).
[6] A.A.Samarskii, Introduction to the theory of differential circuits, Moscow, Nauka, 1971.
[7] V.S.Ryaben'kii, On the stability of difference equations, Moscow, Gos. izd. tekhniko-teoreticheskoj literatury, 1956.
[8] D.Dudgeon, R.Mersereau, Multidimensional Digital Signal Processing, Prentice-Hall, First Edition, 1983.
[9] R.Izerman, Digital Control Systems, Springer-Verlag, 1981.
[10] M.S.Rogozina, Stability of multilayer finite difference schemes and amoebas of algebraic hypersurfaces, Journal of Siberian Federal University. Mathematics & Physics, 5(2012), no. 2, 256-263 (in Russian).
[11] E.K.Leinartas, M.S.Rogozina, Solvability of the Cauchy problem for a polynomial difference operator and monomial bases for the quotients of a polynomial ring, Sib. Math. J., 56(2015), no. 1, 92-100.
[12] E.K.Leinartas, Multiple Laurent Series and Difference Equations, Sib. Math. J., 45(2004), no. 2, 321-326.
[13] M.S.Rogozina, On the solvability of the Cauchy problem for a polynomial difference operator, Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 14(2014), no.3, 83-94 (in Russian).
О корректности полиномиальных разностных операторов
Марина С. Рогозина
Исследуется корректность задачи Коши для полиномиального 'разностного оператора. Доказано
легко проверяемое достаточное условие корректности задачи Коши для полиномиального разностного оператора с постоянными коэффициентами, характеристический многочлен которого
является однородным.
Ключевые слова: полиномиальный разностный оператор, задача Коши, корректность.
