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

1Introduction AnaMariaAcu Monosplinesandinequalitiesfortheremaindertermofquadratureformulas

N/A
N/A
Protected

Academic year: 2022

シェア "1Introduction AnaMariaAcu Monosplinesandinequalitiesfortheremaindertermofquadratureformulas"

Copied!
12
0
0

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

全文

(1)

Monosplines and inequalities for the remainder term of quadrature formulas

1

Ana Maria Acu

Dedicated to Professor Alexandru Lupa¸s on the occasion of his 65th birthday

Abstract

In this paper we studied some quadrature formulas witch are ob- tained using connection between the monosplines and the quadrature formulas. For the remainder term we give some inequalities.

2000 Mathematics Subject Classification: 26D15, 65D30 Key words and phrases: quadrature rule, numerical integration, error

bounds

1 Introduction

We denote Wpn[a, b] :=n

f ∈Cn1[a, b], f(n1) absolutely continuous, °

°f(n)°

°p <∞o with

kfkp :=

½Z b a

|f(x)|pdx

¾

1 p

for1≤p <∞ kfk:= supvraix∈[a,b]|f(x)| .

Definition 1.The function s(x)is called a spline function of degree n with knots {xi}m−1i=1 if a:=x0 < x1 <· · ·< xm−1 < xm :=b and

i) for each i = 0, . . . , m−1, s(x) coincides on (xi, xi+1) with a polyno- mial of degree not greater then n;

ii) s(x), s(x), . . . , s(n−1)(x) are continuous functions on [a, b].

1Received 18 December, 2006

Accepted for publication (in revised form) 13 January, 2007

81

(2)

Definition 2.Functions of the form Mn(t) = tn

n!+sn−1(t),

where sn1(t) is a spline of degree n−1 are called monosplines.

Let

(1) Mn(t) = (b−t)n

n! −

n1

X

k=0

Ak,m

(b−t)n−k−1 (n−k−1)! −

m1

X

i=1 n1

X

k=0

Ak,i

(xi−t)n−k−+ 1 (n−k−1)!

be the monospline of degree n and let (2)

Z b a

f(t)dt=

m

X

i=0 n−1

X

k=0

Ak,if(k)(xi) +R[f],

be the quadrature formula. Between the monospline (1) and the quadrature formula (2) there is a connection, namely, the coefficients {Ak,i}nk=01 i=1m of the quadrature formula are the same with the coefficients of monospline (1), Ak,0 = (−1)n−k−1Mn(n−k−1)(a), k= 0, n−1 and the remainder term of quadrature formula have the representation :

R[f] = Z b

a

Mn(t)f(n)(t)dt , f ∈W1n[a, b].

Definition 3.Functions of the form

Mn(t) =v(t) +sn1(t),

where sn1(t) is a spline of degreen−1 and v is the nth integral of weight function w : [a, b]→R, are called generalized monosplines.

If we choose the weight functions w(t) = (b−t)(t−a), then we obtain the generalized monosplines

Mn(t) = (a−b)(t−b)n+1

(n+1)! −2(t−b)n+2

(n+2)! +(−1)n−1

n−1

X

k=0

Ak,m

(b−t)n−k−1 (n−k−1)!

(3)

+ (−1)n−1

m−1

X

i=1 n−1

X

k=0

Ak,i

(xi−t)n−k−1+ (n−k−1)! .

(3)

Between the monospline (3) and the quadrature formula (4)

Z b a

w(t)f(t)dt=

m

X

i=0 n−1

X

k=0

Ak,if(k)(xi) +R[f],

there is a connection, namely, the coefficients {Ak,i}nk=01i=1m of the quadra- ture formula are the same with the coefficients of monospline (3), Ak,0 = (−1)k+1Mn(n−k−1)(a) , k = 0, n−1 and the remainder term of quadrature formula has the representation :

R[f] = (−1)n Z b

a

Mn(t)f(n)(t)dt , f ∈W1n[a, b].

