• 検索結果がありません。

1Introduction TWODIMENSIONALDIVIDEDDIFFERENCESWITHMULTIPLEKNOTS

N/A
N/A
Protected

Academic year: 2022

シェア "1Introduction TWODIMENSIONALDIVIDEDDIFFERENCESWITHMULTIPLEKNOTS"

Copied!
10
0
0

読み込み中.... (全文を見る)

全文

(1)

TWO DIMENSIONAL DIVIDED

DIFFERENCES WITH MULTIPLE KNOTS

Ovidiu T. Pop and Dan B˘arbosu

Abstract

The notion of two dimensional divided difference was introduced by T. Popoviciu in 1934. Many properties of these differences were obtained by D. V. Ionescu. Other properties of the mentioned differences were obtained by the authors of the present paper.

The focus of the present paper is to establish properties of two di- mensional differences in the case of multiple knots. First, we establish some properties of the univariate divided differences with multiple knots:

a representation theorem using the determinants and a mean value the- orem. Next, one proves the main results of the paper which are a rep- resentation theorem for the bivariate divided differences with multiple knots and a mean-value theorem for this kind of divided differences.

1 Introduction

In this section let beN={1,2, . . .},N0=N∪ {0},m∈N0,r0, r1, ..., rm∈N, r0+r1+· · ·+rm=M + 1, α= max{r0−1, r1−1, . . . , rm−1}, I ⊂R be an interval and Dα(I) the set of all real functions f, α times differentiable on I. If α = 0, we consider that D0(I) = F(I) = {f|f : I → R}. Let x0, x1, . . . , xm∈I be distinct knots.

Them-th order divided differences off ∈F(I) on the knotsx0, x1, . . . , xm

is defined by

[x0, x1, . . . , xm;f] = Xm

k=0

f(xk)

u(xk), (1)

Key Words: divided differences; two dimensional divided differences with multiple knots.

Mathematics Subject Classification: 41A05, 41A63 Received: January, 2009

Accepted: September, 2009

181

(2)

whereu(x) = (x−x0)(x−x1)·. . .·(x−xm).

In the following, the divided difference with multiple knots x0, x0, . . . , x0

| {z }

r0times

, x1, x1, . . . , x1

| {z }

r1times

, . . . , xm, xm, . . . , xm

| {z }

rmtimes

;f

will be denoted by [x(r00), x(r11), . . . , x(rm0);f], wheref ∈Dα(I).

It is known that (see [3], [4]) or [6]) x(r00), x(r11), . . . , x(rmm);f

= (W f) x(r00), x(r11), . . . , x(rmm)

V x(r00), x(r11), . . . , x(rmm)

, (2) where

(W f) x(0r0), x(1r1), . . . , x(mrm) (3)

=

1 x0 ... xr00−1 ... xM0 −1 f(x0)

0 1 ... (r0−1)xr002 ... (M−1)xM0 −2 f(x0) ...

0 0 ... (r0−1)! ... (M−1)(M−2)·. . .·(M−r0+1)xM0 r0 f((xr01)

0)

...

1 xm ... xrmm−1 ... xMm−1 f(xm)

0 1 ... (rm−1)xrmm−2 ... (M−1)xMm−2 f(xm) ...

0 0 ... (rm−1)! ... (M−1)(M−2)·. . .·(M−rm+ 1)xMmrm f((xrmm)1)

and

V x(r00), x(r11), . . . , x(rmm)

(4)

=

1 x0 ... xr00−1 ... xM0

0 1 ... (r0−1)xr00−2 ... M xM0 −1 ...

0 0 ... (r0−1)! ... M(M−1)·. . .·(M−r0+2)xM−0 r0+1 ...

1 xm ... xrmm−1 ... xMm

0 1 ... (rm−1)xrmm−2 ... M xMm−1 ...

0 0 ... (rm−1)! ... M(M−1)·. . .·(M−rm+ 2)xM−rm m+1

=

Ym rYk−1

i! Y

(xk−xs)rk·rs

(3)

is the generalized determinant of Vandermonde.

