Skip to main content
The Scientific World Journal logoLink to The Scientific World Journal
. 2014 Jul 24;2014:265031. doi: 10.1155/2014/265031

Hyperbolic Cross Truncations for Stochastic Fourier Cosine Series

Zhihua Zhang 1,*
PMCID: PMC4134834  PMID: 25147842

Abstract

Based on our decomposition of stochastic processes and our asymptotic representations of Fourier cosine coefficients, we deduce an asymptotic formula of approximation errors of hyperbolic cross truncations for bivariate stochastic Fourier cosine series. Moreover we propose a kind of Fourier cosine expansions with polynomials factors such that the corresponding Fourier cosine coefficients decay very fast. Although our research is in the setting of stochastic processes, our results are also new for deterministic functions.

1. Introduction

For approximations of multivariate functions by algebraic/trigonometric polynomials on full grids, the approximation rate deteriorates rapidly as the dimension d increases [1, 2]; this is just so-called “dimension curse” problem. In order to solve it, hyperbolic cross approximations have received much attention in recent years [1, 35]. For multivariate periodic functions, Griebel and Hamaekers [4] discussed hyperbolic cross trigonometric approximation and gave the corresponding error estimate. Instead of trigonometric polynomial space on full grids, they used the hyperbolic cross space:

XN=span{exp(ik·x):|k|mix=j=1dmax{|kj|,1}N}, (1)

as approximation space. In 2010, Shen and Wang [1] studied the hyperbolic cross Jacobi polynomial approximation for functions on the unit cube and gave various formulas on error estimates. Moreover, they also considered the hyperbolic cross Hermite/Laguerre polynomial approximation. In 2009, Boyd [6] deeply researched large-degree asymptotics for Fourier, Chebyshev, and Hermite coefficients of analytic functions. For high-dimensional polynomial interpolation approximation, one often uses tensor product method to generalize one-dimensional interpolation polynomial approximation with Chebyshev knots. In 2000, Barthelmann et al. [3] showed that when the dimension is larger than 10, it is suggested to use sparse grids instead of full grids. Moreover, Barthelmann et al. obtained the corresponding error estimates.

Up to now, for various hyperbolic cross approximation, the asymptotic formulas of approximation errors are not available. In this paper, we will deeply study the hyperbolic cross approximation in Fourier cosine analyses and give a precise asymptotic formula of approximation error of hyperbolic cross truncation. Although our research is in the setting of stochastic processes, our results are also new for deterministic functions.

In order to obtain asymptotic formulas of approximation errors, we first decompose stochastic process ξ on [0,1]2 into a sum of three terms ξ = P ξ + ξ 2 + ξ 3, where P ξ is a stochastic polynomial determined by partial derivatives of ξ at vertexes of [0,1]2, ξ 2 is determined by partial derivative values of ξ on the boundary of [0,1]2 and is a sum of four univariate stochastic processes with simple polynomial factors, and ξ 3 is a bivariate stochastic process whose partial derivatives vanish on the boundary of [0,1]2.

Secondly, based on the above decomposition, we show that Fourier cosine coefficients of a bivariate stochastic process ξ on [0,1]2 can be approximated asymptotically by a combination of partial derivatives of ξ at vertexes of [0,1]2 and univariate cosine coefficients on the boundary of [0,1]2.

Thirdly, for hyperbolic cross approximation, we give the following precise result: if ξ is a stochastic process on [0,1]2 with smoothness index l ≥ 2, then its hyperbolic cross truncations S N (h)(ξ) (see (16)) of stochastic Fourier cosine series of ξ satisfy the following asymptotic formula:

E[[0,1]2(SN(h)(ξ;t)ξ(t))2dt]=MlogNN3(1+o(1))(N), (2)

where

M=43π8E[(ξ(1,1)(0,0))2+(ξ(1,1)(0,1))2+(ξ(1,1)(1,0))2+(ξ(1,1)(1,1))2], (3)

and E is the mathematical expectation.

Finally, based on our decomposition of stochastic processes, we propose Fourier cosine expansions with polynomial factors (see (111)) whose hyperbolic cross truncations are a combination of stochastic algebraic polynomials and stochastic cosine polynomials. When the smoothness index l ≥ 3 of the stochastic process, for partial sum approximation, hyperbolic cross approximation, and hyperbolic cross approximation with polynomial factors, the square of their approximation errors are

O(1Nc3/2),O(log4NcNc3),o(log6NcNc5), (4)

respectively, where N c is the number of Fourier cosine coefficients used in each approximation method. From this, we see that hyperbolic cross approximation with polynomial factors can reconstruct the stochastic process on [0,1]2 by using the least Fourier cosine coefficients.

This paper is organized as follows. In Section 2 we recall stochastic calculus and stochastic Fourier cosine series. In Section 3 we give decompositions of stochastic processes. In Section 4 we discuss univariate stochastic Fourier cosine analyses. In Section 5 we give an asymptotic formula of Fourier cosine coefficients for bivariate stochastic processes. In Section 6 we discuss partial sum approximations. In Section 7 we discuss hyperbolic cross approximations. In Section 8, we present the Fourier cosine series with polynomial factors and study its hyperbolic cross approximations.

2. Fourier Cosine Series of Stochastic Processes

We recall some concepts in calculus of stochastic processes and stochastic Fourier cosine series.

2.1. Calculus of Stochastic Processes

For a stochastic variable ξ, we denote its expectation, second-order moment, and variance by E[ξ], E[ξ 2], and Var⁡(ξ), respectively. If ξ(t) is a stochastic variable for each t ∈ [0,1]d, then we say ξ(t) is a stochastic process on [0,1]d. In this paper, we always assume that a stochastic process ξ(t) is real-valued and satisfies E[ξ 2(t)] < for each t. This ensures that its expectation, variance, and second-order moment always exist. Calculus of stochastic processes is a generalization of classical calculus. Let {ξ n}1 be a sequence of stochastic variables and let ξ be a stochastic variable. If lim⁡nE[|ξ nξ|2] = 0, we say that ξ is the limit of {ξ n}1 . Starting from the concept of the limit, one defines continuity, derivatives, partial derivatives, integrals, and double integrals of stochastic processes [7]. Moreover, Newton-Leibnitz formula in calculus of stochastic processes is as follows. If ξ is a differentiable stochastic process on [0,1] and the derivative ξ′ is continuous on [0,1], then

