Home A novel recursive method to reconstruct multivariate functions on the unit cube
Article Open Access

A novel recursive method to reconstruct multivariate functions on the unit cube

  • Zhihua Zhang EMAIL logo
Published/Copyright: December 29, 2017

Abstract

Due to discontinuity on the boundary, traditional Fourier approximation does not work efficiently for d−variate functions on [0, 1]d. In this paper, we will give a recursive method to reconstruct/approximate functions on [0, 1]d well. The main process is as follows: We reconstruct a d−variate function by using all of its (d−1)–variate boundary functions and few d–variate Fourier coefficients. We reconstruct each (d−1)–variate boundary function given in the preceding reconstruction by using all of its (d−2)–variate boundary functions and few (d−1)–variate Fourier coefficients. Continuing this procedure, we finally reconstruct each univariate boundary function in the preceding reconstruction by using values of the function at two ends and few univariate Fourier coefficients. Our recursive method can reconstruct multivariate functions on the unit cube with much smaller error than traditional Fourier methods.

MSC 2010: 42B05; 41A63

1 Introduction

Due to discontinuity on the boundary, traditional Fourier approximation does not work efficiently for d–variate functions on [0, 1]d [1, 2, 3, 4, 5, 6]. In order to solve it, we will give a recursive method to reconstruct/approximate functions on [0, 1]d well. We start from a smooth triple–variate function f on the unit cube [0, 1]3. There are six faces (or six 2-dimensional boundaries) on the unit cube:

(ν,y,z)(0y,z1,ν=0or1),(x,ν,z)(0x.z1,ν=0or1),(x,y,ν)(0x,y1,ν=0or1).

The corresponding six bivariate boundary functions on [0, 1]2 are

f(ν,y,z),f(x,ν,z),f(x,y,ν)(ν=0or1). (1)

There are twelve edges (or twelve 1-dimensional boundaries) on the unit cube:

(ν,μ,z)(0z1,ν,μ=0or1),(x,ν,μ)(0x1,ν,μ=0or1),(ν,y,μ)(0y1,ν,μ=0or1).

The corresponding twelve univariate boundary functions on [0, 1] are

f(ν,μ,z),f(x,ν,μ),f(ν,y,μ)(ν,μ=0or1).

The method of reconstructing a triple–variate smooth function f(x,y,z) on [0, 1]3 is as follows.

We construct g3(x,y,z) which is a simple combination of six bivariate boundary functions and six factors x, y, z 1−x, 1−y, 1−z such that g3(x,y,z) = f(x,y,z) on the boundary ([0, 1]3). Let

h3(x,y,z)=f(x,y,z)g3(x,y,z).

Expand h3(x,y,z) into Fourier series:

h3(x,y,z)=n1,n2,n3cn1n2n3(h3)e2πi(n1x+n2y+n3z),

where n1,n2,n3=n1=n2=n3= and cn1n2n3(h3) are Fourier coefficients of h3, and then use its hyperbolic truncation:

sN(hc)(h3;x,y,z)=|n1|,|n2|,|n3|<N|n1n2n3|<Ncn1n2n3(h3)e2πi(n1x+n2y+n3z)

to reconstruct h3(x, y, z) with small square errors. From this, the problem of reconstruction of the triple–variate function f is reduced to that of each bivariate function on [0, 1]2 which is given in (1).

Without loss of generalization, we reconstruct the bivariate function f(x,y,0) on [0, 1]2. First, we construct g2(x,y) which is a combination of four univariate boundary functions on [0, 1]:

f(x,0,0),f(x,1,0),f(0,y,0),f(1,y,0)

and four factors x, y, 1−x, 1−y such that g2(x,y) is equal to f(x,y,0) on the boundary ([0, 1]2). Secondly, we expand h2(x,y) = f(x,y,0)−g2(x,y) into bivariate Fourier series. Finally, we can reconstruct h2(x,y) using the corresponding hyperbolic cross truncations of the Fourier series of h2(x,y). So the problem is reduced to that of reconstruction of univariate functions on [0, 1]

f(x,0,0),f(x,1,0),f(0,y,0),f(1,y,0),

using f(0,0,0), f(0,1,0), f(1,0,0), f(1,1,0) and few univariate Fourier coefficients.

The triple–variate function f(x,y,z) is reconstructed eventually by the values of this triple–variate function at vertexes of the cube [0, 1]3 and few univariate, bivariate & triple–variate Fourier coefficients.

In general, the reconstruction of a d–variate function on [0, 1]d can be reduced to that of (d−1)–variate functions on [0, 1]d−1, up to the reconstruction of univariate functions on [0, 1]. If 2dfx12xd2 is continuous on [0, 1]d, then we will prove that the square errors e~N(d) of this reconstruction scheme satisfy

e~N(d)2log4d4N~dN~d3,

where d is the number of the used Fourier coefficients and dN logd−1N. Here AnBn means that there are two constants C > 0 and D > 0 such that CBnAnDBn for all n.

On the other hand, if we use directly the partial sums of Fourier series of f to reconstruct the function f, then the square errors e~N(d) satisfy (e~N(d))2(N~d)1d, and if we directly reconstruct f by hyperbolic cross truncations of the Fourier series of f, then the square errors e~N(d) satisfy (e~N(d))2log2N~dN~d. Thus, our recursive method can reconstruct multivariate functions on the unit cube with much smaller error than traditional Fourier methods.