Ifk∈ {0,1, . . . , m}andi∈ {0,1, . . . , rk−1}we denote Vk,i x(r00), x(r11), . . . , x(rmm)

(5)

= (−1)M+r0+r1+...+rk1+i

1 x0 ... xM−10

...

0 0 ... (M−1)(M−2)·. . .·(M−i+1)xM−ik 0 0 ... (M−1)(M−2)·. . .·(M−i−1)xMk −i−2

...

0 0 ... (M−1)(M−2)·. . .·(M−rm+1)xM−rm m ,

so the above determinant is obtained from (3) by elimination the liner0+r1+

· · ·+rk−1+i+ 1 and the columnM+ 1.

Theorem 1 If f ∈Dα(I), the identity

x(r00), x(r11), . . . , x(rmm);f

(6)

= 1

V x(r00), x(r11), . . . , x(rmm)

Xm

k=0 rk−1

X

i=0

Vk,i x(r00), x(r11), . . . , x(rmm)

f(i)(xk) holds.

Proof. Taking into account the relation (2), yields x(r00), x(r11), . . . , x(rmm);f

= 1

V x(r00), x(r11), . . . , x(rmm)

·

Xm

k=0

1 x0 ... xM0 −1 0

...

0 0 ... (M−1)(M−2)·. . .·(M −rk−1+ 1)xMk−1−rk1 0

1 xk ... xM−k 1 f(xk)

0 1 ... (M−1)xMk −2 f(xk)

...

0 0 ... (M−1)(M−2)·. . .·(M −rk+ 1)xM−rk k f(x(rkk)−1)

1 xk+1 ... xMk+1 0

...

0 0 ... (M−1)(M−2)·. . .·(M−rm+ 1)xMm−rm 0 and developing the above determinant from the columnM+ 1, we obtain the relation (6).

(4)

Remark 1 Ifr0=r1=· · ·=rm= 1 in Theorem 1 we get the relation (1).

Theorem 2 The following relation

x(r00), x(r11), . . . , x(rmm);xk

(7)

=





0, if k≤M −1

1, if k=M

r0x0+r1x1+· · ·+rmxm, if k=M + 1 holds, wherex∈I.

Proof. From (3) the first and the second statement from (7) follow.

Taking relation (3) into account, we start from the equality h

x(r00), x(r11), . . . , x(rmm); (x−x0)r0(x−x1)r1·. . .·(x−xm)rmi

= 0.

Then, it follows h

x(r00), x(r11), . . . , x(rmm);xM+1−s1xM+s2xM−1+· · ·+(−1)M+1sM+1

i

= 0, wheres1=r0x0+s1x1+· · ·+rmxm, hence

h

x(r00), x(r11), . . . , x(rmm);xM+1i

=s1

h

x(r00), x(r11), . . . , x(rmm);xMi and the third statement of (7) follows.

Theorem 3 Let a = min{x0, x1, . . . , xm}, b = max{x0, x1, . . . , xm}, f ∈ CM−1([a, b]), existsf(M)on(a, b)andf(lk)(xk) = 0, wherelk ∈ {0,1, . . . , rk− 1},k∈ {0,1, . . . , m}. Then exists ξ∈(a, b)such that

hx(r00), x(r11), . . . , x(rmm);fi

1+(M+1)ξ− r0x0+r1x1+· · ·+rmxm

V x(r00), x(r11), . . . , x(rmm)

! (8)

= 1

M!f(M)(ξ).

Proof. Define the auxiliary functionF : [a, b]→Rby F(x) = (W f)

x, x(r00), x(r11), . . . , x(rmm)

−h

x(r00), x(r11), . . . , x(rmm);fi

V

x, x(r00), x(r11), . . . , x(rmm) ,

(5)

for any x ∈ [a, b], where the first line in (W f)

x, x(r00), x(r11), . . . , x(rmm)

,

V

x, x(r00), x(r11), . . . , x(rmm)

is 1 x x2. . . xM f(x), respectively 1 x x2. . . xM xM+1. On verifies immediately that F(lk)(xk) = 0, where lk∈ {0,1, . . . , rk−1},k∈ {0,1, . . . , m}, so the functionF hasr0+r1+· · ·+ rm = M + 1 roots. By the generalized Rolle Theorem, there exists a point ξ∈(a, b) such thatF(M)(ξ) = 0. But