In the paper [1], [2], [3], [4] and [5] are considered generalization of the trapezoid, mid-point and Simpson s quadrature rule. For example, in [3] is studied a generalization of the mid-point quadrature rule:

Z b a

f(t)dt=

n−1

X

k=0

£1+(−1)k¤ (b−a)k+1 2k+1(k+1)!f(k)

µa+b 2

+(−1)n Z b

a

Kn(t)f(n)(t)dt , where

Kn(t) =





(t−a)n n! , t∈

·

a,a+b 2

¸

(t−b)n n! , t∈

µa+b 2 , b]

We observe that for n= 1 we get the mid-point rule Z b

a

f(t)dt= (b−a)f

µa+b 2

− Z b

a

K1(t)f(t)dt .

We will study the case of the quadrature formula with the weight function w(t) = (b−t)(t−a).

2 Main results

Lemma 1. If f ∈W1n[a, b], then (5)

Z b a

w(t)f(t)dt=

n−1

X

k=0

£(−1)k+1¤

· (b−a)k+3

2k+2(k+1)!(k+3)f(k)

µa+b 2

+R[f],

(4)

where w(t) = (b−t)(t−a)

(6) R[f] = (−1)n Z b

a

Mn(t)f(n)(t)dt and

(7) Mn(t) =





(b−a)(t−a)n+1

(n+ 1)! −2(t−a)n+2