2 Univariate functions on [0, 1]

Let f(x) be a function on [0, 1] and f″(x) be continuous on [0, 1] and φ(x) = f(x)−f(0)(1−x)−f(1)x. Expand φ(x) into Fourier series φ(x) = ∑ncn(φ) e2πinx, where Fourier coefficients cn(φ) satisfy

cn(φ)=01φ(x)e2πinxdx=12πin01φ(x)e2πinxdx=O1n2.

Here An = O(Bn) means that there is a constant C > 0 such that |An| < C|Bn| for all n.

Take the partial sum of the Fourier series of φ [7, 8, 9, 10]:

sN(φ;x)=|n|Ncn(φ)e2πinx.

Then the square approximation errors eN(1)=01|φ(x)sN(φ;x)|2dx12 satisfy

eN(1)2=|n|>N|cn(φ)|2=O|n|>N1n4=O1N3.

From this, we see that f(x) is reconstructed by f(0), f(1), and few Fourier coefficients {cn(φ)}|n| ≤ N as follows.

Step 1. Take φ(x) = f(x)−f(0)(1−x)−f(1) x (0 ≤ x ≤ 1).

Step 2. Find the Fourier coefficients of φ:cn(φ)=01φ(x)e2πinxdx.

Step 3. Reconstruct f by the formula: f(x)f(0)(1x)+f(1)x+n=NNcn(φ)e2πinx(0x1) with square errors eN(1) satisfying (eN(1))2=O1N3.

3 Bivariate functions on [0, 1]2

Let f(x,y) be a function on [0, 1]2 and i+jfxiyj (i,j = 0,1,2) be a continuous function on [0, 1]2. We reconstructed four boundary functions f(x,0), f(x,1), f(0,y), f(1,y) using the method shown in Section 2, and then reconstructed f by four boundary function and few bivariate Fourier coefficients as follows.

Define

g(x,y)=f(x,0)(1y)+f(x,1)y+f(0,y)(1x)+f(1,y)xf(0,0)(1x)(1y)f(0,1)(1x)yf(1,0)x(1y)f(1,1)xy (2)

and h(x,y) = f(x,y)−g(x,y). It is easy to check that

h(x,y)=0(x,y)([0,1]2). (3)

To reconstruct f, now we only need to reconstruct h. Expand h(x,y) into Fourier series:

h(x,y)=m,ncmn(h)e2πi(mx+ny),

where Fourier coefficients

cmn(h)=[0,1]2h(x,y)e2πi(mx+ny)dxdy.

By (3),

cmn(h)=1(2πm)201hx(1,y)hx(0,y)e2πinydy1(2πm)2[0,1]22x2(x,y)e2πi(mx+ny)dxdy.

Again, by (3), hx(1,0)=hx(1,1)=hx(0,1)=hx(0,0)=0 and 2hx2(x,0)=2hx2(x,1)=0. So

01hx(1,y)hx(0,y)e2πinydy=O1n2,012hx2(x,y)e2πinydy=O1n2.

Finally, we have

cmn(h)=O1m2n2(m0,n0). (4)

For m = 0 or n = 0,

cm0(h)=O1m2,c0n(h)=O1n2. (5)

We take Nth hyperbolic cross truncation of the Fourier series [11, 12]:

sN(hc)(h;x,y)=|m|,|n|N|mn|Ncmn(h)e2πi(mx+ny). (6)

By the Parseval identity and estimates (4), (5) of Fourier coefficients, we deduce that the square errors eN(2) satisfy

llllleN(2)2=[0,1]2h(x,y)sN(hc)(h;x,y)2dxdy=|n|>N|cm0(h)|2+|n|>N|c0n(h)|2+|n|Nm0|cmn(h)|2+0<|n|<N|m|N|n||cmn(h)|2=O1N3+O(1)0<|n|<N1n4|m|N|n|1m4=OlogNN3.

Hence f(x,y) is reconstructed by four boundary functions f(x,0), f(x,1), f(0,y), f(1,y) and Fourier coefficients cmn(h) (|mn| ≤ N, |m|,|n| ≤ N) as follows.

Step 1. Reconstruct four boundary functions f(x,0), f(x,1), f(0,y), f(1,y) using the scheme proposal in Section 3.

Step 2. Construct a function g(x,y) which is stated in (2) based on these four boundary functions.

Step 3. Expand h(x,y) = f(x,y)−g(x,y) into Fourier series:

h(x,y)=mncmn(h)e2πi(mx+ny)((x,y)[0,1]2).

Step 4. Take the hyperbolic cross truncations sN(hc) (h;x,y) which are stated in (6).

Step 5. Reconstruct f by the formula: f(x,y)≈ g(x,y)+ sN(hc) (x,y) ((x,y) ∈ [0, 1]2) with the square errors eN(2) satisfying (eN(2))2=O(logNN3).

4 Triple–variate function on [0, 1]3