F(M)(x) =

0 0 . . . 0 M! f(M)(x)

1 x0 . . . xM−10 xM0 f(x0) . . .

−h

x(r00), x(r11), . . . , x(rmm);fi

0 0 . . . 0 M! (M+1)!x

1 x0 . . . xM0 −1 xM0 xM0 +1 . . .

= (−1)M+2M!(W f)

x(r00), x(r11), . . . , x(rmm) +(−1)M+3f(M)(x)V

x(r00), x(r11), . . . , x(rmm)

−h

x(r00), x(r11), . . . , x(rmm);fi

·

(−1)M+2M!(W xM+1)

x(r00), x(r11), . . . , x(rmm)

+(−1)M+3(M+ 1)!xV

x(r00), x(r11), . . . , x(rmm)

and taking (2) and (7) into account, the relation (8) follows.

In [4] the following mean-value theorem for divided differences with mul- tiple knots is proved.

Theorem 4 If a = min{x0, x1, . . . , xm}, b = max{x0, x1, . . . , xm}, f ∈ CM−1([a, b]) and f(M) exists on (a, b), then there exists ξ ∈ (a, b) such

that h

x(r00), x(r11), . . . , x(rmm);fi

= 1

M!f(M)(ξ). (9)

In the second section, using this theorem we shall give a mean-value theorem for two dimensional divided differences with multiple knots (Theorem 6).

2 The definition of two dimensional divided differences with multiple knots

In the following let m, n ∈ N0, r0, r1, . . . , rm, q0, q1, . . . , qn ∈ N, r0+r1 +

· · ·+rm = M + 1, q0+q1+· · ·+qn = N + 1, I, J ⊂ R intervals, I×J

(6)

be a bidimensional interval and Dα,β(I×J) the set of all real valued bi- variate functions f with the property that exits ∂fi+j

∂xi∂yj on I ×J, where i ∈ {0,1, . . . , α}, j ∈ {0,1, . . . , β}, α= max{r0−1, r1−1, . . . , rm−1} and p= max{q0−1, q1−1, . . . , qn−1}.

Let x0, x1, . . . , xm ∈ I, y0, y1, . . . , yn ∈ J be distinct knots. For y ∈ J, we denote by h

x(r00), x(r11), . . . , x(rmm);f(x, y)i

x the parametric extension of M-th order divided differences with multiple knots, equivalent the M- th order divided differences of the function f(·, y) : I → R, y ∈ J, with respect the knots x0, x0, . . . , x0

| {z }

r0times

, x1, x1, . . . , x1

| {z }

r1times

, . . . , xm, xm, . . . , xm

| {z }

rmtimes

is defined by (see (6))

h

x(r00), x(r11), . . . , x(rmm);f(x, y)i

x= 1

V

x(r00), x(r11), . . . , x(rmm)

(10)

· XM

k=0 rk−1

X

i=0

Vk,i

x(r00), x(r11), . . . , x(rmm)if

∂xi(xk, y).

In a similar way, the parametric extension of N-th order divided differences of the functionf(x,∗);J →R,x∈I, with respect to the knots

y0, y0, . . . , y0

| {z }

q0times

, y1, y1, . . . , y1

| {z }

q1times

, . . . , yn, yn, . . . , yn

| {z }

qntimes

is defined by

h

y(q00), y1(q1), . . . , y(qnn);f(x, y)i

y (11)

= 1

V

y(q00), y(q11), . . . , yn(qn)

Xn

l=0 ql−1

X

j=0

Vl,j

y0(q0), y1(q1), . . . , y(qnn)jf

∂yj (x, yl).

(7)

Theorem 5 The following equalities h

y(q00), y(q11), . . . , yn(qn);h

x(r00), x(r11), . . . , x(rmm);f(x, y)i

x

i

y (12)

=

x(r00), x(r11), . . . , x(rmm);h

y0(q0), y1(q1), . . . , y(qnn);f(x, y)i

