Applied Mathematics E-Notes, 5(2005), 261-268 c ISSN 1607-2510

Available free at mirror sites of http://www.math.nthu.edu.tw/amen/

ON THE EIGENFUNCTIONS OF A MODIFIED
DURRMEYER OPERATOR AND APPLICATION

Germain E. Randriambelosoa

Received 7 October 2004

Abstract
We show that the eigenfunctions of a modied Durrmeyer operator are or-
thogonal polynomials related to Jacobi polynomials. We give as application a
fast drawing of a degree n Bezier curve approximation for given (r + 1) points,
where n does not depend on r and the rate of approximation being O(n
1/2
).
1 Introduction
Durrmeyer [6] has introduced a Bernstein type operator of degree n dened by
M
n
(f, x) = (n + 1)
n

i=0
b
n
i
(x)
_
1
0
f(u)b
n
i
(u)du, (1)
where f(u) is an integrable function on [0, 1] and b
n
i
(t) =
_
n
i
_
t
i
(1 t)
ni
, i = 0, ..., n,
are the degree n Bernstein polynomials basis.
Many authors have studied the operator M
n
(f, x) [2, 3, 4, 9]. However the operator
M
n
(, x) does not possess the property of endpoint interpolation which is essential for
interpolation problem. For this reason we consider in this paper a modied kind of the
Durrmeyer-Bernstein operator introduced by Goodman and Sharma [7], dened by
U
n
(f, x) = b
n
0
(x)f(0) + (n 1)
n1

i=1
a
i
b
n
i
(x) + b
n
n
(x)f(1), x [0, 1], (2)
where a
i
=
_
1
0
b
n2
i1
(u)f(u)du.
Similar operators dened by
P
n
(f, x) = n
n1

i=1
b
n
i
(x)
_
1
0
f(u)b
n1
i1
(u)du + (1 x)
n
f(0)
were recently introduced by Gupta and Maheshwari [10].

Mathematics Subject Classications: 65D07

Departement of Mathematics and Informatic, University of Tananarive, P. O. Box 906 Tananarive

101 Madagascar.
261
262 Eigenfunctions of a Modied Durrmeyer Operator
The operator U
n
(f, x) satises the endpoint conditions
U
n
(f, 0) = f(0), U
n
(f, 1) = f(1),
and have interesting properties [7]. In particular, U
n
(, x) is a linear positive operator
such that U
n
(1, x) = 1, and Un(f) f

= f

, where f

= sup
t[0,1]
|f(t)|.
In section 2 we establish a common property [2] shared by M
n
and U
n
by giving
the expression of U
n
(t
k
, x) in terms of the Bernstein basis b
p
i
(x), i = 0, ..., p with
p = min(n, k). Then we show that the eigenfunctions of the operator U
n
are orthogonal
polynomials.
In section 3 we present a degree n approximation of a set of (r + 1) given points
q
0
, q
1
, ..., q
r
in R
d
where n does not depend on r. More precisely we approximate the
polygonal line passing through the given points q
i
by a Bezier curve using the operator
U
n
(f, t) expressed in term of the eigenfunctions. This method yields a fast drawing
of the Bezier curve U
n
(f, t) =

n
i=0
p
i
b
n
i
(t) with only O(n) multiplications while the
usual de Casteljau algorithm [6] using a repeated linear interpolation of the control
points p
i
, i = 0, ..., n needs O(n
2
) multiplications.
2 Some Basic Properties
We give below useful basic properties of the operator U
n
. In particular,
If f(t) is a degree k polynomial with k n then U
n
(f, x) is a degree k polynomial.
The eigenfunctions of U
n
are orthogonal polynomials.
Goodman and Sharma [7] have given the expression of U
n
(t
k
, x) in terms of the
monomial basis (1, x, , x
k
). We shall show that in fact U
n
(t
k
, x) is of degree p =
min(n, k) and it can be given in terms of the Bernstein basis b
p
i
(x). This property is
also shared by M
n
and plays an important role in the next section.
PROPOSITION 1. (i). For all integers n 1, k 1, let p = min(n, k) and
q = max(n, k). Then
n

i=0
_
k + i
k
_
b
n
i
(t) =
k

i=0
_
n + i
n
_
b
k
i
(t), (3)
n

i=0
k
_
k + i 1
k
_
b
n
i
(t) =
k

i=0
n
_
n + i 1
n
_
b
k
i
(t). (4)
(ii). U
n
(t
k
, x) is a polynomial of degree p such that
U
n
(t
k
, x) =
(n 1)!(k 1)!
(n + k 1)!
p

i=0

