Skip to main content
The Scientific World Journal logoLink to The Scientific World Journal
. 2014 Feb 10;2014:102062. doi: 10.1155/2014/102062

Approximation of Bivariate Functions via Smooth Extensions

Zhihua Zhang 1,*
PMCID: PMC3934623  PMID: 24683316

Abstract

For a smooth bivariate function defined on a general domain with arbitrary shape, it is difficult to do Fourier approximation or wavelet approximation. In order to solve these problems, in this paper, we give an extension of the bivariate function on a general domain with arbitrary shape to a smooth, periodic function in the whole space or to a smooth, compactly supported function in the whole space. These smooth extensions have simple and clear representations which are determined by this bivariate function and some polynomials. After that, we expand the smooth, periodic function into a Fourier series or a periodic wavelet series or we expand the smooth, compactly supported function into a wavelet series. Since our extensions are smooth, the obtained Fourier coefficients or wavelet coefficients decay very fast. Since our extension tools are polynomials, the moment theorem shows that a lot of wavelet coefficients vanish. From this, with the help of well-known approximation theorems, using our extension methods, the Fourier approximation and the wavelet approximation of the bivariate function on the general domain with small error are obtained.

1. Introduction

In the recent several decades, various approximation tools have been widely developed [114]. For example, a smooth periodic function can be approximated by trigonometric polynomials; a square-integrable smooth function can be expanded into a wavelet series and be approximated by partial sum of the wavelet series; and a smooth function on a cube can be approximated well by polynomials. However, for a smooth function on a general domain with arbitrary shape, even if it is infinitely many time differentiable, it is difficult to do Fourier approximation or wavelet approximation. In this paper, we will extend a function on general domain with arbitrary shape to a smooth, periodic function in the whole space or to a smooth, compactly supported function in the whole space. After that, it will be easy to do Fourier approximation or wavelet approximation. For the higher-dimensional case, the method of smooth extensions is similar to that in the two-dimensional case, but the representations of smooth extensions will be too complicated. Therefore, in this paper, we mainly consider the smooth extension of a bivariate function on a planar domain. By the way, for the one-dimensional case, since the bounded domain is reduced to a closed interval, the smooth extension can be regarded as a corollary of the two-dimensional case.

This paper is organized as follows. In Section 2, we state the main theorems on the smooth extension of the function on the general domain and their applications. In Sections 3 and 4, we give a general method of smooth extensions and complete the proofs of the main theorems. In Section 5, we use our extension method to discuss two important special cases of smooth extensions.

Throughout this paper, we denote T = [0,1]2 and the interior of T by T o and always assume that Ω is a simply connected domain. We say that fC q(Ω) if the derivatives (∂i+j f/∂x iy j) are continuous on Ω for 0 ≤ i + jq. We say that fC (Ω) if all derivatives (∂i+j f/∂x iy j) are continuous on Ω for i, j +. We say that a function h(x, y) is a γ-periodic function if h(x + γk, y + γl) = h(x, y)  ((x, y) ∈ T; k, l), where γ is an integer. We appoint that 0! = 1 and the notation [α] is the integral part of the real number α.

2. Main Theorems and Applications

In this section, we state the main results of smooth extensions and their applications in Fourier analysis and wavelet analysis.

2.1. Main Theorems

Our main theorems are stated as follows.

Theorem 1 —

Let fC (Ω), where ΩT o and the boundary ∂Ω is a piecewise infinitely many time smooth curve. Then for any r + there is a function FC r(T) such that

  • (i)

    F(x, y) = f(x, y)  ((x, y) ∈ Ω);

  • (ii)

    (∂i+j F/∂x iy j)(x, y) = 0 on the boundary ∂T for 0 ≤ i + jr;

  • (iii)
    on the complement TΩ, F(x, y) can be expressed locally in the forms
    j=0L  ξj(x)yj,or  j=0Lηj(y)xj,or  i,j=0Lcijxiyj, (1)

where L is a positive integer and each coefficient c ij is constant.

Theorem 2 —

Let fC (Ω), where Ω is stated as in Theorem 1. Then, for any r +, there exists a 1-periodic function F pC r(ℝ2) such that F p(x, y) = f(x, y)  ((x, y) ∈ Ω).

Theorem 3 —

Let fC (Ω), where Ω is stated as in Theorem 1. Then, for any r +, there exists a function F cC r(ℝ2) with compact support T such that F c(x, y) = f(x, y)  ((x, y) ∈ Ω).

In Sections 3 and 4, we give constructive proofs of Theorems 13. In these three theorems, we assume that fC (Ω). If fC q(Ω) (q is a nonnegative integer), by using the similar method of arguments of Theorems 13, we also can obtain the corresponding results.

2.2. Applications

Here we show some applications of these theorems.

2.2.1. Approximation by Polynomials

Let F be the smooth extension of f from Ω to T which is stated as in Theorem 1. Then FC r(T) and F = f on Ω. By ΔN, denote the set of all bivariate polynomials in the form ∑n1,n2=−N N c n1,n2 x n1 y n2. Then

infPΔN||fP||Lp(Ω)infPΔN||FP||Lp(T), (2)

where ||·||Lp(D) is the norm of the space L p(D). The right-hand side of formula (2) is the best approximation of the extension F in ΔN. By (2), we know that the approximation problem of f by polynomials on a domain Ω is reduced to the well-known approximation problem of its smooth extension F by polynomials on the square T [4, 10].

2.2.2. Fourier Analysis

(i) Approximation by Trigonometric Polynomials. Let F p be the smooth periodic extension of f as in Theorem 2. Then F pC r(ℝ2) and F p = f on Ω. By the well-known results [5, 10], we know that the smooth periodic function F p can be approximated by bivariate trigonometric polynomials very well. Its approximation error can be estimated by the modulus of continuity of its r time derivatives.

By ΔN*, denote the set of all bivariate trigonometric polynomials in the form

n1,n2=NNcn1,n2e2πi(n1x+n2y). (3)

By Theorem 2, we have

infPΔN||fP||Lp(Ω)minPΔN||FpP||Lp(T). (4)

From this and Theorem 2, we see that the approximation problem of f on Ω by trigonometric polynomials is reduced to a well-known approximation problem of smooth periodic functions [5, 7, 10].

(ii) Fourier Series. We expand F p into a Fourier series [9]

Fp(x,y)=(n1,n2)2τn1,n2e2πi(n1x+n2y), (5)

where τ n1,n2 = ∫T F p(x, y)e −2πi(n1x+n2y) dxdy. By Theorem 2, we obtain that, for (x, y) ∈ Ω,

f(x,y)=(n1,n2)2τn1,n2e2πi(n1x+n2y). (6)

Denote the partial sum

sn1,n2(x,y)=k1=0n1k2=0n2τk1,k2e2πi(k1x+k2y). (7)

Then we have

||f(x,y)sn1,n2(x,y)||Lp(Ω)||Fp(x,y)sn1,n2(x,y)||Lp(T). (8)

Since the smooth periodic function F p can be approximated well by the partial sum of its Fourier series [5, 7, 10], from this inequality, we see that we have constructed a trigonometric polynomial s n1,n2(x, y) which can approximate to f on Ω very well.

