AUSTRALIAN JOURNAL OF BASIC AND
Open Access Journal
Published BY AENSI Publication
© 2016 AENSI Publisher All rights reserved
This work is licensed under the Creative
http://creativecommons.org/licenses/by/4.0/
To Cite This Article: Saheb K. Al-Saidy, Hussein Ali AL for Spline Approximation in Space , ,
Error Estimate of Unbounded Function for Spline Approximation in Space
,
,
,
0 , 0
1Saheb K. Al-Saidy, 2Hussein Ali AL-Juboori
1(1st Affiliation) Department of Mathematics 2(2nd Affiliation) Department of Mathematics
3(3rd Affiliation) Department of Mathematics, College of Education,University of AL
Address For Correspondence:
Saheb K. Al-Saidy, (1st Affiliation) Department of Mathematics, College of Science ,Universitya of Al
A R T I C L E I N F O Article history: Received 3 April 2016 Accepted 21 May 2016 Published 2 June 2016
Keywords:
Besove space, The generalized
steklove function, spline
approximation
A spline is a numerical function that consists smoothness at the places (Chen, Wai
We shall prove a new theorem about the convergence to unbounded functions by spline polynomial in terms of K-functional of J. Peeter generated in space
AUSTRALIAN JOURNAL OF BASIC AND
APPLIED SCIENCES
ISSN:1991-8178 EISSN: 2309-8414 Journal home page: www.ajbasweb.com
© 2016 AENSI Publisher All rights reserved
This work is licensed under the Creative Commons Attribution International License (CC BY).
http://creativecommons.org/licenses/by/4.0/
Saidy, Hussein Ali AL-Juboori, Abdulsattar Ali AL-Dulaimi., Error Estimate of Unbounded Function
, 0 , 0 1. Aust. J. Basic & Appl. Sci., 10(10): 6-15, 2016
Error Estimate of Unbounded Function for Spline Approximation in Space
1
Juboori, 3Abdulsattar Ali AL-Dulaimi
of Mathematics, College of Science ,Universitya of Al-Mustansiry, Baghdad, Iraq. of Mathematics, College of Science,Universitya of Al-Mustansiry, Baghdad, Iraq.
Mathematics, College of Education,University of AL-Anbar, AL-Anbar, Iraq.
(1st Affiliation) Department of Mathematics, College of Science ,Universitya of Al-Mustansiry, Baghdad, Iraq.
A B S T R A C T
Background: during the last six decades Spline Approximation has been rapidly increasing in importance in many fields, such as numerical analysis, statistics, engineering, computer science, maneuvering analysis,and others. In 1946 (Ahlberg, J. H., E. N. Nilson, and J. L. Walsh, 1965),Schoenberg introduced the terminology (spline function). As far as we can determine" the only other papers mentioning splines explicitly prior to 1960 were those by Curry and Schoenberg [1947]" Schoenberg and Whitney [1949, 1953], Schoenberg [1958], and Maclaren [1958].see (Larryl Schumaker, 2007)The theory of spline functions had a rather modest development up until 1960. The important impetus for the intense interest in splines in the early 1960 seems to have been provided primarily by the fact that (in addition to I. J. Schoenberg) a number of researchers realized that spline functions were a way to mathematically model the physical process of drawing a smooth curve with a mechanical spline. Despite the feverish activity in splines during the past 30 years, there are relatively few authors on the subject. Work was also being done at Pratt & Whitney Aircraft, where two of the authors of the first book-length treatment of splines
1967) were employed; and the David Taylor Model Basin, by
work at General Motors is detailed nicely in Birkhoff (1990) and Young (1997). (Young 1997) Davis (1997) summarizes some of this material. In (2010) Hawraa A. Fadhil estimated approximation a K-monotone function by free knot spline (Hawraa A. Fadhil 2010) Objective: the main objective for our paper is to study the best approximation of unbounded measurable functions by spline polynomials in weighted space L ,α ,α 0, 0 1, we introduced direct and converse estimate for the degree
of best approximation of this function by means the K-functional. results of this paper is to Approximation error of unbounde
quasi-norm such that we proved a direct and converse theory and some result. Conclusion: there are main conclusion for our paper. we prove that for the unbounded function f ∈ Bσα, ,α, ,α 0 , 0 p 1, the error estimate of spline
quasi-norm. we proved pairs of adjusted inequalities of Jackson and Bernstein type, we using this prove to obtain complete direct and converse theorems in approximation theory.
INTRODUCTION
A spline is a numerical function that consists of piecewise polynomial which is has a high degree of (Chen, Wai-Kai 2009), ( Judd, Kenneth L.1998).
We shall prove a new theorem about the convergence to unbounded functions by spline polynomial in terms functional of J. Peeter generated in space L ,α 0,1 .
Error Estimate of Unbounded Function , 2016
Error Estimate of Unbounded Function for Spline Approximation in Space
Mustansiry, Baghdad, Iraq.
: during the last six decades Spline Approximation has been rapidly increasing in importance in many fields, such as numerical analysis, statistics, engineering, computer science, maneuvering analysis,and others. In 1946 (Ahlberg, J. J. L. Walsh, 1965),Schoenberg introduced the terminology (spline function). As far as we can determine" the only other papers mentioning splines explicitly prior to 1960 were those by Curry and Schoenberg [1947]" Schoenberg and berg [1958], and Maclaren [1958].see (Larryl Schumaker, 2007)The theory of spline functions had a rather modest development up until 1960. The important impetus for the intense interest in splines in the early 1960 the fact that (in addition to I. J. Schoenberg) a number of researchers realized that spline functions were a way to mathematically model the physical process of drawing a smooth curve with a mechanical spline. ing the past 30 years, there are relatively few authors on the subject. Work was also being done at Pratt & Whitney Aircraft, where length treatment of splines (Ahlberg; Nilson; Walsh , by Feodor Theilheimer. The is detailed nicely in Birkhoff (1990) and Young (1997). me of this material. In (2010) Hawraa A. monotone function by free knot spline (Hawraa A. the main objective for our paper is to study the best line polynomials in weighted , we introduced direct and converse estimate for the degree functional. Results: the main results of this paper is to Approximation error of unbounded measurable functions in norm such that we proved a direct and converse theory and some result. Conclusion: there are main conclusion for our paper. we prove that for the unbounded , the error estimate of spline polynomial in adjusted inequalities of Jackson and Bernstein type, we using this prove to obtain complete direct and converse theorems in approximation
of piecewise polynomial which is has a high degree of
The Besov space Bα,σ is defined a set of functions f from L ,α 0,1 which have smoothness α. Where p < 1 we note that for μ< min 1, p and any sequence !f"# , the following inequality holds (Chen, Wai-Kai 2009):
$∑ f"$ ,α ≤ '∑$f"$μ,α( )
μ
. (1.1)
Let f ∈ L ,α 0,1 , α> 0 , 0 < p,σ< 1 , assume k = 1 + α , define the following quasi-norm of:
‖f‖./,ασ = '0 '
1
2α ω f; t ,α( σ52
2 1
6 (
)
σ
(1.2) And
‖f‖./,ασ = sup
1
2α ω f; t ,α (1.3)
Where the quasi norm ‖f‖./,ασ is finite.
To begin proof the direct and inverse theorem for spline approximation. Denoted by Bα,σ, the set of all functions f ∈ L ,α 0,1 such that the quasi norm ‖f‖.
/,σ,9
α is finite.
Where
‖f‖./,ασ,9= '0 '
1
2α ω f; t (
σ52
2 1
6 (
)
σ
(1.4)
And α> 0 , 0 < p,σ< 1, k ≥ 1.
Now we can give some equivalent quasi-norms in Bα,σ, [(Petrushev P. P. popov V. A., 1987)] Denote
‖f‖.1/,ασ,9= !∑ ! 2 α<ω f; 2=< #
σ ∞
<>6 #
)
σ (1.5)
‖f‖./,
σ,9 α
? = @0 @1
2α $∆2f . $C/,σ6,1= 2 D
σ52
2 )
9
6 D
)
σ
(1.6)
The generalized steklove function for f ∈ L ,α is
f,E x = h = 0 … 0 I−f x + t6E 6E 1+ t?+ ⋯ + t L
+ 'k1(f@x + =1 t1+ t?+ ⋯ + t D + ⋯
+ −1 ' kk − 1( f 'x +2)M⋯M29 t
1+ t?+ ⋯LL
LLL+t #Ndt1… dt (1.7)
Theorem .1.1:
Let f ∈ L ,α 0,1 , α> 0 , 0 < p < 1 . Then
$f ,E− f$ ,α≤ω f; h ,α.
Proof:
The generalized Minkovski inequality in (1.7) implies
$f ,E− f$ ,α≤ P
1
h Q … Q R∆2)M⋯M29f x R dt1… dt
E
6 E
6 P ,α
≤ω f; h ,α ▄
Denoted by S k, n, a, b the set of all splines s ∈ S k, n restricted toa, b . a and b witch is the end points of the interval a, b also called knots of s. The degree of best approximation to a continuous function with respect to a polynomial spline on interval a, b ( Fadil, H., (2010), is given by
EW, f ∞= infI‖f − s‖∞ ; s ∈ S k, n X. (1.8)
The degree of best approximation of a function f ∈ L a, b with respect to a polynomial spline of degree ≤ n on a, b is given by
EW, f = infY‖f − s‖ ; s ∈ S k, n N. (1.9)
Define the degree of best weighted approximation to a given unbounded function f ∈ L ,α X with respect to polynomial spline of degree ≤n on X as
EW, f ,α= infY‖f − s‖ ,α ; s ∈ S k, n N. (1.10)
At the same time, when X6= L ,α 0,1 , X1= Bασ,α, , the K-functional is equipped to the kthL ,α-modulus of smoothness, ‖f‖.
σ,α,9
α is a quasi-norm inBσα,α, . In this case,
K!f, t, L ,α, Bσα,α, # = inf|E|]
δ^‖f − g‖C/,α+ t‖g
`‖
.σα,α,9, s = 1,2, … a (1.11)
2. Auxiliary Results:
Let f ∈ L a, b , 0 < p < 1 and , 0 <δ<b=c , k ≥ 1 . Then we have
ω f;δ ≤ Cn 0 06δ cb= 2e∆Ef x e dxdt. (2.1)
Her we can prove the following lemma for the space L ,α.
Lemma 2.2:
For the unbounded function f ∈ L ,α a, b , α> 0 , 0 < p < 1 and,
0 <δ<1 , k ≥ 1, then we have
ω f;δ ,α≤ Cn 0 0 e∆Ee=αgf x e dxdt
b= 2
c .
δ
6 (2.2)
Proof:
ω f,δ ,α= sup
|E|]δ$∆Ef . $ ,α ,
α> 0 , 0 < p < 1
= sup
|E|]δ'0 e∆Ee
=αgf x e dx
b= 2
c (
) /
=ω e=αgf;δ
Using Lemma (2.1) to get
ω e=αgf;δ ≤ Cn 0 06δ cb= 2e∆Ee=αgf x e dxdt.
Hence
ω f;δ ,α≤ Cn 0 0 e∆Ee=αgf x e dxdt
b= 2
c .
δ
6 ▄
Theorem 2.3 (Saheb K. Al-Saidy, 2015):
For unbounded functionsf ∈ L ,α I α> 0 . 0 < p < 1, n ≥ 1 and I = 0,1. There exists a polynomial
P ∈ ∏W=1, where ∏W=1 is the space of all polynomials of degree less than or equal to zero, such that
‖f − P‖ ,α≤ CωW'f;
|k|
W( ,α. (2.3)
Where C = C k, p is a constant depending on k and p
Lemma 2.4:
Let f ∈ L ,α 0,1 , α> 0 , 0 < p < 1 and k ≥ 1 . Then
EW f ,α≤ Cω 'f;
1
W( ,α , n = 1,2, … WhereC = C k, p . (2.4)
Proof:
Let the open interval ∆"= '"=1
W , " W(
By theorem (2.3), there exists a polynomial Pl of degree k − 1 such that
$f − P"$ ,α∆m ≤ Cω @f;e∆meD
,α
, C = C k, p
Using Lemma (2.2) gives
$f − P"$ ,α∆m ≤ C1n 0 0 e∆ne=αgf x e dxdu
m o= n mp)
o .
) 9o
6
Put ᴪ x for x ∈ ∆" , j = 1,2, … , n then to get
‖f −ᴪ‖ ,α = '∑ $f − PW">1 "$ ,α(
) /
≤ C1n r0 r∑ 0 e∆We=αgf x e dx
m o= n mp)
o W
">1 s du
) 9o
6 s
) /
≤ C1n @0 061= We∆We=αgf x e dxdu
) 9o
6 D
) /
▄
Lemma 2.5:
Let 0 <σ< < 1 and let the sequence IuWXW>1∞ of nonnegative function uW∈ L∞ 0,1 such that ‖uW‖σ,α≤
λW ,α> 0 , λWM1≤βλW , n = 1,2, … where 0 <β< 1 and
‖uW‖t,α≤ CδW
)
σ=
) uλ
f = ∑∞W>1uW , f ∈ L ,α 0,1 We have ‖f‖ ,α≤ C @∑ δW /
σ=1λ
W ∞
W>1 D
) /
. (2.5)
Proof:
Put vW = uWσ then ∑∞W>1vW
/
σ≥ ∑∞W>1uW and
‖vW ‖1= 0 u61 Wσ x dx ≤λWσ
Therefore ‖vW ‖t≤δW
) u=1λ
W , 0 < r < 1, Put
σ= s then we has
‖f‖ ,α≤ yz vW
∞
W>1
y
` `
≤ C σ, p,β ∑∞W>1δW`=1
= C σ, p,β ∑ δW
/
σ=1
∞
W>1 λW .
≤ C σ, p,β @∑ δW
/
σ=1λ
W ∞
W>1 D
) /
. ▄
Lemma 2.6 (Petrushev P. P. popov V. A, 1987):
Let 0 <σ< < 1, { ≥ 0 . Then for every polynomial | ∈ P and every finite interval ∆ we have
'|∆|1 0 || x |}dx
∆ (
) ~≤ '1
|∆|0 || x | dx∆ (
)
/≤ c '1
|∆|0 || x |∆ }dx(
)
~ (2.6)
Wherec = c q, k .
Note: the following inequality
!∑ |xl l| #
)
/≤ !∑ |xl l|}#)~ (2.7)
can be used in following lemma
Lemma 2.7:
For ul= eψ?•m−ψ?•mp)e, ψ?•m ∈ E k, 2‚ and 0 <σ< v < 1. Then
‖ul‖t≤ 2‚m'
)
u=)σ(‖ul‖σ (2.8)
Proof:
From lemma (2.6) we have
‖ul‖t ∆< ≤ C|∆l|
) u=)σ$u"$
Cσ,α∆ƒ , C = C k, r
Where
∆<= '<=1?•m ,?<•m ( , v = 1,2 … , 2‚m , then the view of inequality (2.7) we get
‖ul‖t= „z‖ul‖t ∆t …
?•m
<>1
†
1 t
≤ C2‚m'1σ=1t(„z‖ul‖
σ∆… t ?•m
<>1
†
1 t
≤ C2‚m')σ=
)
u('∑ ‖ul‖σ∆
… σ ?•m
<>1 (
) u
≤ C2‚m')σ=
)
u(‖ul‖σ. ▄
3. Main result:
In this section we shall prove direct and inverse theorems in approximation theory for spline approximation in the space L ,α a, b , α> 0 , 0 < p < 1
Theorem 3.1 direct theorem):
Let f ∈ L ,α 0,1 ,α> 0 , 0 < p < 1 ,σ= α+ p=1 =1 and k ≥ 1
SW f ,α ≤ CK 'f, 1
Wα , L ,α; Bσα,α, ( n = 1,2, … , C = C α, p, k (3.1)
Theorem 3.2 (inverse theorem):
For f ∈ L ,α 0,1 , 0 < p < 1 ,σ= α+ p=1 =1 and k ≥ 1
Then:
K 'f,W1α , L ,α; Bσα,α, ( ≤ C n=α '∑
1
<!vαS< f ,α# λ W
<>1 (
)
λ
, n = 1,2, … (3.2)
Where λ= minIσ, 1X , C = C α, p, k .
Corollary 3.3:
For f ∈ L ,α 0,1 , 0 < p < 1 , k ≥ 1 and for ω be nondecreasing and nonnegative function on [0,1] such
that 2δω t ≥ω 2t for δ≥ 0, and
t ≥ 0 . Then
SW f ,α = ‰ 'm=βω n=1 ( , iff K 'f,
1
Wα , L ,α; Bασ,α, ( = ‰ 'm=βω n=1 (
Where 0 <δ+β<α, β≥ 0 .
Proof:
If K 'f,1
Wα , L ,α; Bσα,α, ( = ‰ 'm=βω n=1 (
Then by Theorem (3.1) (direct theorem) we have
SW f ,α ≤ CK 'f,W1α , L ,α; Bσα,α, ( = ‰ 'm=βω n=1 (.
Let SW f ,α= ‰ 'm=βω n=1 ( , 0 <δ+β<α
We need to prove that
ω mt ≤ 2m δω t , t ≥ 0, m ≥ 1. (3.3)
Since
ω 2t ≤ 2δω t , then ω 2`t ≤ 2`δω t , t ≥ 0, s ≥ 0.
Suppose that2`=1< Š < 2`. Then last inequalities give me
ω mt ≤ω 2`t ≤ 2`δω t ≤ 2m δω t .
From inequality (3.3) we get
ω mt ≤ !2 λ+ 1 #δω t , λ≥ 0, t ≥ 0 . (3.4)
Now using Theorem (inverse theorem) (3.2) to get
K @f,n1α , L ,α; Bσα,α, D ≤ C n=α ‹z
1
v !vαS< f ,α#
λ W
<>1
Œ
1 λ
The fact that δ+β<α gives
K @f,n1α , L ,α; Bσα,α, D ≤ C n=α ‹z
1
v 'vα=βω n=1 (
λ W
<>1
Œ
1 λ
Inequality (3.4) implies that
K 'f,W1α , L ,α; Bσα,α, ( ≤ C1 n=α ‹∑ v=1rvα=β'
W <+ 1(
δ
ω n=1 s λ W
<>1 Œ
)
λ
≤ C? n=α 'nδλ!ω n=1 #λ∑W vα=β=δ λ=1
<>1 (
)
λ
≤ C• n=α 'nα=β λ!S < f ,α#
λ
(
)
λ
= O 'm=βω n=1 ( ▄
Now we will offer some of the theorems that we need in the proof theorems above.
Theorem 3.4:
Let f ∈ Bσα, ,α, ,α> 0 , 0 < p < 1 , k ≥ 1 . then
f ∈ L ,α 0,1 and
E =1 f ,α≤ C‖f‖.σα,/,α,9 . (3.5)
Where E =1 f denotes the best approximation to f in L ,α 0,1 by means of all polynomials of degree
Proof:
Let ψ?•∈ E k, 2‚ such that
$f −ψ?•$
σ,α= E?• f σ,α ,‚>1,? ,…. (3.6)
Define
E?•m•) fσ,α ≤
1
•)γE?•m fσ,α ≤ E?•mp) f σ,α
(3.7)
For j = 1, 2 , … where γ= min 1,σ
Put u"= •ψ?•m−ψ?•mp)• then by using (3.6) and ((3.7)) we get
$u"M1$σγ,α = ‘ψ?•m•)−ψ?•m‘ σ,α γ
$u"M1$
σ,α γ
≥ ‘f −ψ?•m‘
σ,α γ
− ‘f −ψ?•m•)‘
σ,α γ
≥ E?•m f σ,α
γ
− E?•m•) f σ,α
γ
≥ 2E?•m•) f σ,α
γ
(3.8) And
$u"M1$σγ,α ≤ E?•m fσ,α γ
+ E?•m•) f σ,α
γ
≤’•E?•m f σ,α
γ
(3.9) Hence
$u"M1$σ,α ≤ '?•( )
γ$u
"$σ,α , i = 1,2, …. (3.10) Assume λ"= $u"$C
σ,α,δ"= 2
‚m, inequality (3.10) , (lemma 2.5) and lemma (2.7) gives
$∑ u∞">1 "$ ,α≤ C k, p,σ @∑ 2‚m'/σ=1($u"$
Cσ,α∆ƒ
∞
">1 D
) /
(3.11)
Inequalities (3.6), (3.7) and (3.11) give
2‚m'/σ=1($u"$
Cσ,α∆ƒ ≤ C p,σ 2
‚m'/σ=1(!E
?•m f σ,α+ E?•m=1 f σ,α#
≤ C p,σ 2‚m'/σ=1(!E
?•m=1 f σ,α#
Hence
$∑ u∞">1 "$ ,α≤ C k, p,σ '∑ 2‚m' /
σ=1(
∞
">6 E?•m f σ,α( ) /
≤ C k, p,σ r∑ @2‚m'
)
σ=
) /(E
?•m f σ,αD ∞
">6 s
) /
(3.12)
By definition of ψ?• and the fact that f ∈ Lσ,α 0,1 . Then we have the following series
∑ '∞">1 ψ?•m−ψ?•mp)( is a function f −ψ1 in Lσ,α 0,1
Inequality (3.12) implies that the same series converges in L ,α 0,1 , Hence in f ∈ L ,α 0,1 .
Also inequality (3.12) yields
E=1 f ,α ≤ $f −ψ1$ .
α≤ C k, p,α ‖f‖.σα,/,α,9 ▄
Theorem 3.5:
Forf ∈ Bσα,α, ,α> 0 ,σ= α+ p=1 =1, 0 < p < 1. Then
f ∈ L ,α 0,1 and SW f ,α≤ C k, p,α n=α‖f‖.σα,α,9, n = 1,2, … and k ≥ 1. (3.13)
Proof:
Since σ< , using the inequality (3), for f ∈ Bσα,σ,α, then f ∈ Bσα, ,α, . Then according to theorem (3.5) it follows that, for f ∈ Bσα,α, , then
f ∈ L ,α 0,1 and
E =1 f ,α≤ C‖f‖.σα,α,9 (3.14)
Suppose the function x = f u + v − u x , x ∈ 0,1 . Using inequality (3.14)we get
E =1 φ ,α≤ C‖φ‖.σα,α,9 (3.15)
E =1 φ ,α6,1 = inf“∈“
9p) '0 | f u + v − u x − P x e
=αg| dx 1
6 (
) /
= 1
<=n/)“∈“inf9p) !0 | f t − P t e =α2| dt <
n #
) /
= 1
∆)/“∈“inf9p) E =1 f ,α∆
Therefore we have
E =1 φ ,α6,1 =
1
∆)/“∈“inf9p) E =1 f ,α∆ (3.16)
On the other hand we obtain
$∆tφ . $C/,α”,)p9• = '061= 2e∆t e=αgf u + v − u x eσdx( )
σ
$∆tφ . $C
/,α”,)p9• =
1
|∆|)σ'0 e∆|∆|2 e
=αgf y eσdy
1= 2
6 (
)
σ, y = u + v − u x
= 1
|∆|)σ$∆|∆|2f . $Cσ,α—,up9|∆|•
Therefore where h = |∆|t we have
‖φ‖.σα,α,9= @0 @t=α$∆2φ . $
Cσ,α”,)p9•D
σ52
2 )
9
6 D
)
σ
= „0 „
‘∆•9φ. ‘
˜σ,α! —,up9|∆|• #
|∆|)σ2α †
σ 52
2 )
9
6 †
)
σ
= 1
|∆|)/r0 rh
=α$∆
Ef . $C
σ,α! —,up9|∆|• #s
σ 5E
E |∆|
9
6 s
)
σ .
‖f‖. ∆ = @0 @t=α$∆2f . $Cσ,α—,up9•D
σ52
2 up—
9
6 D
)
σ
(3.17)
Therefore (3.15), (3.16) and (3.17) gives for each interval ∆⊂ 0,1
E =1 f ,α∆ ≤ C‖f‖.σα,α—,…. (3.18)
Let x6, x1, x?, … , xl=1 such that 0 = x6< x1< ⋯ < xl=1< 1.
We define xlas
xl= sup ™y: xl=1< › ≤ 1, ‖f‖.σα,αœƒp),• ≤
1
n ‖f‖.σα,α”,) ž
For some m ≥ 1, x‚≤ 1 and ∆l= xl=1, xl . Then we have
∑ ‖f‖.σα,α∆ƒ
σ = ∑ 0 t=ασ$∆
2f . $C
σ,α!œƒp),œƒp9•#
σ 52
2 e∆ƒe
9 6 ‚ ">1 ‚
">1
= 0 t)9 =ασ
6 ∑ $∆2f . $Cσ,α!œƒp),œƒp9•#
σ 52
2
|∆ƒ|Ÿ 2
≤ 0 t)9 =ασ
6 $∆2f . $Cσ,α”,)p9•
σ 52
2
= ‖f‖. σ,α α 6,1
σ
Therefore
∑ ‖f‖.σα,α∆ƒ
σ ≤
‚
">1 ‖f‖.σα,α6,1
σ (3.19)
Hence
‖f‖.σα,α∆ƒ
σ =1
W‖f‖.σα,α6,1, i = 1,2, … , m − 1 (3.20)
Equality (3.19)and inequality (3.20)implies that there exists m ≤ n such that x‚= 1. For definition of
x6, x1, x?, … , x‚ it gives that
‖f‖.σα,α∆
ƒ
σ =1
W‖f‖.σα,α6,1, i = 1,2, … , m. (3.21)
Now we Compensation the estimate inequality (3.18) to the function in ∆l. In view of equality (3.21) we obtain
E =1 f ,α∆ƒ ≤
C
n 1σ
‖f‖.σα,α,9n,< i = 1,2, … , m. m ≤ n
SW f ,α ≤ '∑ E =1 f ,α∆
ƒ ‚
">1 (
) /
≤ C k, p,α n=α‖f‖.σα,α,9 ▄
Theorem (3.6):
For s ∈ S k, n, 0,1 , k, n ≥ 1, 0 < p < 1 ,α> 0 and = α+ p=1 =1 . Then
‖s‖.σα,α,9= C
‖ ‖/,α
opα , C = C α, p, k . (3.22)
Proof:
From equality ‖f‖. σ,α,9
α = '0 !t=αω f; t σ,α#σL52
2( 1
6 L
)
σ
Let s ∈ S k, n, 0,1 then we shall a partition of [0,1] such that
0 = x6< x1< ⋯ < x‚= 1 and polynomial P"∈ P=1, j = 1,2, … , m such that s x = P" x for x ∈ ∆".
According to the above and ∆Es x = 0 for x, x + kh ∈ ∆". Therefore
ω s; t σσ,α,α= sup
6¡E¡10 e∆Ee
=αgs x eσdx
1= 2
6
ω s; t σσ,α,α≤ C ^∑e∆me] 20 |e∆m =αgs x |σdxL
L+∑ 0 |e=αgs x |σdx
∆m∗
e∆me£¤¥ + 0 |e∆m∗∗ =αgs x |σdxž
(3.23) Where
∆"∗= !x"=1, x"=1+ kt# , ∆"∗∗= !x"− kt, x"#
By lemma (2.6)[4]we have
‖s‖Cσ,α'∆m∗(≤ Ct
)
αe∆"e=
) /‖s‖
C/,α!∆m# then
ω s; t σσ,α≤ C ^∑ e∆"e
σα
‖s‖Cσ/,α!∆m#+
e∆me] 2 L ∑ e∆"e
=σ
/
e∆me£¤¥ ‖s‖C/,α!∆m#
σ
(3.24)
Now applying inequality (3.24) for ω s; t σσ,α to get
‖s‖.σα,α,9= 0 ! t
=αω s; t σ,α#
σ52 2 1
6
≤ C 0 t =ασM1 '∑ e∆"eσα‖s‖C
/,α!∆m#
σ
e∆me] 2 L L+∑ te∆"e
=σ α‖s‖
C/,α!∆m#
σ
e∆me£¤¥ D dt
1
6
≤ C ∑ !e∆‚">1 "eσαL‖s‖C
/,α!∆m#
σ 0 t =ασM1dt L+e∆
"e=
σ
/‖s‖ C/,α!∆m#
σ 0 t•∆m•9 =ασ
6 dtŒ
∞ •∆m•
9
≤ C ∑ ‖s‖C
/,α!∆m#
σ ‚ ">1
≤ C '∑ ‖s‖C/, α!∆m#
‚
">1 (
σ
/ n 1=/σ
= C α, p, k n ασ‖s‖ C/,α6,1
σ ▄
5.4 Proofs Of Main Results:
Proof of theorem (3.1)(direct theorem): Since
SW f ,α ≤ C k, p,α n=α‖f‖.σα,α,9, n = 1,2, … and k ≥ 1.
Let f = f6+ f1 , f6∈ L ,α , f1∈ Bσα,α,
Then by theorem (3.5) it follows that
SW f ,α ≤ 2
) /r‖ f6‖C
/,α+ sup`∈¦ ,W‖f1− s‖C/,α s
≤ 2
) /'‖ f6‖C
/,α+ SW f1 ,α ( ≤ C '‖ f6‖C/,α+ n=α S
W f1 .σα,α,9 ( Hence
SW f ,α ≤ CK 'f,W1α , L ,α; Bσα,α, ( ▄
f = f − s?…+ s?…− s?…p) + ⋯ + s1− s6 + s6 Therefore
$∆Ef$C/,α≤ $∆E f − s?… $C/,α+ z$∆E s?•− s?•p) $C/,
α
<
‚>6
≤ 2 ‖f − s?…‖C/,α+ ∑<‚>6ω s?•− s?•p); h ,α (4.1)
Where s?…∈ S k, 2<
Let S?< f is an existence set in L ,α Hence
‖s?…− s?…p)‖C/,α ≤ 2=
)
/'‖f − s?…‖C
/,α+ ‖f − s?…p)‖C/,α (
≤ 2 @2=1 S?…p) f C/,αD
≤ CS?…p) f C/,α. (4.2) From (4.1) and (4.2) to get
$∆Ef$C/,α≤ 2 S?… f ,α+ 2h ∑<‚>62‚ S?•p) f ,α (4.3)
Let |h| <1
W , n = 2< then (4.3) gives
$∆Ef$C/,α≤ 2 S?… f ,α+
?
W9∑<‚>62‚ S?…p) f ,α
$∆Ef$C/,α≤?
9
W9∑?<t>6 r + 1 =1Et f ,α (4.4)
Since
S?… f ,α≤
?…9
W9E?… f ,α
2‚ S
?•p) f ,α≤ 2? =1∑? =1ℓ>?•p§ ℓ+ 1 =1Eℓ f ,α
Using (4.4), and(4.2), and( (3.22) to get For all m ≥ 0
K!f, 2=mα ,L
p,α; Bσα,α,k# ≤ ‖f−s2m‖Lp,α+2
=mα‖s
2m‖Bσα,α,k
≤S2km f L
p,α+2
=mα™∑ $s
2v−s2vp1$Bσ,α,k
σ
m
v>1 L L+‖s1‖Bσα,α,k
σ a
1
σ
Since‖s‖B σ,α,k
α ≤C‖s‖p,α
npα , we get
K!f,2=mα ,Lp,α; Bσα,α,k# ≤S2m k
+C2=mα™∑ @ 2vM1α$s2v−s2vp1$Lp,α
σ
D m
v>1 L L+‖s1‖Lp,α
σ a
1
σ
L≤C1'S2km f L p,α
σ L +2=mα^∑ '2v=1αS
2vp1 k
f L p,α(
σ
m
v>1 L + L‖f−s1‖Lp,α
σ + ‖f‖
Lp,α
σ a(
1
σ
≤C22=
mα^∑ ∑ 1 t't
αS
t k
f Lp,α(
σ
2v t>2vp1 m
v>1 + ' S1 k
f Lp,α(
σ
+ ‖f‖Lp,α
σ a
1
σ
≤C32=
mα^∑ tα2=1' S t k
f Lp,α(
σ
2m
t>1 + ‖f‖Lp,α
σ a
1
σ Since K-functional is monotony
Hence (3.2) is satisfy ▄ REFERENCES
Ahlberg, J.H., E.N. Nilson and J.L. Walsh, 1965. "Best approximation and convergence properties of higher-order spline approximations," J. Math. Mech., 14: 231-244.
Ahlberg; Nilson; Walsh, 1967. The Theory of Splines and Their Applications.
Chen, Wai-Kai, 2009."Feedback, Nonlinear, and Distributed Circuits". CRC Press. pp. 9–20. ISBN 978-1-4200-5881-9.
Fadil, H., 2010. “On the constrained spline approximation”, M.sc., thesis, Education College, Babylon university.
Hawraa A. Fadhil, 2010 "On The Constrained Spline Approximation", M. Sc. Thesis , Babylon University , Mathematical Department College of Education.
Judd, Kenneth L., 1998. “Numerical Methods in Economics”. MIT Press. p. 225. ISBN 978-0-262-10071-7. Petrushev, P.P., V.A. popov, 1987. "Rational approximation real function" (Encyclopedia of mathematics and its applications; v. 28) Cambridge University Press.
Saheb K. Al-Saidy, 2015. “Best Approximation in Space L ,¨ I α > 0 . 0 < < 1, ª = a, b By Means of Modulus of Smoothness” Mathematical Theory and Modeling, 5: 8.