Let f(x,y,z) be a function on [0, 1]3 and i+j+kfxiyjzk (i,j,k = 0,1,2) be a continuous function on [0, 1]3. We first reconstruct six boundary functions f(ν, y, z), f(x,ν,z), f(x,y,ν) (ν = 0,1) using the method shown in in Section 3. Secondly, we construct a combination g(x,y,z) of six boundary functions and six factors x, y, z, 1−x, 1−y, 1−z such that g(x,y,z) = f(x,y,z) on the boundary ([0, 1]3) as follows.

  1. Take the sum of linear interpolation of f between the boundary functions

    g1(x,y,z)=(f(x,y,0)(1z)+f(x,y,1)z)+(f(x,0,z)(1y)+f(x,1,z)y)+(f(0,y,z)(1x)+f(1,y,z)x)=:g11+g12+g13. (7)
  2. Take the sum of bivariate interpolation of f at boundary points:

    g2(x,y,z)=(f(x,0,0)(1y)(1z)+f(x,0,1)(1y)z+f(x,1,0)y(1z)+f(x,1,1)yz)+(f(0,y,0)(1x)(1z)+f(0,y,1)(1x)z+f(1,y,0)x(1z)+f(1,y,1)xz)+(f(0,0,z)(1x)(1y)+f(0,1,z)(1x)z+f(1,0,z)x(1y)+f(1,1,z)xy)=:g21+g22+g23 (8)
  3. Take triple–variate interpolation of f at vertexes of [0, 1]3:

    g3(x,y,z)=f(0,0,0)(1x)(1y)(1z)+f(1,0,0)x(1y)(1z)+f(0,1,0)(1x)y(1z)+f(0,0,1)(1x)(1y)z+f(1,1,0)xy(1z)+f(1,0,1)x(1y)z+f(0,1,1)(1x)yz+f(1,1,1)xyz. (9)

In detail, each term in g1, such as g12, is the linear interpolation of F1(t) = f(x,t,z) (0 ≤ t ≤ 1) at the each-point t = 0 or t = 1; each term in g2, such as g21, is the bivariate interpolation polynomial of F2(t,s) = f(x,t,s) (0 ≤ s,t ≤ 1) at the vertexes of [0, 1]2. Define

g(x,y,z)=g1(x,y,z)g2(x,y,z)+g3(x,y,z). (10)

Then g is a combination of the boundary values of f and six factors x, (1−x), y, (1−y), z, (1−z).

Theorem 4.1

Let g(x,y,z) be constructed as above. Then g(x,y,z) and f(x,y,z) have same boundary values, i.e., g(x,y,z) = f(x,y,z) on ([0, 1]3).

Proof

By similarity, we only prove g(0,y,z) = f(0,y,z) (0 ≤ y,z ≤ 1).

Note that

g1(0,y,z)=f(0,y,0)(1z)+f(0,y,1)z+f(0,0,z)(1y)+f(0,y,z)f(0,1,z)y,g2(0,y,z)=f(0,0,0)(1y)(1z)+f(0,0,1)(1y)z+f(0,1,0)y(1z)+f(0,1,1)yz+f(0,0,z)(1y)+f(0,1,z)y+f(0,y,0)(1z)+f(0,y,1)z,g3(0,y,z)=f(0,0,0)(1y)(1z)+f(0,1,0)y(1z)+f(0,0,1)(1y)z+f(0,1,1)yz.

Then g(0,y,z) = f(0,y,z). □

Corollary 4.2

Let h(x,y,z) = f(x,y,z)−g(x,y,z). Then h(x,y,z) satisfies:

  1. h(x,y,z) = 0 on ([0, 1]3);

  2. hx(x,y,z)=hy(x,y,z)=hz(x,y,z)=0 at the vertexes {0,1}3.

Proof

By Theorem 4.1, we obtain immediately (i).

For vertexes {0,1}3, by similarity, we only prove hx (1,0,1) = 0.

Note that (x,y,1) ∈ ([0, 1]3) for (x,y) ∈ [0, 1]2. By (i), h(x,y,1) = 0 for (x,y) ∈ [0, 1]2. So hx (x,y,1) = 0 ((x,y) ∈ [0, 1]2). Especially, hx (1,0,1) = 0. □

Now we only need to reconstruct h(x,y,z) by few Fourier coefficients.

For Fourier coefficients:

cn1n2n3(h)=[0,1]3h(x,y,z)e2πi(n1x+n2y+n3z)dxdydz, (11)

we first consider the inner integral. By Corollary 4.2,

[0,1]2h(x,y,z)e2πi(n1x+n2y+n3z)dxdy=1(2πn1)201hx(1,y,z)hx(0,y,z)e2πin2ydy1(2πn1)2[0,1]22hx2(x,y,z)e2πi(n1x+n2y)dxdy=:J1(z)+J2(z) (12)

Since h(x,1,z) = h(x,0,z) = 0 (0 ≤ x,z ≤ 1),

hx(x,1,z)=hx(x,0,z)=0(0x,z1),

and so

J1(z)=i(2πn1)2(2πn2)012hxy(1,y,z)2hxy(0,y,z)e2πin2ydy=1(2πn1)2(2πn2)22hxy(1,y,z)2hxy(0,y,z)1(2πn1)2(2πn2)2013hxy2(1,y,z)3hxy2(0,y,z)e2πin2ydy (13)

By 2hx2(x,ν,z)=0(ν=0,1),

J2(z)=1(2πn1)2(2πin2)[0,1]23hx2y(x,y,z)e2πi(n1x+n2y)dxdy=1(2πn1)2(2πn2)2013hx2y(x,1,z)3hx2y(x,0,z)e2πin1xdx+1(2πn1)2(2πn2)2[0,1]24hx2y2(x,y,z)e2πi(n1x+n2y)dxdy.