(n+ 2)! , t∈[a, a+b 2

(a−b)(t−b)n+1

(n+ 1)! −2(t−b)n+2 (n+ 2)! , t∈

·a+b 2 , b

¸ . Proof. We denoting

Pn(t) = (b−a)(t−a)n+1

(n+ 1)! −2(t−a)n+2 (n+ 2)! and Qn(t) = (a−b)(t−b)n+1

(n+ 1)! −2(t−b)n+2 (n+ 2)!

we observe that successive integration by parts yields the relation (−1)n

Z b a

Mn(t)f(n)(t)dt= (−1)n Z a+2b

a

Pn(t)f(n)(t)dt+(−1)n Z b

a+b 2

Qn(t)f(n)(t)dt

= (−1)n

n1

X

k=0

(−1)n1kPn(n1k)(t)f(k)(t)¯

¯

a+b 2

a +

Z a+b2

a

Pn(n)(t)f(t)dt +(−1)n

n1

X

k=0

(−1)n1k Q(nn1k)(t)f(k)(t)¯

¯

b

a+b 2

+ Z b

a+b 2

Q(n)n (t)f(t)dt

=

n1

X

k=0

(−1)k+1

·

(b−a)(t−a)k+2

(k+ 2)! −2(t−a)k+3 (k+ 3)!

¸

f(k)(t)

¯

¯

¯

¯

a+b 2

a

+

n−1

X

k=0

(−1)k+1

·

(a−b)(t−b)k+2

(k+2)! −2(t−b)k+3 (k+3)!

¸

f(k)(t)

¯

¯

¯

¯

b

a+b 2

+ Z b

a

(b−t)(t−a)f(t)dt

=−

n1

X

k=0

£(−1)k+ 1¤

· (b−a)k+3

2k+2(k+ 1)!(k+ 3)f(k)

µa+b 2

¶ +

Z b a

w(t)f(t)dt , namely

Z b a

w(t)f(t)dt =

n−1

X

k=0

£(−1)k+ 1¤

· (b−a)k+3

2k+2(k+ 1)!(k+ 3)f(k)

µa+b 2

+ (−1)n Z b

a

Mn(t)f(n)(t)dt .

(5)

Remark 1.To observe that the quadrature formula (5) it is the open type.

Remark 2.If for the generalized monospline (3) we consider the particular case m = 2, x0 = a, x1 = a+b

2 , x2 = b, Ak,2 = 0, Ak,1 = £

(−1)k+ 1¤

· (b−a)k+3

2k+2(k+ 1)!(k+ 3), k = 0, n−1, we will have Mn(t) = (a−b)(t−b)n+1

(n+ 1)! −2(t−b)n+2 (n+ 2)! + 2(−1)n1

(n+ 2)!

n1

X

k=0

£(−1)k+ 1¤ (k+2)

µ n+ 2 k+ 3

¶ µb−a 2

k+3µ a+b

2 −t

nk1 +

.

If t∈[a, a+b 2

¶ , then

Mn(t) = (a−b)(t−b)n+1

(n+ 1)! −2(t−b)n+2

(n+ 2)! + 2(−1)n1 (n+ 2)!

·

·

(n+ 2)b−a

2 (b−t)n+1+(n+ 2)b−a

2 (a−t)n+1−(b−t)n+2+ (a−t)n+2

¸

= (b−a)(t−a)n+1

(n+ 1)! −2(t−a)n+2 (n+ 2)! . If t∈

·a+b 2 , b

¸ , then

Mn(t) = (a−b)(t−b)n+1

(n+ 1)! −2(t−b)n+2 (n+ 2)! .

Theorem 1.The generalized monospline of degree n , Mn(t), n >1, defined in (7), verifies

Z b a

Mn(t)dt = 0, if n is odd, (8)

Z b a

|Mn(t)|dt = (b−a)n+3 2n+1(n+ 1)!(n+ 3), (9)

tmax[a,b]|Mn(t)| = (b−a)n+2 2n+1n!(n+ 2). (10)

(6)

Proof. We have Z b

a

Mn(t)dt= Z a+b2

a

Pn(t)dt+ Z b

a+b 2

Qn(t)dt =

=

·

(b−a)(t−a)n+2

(n+2)! −2(t−a)n+3 (n+3)!

¸¯

¯

¯

¯

a+b 2

a

+

·

(a−b)(t−b)n+2

(n+2)! −2(t−b)n+3 (n+3)!

¸¯

¯

¯

¯

b

a+b 2

= [1 + (−1)n] (b−a)n+3 2n+2(n+ 1)!(n+ 3). If n is odd, then

Z b a

Mn(t)dt = 0.

Z b a

|Mn(t)|dt = Z a+b2

a

|Pn(t)|dt+ Z b

a+b 2

|Qn(t)|dt=

Z a+b2

a

·

(b−a)(t−a)n+1

(n+1)! −2(t−a)n+2 (n+2)!

¸ dt+

Z b

a+b 2

·

(b−a)(b−t)n+1

(n+1)! −2(b−t)n+2 (n+2)!

¸ dt

= (b−a)n+3 2n+1(n+ 1)!(n+ 3).

tmax[a,b]|Mn(t)|= max (

max

t[a,a+b2 ]|Pn(t)|, max

t[a+b2 ,b]|Qn(t)|

)

= max

½ Pn

µa+b 2

¶ ,

¯

¯

¯

¯ Qn

µa+b 2

¶¯

¯

¯

¯

¾

= (b−a)n+2 2n+1n!(n+ 2).

Theorem 2. If f ∈ W1n[a, b], n > 1 and there exist numbers γnn such that γn ≤f(n)(t)≤Γn, t∈[a, b], then

(11) |R[f]| ≤ Γn−γn

2n+2 · (b−a)n+3

(n+ 1)!(n+ 3), if n is odd and

(12) |R[f]| ≤ (b−a)n+3 2n+1(n+ 1)!(n+ 3)

°°f(n)°

° , if n is even.

(7)

Proof. Letn be odd. Using relations (6) and (8) we can written R[f] = (−1)n

Z b a

Mn(t)f(n)(t)dt= (−1)n Z b

a

Mn(t)

·

f(n)(t)− γn+ Γn

2

¸ dt

such that we have

(13) |R[f]| ≤ max

t∈[a,b]

¯

¯

¯

¯

f(n)(t)− γn+ Γn

2

¯

¯

¯

¯ Z b

a

|Mn(t)|dt . We also have

(14) max

t∈[a,b]

¯

¯

¯

¯

f(n)(t)− γn+ Γn

2

¯

¯

¯

¯

≤ Γn−γn

2 .

From (9), (13) and (14) we have

|R[f]| ≤ Γn−γn

2n+2 · (b−a)n+3 (n+ 1)!(n+ 3). Let n be even. Then we have

|R[f]| ≤°

°f(n)°

°· Z b

a

|Mn(t)|dt = (b−a)n+3 2n+1(n+ 1)!(n+ 3)

°

°f(n)°

° . Theorem 3. Let f ∈W1n[a, b], n > 1 and let n be odd. If there exist a real number γn such that γn ≤f(n)(t), then

(15) |R[f]| ≤(Tn−γn)· (b−a)n+3 2n+1n!(n+ 2) where

Tn= f(n−1)(b)−f(n−1)(a)

b−a .

If there exist a real number Γn such that f(n)(t)≤Γn, then (16) |R[f]| ≤(Γn−Tn)· (b−a)n+3

2n+1n!(n+ 2).

(8)

Proof. Using relation (8) we can written

|R[f]|=

¯

¯

¯

¯ Z b

a

¡f(n)(t)−γn

¢Mn(t)dt

¯

¯

¯

¯ . From (10) we have

|R[f]| ≤ max

t∈[a,b]|Mn(t)| · Z b

a

¡f(n)(t)−γn

¢dt

= (b−a)n+2 2n+1n!(n+2)

£f(n−1)(b)−f(n1)(a)−γn(b−a)¤

= (b−a)n+3

2n+1n!(n+2)(Tn−γn). In a similar way we can prove that (16) holds.

Now, we will study the case of the quadrature formula of close type, with the weight function w(t) = (b−t)(t−a).

Lemma 2. If f ∈W1n[a, b], then Z b

a

w(t)f(t)dt =

n−1

X

k=0

µb−a 4

k+3

1 k!

3k+ 10

(k+ 2)(k+ 3)f(k)(a) +

n1

X

k=0

£(−1)k+1¤

µb−a 4

k+3

1 (k+1)!

3k+11 k+3 f(k)

µa+b 2

¶ (17)

+

n1

X

k=0

(−1)k

µb−a 4

k+3

1 k!

3k+ 10

(k+ 2)(k+ 3)f(k)(b) +R[f], where w(t) = (b−t)(t−a)

(18) R[f] = (−1)n Z b

a

Mn(t)f(n)(t)dt and

(19)

Mn(t) =





















 3 n!

µb−a 4

2µ t−3a+b

4

n

+ b−a 2(n+1)!

µ t−3a+b

4

n+1

− 2 (n+2)!

µ t−3a+b

4

n+2

, t∈[a, a+b

2

3 n!

µb−a 4

2µ t−a+3b

4

n

+ a−b 2(n+1)!

µ t−a+3b

4

n+1

− 2 (n+2)!

µ t−a+3b

4

n+2

, t∈

·a+b 2 , b

¸

(9)

Proof. We denoting Pn(t) = 3

n!

µb−a 4

2µ t−3a+b

4

n

+ b−a 2(n+1)!

µ t−3a+b

4

n+1

− 2 (n+2)!

µ t−3a+b

4

n+2

, Qn(t) = 3

n!

µb−a 4

2µ t−a+3b

4

n

+ a−b 2(n+1)!

µ t−a+3b

4

n+1

− 2 (n+2)!

µ t−a+3b

4

n+2

, we observe that successive integration by parts yields the relation

(−1)n Z b

a

Mn(t)f(n)(t)dt= (−1)n Z a+b2

a

Pn(t)f(n)(t)dt+(−1)n Z b

a+b 2

Qn(t)f(n)(t)dt

= (−1)n

n1

X

k=0

(−1)n1kPn(n1k)(t)f(k)(t)¯

¯

a+b 2

a +

Z a+b2

a

Pn(n)(t)f(t)dt +(−1)n

n−1

X

k=0

(−1)n−1−kQ(n−n 1−k)(t)f(k)(t)¯

¯

b

a+b 2

+ Z b

a+b 2

Q(n)n (t)f(t)dt

=

n1

X

k=0

(−1)k+1

"

3 (k+ 1)!

µb−a 4

2µ

t− 3a+b 4

k+1

+ b−a 2(k+ 2)!

µ

t− 3a+b 4

k+2

− 2 (k+ 3)!

µ

t− 3a+b 4

k+3#

f(k)(t)

¯

¯

¯

¯

¯

a+b 2

a

+

n−1

X

k=0

(−1)k+1

"

3 (k+1)!

µb−a 4

2µ

t−a+3b 4

k+1

+ a−b 2(k+2)!

µ

t−a+3b 4

k+2

− 2 (k+ 3)!

µ

t−a+ 3b 4

k+3#

f(k)(t)

¯

¯

¯

¯

¯

b

a+b 2

+ Z b

a

(b−t)(t−a)f(t)dt =

n−1

X

k=0

µb−a 4

k+3

1 k!

3k+ 10

(k+ 2)(k+ 3)f(k)(a)

n−1

X

k=0

£(−1)k+ 1¤

µb−a 4

k+3

1 (k+ 1)!

3k+ 11 k+ 3 f(k)

µa+b 2

n1

X

k=0

(−1)k

µb−a 4

k+3

1 k!

3k+ 10

(k+ 2)(k+ 3)f(k)(b) + Z b

a

w(t)f(t)dt .

Theorem 4.The generalized monospline of degree n , Mn(t), n >1, defined

(10)

in (19), verifies Z b

a

Mn(t)dt = 0, if n is odd, (20)

Z b a

|Mn(t)|dt =

µb−a 4

n+3

4

(n+ 3)!(3n2+ 15n+ 16), (21)

tmax[a,b]|Mn(t)| =

µb−a 4

n+2

1

(n+ 2)!(3n2+ 11n+ 8). (22)

Proof. We have Z b

a

Mn(t)dt= Z a+b2

a

Pn(t)dt+ Z b

a+b 2

Qn(t)dt =

= [1 + (−1)n]

µb−a 4

n+3

2

(n+ 3)!(3n2+ 15n+ 16). If n is odd, then

Z b a

Mn(t)dt = 0. Z b

a

|Mn(t)|dt= Z a+b2

a

|Pn(t)|dt+ Z b

a+b 2

|Qn(t)|dt

=

µb−a 4

n+3

4

(n+ 3)!(3n2+ 15n+ 16).

t∈max[a,b]|Mn(t)|= max (

max

t∈[a,a+b2 ]|Pn(t)|, max

t∈[a+b2 ,b]|Qn(t)|

)

= max

½ Pn

µa+b 2

¶ ,

¯

¯

¯

¯ Qn

µa+b 2

¶¯

¯

¯

¯

¾

= µb−a

4

n+2

1

(n+ 2)!(3n2+ 11n+ 8). Theorem 5. If f ∈ W1n[a, b], n > 1 and there exist numbers γnn such that γn ≤f(n)(t)≤Γn, t∈[a, b], then

(23) |R[f]| ≤ Γn−γn

2

µb−a 4

n+3

4

(n+ 3)!(3n2+ 15n+ 16), if n is odd and

(24) |R[f]| ≤

µb−a 4

n+3

4

(n+ 3)!(3n2+ 5n+ 16)°

°f(n)°

° , if n is even.

(11)

Proof. Ifn is odd, then we can written

|R[f]| ≤ Γn−γn

2

Z b a

|Mn(t)|dt=Γn−γn

2

µb−a 4

n+3

4

(n+3)!(3n2+15n+16). Let n be even. Then we have

|R[f]| ≤°

°f(n)°

°· Z b

a

|Mn(t)|dt =

µb−a 4

n+3

4

(n+3)!(3n2+15n+16)°

°f(n)°

° . Theorem 6. Let f ∈W1n[a, b], n > 1 and let n be odd. If there exist a real number γn such that γn ≤f(n)(t), then

(25) |R[f]| ≤(Tn−γn

µb−a 4

n+3

· 4

(n+ 2)! ·(3n2+ 11n+ 8) where

Tn= f(n1)(b)−f(n1)(a)

b−a .

If there exist a real number Γn such that f(n)(t)≤Γn, then (26) |R[f]| ≤(Γn−Tn

µb−a 4

n+3

· 4

(n+ 2)! ·(3n2+ 11n+ 8). Proof. We have

|R[f]| ≤ max

t∈[a,b]|Mn(t)| · Z b

a

¡f(n)(t)−γn

¢dt

=

µb−a 4

n+2

1

(n+ 2)!(3n2+ 11n+ 8)£

f(n1)(b)−f(n1)(a)−γn(b−a)¤

= (Tn−γn

µb−a 4

n+3

· 4

(n+ 2)! ·(3n2+ 11n+ 8). In a similar way we can prove that (26) holds.

(12)

References

[1] G.A.Anastassiou, Ostrowski Type Inequalities, Proc. Amer.

Math.Soc.,Vol 123,No 12,(1995),3775-3781.

[2] P. Cerone and S.S.Dragomir, Midpoint-type Rules from an Inequalities Point of View, Handbook of Analytic-Computational Methods in Ap- plied Mathematics, Editor: G. Anastassiou, CRC Press, New York, (2000),135-200.

[3] P. Cerone and S.S.Dragomir, Trapezoidal-type Rules from an Inequali- ties Point of View, Handbook of Analytic-Computational Methods in Applied Mathematics, Editor: G. Anastassiou, CRC Press, New York, (2000),65-134.

[4] Lj. Dedi´c, M. Mati´c and J.Peˇcari´c, On Euler trapezoid formulae, Appl.

Math. Comput.,123(2001),37-62.

[5] C.E.M. Pearce, J.Peˇcari´c, N. Ujevi´c and S. Varoˇsanec, Generalizations of some inequalities of Ostrowski-Gr¨uss type, Math. Inequal. Appl., 3(1), (2000), 25-34.

[6] Nenad Ujevi´c, Error Inequalities for a Generalized Quadrature Rule , General Mathematics, Vol. 13, No. 4(2005), 51-64.

University ”Lucian Blaga” of Sibiu Department of Mathematics

Str. Dr. I. Rat.iu, No. 5-7 550012 - Sibiu, Romania e-mail: [email protected]

参照

関連したドキュメント

Dragomir, “Trapezoidal-type rules from an inequalities point of view,” in Handbook of Analytic-Computational Methods in Applied Mathematics, G. Anastassiou,

The aim of the present note is to establish new integral inequalities, provid- ing approximation formulae which can be used to estimate the deviation of the product of two

In the present paper, first we determine the extreme points of the class Q(α, β, γ), then we find the coefficient bounds and radius of univalency for functions belonging to this

The author uses certain property of convex functions to prove Bernoulli’s inequality and to obtain a simple proof of monotonicity of power means.. Key words and phrases: Power

However, in the case of our new inequality (1.3), although the result of doing so would be correct, it would add nothing since the left side of the modulus form, when opened, is

In the following, we will see that by using the property of convexity one can also deduce Hölder’s inequality directly from the Cauchy-Schwarz inequality.. It suffices to assume f, g

In this paper, we obtain a class of refined Carleman’s Inequalities with the arithmetic- geometric mean inequality by decreasing their weight coefficient.. Key words and

A lemma of considerable generality is proved from which one can obtain inequali- ties of Popoviciu’s type involving norms in a Banach space and Gram determinants.. Key words