01ξ(t)dt=ξ(1)ξ(0). (5)

Let ξ(t) be a continuously differentiable stochastic process on [0,1] and let f(t) be a continuously differentiable deterministic function on [0,1]. Then [7]

(ξ(t)f(t))=ξ(t)f(t)+ξ(t)f(t);01ξ(t)f(t)dt=ξ(1)f(1)ξ(0)f(0)01ξ(t)f(t)dt. (6)

Burkardt et al. studied stochastic partial differential equations in [8]. Xiu reviewed the current state-of-the-art of numerical method for stochastic computations in [9].

2.2. Fourier Cosine Series

If ξ(t) is a univariate stochastic process on [0,1] and E[∫0 1 ξ 2(t)dt] < , then it can be expanded into the Fourier cosine series

ξ(t)=n=0cn(ξ)cosπnt (7)

in mean square sense; that is,

E[||SN(ξ)ξ||22]=E[01(n=0N1cn(ξ)cos(πnt)ξ(t))2dt]0asN, (8)

where

c0(ξ)=01ξ(t)dt,cn(ξ)=201ξ(t)cos(πnt)dt(n0). (9)

The corresponding Parseval identity is

E[01ξ2(t)dt]=E[c02(ξ)]+12n=1E[cn2(ξ)]. (10)

If ξ(t 1, t 2) is a bivariate stochastic process on [0,1]2 and E[∫[0,1]2 ξ 2(t 1, t 2)dt 1dt 2] < , then it can be expanded into the Fourier cosine series

ξ(t1,t2)=n1,n2=0cn1,n2(ξ)cos(πn1t1)cos(πn2t2) (11)

in mean square sense, where Fourier sine coefficients

cn1,n2(ξ)=λn1,n2[0,1]2ξ(t1,t2)cos(πn1t1)cos(πn2t2)dt1dt2 (12)

are stochastic variables and