Noticing that h(x,y,0) = h(x,y,1) = 0 (0 ≤ x,y ≤ 1), we get

J1(0)=J1(1)=J2(0)=J2(1)=0.

From this and (11)-(13), it follows that

cn1n2n3=01J1(z)e2πin3zdz+01J2(z)e2πin3zdz=O1n12n22n32.

Theorem 4.3

  1. cn1n2n3(h)=O1n12n22n32(n10,n20,n30).

  2. If one of these three numbers n1,n2,n3 vanishes, for example, n2 = 0, then

    cn1,0,n3(h)=O1n12n32(n20,n30).
  3. If two numbers in these three numbers n1,n2,n3 vanish, for example, n1 = n2 = 0, then

    c0,0,n3(h)=O1n32.

To reconstruct h(x,y,z), take the hyperbolic cross truncation of Fourier series of h:

sN(hc)(h;x,y,z)=|n1|,|n2|,|n3|<N|n1n2n3|<Ncn1n2n3(h)e2πi(n1x+n2y+n3z). (14)

By the Parseval identity and Theorem 4.3, we deduce that the square errors eN(3) satisfy

eN(3)2=[0,1]3h(x,y,z)sN(hc)(h;x,y,z)2dxdydz=O(1)0<|n1|<N1n141<|n3|<N1n34|n2|>N|n1n3|1n24+O1N3=Olog2NN3

The number Nd of Fourier coefficients in sN(hc) (h) is equivalent to Nlog2 N. So we get the following theorem.

Theorem 4.4

Let h be stated as above. Then

eN(3)2=[0,1]3h(x,y,z)sN(hc)(x,y,z)2dxdydz=Olog8NdNd3.

For a function f on [0,1]l, the number of Fourier coefficients in Nth hyperbolic cross truncation of its Fourier series is denoted by Nl. To construct f on [0, 1]3, we need one Nth hyperbolic cross truncation of the triple–variate Fourier series, six Nth hyperbolic cross truncations of the bivariate Fourier series, and twelve partial sums of the univariate Fourier series. Hence, the total number of Fourier coefficients are

N~3=N3+6N2+12N1.

Summarizing up the preceding results, we can reconstruct the function f(x,y,z) as follows.

Step 1. Reconstruct six boundary functions:

f(0,y,z),f(1,y,z),f(x,0,z),f(x,1,z),f(x,y,0),f(x,y,1)

using the scheme of reconstructions of bivariate functions on [0, 1]2 proposal in Section 3.

Step 2. Construct a function g(x,y,z) which is stated in (7)-(10) based on these six boundary functions.

Step 3. Expand h(x,y,z) = f(x,y,z)−g(x,y,z) into a triple-variate Fourier series:

h(x,y,z)=n1,n2,n3cn1n2n3(h)e2πi(n1x+n2y+n3z).

Step 4. Take Nth hyperbolic cross truncations sN(hc) (h;x,y,z) which is stated in (14).

Step 5. Reconstruct f by the formula f(x,y,z)≈ g(x,y,z)+ sN(hc) (h;x,y,z) with the square error eN(3) satisfying (eN(3))2=O(log2NN3). The total number of Fourier coefficients are equivalent to Nlog2 N in the reconstruction scheme.

5 The d–variate functions on [0, 1]d

The problem of high-dimension approximation has attracted a wide attention [13,14,15, 16, 17, 18]. Here we will present a novel recursive method to approximate d-variate functions. Let f(x1,…,xd) be a function on [0, 1]d and i1++idfx1i1xdidC([0,1]d)(i1,...,id=0,1,2). The 2d boundary functions are the following:

f(ν,x2,...,xd),f(x1,ν,...,xd),...,f(x1,...,xd1,ν)(ν=0,1) (15)

which are (d−1)–variate functions on [0, 1]d−1. We construct these boundary functions by the method reconstructing d−1 variate functions, and then construct a combination g(x1,…,xd) of 2d boundary functions and 2d factors x1,x2,…,xd, 1−x1, 1−x2,…,1−xd such that g(x1,…,xd) = f(x1,…,xd) on ([0, 1]d).

Let h(x1,…,xd) = f(x1,…,xd)−g(x1,…,xd). Expand h(x1,…,xd) into the d–variate Fourier series:

h(x1,...,xd)=n1,n2,...,ndcn1n2nde2πi(n1x1+ndxd),

where cn1n2nd=O(1n12n22nd2). Take the hyperbolic cross truncations of the Fourier series:

sN(hc)(h;x1,...,xd)=|n1|,|n2|,...,|nd|<N|n1nd|<Ncn1n2nd(h)e2πi(n1x1++ndxd).

By the Parseval identity and Fourier coefficients estimate, we deduce that the square error eN(d) satisfies

eN(d)2=[0,1]dh(x1,...,xd)sN(hc)(h;x1,...,xd)2dx1dxd=Ologd1NN3.

The number of Fourier coefficients in sN(hc) is

Nd=|n1|,...,|nd|<N|n1nd|<N11Ndx11Nx1dx21Nx1xddxdNlogd1N.

So

eN(d)2=Olog4d4NdNd3.

Note that the reconstruction of each boundary function in (5.1) needs Nlogd−2 N Fourier coefficients of one function on [0, 1]d−1 and 2d−2 functions on [0, 1]d−2 with the error eN(d1) satisfying (eN(d1))2=Ologd2NN3.