i
b
p
i
(x), (5)
with
i
= q
_
q+i1
q
_
.
G. E. Randriambelosoa 263
PROOF. (i). If n = k the identity (3) is obvious. Assume that n > k and let
u
n,k
(x, y) =
1
k!
x
k
(x + y)
n
, then we have

k
x
k
u
n,k
(x, y) =
1
k!

k
x
k
n

i=0
_
n
i
_
x
k+i
y
ni
=
n

i=0
_
n
i
__
k + i
k
_
x
i
y
ni

n
x
n
u
k,n
(x, y) =
1
n!

n
x
n
k

i=0
_
k
i
_
x
n+i
y
ki
=
k

i=0
_
k
i
__
n + i
k
_
x
i
y
ki
.
For y = 1 x, the above equations give

k
x
k
u
n,k
(x, y) =
n

i=0
_
k + i
k
_
b
n
i
(x), (6)

n
x
n
u
k,n
(x, y) =
k

i=0
_
n + i
n
_
b
k
i
(x). (7)
On the other hand using Liebnitz formula for derivative we obtain

k
x
k
u
n,k
(x, y) =
1
k!
k

i=0
_
k
i
_

ki
x
ki
x
k

i
x
i
(x + y)
n
=
k

i=0
_
k
i
__
n
i
_
x
i
(x + y)
ni
,

n
x
n
u
k,n
(x, y) =
1
n!
n

i=0
_
n
i
_

ni
x
ni
x
n

i
x
i
(x + y)
k
. (8)
The assumption n > k implies that

i
x
i
(x + y)k = 0 for i = k + 1, ..., n. Then

n
x
n
u
k,n
(x, y) =
k

i=0
_
k
i
__
n
i
_
x
i
(x + y)
ki
. (9)
Setting y = 1 x, (8) is equal to (9), therefore (6) is equal to (7) and we get (3). Now
using (3) and the degree elevation identity [6]
kb
k1
i
(x) = (i + 1)b
k
i+1
(x) + (k i)b
k
i
(x),
we have
n

i=0
_
k + i 1
k
_
b
n
i
(x) =
n

i=0
_
k + i
k
_
b
n
i
(x)
n

i=0
_
k + i 1
k 1
_
b
n
i
(x)
=
k

i=0
_
n + i
n
_
b
k
i
(x)
k1

i=0
_
n + i
n
_
b
k1
i
(x)
=
k

i=0
__
n + i
n
_

_
n + i 1
n
_
i
k

_
n + i
n
_
k i
k
_
b
k
i
(x)
=
n
k
k

i=0
_
n + i 1
n
_
b
k
i
(x).
264 Eigenfunctions of a Modied Durrmeyer Operator
The proof of part 1 is complete.
For instance we have the following remarkable results:
for k = 1 and n 1,

n
i=0
ib
n
i
(x) = nx,
for k = 2 and n 2,

n
i=0
i(i + 1)b
n
i
(x) = nb
2
1
(x) + n(n + 1)b
2
(x).
(ii). By the denition (2) of the operator U
n
, we have
U
n
(t
k
, x) = (n 1)
n1

i=1
b
n
i
(x)
_
1
0
t
k
b
n2
i1
(t)dt + b
n
n
(x).
We can write
t
k
b
n2
i1
(t) =
_
n2
i1
_
_
n+k2
k+i1
_b
n+k2
k+i1
(t),
and using the well known result [6]
_
1
0
b
n
i
(t)dt = 1/(n + 1), we obtain
U
n
(t
k
, x) =
(n 1)!(k 1)!
(n + k 1)!
n1

i=1
k
_
k + i 1
k
_
b
n
i
(x) + b
n
n
(x)
=
(n 1)!(k 1)!
(n + k 1)!
n

i=0
k
_
k + i 1
k
_
b
n
i
(x).
From the identity (4), we get
U
n
(t
k
, x) =
(n 1)!(k 1)!
(n + k 1)!
n

i=0
q
_
q + i 1
q
_
b
p
i
(x),
and

i
= q
_
q + i 1
q
_
,
with q = max(n, k) and p = min(n, k). The proof is complete.
We consider the Hilbert space L
2
[0, 1] with the inner product
f, g
(,)
=
_
1
0
f(t)g(t)
(,)
(t)dt,
where
(,)
(t) = t

(1 t)

. from [7, Theorem 4], the operator U

n
has eigenvalues