λn1,n2={1,n1=n2=0,2,n1=0,n20orn2=0,n10,4,n10,n20. (13)

The corresponding Parseval identity holds:

E[[0,1]2ξ2(t1,t2)dt1dt2]=n1,n2=0E[cn1,n22(ξ)]λn1,n2. (14)

2.3. Partial Sums and Hyperbolic Cross Truncations

Let ξ be a stochastic process on [0,1]2. Partial sums of its Fourier cosine series are

SN(r)(ξ;t1,t2)=n1,n2=0N1cn1,n2(ξ)cos(πn1t1)cos(πn2t2)(NZ+). (15)

The number of Fourier cosine coefficients in the partial sum S N (r)(ξ) is N 2.

Hyperbolic cross truncations of its Fourier cosine series are

SN(h)(ξ;t1,t2)=n1=0N1cn1,0(ξ)cos(πn1t2)+n2=1N1n1=0[(N1)/n2]1cn1,n2(ξ)cos(πn1t1)cos(πn2t2), (16)

where [·] means the integral part. The number of Fourier cosine coefficients in the hyperbolic cross truncation S N (h)(ξ) is of order Nlog⁡N. The hyperbolic cross approximations have been widely used in multivariate function approximation [1, 35].

2.4. Some Notations

For convenience, we denote vertexes of the unit square [0,1]2 by {0,1}2, the boundary of [0,1]2 by ∂([0,1]2).

For a bivariate stochastic process ξ(t 1, t 2), denote its mixed derivative ∂l1+l2 ξ/∂t 1 l1t 2 l2 by ξ (l1,l2). The notation C s([0,1]2) represents the set of continuous stochastic processes on [0,1]2. If ξ (l,l)C s([0,1]2), then we say ξ has the smoothness index l on [0,1]2.

Let {a n} and {b n} be two sequences. If K 1 | a n | ≤|b n | ≤K 2 | a n| for any n, then we say a n ~ b n; if |a n | ≤K 3 | b n| for any n, then we say a n = O(b n); here K i are constants independent of n. If a n → 0, b n → 0, and a n/b n → 0 as n, then we say a n = o(b n). If a n1,n2 → 0 and b n1,n2 → 0, and a n1,n2/b n1,n2 → 0 as ||n||=n12+n22, then we say a n1,n2 = o(b n1,n2).

3. Decomposition of Stochastic Processes

In order to study stochastic Fourier cosine series, we give a decomposition of stochastic processes. Although this decomposition is given in the setting of stochastic processes, it is also new for deterministic functions.

Let ξ be a bivariate stochastic process on [0,1]2 and ξ (l,l)C s([0,1]2) for some l ≥ 1. First, based on a fundamental polynomial p(t) = t 2/2 − 1/6, we construct a stochastic polynomial P ξ as follows:

Pξ(t1,t2)=ξ(1,1)(0,0)p(1t1)p(1t2)ξ(1,1)(0,1)p(1t1)p(t2)ξ(1,1)(1,0)p(t1)p(1t2)+ξ(1,1)(1,1)p(t1)p(t2). (17)

This stochastic polynomial is determined by partial derivatives of ξ at vertexes {0,1}2.

Denote

ξ1(t1,t2)=ξ(t1,t2)Pξ(t1,t2). (18)

The following is clear.

Proposition 1 . —

Let ξ be a bivariate stochastic process on [0,1]2 with smoothness index l ≥ 1 and ξ 1 be stated in (18). Then

ξ1(1,1)(0,0)=ξ1(1,1)(0,1)=ξ1(1,1)(1,0)=ξ1(1,1)(1,1)=0. (19)

Now we define

ξ2(t1,t2)=ξ1(1,0)(0,t2)p(1t1)+ξ1(1,0)(1,t2)p(t1)ξ1(0,1)(t1,0)p(1t2)+ξ1(0,1)(t1,1)p(t2), (20)
ξ3(t1,t2)=ξ1(t1,t2)ξ2(t1,t2), (21)

and we derive the following.

Proposition 2 . —

Let ξ be a bivariate stochastic process on [0,1]2 with smoothness index l ≥ 1 and ξ 3 be stated in (21). Then

ξ3(1,1)(t1,t2)=0,(t1,t2)([0,1]2). (22)

Proof —

Consider the bottom side 0 ≤ t 1 ≤ 1, t 2 = 0 of the square [0,1]2. Using Proposition 1, it follows from (20) that ξ 2 (1,1)(t 1, 0) = ξ 1 (1,1)(t 1, 0)p′(1) = ξ 1 (1,1)(t 1, 0)  (0 ≤ t 1 ≤ 1). Therefore, by ξ 3 = ξ 1ξ 2, we get ξ 3 (1,1)(t 1, t 2) = 0  (0 ≤ t 1 ≤ 1, t 2 = 0). Similarly, ξ 3 (1,1) vanishes on other sides of the square [0,1]2.

From (18) and (21), we get a decomposition of stochastic processes on [0,1]2 as follows.

Let ξ be a stochastic process on [0,1]2 and ξ (l,l)C s([0,1]2) for some l ≥ 1. Then the decomposition

ξ=Pξ+ξ2+ξ3 (23)

holds, where P ξ, ξ 2, and ξ 3 are stated in (17), (20), and (21), respectively.

4. Univariate Stochastic Fourier Cosine Series

Suppose that ξ is a stochastic process on [0,1] and the derivative ξ (l)C s([0,1]) for some l ≥ 2. Its Fourier cosine coefficients are as follows:

cn(ξ)=201ξ(t)cos(πnt)dt=gn+rn, (24)

where

gn=2(nπ)2(ξ(0)(1)nξ(1)),rn=2(nπ)201ξ′′(t)cos(πnt)dt. (25)

Since the expectation and the integral can be exchanged and E[ξ′′(t)] ∈ C([0,1]), using the Riemann-Lebesgue lemma [1012], we get

E[rn]=2(nπ)201E[ξ(t)]cos(πnt)dt=o(1n2). (26)

From (25),

rn2=4(nπ)4[0,1]2ξ′′(t)ξ′′(s)cos(πnt)cos(πns)dtds. (27)

Again, by the Riemann-Lebesgue lemma, we get

E[rn2]=4(nπ)4[0,1]2E[ξ′′(t)ξ′′(s)]cos(πnt)cos(πns)dtds=o(1n4). (28)

Since Var⁡(r n) ≤ E[r n 2], we have Var⁡(r n) = o(1/n 4). By (24) and (28), we get

E[cn2(ξ)]=E[gn2+2gnrn+rn2]=E[gn2]+2E[gnrn]+o(1n4). (29)

By the Schwarz inequality,

|E[gnrn]|(E[gn2])1/2(E[rn2])1/2=o(1n4). (30)

Therefore, we have

E[c2n2(ξ)]+E[c2n+12(ξ)]=12(nπ)4E[(ξ(0))2+(ξ(1))2]+o(1n4). (31)

By the Parseval identity, the partial sums of its Fourier cosine series S N(ξ; t) = ∑k=0 N−1 c k(ξ)cos⁡(πnt) satisfy

E[||SN(ξ)ξ||22]=E[01(SN(ξ;t)ξ(t))2dt]=12n=NE[cn2(ξ)]=23π4N3E[(ξ(0))2+(ξ(1))2]+o(1N3). (32)

From this, we deduce that E[||S N(ξ)−ξ||2 2] = o(1/N 3) if and only if ξ′(0) = ξ′(1) = 0.

5. Asymptotic Representations of Bivariate Fourier Cosine Coefficients

Suppose that ξ is a bivariate stochastic process on [0,1]2 and ξ (l,l)C s([0,1]2) for some l ≥ 2. We expand ξ into the Fourier cosine series

ξ(t1,t2)=n1,n2=0cn1,n2(ξ)cos(πn1t1)cos(πn2t2) (33)

and Fourier coefficients

cn1,n2(ξ)=λn1,n2[0,1]2ξ(t1,t2)cos(πn1t1)cos(πn2t2)dt1dt2, (34)

where λ n1,n2 is stated in (13).

Based on the decomposition (23) of bivariate stochastic processes, we have

cn1,n2(ξ)=cn1,n2(Pξ)+cn1,n2(ξ2)+cn1,n2(ξ3). (35)

In order to obtain the asymptotic representation of Fourier cosine coefficients c n1,n2(ξ), we will precisely compute the first two terms and estimate the expectation and variance of the last term on the right-hand side of (35) as follows.

(i) For the first term c n1,n2(P ξ), by the representation (17) of stochastic polynomial P ξ, we get that, for n 1 ≠ 0 and n 2 ≠ 0,

cn1,n2(Pξ)=4π4n12n22ηn1,n2, (36)

where

ηn1,n2=ξ(1,1)(0,0)(1)n2ξ(1,1)(0,1)(1)n1ξ(1,1)(1,0)+(1)n1+n2ξ(1,1)(1,1) (37)

is an algebraic sum of values of ξ (1,1) at {0,1}2 and signs for addition and subtraction are determined by odevity of n 1 and n 2. Since ∫0 1 p(t)dt = 0, we get c 0,0(P ξ) = c n1,0(P ξ) = c 0,n2(P ξ) = 0.

(ii) For the second term c n1,n2(ξ 2), by (20), we know that ξ 2 is the sum of products of separated variables.

Denote

φ1=ξ1(1,0)(0,·),φ2=ξ1(1,0)(1,·),φ3=ξ1(1,0)(·,0),φ4=ξ1(1,0)(·,1). (38)

The Fourier cosine coefficients of ξ 2 are equal to

cn1,n2(ξ2)=cn2(φ1)cn1(p(1·))+cn2(φ2)cn1(p)cn1(φ3)cn2(p(1·))+cn1(φ4)cn2(p), (39)

where each c n(φ i) is the Fourier cosine coefficient of the univariate stochastic process φ i and each c n(p) and each c n(p(1 − ·)) are both Fourier cosine coefficients of univariate deterministic functions p and p(1 − ·). A direct computation shows that, for n 1 ≠ 0 and n 2 ≠ 0,

cn1,n2(ξ2)=2π2n12(cn2(φ1)+(1)n1cn2(φ2))+2π2n22(cn1(φ3)+(1)n2cn1(φ4)). (40)

(iii) For the last term c n1,n2(ξ 3), using the integration by parts, we deduce that

cn1,n2(ξ3)=1π2n1n2×01(01ξ3(1,1)(t1,t2)sin(πn1t1)dt1)×sin(πn2t2)dt2. (41)

By Proposition 2, ξ 3 (1,1)(0, t 2) = ξ 3 (1,1)(1, t 2) = 0  (0 ≤ t 2 ≤ 1), the interior integral is equal to

1πn101ξ3(2,1)(t1,t2)cos(πn1t1)dt1. (42)

So

cn1,n2(ξ3)=1π3n12n2×01(01ξ3(2,1)(t1,t2)sin(πn2t2)dt2)×cos(πn1t1)dt1. (43)

By ξ 3 (1,1)(t 1, 0) = 0  (0 ≤ t 1 ≤ 1), we have ξ 3 (2,1)(t 1, 1) = 0  (0 ≤ t 1 ≤ 1). This implies that

cn1,n2(ξ3)=4(n1π)2(n2π)2×[0,1]2ξ3(2,2)(t1,t2)cos(πn1t1)×cos(πn2t2)dt1dt2, (44)

and so

cn1,n22(ξ3)=16(n1π)4(n2π)4×[0,1]4ξ3(2,2)(t1,t2)ξ3(2,2)(s1,s2)×cos(πn1t1)cos(πn2t2)cos(πn1s1)×cos(πn2s2)dt1dt2ds1ds2. (45)

Taking expectations on these two equations, we get

E[cn1,n2(ξ3)]=4(n1π)2(n2π)2×[0,1]2E[ξ3(2,2)(t1,t2)]cos(πn1t1)×cos(πn2t2)dt1dt2,E[cn1,n22(ξ3)]=16(n1π)4(n2π)4×[0,1]4E[ξ3(2,2)(t1,t2)ξ3(2,2)(s1,s2)]×cos(πn1t1)cos(πn2t2)cos(πn1s1)×cos(πn2s2)dt1dt2ds1ds2. (46)

It follows from ξ 3 (2,2)C s([0,1]2) that E[ξ 3 (2,2)] is a continuous function on [0,1]2 and E[ξ 3 (2,2)(t 1, t 2)ξ 3 (2,2)(s 1, s 2)] is a continuous on [0,1]4. By the Riemann-Lebesgue lemma, we have

E[cn1,n2(ξ3)]=o(1n12n22),E[cn1,n22(ξ3)]=o(1n14n24),Var(cn1,n2(ξ))=o(1n14n24) (47)

since Var⁡(c n1,n2(ξ 3)) ≤ E[c n1,n2 2(ξ 3)].

From (i), (ii), and (iii), we get

cn1,n2(ξ)=4π4n12n22ηn1,n2+2π2n12(cn2(φ1)+(1)n1cn2(φ2))+2π2n22(cn1(φ3)+(1)n2cn1(φ4))+cn1,n2(ξ3), (48)

and the error c n1,n2(ξ) satisfies (47), where η n1,n2 is stated in (37) and each φ i is stated in (38).

Now we further estimate these four univariate Fourier cosine coefficients c n(φ i).

Lemma 3 . —

Let each φ i be stated as in (38). Then Fourier cosine coefficients c n(φ i) satisfy

E[cn(φi)]=o(1n2),E[cn2(φi)]=o(1n4),(i=1,2,3,4). (49)

Proof —

By similarity, we only prove the case i = 1, since φ 1 = ξ 1 (1,0)(0, ·). By Proposition 1 and ξ 1 = ξP ξ, we have φ 1′(0) = φ 1′(1) = 0. From this, we deduce that Fourier cosine coefficients satisfy

E[cn(φ1)]=o(1n2),E[cn2(φ1)]=o(1n4). (50)

We will deduce these asymptotic representations of Fourier cosine coefficients.

Theorem 4 . —

Let ξ be a stochastic process on [0,1]2 and ξ (l,l)C s([0,1]2) for some l ≥ 2, and let η n1,n2 and φ i be stated in (37) and (38), respectively. Then

  • (i)
    for n 1, c n1,n2(ξ) = b n1,n2 + τ n1,n2, where
    bn1,n2=4π4n12n22ηn1,n2+2π2n12(cn2(φ1)+(1)n1cn2(φ2)), (51)
  • and τ n1,n2 satisfies
    E[τn1,n2]=o(1n12)1n22,E[τn1,n22]=o(1n14)1n24,Var(τn1,n2)=o(1n12)1n22; (52)
  • (ii)
    for n 2, cn1,n2(ξ)=b~n1,n2+τ~n1,n2, where
    b~n1,n2=4π4n12n22ηn1,n2+2π2n22(cn1(φ3)+(1)n2cn1(φ4)), (53)
  • and τ~n1,n2 satisfies
    E[τ~n1,n2]=o(1n22)1n12,E[τ~n1,n22]=o(1n24)1n14,Var(τ~n1,n2)=o(1n22)1n12; (54)
  • (iii)
    for n 1 and n 2, c n1,n2(ξ) = (4/π 2 n 1 2 n 2 2)η n1,n2 + τ n1,n2* and τ n1,n2* satisfies
    E[τn1,n2]=o(1n12n22),E[τn1,n22]=o(1n14n24),Var(τn1,n2)=o(1n14n24). (55)

Proof —

When n 1, denote

τn1,n2=2(nπ)2(cn1(φ3)+(1)n2cn1(φ4))+cn1,n2(ξ3). (56)

By (48), c n1,n2(ξ) = b n1,n2 + τ n1,n2. Using Lemma 3 and (47), we deduce that E[τ n1,n2] = o(1/n 1 2)(1/n 2 2) and

E[τn1,n22]K(1n22E[cn12(φ3)+cn12(φ4)]+E[cn1,n22(ξ3)])=o(1n14)1n24. (57)

So we get (i). Similarly, we can get (ii).

From this, we can give asymptotic representations of expectation, second-order moment, and variance of Fourier cosine coefficients.

Corollary 5 . —

Under conditions of Theorem 4, we have

  • (i)
    for n 1 and n 2 ≠ 0,
    E[cn1,n2(ξ)]=E[bn1,n2]+o(1n12)1n22,E[cn1,n22(ξ)]=E[bn1,n22]+o(1n14)1n24,Var(cn1,n2(ξ))=Var(bn1,n2)+o(1n14)1n24, (58)
  • where b n1,n2 is stated in (51) and “o” is uniform for n 2;

  • (ii)
    for n 2 and n 1 ≠ 0,
    E[cn1,n2(ξ)]=E[b~n1,n2]+o(1n22)1n12,E[cn1,n22(ξ)]=E[b~n1,n22]+o(1n24)1n14,Var(cn1,n2(ξ))=Var(b~n1,n2)+o(1n24)1n14, (59)
  • where b~n1,n2 is stated in (53) and “o” is uniform for n 1.

Proof —

By similarity, we only prove (58).

From Theorem 4 (i), we deduce that, for n 1,   n 2 ≠ 0,

E[cn1,n22(ξ)]=E[bn1,n22]+2E[bn1,n2τn1,n2]+o(1n14)1n24,|E[bn1,n2λn1,n2]|E[bn1,n22]·E[τn1,n22]=o(1n14)1n24. (60)

So we get (58).

From Corollary 5 (iii), we know that

E[cn1,n2(ξ)]~1n12n22,E[cn1,n22(ξ)]~1n14n24. (61)

These results cannot be improved as smoothness index l increases.

6. Approximation of Partial Sums

Let ξ be a stochastic process on [0,1]2 and ξ (l,l)C s([0,1]2) for some l ≥ 2. We expand ξ into the Fourier cosine series:

ξ(t1,t2)=n1,n2=0cn1,n2(ξ)cos(πn1t1)cos(πn2t2). (62)

We give further the asymptotic representation of approximation error of partial sums. The partial sums S N (r)(ξ) of Fourier cosine series (62) are defined as

SN(r)(ξ;t1,t2)=n1,n2=0N1cn1,n2(ξ)cos(πn1t1)cos(πn2t2). (63)

Using the Parseval identity, we get

E[||SN(r)(ξ)ξ||22]=(n1,n2=0n1,n2=0N1)E[cn1,n22(ξ)]λn1,n2=14(n1,n2=1n1,n2=1N1)E[cn1,n22(ξ)]+12n1=NE[cn1,02(ξ)]+12n2=NE[c0,n22(ξ)]=:  PN+QN+RN. (64)
  • (i)
    We compute P N. The first term P N on the right-hand side of the formula (64) can be decomposed into three sums
    PN=14(PN1+PN2+PN3), (65)
  • where
    PN1=n2=1N1n1=NE[cn1,n22(ξ)],PN2=n1=1N1n2=NE[cn1,n22(ξ)],PN3=n1,n2=NE[cn1,n22(ξ)]. (66)

First, we consider the interior sum of P N 1 with N = 2k,

n1=2kE[cn1,n22(ξ)]=n1=kE[c2n1,n22(ξ)]+n1=kE[c2n1+1,n22(ξ)]=:Xk,n2+Yk,n2. (67)

By Corollary 5 (i), we deduce that

Xk,n2=n1=k(12π2n12)2E[(bn2(1))2]+o(1k3)1n24,Yk,n2=n1=k(12π2n12)2E[(bn2(2))2]+o(1k3)1n24, (68)

where “o” is uniform for n 2 and

bn2(1)=2π2n22(ξ(1,1)(0,0)ξ(1,1)(1,0)(1)n2(ξ(1,1)(0,1)ξ(1,1)(1,1)))cn2(φ1)+cn2(φ2),bn2(2)=2π2n22(ξ(1,1)(0,0)+ξ(1,1)(1,0)(1)n2(ξ(1,1)(0,1)+ξ(1,1)(1,1)))cn2(φ1)cn2(φ2). (69)

Again, by

n1=k1(2π2n12)2=112π4k3+O(1k4) (70)

and (67), we obtain that

n1=2kE[cn1,n22(ξ)]=112π4k3E[(bn2(1))2+(bn2(2))2]+o(1k3)1n24, (71)

where “o” is uniform for n 2. By the convergence of the series ∑n=1 (1/n 4) and (65), we have

P2k1=112π4k3(n2=12k1E[(bn2(1))2+(bn2(2))2])+o(1k3). (72)

By (69), we deduce that there exists a constant K 1 > 0 such that

|E[(bn2(1))2+(bn2(2))2]|K1E[1n24λ{0,1}2(ξ(1,1)(λ))2+cn22(φ1)+cn22(φ2)]. (73)

Again, by Lemma 3, we have

E[(bn2(1))2+(bn2(2))2]=O(1n24), (74)

and so the series ∑n2=1 E[(b n2 (1))2 + (b n2 (2))2] converges, and denote its sum by A. So

n2=12k1E[(bn2(1))2+(bn2(2))2]=A+o(1)(k). (75)

By (72), we get P 2k 1 = (A/12π 4 k 3) + o(1/k 3). Notice that

P2k+11=P2k1+n1=2k+1E[cn1,2k2(ξ)]n2=12k1E[c2k,n22(ξ)] (76)

and E[c n1,n2 2(ξ)] = O(1/n 1 4 n 2 4) (see (61)). We have P 2k+1 1 = P 2k 1 + o(1/k 3). This implies that

PN1=2A3π4N3+o(1N3),where  A=n2=1E[(bn2(1))2+(bn2(2))2]. (77)

Here b n2 (1) and b n2 (2) are stated in (69).

Similarly,

PN2=2B3π4N3+o(1N3),where  B=n1=1E[(b~n1(1))2+(b~n1(2))2]. (78)

Here “o” is uniform for n 1 and

b~n1(1)=2π2n12(ξ(1,1)(0,0)ξ(1,1)(0,1)(1)n1(ξ(1,1)(1,0)ξ(1,1)(1,1)))cn1(φ3)+cn1(φ4),b~n1(2)=2π2n12(ξ(1,1)(0,0)+ξ(1,1)(0,1)(1)n1(ξ(1,1)(1,0)+ξ(1,1)(1,1)))cn1(φ3)cn1(φ4). (79)

From E[c n1,n2 2(ξ)] = O(1/n 1 4 n 2 4), we have P N 3 = o(1/N 3). Finally, by (65), we get

PN=A+B6π4N3+o(1N3), (80)

where A, B are stated in (77) and (78).

  • (ii)
    We compute Q N and R N in (64). By the decomposition formula (23),
    cn1,0(ξ)=cn1,0(Pξ)+cn1,0(ξ2)+cn1,0(ξ3). (81)

By (17) and ∫0 1 p(t)dt = 0, we have c n1,0(P ξ) = 0. By (39), we have

cn1,0(ξ2)=2(πn1)2(c0(φ1)+(1)n1c0(φ2)). (82)

From this, we get

E[c2n1,02(ξ2)]+E[c2n1+1,02(ξ2)]=12(πn1)4(E[c02(φ1)+c02(φ2)])+o(1n14). (83)

Similar to (47), we have

E[cn1,02(ξ3)]=4(πn1)4×01E[ξ3(t1,t2)ξ3(s1,t2)]×cos(πn1t1)cos(πn1s1)dt1ds1=o(1n14). (84)

Again, by (81), we have

n1=2kE[cn1,02(ξ)]=n1=k(E[c2n1,02(ξ)]+E[c2n1+1,02(ξ)])=16π4k3(E[c02(φ1)+c02(φ2)]+o(1)). (85)

This implies by (64) that

QN=2C3π4N3+o(1N3),whereC=E[c02(φ1)+c02(φ2)]. (86)

Similarly, we get

RN=2D3π4N3+o(1N3),whereD=E[c02(φ3)+c02(φ4)]. (87)

From this and (80), we get by (64) the following.

Theorem 6 . —

Let ξ be a stochastic process on [0,1]2 and ξ (l,l)C s([0,1]2) for some l ≥ 2. Then the partial sums S N(ξ) of its Fourier cosine series satisfy

E[||SN(r)(ξ)ξ||22]=MN3+o(1N3), (88)

where M = (1/6π 4)(A + B + 4C + 4D) and A, B, C, D are stated in (77), (78), (86), and (87).

7. Approximation of Hyperbolic Cross Truncations

Suppose that ξ is a stochastic process on [0,1]2 and ξ (l,l)C s([0,1]2) for some l ≥ 2. We consider hyperbolic cross truncations of its Fourier cosine series:

SN(h)(ξ;t1,t2)=n1=0N1cn1,0(ξ)cos(πn1t2)+n2=1N1n1=0[(N1)/n2]1cn1,n2(ξ)cos(πn1t1)×cos(πn2t2). (89)

By the Parseval identity and (61), (86), and (87), we have

E[||SN(h)(ξ)ξ||22]=14JN+12n1=NE[cn1,02(ξ)]+14n2=Nn1=0E[cn1,n22(ξ)]=14JN+O(1N3), (90)

where J N = ∑n2=1 N−1n1=[(N−1)/n2] E[c n1,n2 2(ξ)]. We rewrite J N in the form

JN=n2=1[(N1)/2]n1=[(N1)/4n2](E[c2n1,2n22(ξ)+c2n11,2n22(ξ)])+n2=1[(N1)/2]n1=[(N1)/(4n22)]×(E[c2n1,2n212(ξ)]+c2n11,2n212(ξ))+O(1N3)=JN1+JN2+O(1N3). (91)

We first consider J N 1. By Corollary 5 (i), we have

E[c2n1,2n22(ξ)]=14π4n14E[(12π2n22ω1c2n2(φ1)+c2n2(φ2))2]+o(1n14)1n24,E[c2n11,2n22(ξ)]=14π4n14E[(12π2n22ω2c2n2(φ1)c2n2(φ2))2]+o(1n14)1n24, (92)

where “o” is uniform for n 2 and

ω1=ξ(1,1)(0,0)ξ(1,1)(0,1)ξ(1,1)(1,0)+ξ(1,1)(1,1)),ω2=ξ(1,1)(0,0)ξ(1,1)(0,1)+ξ(1,1)(1,0)ξ(1,1)(1,1). (93)

