<<

. 74
( 83 .)



>>

lim n Bn (f; x) ’ f(x) ’ D f(x)
! n| |
° »
n’∞
∈Ns0
| |62k’1

« 
k s
1 i
 ’ x)ÿ  D f(x):
j
= j (v (9)
!
∈Ns i=1 j=0
1 k
∈Ns
ÿ ;:::;ÿ
0 0
ÿ1 +···+ÿ = k
| |=2k
|ÿi |=2; i=1;:::; k


Building on these auxiliary results, we can now state and prove our main theorem. Note that
although Theorem 4 is a deep and nice result on the asymptotic behavior of the multivariate Bernstein
approximants, it does still not yet prove the asymptotic expansion. To do this, a careful analysis of
the coe cient functions in (9) is necessary.


Theorem 5. Let f ∈ C 2k (T ) with some k ∈ N. Then the sequence of Bernstein approximants
{Bn (f; x)}; deÿned in (8); possesses an asymptotic expansion of the form
k
c (x)
+ o(n’k )
Bn (f; x) = f(x) + for n ’ ∞: (10)
n
=1

The coe cient functions c (x) can be given explicitly; we have
« 
| |=2 s
1 i
 ’ x)ÿ 
j
c (x) = j (v (11)
| |’ ;
!
∈Ns i=1 j=0
1
∈Ns
=| |’ ÿ ;:::;ÿ
0 0
ÿ1 +···+ÿ =
+16| |62
|ÿi |¿2; i=1;:::;

with recursively computable numbers ; see (14) below.
i;




Proof. We use the following result, to be found for example in [7].
A sequence {Bn } possesses an asymptotic expansion of the desired form, if and only if for
m = 1; : : : ; k,
m’1
c
m
lim n Bn ’ f ’ = : cm (12)
n
n’∞
=1

exists and is di erent from zero. (Here and below, we set empty sums equal to zero.)
From (12), it is clear that the results due to Lai, as quoted above, are a big step towards the
proof of our Theorem, but as be seen below, there is still something to do.
We ÿrst have to make a further analysis of the functions S n . It is clear that if we have points
ÿ1 ; : : : ; ÿ ∈ Ns with |ÿi |¿2; i = 1; : : : ; , and if ¿ | |=2, then
0

|ÿ1 + · · · + ÿ | ¿ | |:
322 G. Walz / Journal of Computational and Applied Mathematics 122 (2000) 317“328


This means that
« 
| |’2 s
n
S (x) n(n ’ 1) · · · (n ’ + 1) i
 ’ x)ÿ 
j
= j (v
n| | n| |
=1 i=1 j=0
ÿ1 ;:::;ÿ ∈Ns
0
ÿ1 +···+ÿ =
|ÿi |¿2; i=1;:::;
« 
| |=2 s
n(n ’ 1) · · · (n ’ + 1) i
 ’ x)ÿ 
j
= j (v (13)
n| |
=1 i=1 j=0
1
∈Ns
ÿ ;:::;ÿ 0
ÿ1 +···+ÿ =
|ÿi |¿2; i=1;:::;

with
||
; | | even;
|| 2
=
2 | |’1
; | | odd:
2

Next, we observe that the expression
n(n ’ 1) · · · (n ’ + 1)
is a polynomial of exact degree in n, say

ni ;
n(n ’ 1) · · · (n ’ + 1) = i;
i=1

with coe cients , which can be computed by the recursion
i;

= 1; = 0; i = 1;
1; 1 i; 1

and
i; +1 := i’1; ’ ; ¿1; 16i6 + 1: (14)
i;

In particular,
’1
=1 and = (’1) ( ’ 1)! (15)
; 1;

for all .
Together with (13), it follows that
« 
| |=2 s
n
S (x) i; i
 ’ x)ÿ  :
j
= j (v (16)
n| | n | |’i
=1 i=1 i=1 j=0
1
∈Ns
ÿ ;:::;ÿ 0
ÿ1 +···+ÿ =
|ÿi |¿2; i=1;:::;

Rearranging this according to powers of n, we obtain
| |’1
S n (x) (x)
l;
= (17)
n| | nl
l= | |+1=2

with coe cient functions , which do not depend on n.
l;
G. Walz / Journal of Computational and Applied Mathematics 122 (2000) 317“328 323


For later use, we note that for | | even, say | | = 2 , the coe cient of the lowest power of n; ,
;
can be given explicitly: From (16), we deduce that
« 
s
i
 ’ x)ÿ 
j
(x) = j (v
; ;
i=1 j=0
ÿ1 ;:::;ÿ ∈Ns
0
ÿ1 +···+ÿ =
|ÿi |¿2; i=1;:::;
« 
s
i
 ’ x)ÿ  :
j
= j (v (18)
i=1 j=0
ÿ1 ;:::;ÿ ∈Ns
0
ÿ1 +···+ÿ =2
|ÿi |=2; i=1;:::;


From (17), it follows that the sum over all these expressions itself is of the form

1 S n (x) d1; k (x) d2; k (x) dk; k (x)
+ O(n’(k+1) ):
D f(x) = + + ··· + (19)
!n n n n
|| 2 k
∈Ns0
| |62k’1


We now make the

Claim. For all 6k; the coe cient functions dj; in (19) satisfy

dj; (x) = dj; ’1 (x) j = 1; : : : ; ’ 2

and

d ’1; (x) = d ’1; ’1 (x) + (x) (20)
’1;
∈Ns
0
| |=2 ’2


with from (17).
’1; 2 ’1


Proof of Claim. The proof is by induction. For k = 1, there is nothing to show, while for k = 2,
the only relation to prove is

d1; 2 (x) = d1; 1 (x) + (x):
1;
∈Ns
0
| |=2


But this is true, since d1; 1 = 0.
Now we assume that the claim is true for , and prove it for + 1.
From (17) and (19) and the induction hypothesis,

1 Sn
D f(x)
! n| |
∈Ns0
| |62 +1
324 G. Walz / Journal of Computational and Applied Mathematics 122 (2000) 317“328

2 ’1 2
d1; (x) d ; (x) (x) (x)
l; l;
’( +1)
= + ··· + + O(n )+ +
n n nl nl
∈Ns
l= l= +1
∈Ns 0
0
| |=2 +1
| |=2

d1; +1 (x) d; +1 (x) d +1; +1 (x)
+ O(n’( +2) )
= + ··· + +

<<

. 74
( 83 .)



>>