(iii) Odd (Even) Periodic Extension. Let F be the smooth extension of f from Ω to T which is stated in Theorem 1. Define F o on [−1,1]2 by

Fo(x,y)={F(x,y),(x,y)[0,1]2,F(x,y),(x,y)[1,0]×[0,1],F(x,y),(x,y)[1,0]2,F(x,y),(x,y)[0,1]×[1,0]. (9)

Then F o is an odd function. By Theorem 1, we have F oC r([−1,1]2) and (∂i+j F o/∂x iy j)(x, y) = 0 on ∂([−1,1]2) for 0 ≤ i + jr. Again, doing a 2-periodic extension, we obtain a 2-periodic odd function F p o and F p oC r(ℝ2). By the well-known results [5, 7, 10], F p o can be approximated by sine polynomials very well. Moreover, F p o can be expanded into the Fourier sine series; that is,

Fpo(x,y)=n1=1  n2=1αn1,n2sin(πn1x)sin(πn2y), (10)

where the coefficients α n1,n2 = 4∫T F p o(x, y)sin(πn 1 x)sin(πn 2 y) dxdy [9]. Considering the approximation of F p o by the partial sum, the Fejer sum, and the Vallee-Poussin sum [7, 14] of the Fourier sine series of F p o, we will obtain the approximation of the original function f on Ω by sine polynomials.

Define F e on [−1,1]2 as follows:

Fe(x,y)={F(x,y),(x,y)[0,1]2,F(x,y),(x,y)[1,0]×[0,1],F(x,y),(x,y)[1,0]2,F(x,y),(x,y)[0,1]×[1,0]. (11)

Then F e is an even function on [−1,1]2. By Theorem 1, F eC r([−1,1]2) and (∂i+j F e/∂x i  ∂y j)(x, y) = 0 on ∂([−1,1]2) for 0 ≤ i + jr. Again, doing a 2-periodic extension, we obtain a 2-periodic even function F p e and F p eC r(ℝ2). By the well-known result [5, 10], F p e can be approximated by cosine polynomials very well. Moreover, F p e can be expanded into the Fourier cosine series. Considering the partial sum, the Fejer sum, and the Vallee-Poussin sum [5, 7, 14] of the Fourier cosine series of F p e, we will obtain the approximation of the original function f on Ω by cosine polynomials.

2.2.3. Wavelet Analysis

(i) Periodic Wavelet Series. Let F pC r(ℝ2) be stated in Theorem 2. Let {ψ μ}1 3 be a bivariate smooth wavelet [2]. Then, under a mild condition, the families

Ψper:={1}{ψμ,m,nper,μ=1,2,3;  m+;  n=(n1,n2),n1,n2=0,,2m1},where  ψμ,m,nper=l2ψμ,m,n(·+l),ψμ,m,n=2mψμ(2m·n) (12)

are a periodic wavelet basis. We expand F p into a periodic wavelet series [2]

Fp=d0,0+μ=13m=0n1,n2=02m1dμ,m,nψμ,m,nper. (13)

From this, we can realize the wavelet approximation of f on Ω, for example, if r = 2, its partial sum

s2M(Fp)=d0,0+μ=13m=0M1n1,n2=02m1dμ,m,nψμ,m,nper (14)

satisfies ||F ps 2M(F p)||L2(T) = O(2−2M). From this and F p(x, y) = f(x, y)  ((x, y) ∈ Ω), we will obtain an estimate of wavelet approximation for a smooth function f on the domain Ω.

(ii) Wavelet Approximation. Let F c be the smooth function with a compact support as in Theorem 3. Let ψ be a univariate Daubechies wavelet and ϕ be the corresponding scaling function [2]. Denoting

ψ1(x,y)=ϕ(x)ψ(y),ψ2(x,y)=ψ(x)ϕ(y),  ψ3(x,y)=ψ(x)ψ(y), (15)

then {ψ μ(x, y)}μ=1 3 is a smooth tensor product wavelet. We expand F c into the wavelet series

Fc(x,y)=μ=13mn2cμ,m,nψμ,m,n(x,y), (16)

where ψ μ,m,n = 2m ψ μ(2m · −n) and the wavelet coefficients

cμ,m,n=2Fc(x,y)ψ¯μ,m,n(x,y)dxdy  =TF(x,y)ψ¯μ,m,n(x,y)dxdy. (17)

Since F c is a smooth function, the wavelet coefficients c μ,m,n decay fast.

On the other hand, since F c(x, y) = 0, (x, y) ∈ ℝ2T, a lot of wavelet coefficients vanish. In fact, when m 0 and n 0 2 satisfy supp⁡ψ μ,m0,n0 ⊂ (ℝ2T), we have c μ,m0,n0 = 0. Besides, by condition (iii) in Theorem 1, we know that F is univariate or bivariate polynomials on TΩ. By the moment theorem [2], we know that more wavelet coefficients vanish.

For example, let m* ∈ and n* = (n 1*, n 2*) ∈ 2 satisfy supp⁡ψ m*,n2* ⊂ [0, α*], where α* = inf⁡{g(x), x 1xx 2}. Then we have

c1,m,n=2m(0x1+x1x2+x21)ϕ¯m,n1(x)×(0αψ¯m,n2(y)F(x,y)dy)dx  =  :I1+I2+I3. (18)

By Lemma 8, we know that

F(x,y)=j=0Lξj(x)yj,(x,y)E1, (19)

where E 1 = {(x, y) : x 1xx 2, 0 ≤ yg(x)} and g(x) ≥ α*(x 1xx 2). So

I2=x1x2ϕ¯m,n1(x)(0α  ψ¯m,n2(y)(j=0Lξj(x)yj)dy)dx. (20)

If the Daubechies wavelet ψ chosen by us is L time smooth, then, by using the moment theorem and supp⁡ψ m*,n2* ⊂ [0, α*], we have

0αψ¯m,n2(y)yjdy=ψ¯m,n2(y)yjdy=0,(0j2r+1). (21)

So I 2 = 0. Similarly, since F(x, y) is bivariate polynomials on rectangles H 1 and H 3 (see Lemma 11), we have I 1 = I 3 = 0. Furthermore, by (18), we get c 1,m*,n* = 0.

Therefore, the partial sum of the wavelet series (16) can approximate to F c very well and few wavelet coefficients can reconstruct F c. Since F c = f on Ω, the partial sum of the wavelet series (16) can approximate to the original function f on the domain Ω very well.

3. Proofs of the Main Theorems

We first give a partition of the complement TΩ.

3.1. Partition of the Complement of the Domain Ω in T

Since ΩT o and ∂Ω is a piecewise infinitely many time smooth curve, without loss of generality, we can divide the complement TΩ into some rectangles and some trapezoids with a curved side. For convenience of representation, we assume that we can choose four point (x ν, y ν)∈∂Ω  (ν = 1,2, 3,4) such that TΩ can be divided into the four rectangles

H1=[0,x1]×[0,y1],H2=[x2,1]×[0,y2],H3=[x3,1]×[y3,1],H4=[0,x4]×[y4,1] (22)

and four trapezoids with a curved side

E1={(x,y);x1xx2,0yg(x)},E2={(x,y);h(y)x1,y2yy3},E3={(x,y);x4xx3,g(x)y1},E4={(x,y);0xh(y),y1yy4}, (23)

where gC ([x 1, x 2]), hC ([y 2, y 3]), g* ∈ C ([x 4, x 3]), and h* ∈ C ([y 1, y 4]) and

0<g(x)<1(x1xx2),0<h(y)<1(y2yy3),0<g(x)<1(x4xx3),0<h(y)<1(y1yy4). (24)

From this, we know that T can be expressed into a disjoint union as follows:

T=Ω(14Eν)(14Hν), (25)

where each E ν is a trapezoid with a curved side and each H ν is a rectangle (see Figure 1).

Figure 1.

Figure 1

Partition of the complement of the domain Ω.

In Sections 3.2 and 3.3 we will extend f to each E ν and continue to extend to each H ν such that the obtained extension F satisfies the conditions of Theorem 1.

3.2. Smooth Extension to Each Trapezoid E ν with a Curved Side

By (23), the trapezoid E 1 with a curved side y = g(x)(x 1xx 2) is represented as

E1={(x,y):x1xx2,0yg(x)}. (26)

We define two sequences of functions {a k,1(x, y)}0 and {b k,1(x, y)}0 as follows:

a0,1(x,y)=yg(x),b0,1(x,y)=yg(x)g(x),ak,1(x,y)=(yg(x))kk!(yg(x))k+1,bk,1(x,y)=ykk!(yg(x)g(x))k+1,k=1,2,. (27)

By (27), we deduce that for x 1xx 2,

lak,1yl(x,g(x))=0      (0lk1),kak,1yk(x,g(x))=1;(lak,1)yl(x,0)=0(0lk),lbk,1yl(x,g(x))=0      (0lk);  lbk,1yl(x,0)=0      (0lk1),(kbk,1)yk(x,0)=1. (28)

On E 1, we define a sequence of functions {S 1 (k)(x, y)}0 by induction.

Let

S1(0)(x,y)=f(x,g(x))a0,1(x,y)(x1xx2,0yg(x)). (29)

Then, by (27),

S1(0)(x,0)=0,S1(0)(x,g(x))=f(x,g(x)),(x1xx2). (30)

Let

S1(1)(x,y)=S1(0)(x,y)+a1,1(x,y)(fy(x,g(x))S1(0)y(x,g(x)))b1,1(x,y)S1(0)y(x,0)(x1xx2,  0yg(x)). (31)

Then, by (27)–(30), we obtain that, for x 1xx 2,

S1(1)(x,g(x))=f(x,g(x)),S1(1)y(x,g(x))=fy(x,g(x)),S1(1)(x,0)=0,S1(1)y(x,0)=0. (32)

In general, let

S1(k)(x,y)=S1(k1)(x,y)+ak,1(x,y)×(kfyk(x,g(x))kS1(k1)yk(x,g(x)))bk,1(x,y)kS1(k1)yk(x,0)(x1xx2,0yg(x)). (33)

Lemma 4 —

For any k +, one has S 1 (k)C (E 1) and

S1(k)(x,y)=j=02k+1ζj,1(x)yj,(x,y)E1. (34)

Proof —

Since fC (Ω) and gC ([x 1, x 2]), and g(x) > 0  (x 1xx 2), by the above construction, we know that S 1 (k)C (E 1) for any k = 0,1,….

For k = 0, since

S1(0)(x,y)=f(x,g(x))a0,1(x,y)=f(x,g(x))g(x)y, (35)

(34) holds. We assume that (34) holds for k = l − 1; that is,

S1(l1)(x,y)=j=02l1ζj,1(l1)(x)yj. (36)

This implies that

lS1(l1)yl(x,g(x))=j=l2l1j!(jl)!  ζj,1(l1)(x)(g(x))jl,lS1(l1)yl(x,0)=l!ζl,1(l1)(x). (37)

Again, notice that a l,1(x, y) and b l,1(x, y) are polynomials of y whose degrees are both 2l + 1. From this and (33), it follows that (34) holds for k = l. By induction, (34) holds for all k. Lemma 4 is proved.

Below we compute derivatives (∂l S 1 (k)/∂y l)(x, y)  (0 ≤ lk) on the curved side Γ1 = {(x, g(x)) : x 1xx 2} and the bottom side Δ1 = {(x, 0) : x 1xx 2} of E 1.

Lemma 5 —

Let S 1 (k)(x, y) be stated as above. For any k +, one has

lS1(k)yl(x,g(x))=lfyl(x,g(x)),lS1(k)yl(x,0)=0(x1xx2,  0lk). (38)

Proof —

By (30), We have known that, for k = 0, (38) holds.

Now we assume that (38) holds for k − 1.

For x 1xx 2, by (33), we have

lS1(k)yl(x,  g(x))=lS1(k1)yl(x,g(x))+lak,1yl(x,g(x))×(kfyk(x,g(x))kS1(k1)yk(x,g(x)))lbk,1yl(x,g(x))kS1(k1)yk(x,0),(0lk). (39)

For l = 0,1,…, k − 1, by the assumption of induction, we have

lS1(k1)yl(x,g(x))=lfyl(x,g(x)). (40)

By (28), we have (∂l a k,1/∂y l)(x, g(x)) = 0, (∂l b k,1/∂y l)(x, g(x)) = 0. So we get

lS1(k)yl(x,g(x))=lfyl(x,g(x)). (41)

For l = k, note that (∂k a k,1/∂y k)(x, g(x)) = 1 and (∂k b k,1/∂y k)(x, g(x)) = 0. By (39), we get

kS1(k)yk(x,g(x))=kS1(k1)yk(x,g(x))+(  kfyk(x,g(x))kS1(k1)yk(x,g(x)))=kfyk(x,  g(x)). (42)

The first formula of (38) holds for k.

By (33), we have

lS1(k)yl(x,0)=lS1(k1)yl(x,0)+lak,1yl(x,0)×(kfyk(x,g(x))kS1(k1)yk(x,g(x)))lbk,1yl(x,0)kS1(k1)yk(x,0),(x1xx2,  0lk). (43)

For l = 0,…, k − 1, by the assumption of induction and (28), we have (∂l S 1 (k−1)/∂y l)(x, 0) = 0 and (∂l a k,1/∂y l)(x, 0) = (∂l b k,1/∂y l)(x, 0) = 0. So

lS1(k)yl(x,0)=0. (44)

For l = k, since (∂k a k,1/∂y k)(x, 0) = 0, (∂k b k,1/∂y k)(x, 0) = 1, by (43), we have

kS1(k)yk(x,0)=kS1(k1)yk(x,0)kS1(k1)yk(x,0)=0. (45)

The second formula of (38) holds. By induction, (38) holds for all k. From this, we get Lemma 5.

Now we compute the mixed derivatives of S 1 (k)(x, y) on the curved side Γ1 and bottom side Δ1 of E 1.

Lemma 6 —

Let Γ1 and Δ1 be the curved side and the bottom side of E 1, respectively. Then, for k +,

  1. (∂i+j S 1 (k)/∂x iy j)(x, y) = (∂i+j f/∂x iy j)(x, y)  ((x, y) ∈ Γ1),

  2. (∂i+j S 1 (k)/∂x iy j)(x, y) = 0  ((x, y) ∈ Δ1),

where 0 ≤ i + jk.

Proof —

Let x 1xx 2. Then we have

ddx(l1fyl1(x,g(x)))=lfxyl1(x,g(x))+lfyl(x,g(x))g(x),(l1). (46)

By the Newton-Leibniz formula, we have

l1fyl1(x,g(x))=l1fyl1(x1,g(x1))+x1x(lfxyl1(t,g(t))+lfyl(t,g(t))g(t))dt. (47)

Similarly, replacing f by S 1 (k) in this formula, we have

l1S1(k)yl1(x,g(x))=l1S1(k)yl1(x1,g(x1))+x1x(lS1(k)xyl1(t,g(t))+lS1(k)yl(t,g(t))g(t))dt,(l1). (48)

From this and Lemma 5, it follows that, for any x 1xx 2, we have

x1xlS1(k)xyl1(t,g(t))dt=x1xlfxyl1(t,g(t))dt(1lk). (49)

Finding derivatives on the both sides of this formula, we get

lS1(k)xyl1(x,g(x))=lfxyl1(x,g(x))(1lk). (50)

Now we start from the equality

ddx(l1fxyl2(x,g(x)))=lfx2yl2(x,g(x))+lfxyl1(x,g(x))g(x),(l2). (51)

Similar to the argument from (46) to (50), we get

lS1(k)x2yl2(x,g(x))=lfx2yl2(x,g(x))(2lk). (52)

Continuing this procedure, we deduce that (i) holds for 0 < i + jk. Letting l = 0 in Lemma 5, we have S 1 (k)(x, g(x)) = f(x, g(x)); that is, (i) holds for i = j = 0. So we get (i).

By Lemma 5, (∂j S 1 (k)/∂y j)(x, 0) = 0  (0 ≤ jk). From this and S 1 (k)C (E 1), we have

i+jS1(k)xiyj(x,0)=0(0i+jk), (53)

so (ii) holds. Lemma 6 is proved.

From this, we get the following.

Lemma 7 —

For any positive integer r, denote l r = r(r + 1)(r + 2)(r + 3). Let

F(x,y)={S1(lr)(x,y),(x,y)E1,f(x,y),(x,y)Ω. (54)

Then (i) FC lr(ΩE 1)   and   F(x, y) = f(x, y) ((x, y) ∈ Ω); (ii) (∂i+j F/∂x iy j)(x, y) = 0((x, y)∈(E 1⋂∂T), 0 ≤ i + jl r).

Proof —

By the assumption fC (Ω), Lemma 4: S 1 (k)C (E 1), and Lemma 6(i):

i+jS1(k)xiyj(x,y)=i+jfxiyj(x,y)((x,y)Γ1,0i+jk), (55)

where Γ1 = ΩE 1, we get (i). By Lemma 6(ii) and E 1⋂∂T = Δ1, we get (ii). Lemma 7 is proved.

For ν = 2,3, 4, by using a similar method, we define S ν (k)(x, y) on the each trapezoid E ν with a curve side. The representations of S ν (k)(x, y) are stated in Section 4.1.

Lemma 8 —

For any ν = 1,2, 3,4, let

F(x,y)={Sν(lr)(x,y),(x,y)Eν,f(x,y),(x,y)Ω, (56)

where l r = r(r + 1)(r + 2)(r + 3). Then, for ν = 1,2, 3,4, one has the following:

  • (i)

    FC lr(ΩE ν  );

  • (ii)

    (∂i+j F/∂x iy j)(x, y) = 0, (x, y)∈(E ν⋂∂T) for 0 ≤ i + jl r;

  • (iii)
    F(x, y) can be expressed in the form:
    F(x,y)=j=02lr+1ζj,1(x)yj,(x,y)E1,F(x,y)=j=02lr+1ζj,2(y)xj,(x,y)E2,F(x,y)=j=02lr+1ζj,3(x)yj,(x,y)E3,F(x,y)=j=02lr+1ζj,4(y)xj,(x,y)E4. (57)

Proof —

By Lemma 7, we have

FClr(ΩE1),i+jFxiyj(x,y)=0,((x,y)(E1T),0i+jlr). (58)

Similar to the argument of Lemma 7, for ν = 2,3, 4, we have

FClr(ΩEν),i+jFxiyj(x,y)=0,((x,y)(EνT),  0i+jlr). (59)

From this, we get (i) and (ii).

The proof of (iii) is similar to the argument of Lemma 4(iii). Lemma 8 is proved.

3.3. Smooth Extension to Each Rectangle H ν

We have completed the smooth extension of f to each trapezoid E ν with a curved side. In this subsection we complete the smooth extension of the obtained function F to each rectangle H ν. First we consider the smooth extension of F to H 1. We divide this procedure in two steps.

Step 1 —

In Lemma 8, we know that F(x, y) = S 4 lr(x, y) on E 4. Now we construct the smooth extension of S 4 (lr)(x, y) from E 4 to H 1, where S 4 (lr)(x, y) is stated in Section 4.2 and l r = r(r + 1)(r + 2)(r + 3).

Let

αk,11(y)=(yy1)kk!(yy1)k+1,βk,11(y)=ykk!(yy1y1)k+1,k=0,1,, (60)

and let

M1(0)(x,y)=S4(lr)(x,y1)α0,11(y),M1(k)(x,y)=M1(k1)(x,y)+αk,11(y)×(kS4(lr)yk(x,y1)kM1(k1)yk(x,y1))βk,11(y)kM1(k1)yk(x,0),k=1,2,,τr((x,y)H1), (61)

where τ r = r(r + 2).

Lemma 9 —

Let {J 1,l}1 4 be four sides of the rectangle H 1:

J1,1={(x,y1),0xx1},J1,2={(0,y),0yy1},J1,3={(x,0),0xx1},J1,4={(x1,y),0yy1}. (62)

Then one has the following

  1. M 1 (τr)(x, y) = ∑i,j=0 2lr+1 d i,j (1) x i y j, where d i,j (1) is a constant;

  2. (∂i+j M 1 (τr)/∂x iy j)(x, y) = (∂i+j S 4 (lr)/∂x iy j)(x, y)  ((x, y) ∈ J 1,1);

  3. (∂i+j M 1 (τr)/∂x iy j)(x, y) = 0  ((x, y) ∈ J 1,2);

  4. (∂i+j M 1 (τr)/∂x iy j)(x, y) = 0  ((x, y) ∈ J 1,3),

where 0 ≤ i + jτ r.

Proof —

By Lemma 8(iii), we have

S4(lr)(x,y)=j=02lr+1ζj,4(y)xj. (63)

So (∂k S 4 (lr)/∂y k)(x, y 1) is a polynomial of degree 2l r + 1 with respect to x. Since α τr,11(y) and β τr,11(y) are both polynomials of degree 2τ r + 1, (i) follows from (61).

Similar to the argument of Lemma 6, we get (ii) and (iv).

Since (0, y 1)∈(E 4⋂∂T), by Lemma 7, we have

i+jS4(lr)xiyj(0,y1)=i+jFxiyj(0,y1)=0,(0i+jlr). (64)

By the definition of M 1 (0) and (64), we have

i+jM1(0)xiyj(0,y)=iS4(lr)xi(0,y1)djα0,11dyj(y)=0,(0i+jlr,y). (65)

We assume that

i+jM1(k1)xiyj(0,y)=0,(0i+jlr12k(k1)). (66)

By (61), we get

i+jM1(k)xiyj(0,y)=i+jM1(k1)xiyj(0,y)+djαk,11dyj(y)×(k+iS4(lr)xiyk(0,y1)k+iM1(k1)xiyk(0,y1))djβk,11dyj(y)k+iM1(k1)xiyk(0,0). (67)

for 0 ≤ i + jl r − (1/2)k(k + 1), we have 0 ≤ i + jl r − (1/2)k(k − 1) and 0 ≤ i + kl r − (1/2)k(k − 1). Again, by the assumption of induction, we get

i+jM1(k1)xiyj(0,y)=0,k+iM1(k1)xiyk(0,y1)=0. (68)

By (64), we have (∂k+i S 4 (lr)/∂x iy k)(0, y 1) = 0. From this and (67), we get

i+jM1(k)xiyj(0,y)=0,(0yy1,  0i+jlrk2(k+1)). (69)

Taking k = τ r, we have

i+jM1(τr)xiyj(0,y)=0,(0yy1,  0i+jlrτr2(τr+1)). (70)

Since l r − (τ r/2)(τ r + 1) = (l r/2) ≥ τ r, we get (iii). Lemma 9 is proved.

Step 2 —

In Lemma 8, we know that F(x, y) = S 1 lr(x, y) on E 1. We consider the difference S 1 (lr)(x, y) − M 1 (τr)(x, y). Obviously, it is infinitely many time differentiable on E 1 since M 1 (τr)(x, y) is a polynomial. Now we construct its smooth extension from E 1 to the rectangle H 1 as follows. Let

αk,14(x)=(xx1)kk!(xx1)k+1,  βk,14(x)=xkk!(xx1x1)k+1,k=0,1,, (71)

and let

N1(0)(x,y)=(S1(lr)(x1,y)M1(τr)(x1,y))α0,14(x),N1(k)(x,y)=N1(k1)(x,y)+αk,14(x)×(k(S1(lr)M1(τr))xk(x1,y)kN1(k1)xk(x1,y))βk,14(x)kN1(k1)xk(0,y),k=0,1,,r,((x,y)H1). (72)

From this, we obtain the following.

Lemma 10 —

N 1 (r)(x, y) possesses the following properties:

  1. (∂i+j N 1 (r)/∂x iy j)(x, y) = (∂i+j S 1 (lr)/∂x iy j)(x, y) − (∂i+j M 1 (τr)/∂x iy j)(x, y) on J 1,4;

  2. (∂i+j N 1 (r)/∂x iy j)(x, y) = 0 on J 1,2;

  3. (∂i+j N 1 (r)/∂x iy j)(x, y) = 0 on J 1,1;

  4. (∂i+j N 1 (r)/∂x iy j)(x, y) = 0 on J 1,3, where 0 ≤ i + jr and {J 1,ν}1 4 are stated in (62);

  5. N 1 (r)(x, y) = ∑i,j=0 2lr+1 τ i,j (1) x i y j, where τ i,j (1) is a constant.

Proof —

The arguments similar to Lemma 9(ii) and (iv) give the conclusions (i) and (ii) of this theorem. Now we prove (iii) and (iv).

By Lemma 6(i) and Lemma 9(ii), as well as l rτ r, we get that, for 0 ≤ i + jτ r,

i+jS1(lr)xiyj(x1,y1)=i+jfxiyj(x1,y1)=i+jS4(lr)xiyj(x1,y1)=i+jM1(τr)xiyj(x1,y1). (73)

So we have

i+jN1(0)xiyj(x,y1)=j(S1(lr)M1(τr))yj(x1,y1)diα0,14dxi(x)=0,(0xx1,0i+jτr). (74)

Now we assume that

i+jN1(k1)xiyj(x,y1)=0,(0xx1,0i+jτrk2(k1)). (75)

By (72) and (73),

i+jN1(k)xiyj(x,y1)=i+jN1(k1)xiyj(x,y1)+diαk,14dxi(x)×(k+j(S1(lr)M1(τr))xkyj(x1,y1)k+jN1(k1)xkyj(x1,y1))diβk,14dxi(x)k+jN1(k1)xkyj(0,y1)=0,(0xx1,0i+jτrk(k+1)2). (76)

By induction, we get

i+jN1(k)xiyj(x,y1)=0,(0xx1,0i+jτrk(k+1)2). (77)

From this and τ r − (1/2)r(r + 1) ≥ r, we get (iii). By Lemma 6(ii) and Lemma 9(iii), we get that

i+jS1(lr)xiyj(x,0)=0,(0i+jlr),      i+jM1(τr)xiyj(x,0)=0,(0i+jτr). (78)

From this and (72), by using an argument similar to the proof of (iii), we get (iv).

By Lemma 8(iii) and Lemma 9(i), we deduce that (S 1 (lr)M 1 (τr))(x 1, y) is a polynomial of degree 2l r + 1 with respect to y. From this and (72), we get (v). Lemma 10 is proved.

By Lemmas 9 and 10, we obtain that for 0 ≤ i + jr,

        i+j(M1(τr)+N1(r))xiyj(x,y)=i+jS4(lr)xiyj(x,y)on  J1,1, (79)
i+j(M1(τr)+N1(r))xiyj(x,y)=0on  J1,2J1,3, (80)
      i+j(M1(τr)+N1(r))xiyj(x,y)=i+jS1(lr)xiyj(x,y)on  J1,4. (81)

Lemma 11 —

Let

F(x,y)={f(x,y),(x,y)Ω,S1(lr)(x,y),(x,y)E1,S4(lr)(x,y),(x,y)E4,M1(τr)(x,y)+N1(r)(x,y),(x,y)H1. (82)

Then one has

  1. FC r(ΩE 1E 4H 1),

  2. (∂i+j F/∂x iy j)(x, y) = 0,   (x, y) ∈ ((E 1E 4H 1)⋂∂T) for 0 ≤ i + jr;

  3. F(x, y) = ∑i,j=0 2lr+1 c ij (1) x i y j((x, y) ∈ H 1), where each c ij (1) is constant.

Proof —

By Lemma 7, we have FC r(ΩE 1E 4). Since S 1 (lr)C r(E 1),

M1(τr)+N1(r)Cr(H1),E1H1=J1,4, (83)

by (81), we deduce that FC r(E 1H 1). Since S 4 (lr)C r(E 4),

M1(τr)+N1(r)Cr(H1),E4H1=J1,1, (84)

by (79), we deduce that FC r(H 1E 4). So we get (i).

By Lemma 8(ii),

i+jFxiyj(x,y)=0,(x,y)((E1E4)T). (85)

Since H 1⋂∂T = J 1,2J 1,3, by (80), we deduce that

i+jFxiyj(x,y)=0,(x,y)(H1T). (86)

So we get (ii).

From Lemma 9(i), Lemma 10(v), and F(x, y) = M 1 (τr)(x, y) + N 1 (r)(x, y) ((x, y) ∈ H 1), we get (iii). Lemma 11 is proved.

For ν = 2,3, 4, by using a similar method, we define F(x, y) = M ν (τr)(x, y) + N ν (r)(x, y) ((x, y) ∈ H ν), where representations of M ν (τr)(x, y) and N ν (r)(x, y) see Section 4.2.

3.4. The Proofs of the Theorems

Proof of Theorem 1

Let

graphic file with name TSWJ2014-102062.e001.jpg (87)

By (25), F has been defined on the unit square T. The argument similar to Lemma 11(i)-(ii) shows that

FCr(ΩE1E4H1);FCr(ΩE1E2H2);FCr(ΩE2E3H3);FCr(ΩE3E4H4); (88)

and for 0 ≤ i + jr,

i+jFxiyj(x,y)=0,(x,y)((E1E4H1)T);i+jFxiyj(x,y)=0,(x,y)((E1E2H2)T);i+jFxiyj(x,y)=0,(x,y)((E2E3H3)T);i+jFxiyj(x,y)=0,(x,y)((E3E4H4)T). (89)

From this and Ω⋂∂T = , by (25), we have FC r(T) and (∂i+j F/∂x iy j)(x, y) = 0   ((x, y)∈∂T, 0 ≤ i + jr). So we get (i) and (ii).

Similar to the argument of Lemma 11(iii), we get

F(x,y)=i,j=02lr+1cij(ν)xiyj,(x,y)Hν(ν=1,2,3,4), (90)

where each c ij (ν) is a constant. From this and Lemma 8(iii), we know that, on TΩ,   F(x, y) can be expressed locally in the form

j=02lr+1ξj(x)yjor    j=02lr+1  ηj(x)xjor  i,  j=02lr+1cijxiyj; (91)

(iii) holds. We have completed the proof of Theorem 1.

The representation of F satisfying the conditions of Theorem 1 is given in Section 4.

Proof of Theorem 2

Let F be the smooth extension of f from Ω to T which is stated as in Theorem 1. Define F p by

Fp(x+k,y+l)=F(x,y)((x,y)T;k,l). (92)

Then F p is a 1-periodic function of ℝ2. By Theorem 1, we know that F pC r(T) and

i+jFpxiyj(x,y)=0((x,y)T;0i+jr). (93)

Let T n1,n2 = [n 1, n 1 + 1]×[n 2, n 2 + 1](n 1, n 2). Since F p is 1-periodic function, we have F pC r(T n1,n2) and for any n 1, n 2,

i+jFpxiyj(x,y)=0((x,y)Tn1,n2;0i+jr). (94)

Noticing that ℝ2 = ⋃n1,n2 T n1,n2, we have F pC r(ℝ2). By (92) and Theorem 1(i), we get

Fp(x,y)=F(x,y)=f(x,y)((x,y)Ω). (95)

Theorem 2 is proved.

Proof of Theorem 3

Let F be the smooth extension of f from Ω to T which is stated as in Theorem 1. Define F c by

Fc(x,y)={F(x,y),(x,y)T,0,(x,y)2T. (96)

From Theorem 1(ii), we have

i+jFcxiyj(x,y)=0((x,y)T;0i+jr). (97)

From this and (96), we get F c(x, y) ∈ C r(ℝ2). By (96) and Theorem 1(i), we get

Fc(x,y)=F(x,y)=f(x,y)((x,y)Ω). (98)

Theorem 3 is proved.

4. Representation of the Extension F Satisfying Theorem 1

Let f and Ω be stated as in Theorem 1 and let Ω be divided as in Section 3.1. The representation of F satisfying conditions of Theorem 1 is as follows:

graphic file with name TSWJ2014-102062.e002.jpg (99)

where

T=Ω(14Eν)(14Hν) (100)

and the rectangles {H ν}1 4 and the trapezoids {E ν}1 4 with a curved side are stated in (22) and (23) and l r = r(r + 1)(r + 2)(r + 3) and τ r = r(r + 2).

Below we write out the representations of {S ν (k)(x, y)}1 4, {M ν (k)(x, y)}1 4, and {N ν (k)(x, y)}1 4.

4.1. The Construction of Each S ν (k)(x, y)

(i) Denote

ak,1(x,y)=(yg(x))kk!(yg(x))k+1,bk,1(x,y)=ykk!(yg(x)g(x))k+1,k=0,1,. (101)

Define S 1 (k)(x, y) by induction as follows:

S1(0)(x,y)=f(x,g(x))a0,1(x,y),S1(k)(x,y)=S1(k1)(x,y)+ak,1(x,y)×(kfyk(x,g(x))kS1(k1)yk(x,g(x)))bk,1(x,y)kS1(k1)yk(x,0),k=1,2,,((x,y)E1). (102)

(ii) Denote

ak,2(x,y)=(xh(y))kk!(1x1h(y))k+1,bk,2(x,y)=(x1)kk!(h(y)xh(y)1)k+1,k=0,1,. (103)

Define S 2 (k)(x, y) by induction as follows:

S2(0)(x,y)=f(h(y),y)a0,2(x,y),S2(k)(x,y)=S2(k1)(x,y)+ak,2(x,y)×(kfxk(h(y),y)kS2(k1)xk(h(y),y))        bk,2(x,y)kS2(k1)xk(1,y),k=1,2,,((x,y)E2). (104)

(iii) Denote

ak,3(x,y)=(yg(x))kk!(1y1g(x))k+1,  bk,3(x,y)=(y1)kk!(g(x)yg(x)1)k+1,k=0,1,. (105)

Define S 3 (k)(x, y) by induction as follows:

S3(0)(x,y)=f(x,g(x))a0,3(x,y),S3(k)(x,y)=S3(k1)(x,y)+ak,3(x,y)×(kfyk(x,g(x))kS3(k1)yk(x,g(x)))bk,3(x,y)kS3(k1)yk(x,1),k=1,2,((x,y)E3). (106)

(iv) Denote

ak,4(x,y)=(xh(y))kk!(xh(y))k+1,  bk,4(x,y)=xkk!(xh(y)h(y))k+1,k=0,1,. (107)

Define S 4 (k)(x, y) by induction as follows:

S4(0)(x,y)=f(h(y),y)a0,4(x,y),S4(k)(x,y)=S4(k1)(x,y)+ak,4(x,y)×(kfxk(h(y),y)kS4(k1)xk(h(y),y))bk,4(x,y)kS4(k1)xk(0,y),k=1,2,((x,y)E4). (108)

4.2. The Constructions of Each M ν (k)(x, y) and N ν (k)(x, y)

(i) Denote

αk,11(y)=(yy1)kk!(yy1)k+1,βk,11(y)=ykk!(yy1y1)k+1,k=0,1,. (109)

Define M 1 (k)(x, y) by induction as follows:

M1(0)(x,y)=S4(lr)(x,y1)α0,11(y),M1(k)(x,y)=M1(k1)(x,y)+αk,11(y)×(kS4(lr)yk(x,y1)kM1(k1)yk(x,y1))βk,11(y)kM1(k1)yk(x,0),k=1,2,,((x,y)H1). (110)

Denote

αk,14(x)=(xx1)kk!(xx1)k+1,                                              βk,14(x)=xkk!(xx1x1)k+1,k=0,1,. (111)

Define N 1 (k)(x, y) by induction as follows:

N1(0)(x,y)=(S1(lr)(x1,y)M1(2r)(x1,y))α0,14(x)N1(k)(x,y)=N1(k1)(x,y)+αk,14(x)×(k(S1(4r)M1(2r))xk(x1,y)kN1(k1)xk(x1,y))βk,14(x)kN1(k1)xk(0,y),k=1,2,((x,y)H1). (112)

(ii) Denote

αk,21(x)=(xx2)kk!(1x1x2)k+1,βk,21(x)=(x1)kk!(x2xx21)k+1,k=0,1,. (113)

Define M 2 (τr)(x, y) by induction as follows:

M2(0)(x,y)=S1(lr)(x2,y)α0,21(x),M2(k)(x,y)=M2(k1)(x,y)+αk,21(x)×(kS1(lr)xk(x2,y)kM2(k1)xk(x2,y))βk,21(x)kM2(k1)xk(1,y),k=1,2,((x,y)H2). (114)

Denote

αk,22(y)=(yy2)kk!(yy2)k+1,βk,22(y)=ykk!(yy2y2)k+1,k=0,1,. (115)

Define N 2 (r)(x, y) by induction as follows:

N2(0)(x,y)=(S2(lr)M2(τr))(x,y2)α0,22(y),N2(k)(x,y)=N2(k1)(x,y)+αk,22(y)×(k(S2(lr)M2(τr))yk(x,y2)kN2(k1)yk(x,y2))βk,22(y)kN2(k1)yk(x,0),k=1,2,((x,y)H2). (116)

(iii) Denote

αk,31(y)=(yy3)kk!(1y1y3)k+1,βk,31(y)=(y1)kk!(y3yy31)k+1,k=0,1,. (117)

Define M 3 (k)(x, y) by induction as follows:

M3(0)(x,y)=S2(lr)(x,y3)  α0,31(y).M3(k)(x,y)=M3(k1)(x,y)+αk,31(y)×(kS2(lr)yk(x,y3)kM3(k1)yk(x,y3))βk,31(y)kM3(k1)yk(x,1),k=1,2,((x,y)H3). (118)

Denote

αk,32(x)=(xx3)kk!(1x1x3)k+1,βk,32(x)=(x1)kk!(x3xx31)k+1,k=0,1,. (119)

Define N 3 (k)(x, y) by induction as follows:

N3(0)(x,y)=(S3(lr)M3(τr))(x3,y)α0,32(x),  N3(k)(x,y)=N3(k1)(x,y)+αk,32(x)×(k(S3(lr)M3(τr))yk(x3,y)kN3(k1)xk(x3,y))βk,32(x)kN3(k1)xk(1,y),k=1,2,((x,y)H3). (120)

(iv) Denote

αk,41(x)=(xx4)kk!(xx4)k+1,  βk,41(x)=(xx4)kk!(xx4)k+1,k=0,1,. (121)

Define M 4 (k)(x, y) by induction as follows:

M4(0)(x,y)=S3(lr)(x4,y)α0,41(x),M4(k)(x,y)=M4(k1)(x,y)+αk,41(x)×(kS3(lr)xk(x4,y)kM4(k1)xk(x4,y))βk,41(x,y)kM4(k1)xk(0,y),k=1,2,((x,y)H4). (122)

Denote

αk,42(y)=(yy4)kk!(1y1y4)k+1,βk,42(y)=(y1)kk!(y4yy41)k+1,k=0,1,. (123)

Define N 4 (k)(x, y) by induction as follows:

N4(0)(x,y)=(S4(lr)M4(τr))(x,y4)α0,42(y),N4(k)(x,y)=N4(k1)(x,y)+αk,42(y)×(k(S4(lr)M4(τr))yk(x,y4)kN4(k1)yk(x,y4))βk,42(x,y)kN4(k1)xk(x,1),k=1,2,((x,y)H4). (124)

5. Corollaries

By using the extension method given in Section 3, we discuss the two important special cases.

5.1. Smooth Extensions of Functions on a Kind of Domains

Let Ω be a trapezoid with two curved sides:

Ω={(x,y):x1xx2,  η(x)yξ(x)}, (125)

where L 1 < η(x) < ξ(x) < L 2 (x 1xx 2), η, ξC m([x 1, x 2]). Denote the rectangle D = [x 1, x 2]×[L 1, L 2]. Then D = G 1ΩG 2, where G 1 and G 2 are both trapezoids with a curved side:

G1={(x,y):x1xx2,L1yη(x)},G2={(x,y):x1xx2,ξ(x)yL2}. (126)

Suppose that fC q(Ω) (q is a nonnegative integer). We will smoothly extend f from Ω to the trapezoids G 1 and G 2 with a curved side, respectively, as in Section 3.2, such that the extension function F is smooth on the rectangle D. Moreover, we will give a precise formula. It shows that the index of smoothness of F depends on not only smoothness of f but also smoothness of η, ξ.

Denote a 0,1(x, y) = (yL 1)/(η(x) − L 1) and

ak,1(x,y)=(yη(x))kk!(yL1η(x)L1)k+1,k=1,2,(x1xx2,y). (127)

We define {S 1 (k)(x, y)} on G 1 as follows. Let

S1(0)(x,y)=f(x,η(x))a1,0(x,y)((x,y)G1), (128)

and let k 0 be the maximal integer satisfying 1 + 2 + ⋯+k 0q. For k = 1,2,…, k 0, we define

S1(k)(x,y)=S1(k1)(x,y)+a1,k(x,y)×(kfyk(x,η(x))kS1(k1)yk(x,η(x))). (129)

Then S 1 (k)C λk(G 1), where λ k = min⁡{q − 1 − 2 − ⋯−k, m}.

Denote   a 0,2(x, y) = (L 2y)/(L 2ξ(x)) and

ak,2(x,y)=(yξ(x))kk!(L2yL2ξ(x))k+1,k=1,2,(x1xx2,y). (130)

We define {S 2 (k)(x, y)} on G 2 as follows. Let

S2(0)(x,y)=f(x,ξ(x))a0,2(x,y)((x,y)G2). (131)

For k = 1,2,…, k 0, define

S2(k)(x,y)=S2(k1)(x,y)+ak,2(x,y)×(kfyk(x,ξ(x))kS2(k1)yk(x,ξ(x))),((x,y)G2). (132)

Then S 2 (k)C λk(G 2), where λ k is stated as above.

An argument similar to Lemmas 5 and 6 shows that, for 0 ≤ kk 0 and 0 ≤ i + j ≤ min⁡{k, λ k},

i+jS1(k)xiyj(x,η(x))=i+jfxiyj(x,η(x)),  i+jS2(k)xiyj(x,ξ(x))=i+jfxiyj(x,ξ(x)),(x1xx2). (133)

A direct calculation shows that the number

τ(q,m)=min{[2q+9432],m} (134)

is the maximal value of integers k satisfying kλ k, where [·] expresses the integral part. So τ(q, m) ≤ λ τ(q,m).

By (133), we get that, for 0 ≤ i + jτ(q, m),

i+jS1(τ(q,m))xiyj(x,η(x))=i+jfxiyj(x,ξ(x)),i+jS2(τ(q,m))xiyj(x,ξ(x))=i+jfxiyj(x,ξ(x)),(x1xx2). (135)

Note that

S1(τ(q,m))Cλτ(q,m)(G1),S2(τ(q,m))Cλ(q,m)(G2),τ(q,m)λτ(q,m)q, (136)

and the assumption fC q(Ω). Now we define a function on D by

Fq,m(x,y)={f(x,y),(x,y)Ω,S1(τ(q,m))(x,y),(x,y)G1,S2(τ(q,m))(x,y),(x,y)G2. (137)

From this and (135), we have F q,mC τ(q,m)(D). This implies the following theorem.

Theorem 12 —

Let the domain Ω and the rectangle D be stated as above. If fC q(Ω), then the function F q,m(x, y), defined in (137), is a smooth extension of f from Ω to D and F q,mC τ(q,m)(D), where τ(q, m) is stated in (134).

Especially, for q = 0 and m ≥ 0, we have τ(q, m) = 0, and so F 0,mC(D); for q = 2 and m ≥ 1, we have τ(q, m) = 1, and so F 2,1C 1(D); for q = 5 and m ≥ 2, we have τ(q, m) = 2, and so F 5,2C 2(D).

5.2. Smooth Extensions of Univariate Functions on Closed Intervals

Let fC q([x 1, x 2]) and [x 1, x 2]⊂(0,1). In order to extend smoothly f from [x 1, x 2] to [0, x 1], we construct two polynomials

a0(k)(x)=(xx1)kk!(xx1)k+1,b0(k)(x)=xkk!(x1xx1)k+1,k=0,1,. (138)

Define S 0 (0)(x) = f(x 1)(x/x 1) and for k = 1,…, q,

S0(k)(x)=S0(k1)(x)a0(k)(x)(f(k)(x1)(S0(k1))(k)(x1))b0(k)(x)(S0(k1))(k)(0)(0xx1). (139)

Then S 0 (q)(x) is a polynomial of degree ≤2q + 1.

Similar to the proof of Lemma 5, we get

(S0(q))(k)(0)=0,(S0(q))(k)(x1)=f(k)(x1),k=0,1,,q. (140)

It is also easy to check directly them.

Again extend smoothly f from [x 1, x 2] to [x 2, 1], we construct two polynomials

a1(k)(x)=(xx2)kk!(1x1x2)k+1,b1(k)(x)=(x1)kk!(x2xx21)k+1,k=0,1,. (141)

Define   S 1 (0)(x) = f(x 2)((1 − x)/(1 − x 2)) and for k = 1,…, q,

S1(k)(x)=S1(k1)(x)a1(k)(x)(f(k)(x2)(S1(k1))(k)(x2))b1(k)(x)(S1(k1))(k)(1)(x2x1). (142)

Then S 1 (q)(x) is a polynomial of degree ≤2q + 1.

Similar to the proof of Lemma 5, we get

(S1(q))(k)(x2)=f(k)(x2),(S1(q))(k)(1)=0(k=0,1,,q). (143)

Therefore, we obtain the smooth extension F from [x 1, x 2] to [0,1] by

F(x)={f(x),x[x1,x2],S0(q)(x),x[0,x1],S1(q)(x),x[x2,1], (144)

where S 0 (q)(x) and S 1 (q)(x) are polynomials of degree 2q + 1 defined as above, and FC q([0,1]) and F (l)(0) = F (l)(1) = 0 (l = 0,1, ..., q). From this, we get the following.

Theorem 13 —

Let fC q([x 1, x 2]) and [x 1, x 2]⊂(0,1). Then there exists a function FC q([0,1]) satisfying F(x) = f(x) (x 1xx 2) and F (l)(0) = F (l)(1) = 0 (l = 0,1,…, q).

Let fC q([x 1, x 2]) and [x 1, x 2]⊂(0,1), and let F be the smooth extension of f from [x 1, x 2] to [0,1] which is stated as in Theorem 12. Let F p be the 1-periodic extension satisfying F p(x + n) = F(x) (0 ≤ x ≤ 1, n). Then F pC q(ℝ) and F p(x) = f(x) (x ∈ [x 1, x 2]). We expand F(x) into the Fourier series which converges fast. From this, we get trigonometric approximation of fC q([x 1, x 2]). We also may do odd extension or even extension of F from [0,1] to [−1,1], and then doing periodic extension, we get the odd periodic extension F p oC q(ℝ) or the even periodic extension F p eC q(ℝ). We expand F p o or F p e into the sine series and the cosine series, respectively. From this, we get the sine polynomial approximation and the cosine polynomial approximation of f on [x 1, x 2]. For FC q(x) (x ∈ [0,1]), we pad zero in the outside of [0,1] and then the obtained function F cC q(ℝ). We expand F c into a wavelet series which converges fast. By the moment theorem, a lot of wavelet coefficients are equal to zero. From this, we get wavelet approximation of fC q([x 1, x 2]).

Acknowledgments

This research is partially supported by the National Key Science Program no. 2013CB956604; the Beijing Higher Education Young Elite Teacher Project; the Fundamental Research Funds for the Central Universities (Key Program) no. 105565GK; and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry.

Conflict of Interests

The author declares that there is no conflict of interests regarding the publication of this paper.

References

  • 1.Daubechies I. Orthonormal bases of compactly supported wavelets. Communications on Pure and Applied Mathematics. 1998;41:909–996. [Google Scholar]
  • 2.Daubechies I. Ten Lectures on Wavelets. Vol. 6. Philadelphia, Pa, USA: SIAM; 1992. (CBMS-Conference Lecture Notes). [Google Scholar]
  • 3.Chui CK, Schumaker LL, Stockler J. Approximation Theory X: Wavelets, Splines, and Applications. Vanderbilt University Press; 2002. [Google Scholar]
  • 4.Chui CK, Schempp W, Zeller K. Multivariate Approximation Theory. Birkhauser; 1989. [Google Scholar]
  • 5.Chui CK. Approximation induced by a fourier series. Rocky Mountain Journal of Mathematics. 1974;4(4):643–648. [Google Scholar]
  • 6.Long R. Multidimensional Wavelet Analysis. Beijing, China: International Publishing; 1995. [Google Scholar]
  • 7.Lorentz GG. Approximation of Functions. Holt, Rinebart and Winston; 1966. [Google Scholar]
  • 8.Petrushev P. Multivariate n-term rational and piecewise polynomial approximation. Journal of Approximation Theory. 2003;121(1):158–197. [Google Scholar]
  • 9.Stein EM, Weiss G. Introduction to Fourier Analysis on Euclidean Spaces. Princeton University Press; 1971. [Google Scholar]
  • 10.Timan AF. Theory at Approximation of Functions of a Real Variable. Pergamon; 1963. [Google Scholar]
  • 11.Zhang Z. Convergence and Gibbs phenomenon of periodic wavelet frame series. Rocky Mountain Journal of Mathematics. 2009;39(4):1373–1396. [Google Scholar]
  • 12.Zhang Z. Measures, densities and diameters of frequency bands of scaling functions and wavelets. Journal of Approximation Theory. 2007;148(2):128–147. [Google Scholar]
  • 13.Zhou D, Jetter K. Approximation with polynomial kernels and SVM classifiers. Advances in Computational Mathematics. 2006;25(1–3):323–344. [Google Scholar]
  • 14.Zygmund A. Trigonometric Series, I, II. 2nd edition. Cambridge University Press; 1968. [Google Scholar]

Articles from The Scientific World Journal are provided here courtesy of Wiley

RESOURCES