Therefore,

n1=[(N1)/4n2]E[c2n1,2n22(ξ)]=(n1=[(N1)/4n2]14π4n14)×E[(12π2n22ω1c2n2(φ1)+c2n2(φ2))2]+o(1N3)1n2. (94)

Here

n1=[(N1)/4n2]14π4n14=16n233π4N3+O(n24N4),E[(12π2n22ω1cn2(φ1)+cn2(φ2))2]=14π4n24E[ω12]+μn2, (95)

where μ n2 = −(1/π 2 n 2 2)  E[ω 1(c n2(φ 1) − c n2(φ 2))] + E[(c n2(φ 1) − c n2(φ 2))2].

By using the Schwarz inequality in Probability theory,

|E[ω1(cn2(φ1)cn2(φ2))]|(E[ω12])1/2(E[(cn2(φ1)cn2(φ2))2])1/2. (96)

By Lemma 3, E[(c n2(φ 1) − c n2(φ 2))2] ≤ 2E[c n2 2(φ 1) + c n2 2(φ 2)] = o(1/n 2 4). Therefore, μ n2 = o(1/n 2 4). From this, we have

E[(12π2n22ω1cn2(φ1)+cn2(φ2))2]=14π4n24E[ω12]+o(1n24). (97)

Substituting (95) and (97) into (94), we get that, for n 2N,