y

x

= 1

V

x(r00), x(r11), . . . , x(rmm)

V

y0(q0), y1(q1), . . . , y(qnn)

Xm

k=0

Xn

l=0 rk−1

X

i=0 ql−1

X

j=0

·Vk,i

x(r00), x(r11), . . . , x(rmm) Vl,j

y0(q0), y1(q1), . . . , y(qnn)i+jf

∂xi∂yj (xk, yl) hold, where(x, y)∈I×J.

Proof. Taking into account (10) and (11), we have h

y(q00), y(q11), . . . , yn(qn);h

x(r00), x(r11), . . . , x(rmm);f(x, y)i

x

i

y

=

"

y0(q0), y1(q1), . . . , y(qnn); 1

V

x(r00), x(r11), . . . , x(rmm)

Xm

k=0 rk−1

X

i=0

·Vk,i

x(r00), x(r11), . . . , x(rmm)if

∂xi(xk, y)

#

y

= 1

V

x(r00), . . . , x(rmm)

· Xm

k=0 rk−1

X

i=0

Vk,i

x(r00), . . . , x(rmm) y(q00), y1(q1), . . . , y(qnn);∂if

∂xi (xk, y)

y

= 1

V

x(r00), . . . , x(rmm)

Xm

k=0 rk−1

X

i=0

Vk,i

x(r00), . . . , x(rmm)

· 1

V

y(q00), y(q11), . . . , yn(qn)

Xn

l=0 ql−1

X

j=0

Vl,j

y(q00), y(q11), . . . , yn(qn)i+jf

∂xi∂yj(xk, yl), and (12) follows.

Definition 1 The (m, n)-th order divided difference of the functionf ∈Dα,β(I×

J) with respect to the distinct knots (xi, yj) ∈ I×J, i ∈ {0,1, . . . , m},

(8)

j∈ {0,1, . . . , n} is defined by

"

x(r00), x(r11), . . . , x(rmm)

y0(q0), y(q11), . . . , yn(qn)

;f

#

(13)

= 1

V

x(r00), x(r11), . . . , x(rmm)

V

y(q00), y(q11), . . . , yn(qn)

Xm

k=0

Xn

l=0 rk−1

X

i=0 ql−1

X

j=0

Vk,i

x(r00), x(r11), . . . , x(rmm) Vl,j

y0(q0), y(q11), . . . , yn(qn)i+jf

∂xi∂yj(xk, yl).

In the paper [2], we give a mean-value theorem for two divided differences with simple knots.

Let a, b, c, d be real numbers defined by a = min{x0, x1, . . . , xm}, b = max{x0, x1, . . . , xm},c= min{y0, y1, . . . , yn} andd= max{y0, y1, . . . , yn}.

Theorem 6 If f(·, y)∈CM−1([a, b]), ∂Mf

∂xM(·, y)exists on (a, b)for any y ∈ [c, d], ∂Mf

∂xM(x,∗) ∈ CN−1([c, d]) and ∂M+N

∂xM∂xN(x,∗) exists on (c, d) for any x∈(a, b), then exists(ξ, η)∈(a, b)×(c, d)such that

"

x(r00), x(r11), . . . , x(rmm)

y(q00), y(q11), . . . , yn(qn)

;f

#

= 1

M!N!

M+Nf

∂xM∂yN (ξ, η), (14) where ”·” and ”∗” stand for the first and respectively second variable.

Proof. Taking into account (12) and (13) and applying the mean-value theorem for one dimensional divided differences (see Theorem 4), there exist ξ∈(a, b) and respectively η∈(c, d) such that

"

x(r00), x(r11), . . . , x(rmm)

y0(q0), y(q11), . . . , yn(qn)

;f

#

=h

y0(q0), y1(q1), . . . , y(qnn);h

x(r00), x(r11), . . . , x(rmm);f(x, y)i

x

i

y

=

y0(q0), y1(q1), . . . , y(qnn); 1 M!

Mf

∂xM (ξ, y)

y

= 1 M!

y(q00), y1(q1), . . . , y(qnn);∂Mf

∂xM (ξ, y)