Continuing this procedure, we deduce that the reconstruction of functions on [0, 1]d needs d Fourier coefficients and the values of f(x1,…,xd) at vertexes on [0, 1]d, where

Adlogd1NN~dBdlogd1N,

where Ad and Bd are constants depending on d. The total square errors e~N(d) satisfy

e~N(d)2=Ologd1NN3=Olog4d4N~dN~d3.

Our method can not only approximate smooth multivariate functions on the cube well, but also approximate piecewise-smooth multivariate functions with on a general region. Under that case, based on the smoothness of functions, we divide the general region into the union of some cubes with difference size which contain smooth parts and a very small region which contains non-smooth parts. Because of piecewise smoothness, we can make the size of the region containing non-smooth parts as small as possible. Finally, we will apply our novel recursive method on each cube.

6 Numerical results

In this section, we will give some numerical results in order to compare our method with traditional Fourier methods. Due to the similarity, we only discuss one-dimensional and two-dimensional cases.

First we consider a univariate function f(x) = ex (x ∈ [0, 1]). Using the method in Section 2, we will construct a new function φ(x) such that

φ(x)=f(x)f(0)(1x)f(1)x=ex+(1e)x1.

Then we will expend φ(x) into Fourier series and numerically compute the Fourier coefficients by using discrete Fourier transform. After that, we will reconstruct f(x) by using f(0), f(1) and the Fourier coefficients of φ(x). The approximation error will be measured as

01(f(x)frecon(x))2dx01f2(x)dx

Figure 1 shows approximation errors by using traditional Fourier method and our method. It is clear that our method can reconstruct f(x) with much smaller error than traditional Fourier methods.

Figure 1 
Approximation of f(x) = ex by traditional Fourier method and our method
Figure 1

Approximation of f(x) = ex by traditional Fourier method and our method

Next we consider a bivariate function f(x,y) = ex+y on [0, 1]2. Using the method in Section 3, we will construct g(x,y):

g(x,y)=ex(1y)+ex+1y+ey(1x)+ey+1x(1x)(1y)e(1x)yex(1y)e2xy.

and h(x,y) = f(x,y)−g(x,y). Since g(x,y) is completely determined by four boundary functions f(x,0), f(x,1), f(0,y) and f(1,y). In order to reconstruct g(x,y) well, with the help of our method in Section 2, we need to construct the following function:

φ1(x)=f(x,0)f(0,0)(1x)f(1,0)x=ex(1x)exφ2(x)=f(x,1)f(0,1)(1x)f(1,1)x=ex+1e(1x)e2xφ3(y)=f(0,y)f(0,0)(1y)f(0,1)y=ey(1y)eyφ4(y)=f(1,y)f(1,0)(1y)f(1,1)y=e1+ye(1y)e2y

Then we will expand h(x,y), φ1(x), φ2(x), φ3(y), and φ4(y) into Fourier series. Finally, we will reconstruct f(x,y) by f(0,0), f(0,1), f(1,0), f(1,1), partial sums of Fourier series of four univariate functions φ1(x), φ2(x), φ3(y) and φ4(y), as well as the hyperbolic cross truncations of bivariate Fourier series of h(x,y). Figure 2 shows approximation errors by using traditional Fourier method based on hyperbolic cross truncations and our method. It is clear that our method can reconstruct f(x,y) with much smaller error than traditional Fourier method.

Figure 2 
Approximation of f(x,y) = ex+y by traditional Fourier method and our method
Figure 2

Approximation of f(x,y) = ex+y by traditional Fourier method and our method

Acknowledgement

The author is grateful to the reviewers for their valuable comments. This research is partially supported by National Key Science Programme for Global Change Research 2015CB953602, Beijing Higher Education Young Elite Teacher Project, and Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry.

References

[1] Boashash B., Time-frequency signal analysis and processing, 2nd ed., Academic Press, New York, 2016.Search in Google Scholar

[2] DoVore A., Lorentz G. G., Constructive approximation, Vol. 303 of Grundlehren, Springer, Hcidelberg, 1993.10.1007/978-3-662-02888-9Search in Google Scholar

[3] DoVore A., Konyagin S., Temlyakov V., Hyperbolic wavelet approximation, Constr. Approx, 1998, 14, 1-26.10.1007/s003659900060Search in Google Scholar

[4] Lorentz, G.G., von Golitschck M., Makovoz J., Constructive approximation: Advanced Problems, Springer, Berlin, 1996.10.1007/978-3-642-60932-9Search in Google Scholar

[5] Stein E. M., Weiss G., Introduction to Fourier analysis on Euclidean spaces, Princeton Univ. Press, 1971.10.1515/9781400883899Search in Google Scholar

[6] Timan A. F., Theory at approximation of Functions of a real variable, Pergamon, 1963.10.1016/B978-0-08-009929-3.50008-7Search in Google Scholar

[7] Zygmund A., Trigonometric series, 2nd ed., Cambridge, 1968.Search in Google Scholar

[8] Zhang Z., Approximation of bivariate functions via smooth extensions, Sci. World Journal, Article ID 102062, 2014.10.1155/2014/102062Search in Google Scholar PubMed PubMed Central

[9] Zhang Z., Environmental Data Analysis: Methods and Application, DeGruyter, Berlin, 2016.10.1515/9783110424904Search in Google Scholar