n1=[(N1)/4n2]E[c2n1,2n22(ξ)]=4E[ω12]3π8N3n2+o(1N3n2). (98)

Similarly, we have

n1=[(N1)/4n2]E[c2n11,2n22(ξ)]=4E[ω22]3π8N3n2+o(1N3n2). (99)

Denote ω = (1/2)(ω 1 2 + ω 2 2). We get

ω=(ξ(1,1)(0,0)ξ(1,1)(0,1))2+(ξ(1,1)(1,0)ξ(1,1)(1,1))2. (100)

This implies that

n1=[(N1)/4n2]E[c2n1,2n22(ξ)+c2n11,2n22(ξ)]=8E[ω]3π8N3n2+o(1N3n2). (101)

So we have

JN1=8E[ω]3π8N3n2=1[(N1)/2]1n2+o(1N3)n2=1[(N1)/2]1n2=8logN3π8N3(E[ω]+o(1)). (102)

Similarly, we have

JN2=8logN3π8N3(E[ω~]+o(1)), (103)

where ω~=(ξ(1,1)(0,0)+ξ(1,1)(0,1))2+(ξ(1,1)(1,0)+ξ(1,1)(1,1))2. From this and (91), we deduce by (90) that

JN=n2=1[(N1)/2](8E[ω+ω~]3π8N3n2+o(1N3n2))=16logN3π8N3(E[ω]+o(1)), (104)