n,m
=
(n 1)!n!
(n 1 + m)!(n m)!
, m = 0, 1, ..., n,
and for m 2 corresponding eigenfunctions F
m2
(x) where
F
m
(x) =
d
m
dx
m
x
m+1
(1 x)
m+1
. (10)
G. E. Randriambelosoa 265
Since
n,0
=
n,1
= 1, we see by (2) and (5) that the corresponding eigenfunctions are
1 and x. Notice that the eigenfunctions F
m
(x) do not depend on n.
PROPOSITION 2. (i) The eigenfunctions F
m
(x) are orthogonal polynomials in
L
2
[0, 1] with respect to the inner product f, g
(1,1)
and we have
_
1
0
f
m
(t)f
j
(t)
(1,1)
(t)dt = c
m

mj
,
where
mj
is the Kronecker symbol and c
m
= (m!)
2
(m + 1)/(2m + 3)(m + 2).
(ii) The following recursion formula holds:
(n + 1)(n + 3)F
n+1
(x) = (2n + 3)(n + 2)xF
n
(x) (n + 1)(n + 2)F
n1
(x). (11)
PROOF. (i). On the interval [0, 1] Jacobi polynomials of equal parameters =
can be dened by the Rodrigues formula [1] (upto a constant factor).
P
a
n
(x) = (x x
2
)

d
n
dx
n
(x x
2
)
n+
, x [0, 1], (12)
and the polynomials P
n
(x) are orthogonal in L
2
[0, 1] with respect to the inner product
f, g
(,)
. From (12) we obtain
F
n
(x) = x(1 x)P
1
n
(x). (13)
Then, x(1 x)P
1
n
(x)P
1
m
(x) = x
1
(1 x)
1
F
n
(x)F
m
(x), which gives
P
n
(x), P
m
(x)
(1,1)
= F
n
(x), F
m
(x)
(1,1)
= 0, m = n.
For m = n, a repeated integration by parts yields F
m

2
L
2
[0,1]
= c
m
.
(ii). Jacobi orthogonal polynomials P
1
n
satisfy the three-term recursion formula
(n + 1)(n + 3)P
1
n+1
(x) = (2n + 3)(n + 2)xP
1
n
(x) (n + 1)(n + 2)P
1
n1
(x). (14)
From (13) and (14) we obtain the recursion formula (11).
PROPOSITION 3. (i). Let G
0
=
_
f L
1
[0, 1] : f(0) = f(1) = 0
_
. Then for f, g
G
0
, we have
U
n
(f), g
(1,1)
= f, U
n
(g)
(1,1)
,
i.e. the operator U
n
is self adjoint in G
0
and
n,m
= 0, m > n.
(ii). For any f G
0
, the operator U
n
can be expressed in term of F
m
(x) as
U
n
(f, x) =
n

m=0

n,m+2
a
n,m
(f)F
m
(x), (15)
where a
n,m
(f) are the Fourier coecients of f given by
a
n,m
(f) =
1
c
m
f, F
m

(1,1)
.
266 Eigenfunctions of a Modied Durrmeyer Operator
PROOF. (i). Let f, g G
0
. Then
U
n
(f), g
(1,1)
= (n 1)
_
1
0
_
n1

i=1
b
n
i
(x)(x)
_
1
0
b
n2
i1
(t)f(t)dt
_
g(x)
(1,1)
(x)dx.
On the other hand we have b
n
i
(x)
(1,1)
(x) =
(n1)n
i(ni)
b
n2
i1
, hence
U
n
(f), g
(1,1)
= (n 1)
_
1
0
_
n1

i=1
b
n
i
(x)(x)
_
1
0
b
n2
i1
(t)g(t)dt
_
f(x)
(1,1)
(x)dx
= f, U
n
(g)
(1,1)
.
Furthermore we have
n,m
= 0 if m > n. Indeed if r n and m > n we have
U
n
(F
m
), F
r

(1,1)
= F
m
, F
r

(1,1)

n,r
= 0,
now by Proposition 1, U
n
(F
m
) is a degree n polynomial orthogonal to all polynomials
of degree n, then U
n
(F
m
) = 0 and
n,m
= 0, m > n.
(ii). For integrable function f on [0, 1], U
n
(f, x) is a polynomial of degree n. Thus
there are reals
n,m
(f) for 0 m n such that
U
n
(f, x) =
n

m=0

n,m
(f)F
m
(x).
For r n we have, since U
n
is self adjoint
U
n
(f), F
r

(1,1)
=
n

m=0

n,m
(f) F
m
, F
r

(,1)
= c
r

n,r
(f)
= f, U
n
(F
r
)
(1,1)
=
n,r+2
f, F
r

(1,1)
,
thus

n,r
(f) =
1
c
r

n,r+2
f, F
r