y

= 1 ∂M+Nf (ξ, η),

(9)

so the equality (14) holds.

Remark 2 Because r0, r1, . . . , rm ∈ N and r0+r1+· · ·+rm = M + 1, it results thatM ≥m, so if mtends to∞it results thatM also tends to∞.

We consider a functionf : [a, b]×[c, d] →R, f ∈C∞,∞([a, b]×[c, d]), f possessing uniform bounded partial derivatives, so there exists M > 0 such

that

k+lf

∂xk∂yl(x, y)

≤M (15) for any (x, y)∈[a, b]×[c, d] and any (k, l)∈N0×N0.

Theorem 7 If (xm)m≥0 and (yn)n≥0 are sequences of distinct points from [a, b], respectively[c, d], then

m,n→∞lim

"

x(r00), x(r11), . . . , x(rmm)

y0(q0), y1(q1), . . . , y(qnn)

;f

#

= 0. (16)

Proof. Taking into account (14), (15) and Remark 2, relation (16) follows.

References

[1] D. B˘arbosu,Two dimensional divided differences revisited, Creative Math. & Inf.,17 (2008), 1-7.

[2] D. B˘arbosu, O. T. Pop,A note on the GBS Bernstein’s approximation formula, Annals of Univ. Craiova, Math. Comp. Sci. Ser.,35(2008), 1-6.

[3] Gh. Coman,Numerical Analysis, Ed. Libris, Cluj-Napoca, 1995 (in Romanian).

[4] D. V. Ionescu,Divided differences, Ed. Academiei, Bucure¸sti, 1978 (in Romanian).

[5] M. Ivan,Elements of interpolation theory, Mediamira Science Publisher, Cluj-Napoca, 2004.

[6] I. P˘av˘aloiu, N. Pop,Interpolation and applications, Ed. Risoprint, Cluj-Napoca, 2005 (in Romanian).

[7] T. Popoviciu,Sur quelques propriet´es des fonctions convexes d’une ou de deux vari- ables r´eelles, Mathematica, 1934, 1-85.

[8] D. D. Stancu, Lectures and Exercises in Numerical Analysis,I, lito Univ. ”Babe¸s- Bolyai”, Cluj-Napoca, 1977 (in Romanian).

[9] D. D. Stancu, Gh. Coman, O. Agratini, Trˆımbit¸a¸s, R.,Numerical Analysis and theory of aproximation,I, Presa Univ. Clujean˘a, Cluj-Napoca, 2001 (in Romanian).

(10)

(Ovidiu T. Pop) National College ”Mihai Eminescu”, 5 Mihai Eminescu Street,

440014 Satu Mare, Romania,

E-mail: [email protected]

(Dan B˘arbosu) North University of Baia Mare, Department of Mathematics and Computer Science 76 Victoriei,

430122 Baia Mare, Romania,

E-mail: [email protected]

参照

関連したドキュメント

(A 3-edge-connected graph of maximum degree ∆ cannot contain K ∆+1 − as a proper subgraph.) Since Brooks’ theorem itself requires the exclusion of K ∆+1 components, this would

Integral inequalities play a significant role in the study of qualitative properties of solutions of integral, differential and integro-differential equations see, e.g., 1–4 and

Berndt’s discussion of Ramanujan’s approximation includes Almkvist’s very plausible sug- gestion that Ramanujan’s “empirical process” was to develop a continued fraction

Wang, A probabilistic interpretation to umbral calculus, Journal of Mathematical Research & Exposition.,

A geometric realization (M, G) (in some R n ) is called linear if each face of M is a convex polygon and no two adjacent faces (i.e., faces which share a common edge) lie in the

Remark 3 Because the Bernstein’s bivariate operator B m,n conserve only the lineares functions in x and respectively y, it follows that the degree of exactness for the cubature

Instead, the authors merely construct classifying invariants by attaching three multiplication tables T i (D) (i = 0, 1, 2) to any two-dimensional real division algebra D

In this paper, we have used the spectral homotopy analysis method SHAM and the successive linearisation method SLM to solve a fourth-order nonlinear boundary value problem that