where ω* = (ξ (1,1)(0,0))2 + (ξ (1,1)(0,1))2 + (ξ (1,1)(1,0))2 + (ξ (1,1)(1,1))2. Finally, we get by (90) that

E[||SN(h)(ξ)ξ||22]=4logN3π8N3(E[ω]+o(1)). (105)

So we get the following.

Theorem 7 . —

Suppose that ξ is a stochastic process on [0,1]2 and ξ (l,l)C s([0,1]2) for some l ≥ 2. Let S N (h)(ξ) be the hyperbolic cross truncations of its Fourier cosine series, which is stated in (89). Then the following asymptotic formula holds:

E[||SN(h)(ξ)ξ||22]=M~logNN3(1+o(1)), (106)

where M~=(4/3π8)E[(ξ(1,1)(0,0))2+(ξ(1,1)(0,1))2+(ξ(1,1)(1,0))2+(ξ(1,1)(1,1))2].

From Theorem 7, we know that E[||S N (h)(ξ)−ξ||2 2] ~ (log⁡N/N 3). This result cannot be improved as the smoothness index l increases.

By (89), the number of Fourier cosine coefficients in hyperbolic cross truncation S N (h)(ξ) is

Nc=N+n1=1N1[N1n1]~NlogN (107)

and log⁡N c ~ log⁡N. From this, we get