(1,1)
.
and the proof is complete.
3 Application
The expression (15) of U
n
(f, x) is suitable for computation, we shall use this expression
for the approximation of given points q
0
, ..., q
r
in the ane space R
d
by the Bezier curve
U
n
(f, x). We can always assume that q
0
= q
r
= 0. Let 0 = t
0
< t
1
< < t
r1
<
t
r
= 1 be a subdivision of the interval [0, 1] and f the piecewise ane function such
that f(t
i
) = q
i
, i = 0, ..., r, dened on [0, 1] by
f(u) = ((t
i+1ti
)q
i
+ (u t
i
)q
i+1
)/(t
i+1
t
i
), u [t
i
, t
i+1
].
G. E. Randriambelosoa 267
PROPOSITION 4. Let d be a distance in R
d
associated with a norm denoted .
(i). For any integer n, one has the estimate for i = 1, ..., r,
d(U
n
(f, t
i
), q
i
) = 2n
1/2
(16)
where = max
0hr

h
and
h
= (q
h+1
q
h
)/(t
h+1
t
h
).
(ii). Let A
k
= f, F
k

(1,1)
. Then U
n
(f, x) =

n
k=0

n,k+2
c
k
A
k
F
k
(x) with
A
k
=
1
(k + 2)(k + 1)
r1

i=1
F
k
(t
i
)
2
i
, k = 0, ..., r, (17)
where
2
i
=
i

i1
.
PROOF. (i). Inequality (16) is a consequence of the next estimation given by [7,
Theorem 11]
U
n
(f) f
k
= 2(f; n
1/2
),
where (f; h) = sup
(x,t)H
|f(x + t) f(x)|, H =
_
(x, t), /|t| = h, (x + t, x) [0, 1]
2
_
,
is the moduli of continuity of f.
(ii). It is known [7] that F
m
(x) satises the dierential equation
x(1 x)y
xx
+ (m + 2)(m + 1)y = 0,
and it follows immediately that
A
k
= e
k
_
1
0
f(u)F

k
(u)du = e
k
r1

i=0
_
ti+1
t
i
f(u)F

k(u)du
= e
k
_
q
r
F

m
(1) q
0
F

m
(0)
r1
F
m
(1) +
0
F
m
(0) +
r1

i=1
F
m
(t
i
)
2
i
_
,
with e
k
=
1
(k+2)(k+1)
. Since q
0
= q
r
= 0 and F
m
(1) = F
m
(0) = 0, we obtain (17).
The three-term recursion formula (11) provides an ecient and fast algorithm for
computing the values of U
n
(f) expressed in term of the polynomials F
m
(x) with only
O(n) multiplications while the de Casteljau algorithm [6] related to Bernstein basis
polynomials needs O(n
2
) multiplications.
Acknowledgment. The author would like to acknowledge the suggestions and
recommendations of an anonymous referee who has contributed to improve the nal
version of the paper.
References
[1] M. Abramowitz and I. A. Stegun (Eds.), Orthogonal Polynomials, Ch. 22 in Hand-
book of Mathematical Functions with Formulas, Graphs, and Mathematical Ta-
bles, 9-th printing. New York: Dover, (1972), 771802.
268 Eigenfunctions of a Modied Durrmeyer Operator
[2] P. N. Agrawal and V. Gupta, Simultaneous approximation by linear combination
of modied Bernstein polynomials, Bull Greek Math. Soc. 39 (1989), 2943.
[3] M. M. Derriennic, Sur lapproximation de fonctions integrables sur [0, 1] par des
polynomes de Bernstein modies, J. Approx. Theory, 31(4)(1981), 325343 (in
French).
[4] Z. Ditzian and K. Ivanov, Bernstein type operators and their derivatives, J. Ap-
prox. Theory 56(1989), 72-90.
[5] J. L. Durrmeyer, Une formule dinversion de la transformeee de Laplace Applica-
tions a la theorie des moments, These de 3e cycle, Faculte des Sciences de Paris,
(1967).
[6] G. Farin, Curves and Surfaces for Computer Aided Geometric Design, Academic
Press, New York, 1988.
[7] T. N. T. Goodman and A. Sharma, A Bernstein type operator on the simplex,
Math. Balkanica (N.S.), 5(1991), 129145
[8] G. Szeg o, Orthogonal Polynomials, A. M. S. Colloquim Series, Vol 23, Revised
edition, 1959.
[9] V. Gupta, A note on modied Bernstein polynomials, Pure and Applied Math Sci.
44(1-2)(1996), 13.
[10] V. Gupta and P. Maheshwari, Bezier variant of a new Durrmeyer type operators.
Riv. Mat. Univ. Parma (7) 2 (2003), 921.