[10] Butzer P.L., Nessel, R.J., Fourier Analysis and Approximation I, Academic Press, New York, 1971.10.1007/978-3-0348-7448-9Search in Google Scholar

[11] Barthelmann V., Novak E., Ritter K., High dimensional polynomial interpolation on sparse grids, Adv. Comput. Math., 2000, 12, 273-288.10.1023/A:1018977404843Search in Google Scholar

[12] Shen J., Yu H., Efficient spectral sparse grid methods and applications to high-dimensional elliptic problems, SIAM J. Sci. Comput., 2010, 32, 3228-3250.10.1137/100787842Search in Google Scholar

[13] Costarelli D., Neural network operators: constructive interpolation of multivariate functions, Neural Networks, 2015, 67, 28-36.10.1016/j.neunet.2015.02.002Search in Google Scholar

[14] Reimer M., On multivariate polynomials of least deviation from zero on the unit cube, J. Approx. Theory, 1978, 23, 65-69.10.1016/0021-9045(78)90078-3Search in Google Scholar

[15] Reimer M., On multivariate polynomials of least deviation from zero on the unit ball, Math. Zeitschrift, 1977, 153, 51-58.10.1007/BF01214733Search in Google Scholar

[16] Fard S.P., Zainuddin Z., The universal approximation capabilities of cylindrical approximate identity neural networks, Arab. J. Sci. Eng., 2016, 41, 1-8.10.1007/s13369-016-2067-9Search in Google Scholar

[17] Costarelli D., Vinti G., Rate of approximation for multivariate sampling Kantorovich operators on some functions spaces, J. Int. Eq. Appl. 2014, 26, 455-481.10.1216/JIE-2014-26-4-455Search in Google Scholar

[18] Costarelli D., Vinti G., Degree of approximation for nonlinear multivariate sampling Kantorovich operators on some functions spaces, Num. Funct. Anal. Optimization, 2015, 36, 964-990.10.1080/01630563.2015.1040888Search in Google Scholar

Received: 2016-11-3
Accepted: 2017-11-16
Published Online: 2017-12-29