E[||SN(h)(ξ)ξ||22]~log4NcNc3. (108)

Since the number of Fourier cosine coefficients in the partial sum S N (r)(ξ) is N c = N 2, by Theorem 6, we have

E[||SN(r)(ξ)ξ||22]~1Nc3/2. (109)

8. Approximation of Hyperbolic Cross Truncations with Polynomial Factors

In order to use the least Fourier cosine coefficients to reconstruct stochastic processes, we introduce the Fourier cosine expansion with polynomial factors. Suppose that ξ is a stochastic process on [0,1]2 and ξ (l,l)C s([0,1]2) for some l ≥ 3. By using notation (38), the decomposition (23) can be rewritten in the form

ξ(t1,t2)=Pξ(t1,t2)+ξ2(t1,t2)+ξ3(t1,t2)=Pξ(t1,t2)φ1(t2)p(1t1)+φ2(t2)p(t1)φ3(t1)p(1t2)+φ4(t1)p(t2)+ξ3(t1,t2). (110)

In this decomposition, we expand each φ i into univariate Fourier cosine series and expand ξ 3(t 1, t 2) into bivariate Fourier cosine series. Finally, we obtain the Fourier cosine expansion of ξ with polynomial factors:

ξ(t1,t2)=Pξ(t1,t2)+(n=0cn(φ1)cos(πnt2))×(p(1t1))+(n=0cn(φ2)cos(πnt2))p(t1)+(n=0cn(φ3)cos(πnt1))×(p(1t2))+(n=0cn(φ4)cos(πnt1))p(t2)+n1,n2=0cn1,n2(ξ3)cos(πn1t1)cos(πn2t2), (111)

where p(t) = (t 2/2) − (1/6). Notice that φ 1(t 2) = ξ 1 (1,0)(0, t 2) and ξ 1 (3,3)C s([0,1]2), where ξ 1 = ξP ξ. Using Proposition 1, we have φ 1′′′ ∈ C s([0,1]) and φ 1′(0) = φ 1′(1) = 0, and so

cn(φ1)=2(nπ)301φ1(t)sin(πnt)dt. (112)

Therefore, we have E[c n(φ 1)] = o(1/n 3) and

E[cn2(φ1)]=4(nπ)6×[0,1]2E[φ1(t)φ1(s)]sin(πnt)×sin(πns)dtds. (113)

Similarly, for c n(φ 2),c n(φ 3), and c n(φ 4), we get

E[cn(φi)]=o(1n3),E[cn2(φi)]=o(1n6)(i=1,2,3,4). (114)

From this, we see that these univariate Fourier coefficients decay fast.

Now we show that bivariate Fourier cosine coefficients c n1,n2(h 3) decay fast. By ξ (l,l)C s([0,1]3)  (l ≥ 3) and Proposition 2, using the integration by parts, we get

E[cn1,n2(ξ3)]=4(n1π)3(n2π)3×[0,1]2E[ξ3(3,3)(t1,t2)]sin(πn1t1)×sin(πn2t2)dt1dt2,E[cn1,n22(ξ3)]=16(n1π)6(n2π)6×[0,1]4E[ξ3(3,3)(t1,t2)ξ3(3,3)(s1,s2)]×sin(πn1t1)sin(πn2t2)×sin(πn1s1)×sin(πn2s2)dt1dt2ds1ds2. (115)