© 2017 Zhang

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Articles in the same Issue

  1. Regular Articles
  2. Integrals of Frullani type and the method of brackets
  3. Regular Articles
  4. Edge of chaos in reaction diffusion CNN model
  5. Regular Articles
  6. Calculus using proximities: a mathematical approach in which students can actually prove theorems
  7. Regular Articles
  8. An investigation on hyper S-posets over ordered semihypergroups
  9. Regular Articles
  10. The Leibniz algebras whose subalgebras are ideals
  11. Regular Articles
  12. Fixed point and multidimensional fixed point theorems with applications to nonlinear matrix equations in terms of weak altering distance functions
  13. Regular Articles
  14. Matrix rank and inertia formulas in the analysis of general linear models
  15. Regular Articles
  16. The hybrid power mean of quartic Gauss sums and Kloosterman sums
  17. Regular Articles
  18. Tauberian theorems for statistically (C,1,1) summable double sequences of fuzzy numbers
  19. Regular Articles
  20. Some properties of graded comultiplication modules
  21. Regular Articles
  22. The characterizations of upper approximation operators based on special coverings
  23. Regular Articles
  24. Bi-integrable and tri-integrable couplings of a soliton hierarchy associated with SO(4)
  25. Regular Articles
  26. Dynamics for a discrete competition and cooperation model of two enterprises with multiple delays and feedback controls
  27. Regular Articles
  28. A new view of relationship between atomic posets and complete (algebraic) lattices
  29. Regular Articles
  30. A class of extensions of Restricted (s, t)-Wythoff’s game
  31. Regular Articles
  32. New bounds for the minimum eigenvalue of 𝓜-tensors
  33. Regular Articles
  34. Shintani and Shimura lifts of cusp forms on certain arithmetic groups and their applications
  35. Regular Articles
  36. Empirical likelihood for quantile regression models with response data missing at random
  37. Regular Articles
  38. Convex combination of analytic functions
  39. Regular Articles
  40. On the Yang-Baxter-like matrix equation for rank-two matrices
  41. Regular Articles
  42. Uniform topology on EQ-algebras
  43. Regular Articles
  44. Integrations on rings
  45. Regular Articles
  46. The quasilinear parabolic kirchhoff equation
  47. Regular Articles
  48. Avoiding rainbow 2-connected subgraphs
  49. Regular Articles
  50. On non-Hopfian groups of fractions
  51. Regular Articles
  52. Singularly perturbed hyperbolic problems on metric graphs: asymptotics of solutions
  53. Regular Articles
  54. Rings in which elements are the sum of a nilpotent and a root of a fixed polynomial that commute
  55. Regular Articles
  56. Superstability of functional equations related to spherical functions
  57. Regular Articles
  58. Evaluation of the convolution sum involving the sum of divisors function for 22, 44 and 52
  59. Regular Articles
  60. Weighted minimal translation surfaces in the Galilean space with density
  61. Regular Articles
  62. Complete convergence for weighted sums of pairwise independent random variables
  63. Regular Articles
  64. Binomials transformation formulae for scaled Fibonacci numbers
  65. Regular Articles
  66. Growth functions for some uniformly amenable groups
  67. Regular Articles
  68. Hopf bifurcations in a three-species food chain system with multiple delays
  69. Regular Articles
  70. Oscillation and nonoscillation of half-linear Euler type differential equations with different periodic coefficients
  71. Regular Articles
  72. Osculating curves in 4-dimensional semi-Euclidean space with index 2
  73. Regular Articles
  74. Some new facts about group 𝒢 generated by the family of convergent permutations
  75. Regular Articles
  76. lnfinitely many solutions for fractional Schrödinger equations with perturbation via variational methods
  77. Regular Articles
  78. Supersolvable orders and inductively free arrangements
  79. Regular Articles
  80. Asymptotically almost automorphic solutions of differential equations with piecewise constant argument
  81. Regular Articles
  82. Finite groups whose all second maximal subgroups are cyclic
  83. Regular Articles
  84. Semilinear systems with a multi-valued nonlinear term
  85. Regular Articles
  86. Positive solutions for Hadamard differential systems with fractional integral conditions on an unbounded domain
  87. Regular Articles
  88. Calibration and simulation of Heston model
  89. Regular Articles
  90. One kind sixth power mean of the three-term exponential sums
  91. Regular Articles
  92. Cyclic pairs and common best proximity points in uniformly convex Banach spaces
  93. Regular Articles
  94. The uniqueness of meromorphic functions in k-punctured complex plane
  95. Regular Articles
  96. Normalizers of intermediate congruence subgroups of the Hecke subgroups
  97. Regular Articles
  98. The hyperbolicity constant of infinite circulant graphs
  99. Regular Articles
  100. Scott convergence and fuzzy Scott topology on L-posets
  101. Regular Articles
  102. One sided strong laws for random variables with infinite mean
  103. Regular Articles
  104. The join of split graphs whose completely regular endomorphisms form a monoid
  105. Regular Articles
  106. A new branch and bound algorithm for minimax ratios problems
  107. Regular Articles
  108. Upper bound estimate of incomplete Cochrane sum
  109. Regular Articles
  110. Value distributions of solutions to complex linear differential equations in angular domains
  111. Regular Articles
  112. The nonlinear diffusion equation of the ideal barotropic gas through a porous medium
  113. Regular Articles
  114. The Sheffer stroke operation reducts of basic algebras
  115. Regular Articles
  116. Extensions and improvements of Sherman’s and related inequalities for n-convex functions
  117. Regular Articles
  118. Classification lattices are geometric for complete atomistic lattices
  119. Regular Articles
  120. Possible numbers of x’s in an {x, y}-matrix with a given rank
  121. Regular Articles
  122. New error bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices
  123. Regular Articles
  124. Boundedness of vector-valued B-singular integral operators in Lebesgue spaces
  125. Regular Articles
  126. On the Golomb’s conjecture and Lehmer’s numbers
  127. Regular Articles
  128. Some applications of the Archimedean copulas in the proof of the almost sure central limit theorem for ordinary maxima
  129. Regular Articles
  130. Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  131. Regular Articles
  132. Corrigendum to: Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  133. Regular Articles
  134. Convergence and stability of generalized φ-weak contraction mapping in CAT(0) spaces
  135. Regular Articles
  136. Triple solutions for a Dirichlet boundary value problem involving a perturbed discrete p(k)-Laplacian operator
  137. Regular Articles
  138. OD-characterization of alternating groups Ap+d
  139. Regular Articles
  140. On Jordan mappings of inverse semirings
  141. Regular Articles
  142. On generalized Ehresmann semigroups
  143. Regular Articles
  144. On topological properties of spaces obtained by the double band matrix
  145. Regular Articles
  146. Representing derivatives of Chebyshev polynomials by Chebyshev polynomials and related questions
  147. Regular Articles
  148. Chain conditions on composite Hurwitz series rings
  149. Regular Articles
  150. Coloring subgraphs with restricted amounts of hues
  151. Regular Articles
  152. An extension of the method of brackets. Part 1
  153. Regular Articles
  154. Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
  155. Regular Articles
  156. Strong edge geodetic problem in networks
  157. Regular Articles
  158. Ricci solitons on almost Kenmotsu 3-manifolds
  159. Regular Articles
  160. Uniqueness of meromorphic functions sharing two finite sets
  161. Regular Articles
  162. On the fourth-order linear recurrence formula related to classical Gauss sums
  163. Regular Articles
  164. Dynamical behavior for a stochastic two-species competitive model
  165. Regular Articles
  166. Two new eigenvalue localization sets for tensors and theirs applications
  167. Regular Articles
  168. κ-strong sequences and the existence of generalized independent families
  169. Regular Articles
  170. Commutators of Littlewood-Paley gκ -functions on non-homogeneous metric measure spaces
  171. Regular Articles
  172. On decompositions of estimators under a general linear model with partial parameter restrictions
  173. Regular Articles
  174. Groups and monoids of Pythagorean triples connected to conics
  175. Regular Articles
  176. Hom-Lie superalgebra structures on exceptional simple Lie superalgebras of vector fields
  177. Regular Articles
  178. Numerical methods for the multiplicative partial differential equations
  179. Regular Articles
  180. Solvable Leibniz algebras with NFn Fm1 nilradical
  181. Regular Articles
  182. Evaluation of the convolution sums ∑al+bm=n lσ(l) σ(m) with ab ≤ 9
  183. Regular Articles
  184. A study on soft rough semigroups and corresponding decision making applications
  185. Regular Articles
  186. Some new inequalities of Hermite-Hadamard type for s-convex functions with applications
  187. Regular Articles
  188. Deficiency of forests
  189. Regular Articles
  190. Perfect codes in power graphs of finite groups
  191. Regular Articles
  192. A new compact finite difference quasilinearization method for nonlinear evolution partial differential equations
  193. Regular Articles
  194. Does any convex quadrilateral have circumscribed ellipses?
  195. Regular Articles
  196. The dynamic of a Lie group endomorphism
  197. Regular Articles
  198. On pairs of equations in unlike powers of primes and powers of 2
  199. Regular Articles
  200. Differential subordination and convexity criteria of integral operators
  201. Regular Articles
  202. Quantitative relations between short intervals and exceptional sets of cubic Waring-Goldbach problem
  203. Regular Articles
  204. On θ-commutators and the corresponding non-commuting graphs
  205. Regular Articles
  206. Quasi-maximum likelihood estimator of Laplace (1, 1) for GARCH models
  207. Regular Articles
  208. Multiple and sign-changing solutions for discrete Robin boundary value problem with parameter dependence
  209. Regular Articles
  210. Fundamental relation on m-idempotent hyperrings
  211. Regular Articles
  212. A novel recursive method to reconstruct multivariate functions on the unit cube
  213. Regular Articles
  214. Nabla inequalities and permanence for a logistic integrodifferential equation on time scales
  215. Regular Articles
  216. Enumeration of spanning trees in the sequence of Dürer graphs
  217. Regular Articles
  218. Quotient of information matrices in comparison of linear experiments for quadratic estimation
  219. Regular Articles
  220. Fourier series of functions involving higher-order ordered Bell polynomials
  221. Regular Articles
  222. Simple modules over Auslander regular rings
  223. Regular Articles
  224. Weighted multilinear p-adic Hardy operators and commutators
  225. Regular Articles
  226. Guaranteed cost finite-time control of positive switched nonlinear systems with D-perturbation
  227. Regular Articles
  228. A modified quasi-boundary value method for an abstract ill-posed biparabolic problem
  229. Regular Articles
  230. Extended Riemann-Liouville type fractional derivative operator with applications
  231. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  232. The algebraic size of the family of injective operators
  233. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  234. The history of a general criterium on spaceability
  235. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  236. On sequences not enjoying Schur’s property
  237. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  238. A hierarchy in the family of real surjective functions
  239. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  240. Dynamics of multivalued linear operators
  241. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  242. Linear dynamics of semigroups generated by differential operators
  243. Special Issue on Recent Developments in Differential Equations
  244. Isomorphism theorems for some parabolic initial-boundary value problems in Hörmander spaces
  245. Special Issue on Recent Developments in Differential Equations
  246. Determination of a diffusion coefficient in a quasilinear parabolic equation
  247. Special Issue on Recent Developments in Differential Equations
  248. Homogeneous two-point problem for PDE of the second order in time variable and infinite order in spatial variables
  249. Special Issue on Recent Developments in Differential Equations
  250. A nonlinear plate control without linearization
  251. Special Issue on Recent Developments in Differential Equations
  252. Reduction of a Schwartz-type boundary value problem for biharmonic monogenic functions to Fredholm integral equations
  253. Special Issue on Recent Developments in Differential Equations
  254. Inverse problem for a physiologically structured population model with variable-effort harvesting
  255. Special Issue on Recent Developments in Differential Equations
  256. Existence of solutions for delay evolution equations with nonlocal conditions
  257. Special Issue on Recent Developments in Differential Equations
  258. Comments on behaviour of solutions of elliptic quasi-linear problems in a neighbourhood of boundary singularities
  259. Special Issue on Recent Developments in Differential Equations
  260. Coupled fixed point theorems in complete metric spaces endowed with a directed graph and application
  261. Special Issue on Recent Developments in Differential Equations
  262. Existence of entropy solutions for nonlinear elliptic degenerate anisotropic equations
  263. Special Issue on Recent Developments in Differential Equations
  264. Integro-differential systems with variable exponents of nonlinearity
  265. Special Issue on Recent Developments in Differential Equations
  266. Elliptic operators on refined Sobolev scales on vector bundles
  267. Special Issue on Recent Developments in Differential Equations
  268. Multiplicity solutions of a class fractional Schrödinger equations
  269. Special Issue on Recent Developments in Differential Equations
  270. Determining of right-hand side of higher order ultraparabolic equation
  271. Special Issue on Recent Developments in Differential Equations
  272. Asymptotic approximation for the solution to a semi-linear elliptic problem in a thin aneurysm-type domain
  273. Topical Issue on Metaheuristics - Methods and Applications
  274. Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
  275. Topical Issue on Metaheuristics - Methods and Applications
  276. Nature–inspired metaheuristic algorithms to find near–OGR sequences for WDM channel allocation and their performance comparison
  277. Topical Issue on Cyber-security Mathematics
  278. Monomial codes seen as invariant subspaces
  279. Topical Issue on Cyber-security Mathematics
  280. Expert knowledge and data analysis for detecting advanced persistent threats
  281. Topical Issue on Cyber-security Mathematics
  282. Feedback equivalence of convolutional codes over finite rings
Downloaded on 10.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/math-2017-0132/html
Scroll to top button