So we get

E[cn1,n2(ξ3)]=o(1n13n23),E[cn1,n22(ξ3)]=o(1n16n26). (116)

Take the hyperbolic cross truncations of the expansion (111),

TN(h)(ξ;t1,t2)=Pξ(t1,t2)+SN(φ1;t1)p(1t1)+SN(φ4,t1)p(t1)+SN(ξ1(0,1)(t1,0))p(1t2)+SN(ξ1(0,1)(t1,1))p(t2)+SN(h)(ξ3;t1,t2), (117)

where each S N(φ i) is the first N terms partial sums of Fourier cosine series of φ i and S N (h)(ξ 3) is the hyperbolic cross truncation of Fourier cosine series of bivariate stochastic process of ξ 3 which is stated in (21). The hyperbolic cross truncation T N (h)(ξ) is a combination of stochastic polynomials and cosine polynomials. By (111) and (117),

TN(h)(ξ;t1,t2)ξ(t1,t2)=(SN(φ1;t2)φ1(t2))p(t1)+(SN(φ2;t2)φ2(t2))p(t1)+(SN(φ3;t1)φ3(t1))p(t2)+(SN(φ4;t1)φ4(t1))p(t2)+(SN(h)(ξ3;t1,t2)ξ3(t1,t2)). (118)

Again, by the formula (∑n=1 k a n)2k 2n=1 k a n 2, we get

125E[||TN(h)(ξ)ξ||22](i=14E[||SN(φi)φi||22])||p||22+E[||SN(h)(ξ3)ξ3||22]. (119)

By using Parseval identity and (114), we get

E[||SN(φi)φi||22]=12n=NE[cn2(φi)]=o(1N5)(i=1,2,3,4). (120)

By Proposition 2, we have ξ 3 (1,1)(0,0) = ξ 3 (1,1)(0,1) = ξ 3 (1,1)(1,0) = ξ 3 (1,1)(1,1) = 0. Based on (114) and (116), the argument similar to Theorem 7 shows that

E[||SN(h)(ξ3)ξ3||22]=o(logNN5). (121)

From this and (119), we deduce that E[||T N (h)(ξ)−ξ||2 2] = o((log⁡N)/N 5). Noticing that the number of Fourier cosine coefficients in T N(t 1, t 2) : N c ~ Nlog⁡N, we get the following.

Theorem 8 . —

Suppose that ξ is a stochastic process on [0,1]2 and ξ (l,l)C s([0,1]2) for some l ≥ 3. Then

E[||TN(h)(ξ)ξ||22]=o(log6NcNc5), (122)

where N c is the number of Fourier cosine coefficients in T N (h)(ξ).

Comparing Theorem 8 with (108) and (109), we obtain the following.

Theorem 9 . —

Let ξ be a stochastic process on [0,1]2 and ξ (l,l)C s([0,1]2) for some l ≥ 3. Then

E[||SN(r)(ξ)ξ||22]~1Nc3/2,E[||SN(h)(ξ)ξ||22]~log4NcNc3,E[||TN(h)(ξ)ξ||22]=o(log6NcNc5), (123)

where S N (r)(ξ) and S N (h)(ξ) are partial sums and hyperbolic cross truncations of Fourier cosine series of ξ, respectively, T N (h)(ξ) is the hyperbolic cross truncations of Fourier expansion of ξ with polynomial factors, and N c is the number of Fourier cosine coefficients in each sum.

From this, we see that if we reconstruct ξ by T N (h)(ξ), we need the least Fourier cosine coefficients.

Acknowledgments

This research is supported by National Key Science Program for Global Change Research no. 2013CB956604 and no. 2010CB950504; the Beijing Higher Education Young Elite Teacher Project; Fundamental Research Funds for the Central Universities (Key Program) no. 105565GK; and 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.Shen J, Wang L. Sparse spectral approximations of high-dimensional problems based on hyperbolic cross. SIAM Journal on Numerical Analysis. 2010;48(3):1087–1109. [Google Scholar]
  • 2.Timan AF. Theory at Approximation of Functions of a Real Variable. Pergamon; 1963. [Google Scholar]
  • 3.Barthelmann V, Novak E, Ritter K. High dimensional polynomial interpolation on sparse grids. Advances in Computational Mathematics. 2000;12(4):273–288. [Google Scholar]
  • 4.Griebel M, Hamaekers J. Sparse grids for the Schrödinger equation. ESAIM Mathematical Modelling and Numerical Analysis. 2007;41:215–247. [Google Scholar]
  • 5.Shen J, Yu H. Efficient spectral sparse grid methods and applications to high-dimensional elliptic problems. SIAM Journal on Scientific Computing. 2010;32(6):3228–3250. [Google Scholar]
  • 6.Boyd JP. Large-degree asymptotics and exponential asymptotics for Fourier, Chebyshev and Hermite coefficients and Fourier transforms. Journal of Engineering Mathematics. 2009;63(2–4):355–399. [Google Scholar]
  • 7.Klebaner FC. Introduction to Stochastic Calculus with Application. Hackensak, NJ, USA: World Scientific Publishing; 2012. [Google Scholar]
  • 8.Burkardt J, Gunzburger MD, Webster C. Reduced order modeling of some nonlinear stochastic partial differential equations. International Journal of Numerical Analysis and Modeling. 2007;4(3-4):368–391. [Google Scholar]
  • 9.Xiu D. Fast numerical methods for stochastic computations: a review. Communications in Computational Physics. 2009;5(2–4):242–272. [Google Scholar]
  • 10.Kammler DW. A First Course in Fourier Analysis. Cambridge, UK: Cambridge University Press; 2007. [Google Scholar]
  • 11.Duoandikoetxea J. Fourier Analysis. American Mathematical Society; 2001. [Google Scholar]
  • 12.Zhang ZH. Decomposition and approximation of multivariate functions on the cube. Acta Mathematica Sinica. 2013;29(1):119–136. [Google Scholar]

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

RESOURCES