Preprint
Article

Exponential Convergence-(t, s)-Weak Tractability of Approximation in Weighted Hilbert Spaces

Altmetrics

Downloads

70

Views

13

Comments

0

A peer-reviewed article of this preprint also exists.

This version is not peer-reviewed

Submitted:

17 May 2024

Posted:

20 May 2024

You are already at the latest version

Alerts
Abstract
We study L_2-approximation problems in the weighted Hilbert spaces in the worst case setting. Three interesting weighted Hilbert spaces appear in this paper, whose weights are equipped with two positive parameters $\ga_j$ and $\az_j$ for $j=1,\,2,\dots,\,d$. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. We discuss the exponential convergence-(t,s)-weak tractability (EC-(t,s)-WT) of these L_2-approximation problems under the absolute or normalized error criterion. In particular, we obtain the sufficient and necessary conditions for EC-(1,1)-WT and EC-(t,1)-WT with t
Keywords: 
Subject: Computer Science and Mathematics  -   Mathematics

MSC:  41A81; 47A58; 47B02

1. Introduction

We study multivariate approximation problems APP = { APP d } d N of functions defined over Hilbert spaces with large or huge d in the worst case setting. Such problems appear in statistics (see [1]), computational finance (see [2]) and physics (see [3]). We consider algorithms that use finitely many continuous linear functionals. The information complexity n ( ε , APP d ) is defined to be the minimal number of linear functionals for which the approximation error of some algorithm is at most ε . Tractability describes the growth rate of the information complexity n ( ε , APP d ) when the error threshold ε tends to 0 and the dimension d tends to infinity. There are two kinds of tractability, classical tractability based on polynomial convergence and exponential convergence-tractability (EC-tractability) based on exponential convergence. Recently many authors are interested in classical tractability and EC-tractability in weighted Hilbert spaces, such as classical tractability and EC-tractability in analytic Korobov spaces (see [4,5,6,7,8,9]), classical tractability and EC-tractability in weighted Korobov spaces (see [10,11,12,13,14,15,16,17]), and classical tractability in weighted Gaussian ANOVA spaces (see [18]).
This paper is devoted to discussing EC-tractability of L 2 -approximation problems from the weighted Hilbert spaces in the worst case setting. Let H ( K R d , α , γ ) be a Hilbert space with weight R d , α , γ , where γ = { γ j } j N and α = { α j } j N are two positive sequences satisfying 1 γ 1 γ 2 0 and 1 < α 1 α 2 . We consider the L 2 -approximation problem
APP d : H ( K R d , α , γ ) L 2 ( [ 0 , 1 ] d ) with APP d ( f ) = f .
In the worst case setting the classical tractability of the problem APP = { APP d } in weighted Korobov spaces such as strong polynomial tractability and polynomial tractability were discussed in [13,14,18]; quasi-polynomial tractability, uniform weak tractability, weak tractability and ( t , s ) -weak tractability were investigated in [15,18]. Additionally, [18] also discussed classical tractability in several weighted Hilbert spaces including weighted Korobov spaces and weighted Gaussian ANOVA spaces. The EC-tractability of the problem APP = { APP d } in weighted Korobov spaces such as EC- ( t , 1 ) -weak tractability for 0 < t 1 were studied in [17]. However, the above weighted Hilbert spaces H ( K R d , α , γ ) with weights R d , α , γ satisfy 1 γ 1 γ 2 0 and 1 < α 1 = α 2 = .
In this paper we present three cases of weighted Hilbert spaces H ( K R d , α , γ ) with weights R d , α , γ for 1 γ 1 γ 2 0 and 1 < α 1 α 2 , that appear in the reference [16]. These weighted Hilbert spaces are similar but also different. [16] studied the strong polynomial tractability, polynomial tractability, weak tractability and ( t , s ) -weak tractability for t > 1 of the problems APP = { APP d } in these three weighted Hilbert spaces. However, EC-tractability have not yet been considered for the approximation problems APP = { APP d } for the above three weighted Hilbert spaces. We will investigate EC- ( t , s ) -weak tractability for some t > 0 , s > 0 and get the sufficient and necessary conditions for the EC- ( 1 , 1 ) -weak tractability (EC-weak tractability) and EC- ( t , 1 ) -weak tractability with t < 1 .
The paper is organized as follows. In Section 2 we present three cases of weighted Hilbert spaces. In Section 3 we give preliminaries about the L 2 -approximation problem in the weight Hilbert space. Section 4.1 are devoted to recall some notions about the tractability such as classical tractability and exponential convergence-tractability and state out the main results. In Section 4.2 we give the proof of Theorem 10.

2. Weighted Reproducing Kernel Hilbert Spaces

In this section we introduce multivariate approximation problems in weighted reproducing kernel Hilbert spaces in the worst case setting.
In this paper, let γ = { γ j } j N and α = { α j } j N be two positive sequences of the reproducing kernel Hilbert space H ( K R d , α , γ ) with weight R d , α , γ satisfying
1 γ 1 γ 2 0 ,
and
1 < α 1 α 2 .
Assume that the weighted reproducing kernel function K R d , α , γ : [ 0 , 1 ] d × [ 0 , 1 ] d C of the space H ( K R d , α , γ ) is of product form
K R d , α , γ ( x , y ) : = k = 1 d K R 1 , α k , γ k ( x k , y k ) ,
where K R 1 , α , γ : [ 0 , 1 ] × [ 0 , 1 ] C is a universal weighted function,
K R 1 , α , γ ( x , y ) : = k N 0 R α , γ ( k ) exp ( 2 π i k · ( x y ) ) , x , y [ 0 , 1 ] .
Here, let weight R α , γ : N 0 R + be a summable function, i.e., k N 0 R α , γ ( k ) < . Then we have
K R d , α , γ ( x , y ) = k N 0 d R d , α , γ ( k ) exp ( 2 π i k · ( x y ) ) , x , y [ 0 , 1 ] d ,
and the inner product
f , g H ( K R d , α , γ ) = k N 0 d 1 R d , α , γ ( k ) f ^ ( k ) g ^ ¯ ( k )
and
| | f | | H ( K R d , α , γ ) = f , f H ( K R d , α , γ ) ,
where
R d , α , γ ( k ) : = j = 1 d R α j , γ j ( k j ) , k = ( k 1 , k 2 , , k d ) N 0 d ,
x · y : = k = 1 d x k · y k , x = ( x 1 , x 2 , , x d ) , y = ( y 1 , y 2 , , y d ) [ 0 , 1 ] d ,
and
f ^ ( k ) = [ 0 , 1 ] d f ( x ) exp ( 2 π i k · x ) d x .
Note that K R d , α , γ ( x , y ) is well defined for 1 < α 1 α 2 and for all x , y [ 0 , 1 ] d , since
| K R d , α , γ ( x , y ) | k N 0 d R d , α , γ ( k ) = j = 1 d ( k N 0 R α j , γ j ( k ) ) < .
If γ 1 = γ 2 = = 1 and 1 < α 1 = α 2 = , then the space H ( K R d , α , γ ) is called unweighted space. Here, N 0 = { 0 , 1 , } and N = { 1 , 2 , } .
There are many ways for introducing weighted reproducing kernel Hilbert spaces with weights R d , α , γ . In this paper we consider three weights like the cases in the reference [16].

2.1. A Weighted Korobov Space

Let α = { α j } j N and γ = { γ j } j N satisfy (1) and (2). We consider a weighted Korobov space H ( K R d , α , γ ) with weight
R d , α , γ ( k ) = r d , α , γ ( k ) : = j = 1 d r α j , γ j ( k j ) ,
where
r α , γ ( k ) : = 1 , for k = 0 , γ k α , for k 1 ,
for α > 1 and γ ( 0 , 1 ] . We can see the case in the references [16,19]. Then we have the kernel function (3) and the inner product (4) as follows:
K R d , α , γ ( x , y ) = K r d , α , γ ( x , y ) = k N 0 d r d , α , γ ( k ) exp ( 2 π i k · ( x y ) ) , x , y [ 0 , 1 ] d ,
and
f , g H ( K R d , α , γ ) = f , g H ( K r d , α , γ ) = k N 0 d 1 r d , α , γ ( k ) f ^ ( k ) g ^ ¯ ( k ) .
Remark 1. 
Obviously, the kernel K r d , α , γ ( x , y ) is well defined for α and γ satisfying (1) and (2), due to
| K r d , α , γ ( x , y ) | k N 0 d r d , α , γ ( k ) = j = 1 d ( 1 + ζ ( α j ) γ j ) < ,
where ζ ( · ) is the Riemann zeta function.

2.2. A First Variant of the Weighted Korobov Space

Let α = { α j } j N and γ = { γ j } j N satisfy (1) and (2), respectively. We consider a first variant of the weighted Korobov space with weight
R d , α , γ ( k ) = ψ d , α , γ ( k ) : = j = 1 d ψ α j , γ j ( k j ) ,
where 1.5
ψ α , γ ( k ) : = 1 , for k = 0 , γ k ! , for 1 k < α , γ ( k α ) ! k ! , for k α ,
for α > 1 and γ ( 0 , 1 ] .
Then we have the kernel function (3) and the inner product (4) as follows:
K R d , α , γ ( x , y ) = K ψ d , α , γ ( x , y ) = k N 0 d ψ d , α , γ ( k ) exp ( 2 π i k · ( x y ) ) , x , y [ 0 , 1 ] d ,
and
f , g H ( K R d , α , γ ) = f , g H ( K ψ d , α , γ ) = k N 0 d 1 ψ d , α , γ ( k ) f ^ ( k ) g ^ ¯ ( k ) .
Lemma 2. 
([16] Lemma 2) For all j , k N we have
ψ α j , γ j ( k ) α j α j r α j , γ j ( k ) .
Remark 3. 
From Lemma 2 and 1 < α 1 α 2 we obtain
| K ψ d , α , γ ( x , y ) | k N 0 d ψ d , α , γ ( k ) = j = 1 d ( 1 + k N ψ α j , γ j ( k ) ) j = 1 d ( 1 + k N α j α j r α j , γ j ( k ) ) = j = 1 d ( 1 + α j α j ζ ( α j ) γ j ) < .
Hence the kernel K ψ d , α , γ ( x , y ) is well defined.

2.3. A Second Variant of the Weighted Korobov Space

Let α = { α j } j N and γ = { γ j } j N satisfy (1) and (2), respectively. We consider a second variant of the weighted Korobov space H ( K R d , α , γ ) (see the references [16,20]) with weight
R d , α , γ ( k ) = ω d , α , γ ( k ) : = j = 1 d ω α j , γ j ( k j ) ,
where
ω α , γ ( k ) : = 1 + 1 γ l = 1 α θ l ( k ) 1 ,
for α > 1 and γ ( 0 , 1 ] , and 1.5
θ l ( k ) : = k ! ( k l ) ! , for k l , 0 , for 0 k < l .
Then we have the kernel function (3) and the inner product (4) as follows:
K R d , α , γ ( x , y ) = K ω d , α , γ ( x , y ) = k N 0 d ω d , α , γ ( k ) exp ( 2 π i k · ( x y ) ) , x , y [ 0 , 1 ] d ,
and
f , g H ( K R d , α , γ ) = f , g H ( K ω d , α , γ ) = k N 0 d 1 ω d , α , γ ( k ) f ^ ( k ) g ^ ¯ ( k ) .
Lemma 4. 
([16] Lemma 3) For all j , k N we have
ω α j , γ j ( k ) α j α j r α j , γ j ( k ) .
Remark 5. 
We note that the kernel K R d , α , γ ( x , y ) is also well defined. Indeed, it follows from Lemma 4 and 1 < α 1 α 2 that
| K ω d , α , γ ( x , y ) | k N 0 d ω d , α , γ ( k ) = j = 1 d ( 1 + k N ω α j , γ j ( k ) ) j = 1 d ( 1 + k N α j α j r α j , γ j ( k ) ) = j = 1 d ( 1 + α j α j ζ ( α j ) γ j ) < .
Lemma 6. 
Let R α j , γ j r α j , γ j , ψ α j , γ j , ω α j , γ j for all j N . Then we have for all j N , k N 0 ,
R α j , γ j ( k ) α j α j r α j , γ j ( k ) .
Especially, we have for all j N , k N 0 ,
R α j , γ j ( k ) α 1 α 1 r α 1 , γ j ( k ) .
Proof. 
On the one hand, it is obvious from Lemma 2 and Lemma 4 that
R α j , γ j ( k ) α j α j r α j , γ j ( k )
for all j , k N . Since for all j N
r α j , γ j ( 0 ) = ψ α j , γ j ( 0 ) = ω α j , γ j ( 0 ) = 1 ,
we have
R α j , γ j ( 0 ) = 1 α j α j = α j α j r α j , γ j ( 0 ) .
Thus we have for all j N , k N 0 that
R α j , γ j ( k ) α j α j r α j , γ j ( k ) .
On the other hand, noting for all j , k N
r α j , γ j ( k ) r α 1 , γ j ( k ) , ψ α j , γ j ( k ) ψ α 1 , γ j ( k ) , ω α j , γ j ( k ) ω α 1 , γ j ( k ) ,
and for all j N
r α j , γ j ( 0 ) = r α 1 , γ j ( 0 ) = 1 , ψ α j , γ j ( 0 ) = ψ α 1 , γ j ( 0 ) = 1 , ω α j , γ j ( 0 ) = ω α 1 , γ j ( 0 ) = 1 ,
we have for all j N , k N 0 that
R α j , γ j ( k ) R α 1 , γ j ( k ) .
Hence by (5) we further get for all j N , k N 0 that
R α j , γ j ( k ) R α 1 , γ j ( k ) α 1 α 1 r α 1 , γ j ( k ) .
Remark 7. 
Let R α j , γ j r α j , γ j , ψ α j , γ j , ω α j , γ j for all j N . Then we obtain
R α j , γ j ( 0 ) = 1 and R α j , γ j ( 1 ) γ j 2
for all j N . Indeed, for all j N we have
ψ α j , γ j ( 0 ) = r α j , γ j ( 0 ) = ω α j , γ j ( 0 ) = 1 ,
which means R α j , γ j ( 0 ) = 1 . Due to for all j N , we get
ψ α j , γ j ( 1 ) = r α j , γ j ( 1 ) = γ j and ω α j , γ j ( 1 ) = 1 + 1 γ j 1 γ j 2 ,
which yields R α j , γ j ( 1 ) γ j 2 .

3. L 2 -Approximation in the Weighted Hilbert Spaces

In this paper we investigate the L 2 -approximation
APP d : H ( K R d , α , γ ) L 2 ( [ 0 , 1 ] d ) with APP d ( f ) = f ,
for all f H ( K R d , α , γ ) in Hilbert space H ( K R d , α , γ ) with weight R d , α , γ { r d , α , γ , ψ d , α , γ , ω d , α , γ } . It is well known from Remark 1, Remark 3, Remark 5 and [14] that this L 2 -approximation is compact for 1 < α 1 α 2 . We approximation APP d by algorithm A n , d of the form
A n , d ( f ) = i = 1 n T i ( f ) g i , for f H ( K R d , α , γ ) ,
where g 1 , g 2 , , g n belong to L 2 ( [ 0 , 1 ] d ) and T 1 , T 2 , , T n are continuous linear functionals on H ( K R d , α , γ ) . The worst case error for the algorithm A n , d of the form (7) is defined as
e ( A n , d ) : = sup | | f | | H ( K R d , α , γ ) 1 | | APP d ( f ) A n , d ( f ) | | L 2 .
The nth minimal worst-case error, for n 1 , is defined by
e ( n , APP d ) : = inf A n , d e ( A n , d ) ,
where the infimum is taken over all linear algorithms of the form (7). For n = 0 , we use A 0 , d = 0 . We call
e ( 0 , APP d ) = sup | | f | | H ( K R d , α , γ ) 1 | | APP d ( f ) | | L 2
the initial error of the problem APP d .
We are interested in how the worst case error for the algorithm A n , d depend on the number n and d. To this end, we define the so-called information complexity as
n ( ε , APP d ) : = min { n N 0 : e ( n , APP d ) ε } ,
where ε ( 0 , 1 ) and d N . Here, N 0 = { 0 , 1 , } and N = { 1 , 2 , } .
It is well known, see e.g., [2,10], that the nth minimal worst case errors e ( n , APP d ) and the information complexity n ( ε , APP d ) depend on the eigenvalues of the continuously linear operator W d = APP d * APP d : H ( K R d , α , γ ) H ( K R d , α , γ ) . Let ( λ d , j , η d , j ) be the eigenpairs of W d , i.e.,
W d η d , j = λ d , j η d , j , for all j N ,
where the eigenvalues λ d , j are ordered,
λ d , 1 λ d , 2 0 ,
and the eigenvectors η d , j are orthonormal,
η d , i , η d , j H ( K R d , α , γ ) = δ i , j , for all i , j N .
Then the nth minimal worst-case error, n 1 , is obtained for the algorithm
A n , d f = j = 1 n f , η d , j H ( K R d , α , γ ) η d , j , for all n N .
and
e ( n , APP d ) = e ( A n , d ) = λ d , n + 1 , for all n N .
The initial error e ( 0 , APP d ) = λ d , 1 . Hence we have e ( n , APP d ) = λ d , n + 1 for all n N 0 . The information complexity is
n ( ε , APP d ) = min n N 0 : λ d , n + 1 ε = min n N 0 : λ d , n + 1 ε 2 .
Since the eigenvalues λ d , j with j N of the operator W d are R d , α , γ ( k ) with k N 0 d (see [10], p. 215), by (8) the information complexity of APP d from the space H ( K R d , α , γ ) is equal to
n ( ε , APP d ) = min n N 0 : λ d , n + 1 ε 2 = n N : λ d , n > ε 2 = h N 0 d : R d , α , γ ( h ) > ε 2 = h N 0 d : j = 1 d R α j , γ j ( h j ) > ε 2 ,
with ε ( 0 , 1 ) and d N .
Note that for the L 2 -approximation APP d from the space H ( K R d , α , γ ) we do not need to distinguish between the absolute error criterion and the normalized error criterion since the initial error e ( 0 , APP d ) = λ d , 1 = 1 .

4. Tractability in Weighted Hilbert Spaces and Main Results

In this section we will consider the classical tractability the exponential convergence-tractability (EC-tractability) for the problem APP = { APP d } d N in the weighted Hilbert space H d , α , γ .

4.1. Tractability and Main Results

We focus on the behaviours of the information complexity n ( ε , APP d ) depending on the dimension d and the error threshold ε . Hence we will recall several notions of the classical tractability and exponential convergence-tractability (EC-tractability) notions (see [4,5,7,8,9,10,11,12,17,21]).
Definition 8. 
Let APP = { APP d } d N . We say we have:
  • Strong polynomial tractability (SPT) if there exist non-negative numbers C and p such that
    n ( ε , APP d ) C ( ε 1 ) p for all d N , ε ( 0 , 1 ) .
    In this case we define the exponent p str of SPT as
    p str : = inf { p : C > 0 such that n ( ε , APP d ) C ( ε 1 ) p , d N , ε ( 0 , 1 ) } .
  • Polynomial tractability (PT) if there exist non-negative numbers C, p and q such that
    n ( ε , APP d ) C d q ( ε 1 ) p for all d N , ε ( 0 , 1 ) .
  • Quasi-polynomial tractability (QPT) if there exist two constants C , t > 0 such that
    n ( ε , APP d ) C exp t 1 + ln ε 1 ( 1 + ln d ) for all d N , ε ( 0 , 1 ) .
  • Uniform weak tractability (UWT) if for all t , s > 0 ,
    lim ε 1 + d ln n ( ε , APP d ) d t + ( ε 1 ) s = 0 .
  • Weak tractability (WT) if
    lim ε 1 + d ln n ( ε , APP d ) d + ε 1 = 0 .
  • ( t , s ) -weak tractability ( ( t , s ) -WT) for fixed positive t and s if
    lim ε 1 + d ln n ( ε , APP d ) d t + ( ε 1 ) s = 0 .
  • APP d suffers from the curse of the dimensionality if there exist positive numbers C 1 , C 2 , ε 0 such that
    n ( ε , APP d ) C 1 ( 1 + C 2 ) d for all 0 < ε ε 0 and infinitely many d N .
We find that (1,1)-WT is the same as WT and
SPT PT QPT UWT WT .
In the above definitions about classical tractability, if we replace ε 1 by ( 1 + ln ( ε 1 ) ) we will get the following definitions about exponential convergence-tractability (EC-tractability).
Definition 9. 
Let APP = { APP d } d N . We say we have:
  • Exponential convergence-strong polynomial tractability (EC-SPT) if there exist non-negative numbers C and p such that
    n ( ε , APP d ) C 1 + ln ( ε 1 ) p for all d N , ε ( 0 , 1 ) .
    In this case we define the exponent of EC-SPT as
    inf { p : C > 0 such that n ( ε , APP d ) C 1 + ln ( ε 1 ) p , d N , ε ( 0 , 1 ) } .
  • Exponential convergence-polynomial tractability (EC-PT) if there exist non-negative numbers C, p and q such that
    n ( ε , APP d ) C d q 1 + ln ( ε 1 ) p for all d N , ε ( 0 , 1 ) .
  • Exponential convergence-uniform weak tractability (EC-UWT) if for all t , s > 0
    lim ε 1 + d ln n ( ε , APP d ) d t + 1 + ln ( ε 1 ) s = 0 .
  • Exponential convergence-weak tractability (EC-WT) if
    lim ε 1 + d ln n ( ε , APP d ) d + ln ( ε 1 ) = 0 .
  • Exponential convergence- ( t , s ) -weak tractability (EC- ( t , s ) -WT) for fixed positive t and s if
    lim ε 1 + d ln n ( ε , APP d ) d t + 1 + ln ( ε 1 ) s = 0 .
We note that EC- ( 1 , 1 ) -WT is the same as EC-WT, and
EC - SPT EC - PT EC - QPT EC - UWT EC - WT .
If the problem APP has exponential convergence-tractability, then it has classical tractability. Hence we have
EC - SPT SPT , EC - PT PT , EC - QPT QPT ,
EC - ( t , s ) - WT ( t , s ) - WT , EC - UWT UWT , EC - WT WT .
In the worst case setting the classical tractability and EC-tractability of the problem APP = { APP d } d N in the weighted Hilbert space H d , α , γ with γ = { γ j } j N and α = { α j } j N satisfying
1 γ 1 γ 2 0 ,
and
1 < α * = α 1 = α 2 = .
have been solved by [13,15,16] and [17], respectively. The following results have been obtained:
  • For R d , α * , γ { r d , α * , γ , ψ d , α * , γ , ω d , α * , γ } , PT holds iff SPT holds iff
    s γ : = inf κ > 0 : j = 1 γ j κ < < ,
    and the exponent of SPT is
    p str = 2 max s γ , 1 α .
  • For R d , α * , γ = r d , α * , γ , QPT, UWT and WT are equivalent and hold iff
    γ I : = inf j N γ j < 1 .
    For R d , α * , γ { ψ d , α * , γ , ω d , α * , γ } ,
    γ I <
    implies QPT.
  • For R d , α * , γ { r d , α * , γ , ψ d , α * , γ , ω d , α * , γ } and t > 1 , ( t , s ) -WT holds for all 1 γ 1 γ 2 0 .
  • For R d , α * , γ = r d , α * , γ , EC-WT holds iff
    lim j γ j = 0 .
  • For R d , α * , γ = r d , α * , γ and t < 1 , EC- ( t , 1 ) -WT holds iff
    lim j ln j ln ( γ j 1 ) = 0 .
In the worst case setting the classical tractability such as SPT, PT and WT of the problem APP = { APP d } d N in the weighted Hilbert space H d , α , γ with γ = { γ j } j N and α = { α j } j N satisfying (1) and (2), i.e.,
1 γ 1 γ 2 0 ,
and
1 < α 1 α 2 .
has been solved by [16] as follows:
  • For R d , α , γ { r d , α , γ , ψ d , α , γ , ω d , α , γ } , SPT and PT are equivalent and hold iff
    δ : = lim inf j ln γ j 1 ln j > 0 .
    The exponent of SPT is
    p str = 2 max 1 δ , 1 α 1 .
  • For R d , α , γ = r d , α , γ , WT holds iff
    lim j γ j < 1 .
  • For R d , α , γ { r d , α , γ , ψ d , α , γ , ω d , α , γ } and t > 1 , ( t , s ) -WT holds.
In this paper, we investigate the EC-tractability of the problem APP = { APP d } d N in the weighted Hilbert space H d , α , γ with γ = { γ j } j N and α = { α j } j N satisfying (1) and (2). We obtain sufficient and necessary conditions for EC- ( t , 1 ) -WT with 0 < t < 1 and t = 1 .
Theorem 10. 
Let the sequences γ = { γ j } j N and α = { α j } j N satisfy (1) and (2). Then the problem APP = { APP d } d N for the weighted Hilbert spaces H R d , α , γ with R d , α , γ { r d , α , γ , ψ d , α , γ , ω d , α , γ }
(1) is EC-WT, if and only if
lim j γ j = 0 .
(2) is EC- ( t , 1 ) -WT with t < 1 , if and only if
lim j ln j ln ( γ j 1 ) = 0 .

4.2. The Proof

In order to prove Theorem 10 we need the following Lemmas.
Lemma 11. 
Let η > 0 , ε ( 0 , 1 ) . We have for any d N
n ( ε , APP d ) ε 2 η j = 1 d 1 + α 1 α 1 η ζ ( α 1 η ) γ j η .
Proof. 
By Lemma 6 we have
k = 1 λ d , k η = k N 0 d R d , α , γ ( k ) η = j = 1 d 1 + k = 1 R α j , γ j ( k ) η j = 1 d 1 + k = 1 α 1 α 1 r α 1 , γ j ( k ) η = j = 1 d 1 + α 1 α 1 η k = 1 r α 1 , γ j ( k ) η = j = 1 d 1 + α 1 α 1 η k = 1 γ j k α 1 η = j = 1 d 1 + α 1 α 1 η ζ α 1 η γ j η .
This yields
n λ d , n η k = 1 n λ d , k η k = 1 λ d , k η j = 1 d 1 + α 1 α 1 η ζ α 1 η γ j η ,
which means
λ d , n j = 1 d 1 + α 1 α 1 η ζ ( α 1 η ) γ j η 1 / η n 1 / η .
It follows from the above inequality and (8)
n ( ε , APP d ) = min n N 0 : λ d , n + 1 ε 2 ,
that
n ( ε , APP d ) ε 2 η j = 1 d 1 + α 1 α 1 η ζ ( α 1 η ) γ j η .
This proof is complete. □
Lemma 12. 
Let ε ( 0 , 1 ) . We have for any d 2
n ( ε , APP d ) ε 2 α 1 α 1 γ d 1 α 1 .
Proof. 
Set
H = H ( ε , d , α ) : = h N 0 : h ε 2 α 1 α 1 γ d 1 α 1 1 .
If h > ε 2 α 1 α 1 γ d 1 α 1 1 and d 2 , by Lemma 6 we have
j = 1 d 1 R α j , γ j ( h j ) R α d , γ d ( h ) R α d , γ d ( h ) α 1 α 1 r α 1 , γ d ( h ) = α 1 α 1 γ d h α 1 ε 2
for any { h 1 , , h d 1 } N 0 d 1 , which means
h N 0 d 1 : j = 1 d 1 R α j , γ j ( h j ) R α d , γ d ( h ) > ε 2 =
for all h > ε 2 α 1 α 1 γ d 1 α 1 1 . It follows from (9) and (10) that
n ( ε , APP d ) = h N 0 d : j = 1 d R α j , γ j ( h j ) > ε 2 = h N 0 d : j = 1 d 1 R α j , γ j ( h j ) R α d , γ d ( h d ) > ε 2 = h N 0 h N 0 d 1 : j = 1 d 1 R α j , γ j ( h j ) R α d , γ d ( h ) > ε 2 = h H h N 0 d 1 : j = 1 d 1 R α j , γ j ( h j ) R α d , γ d ( h ) > ε 2 = h ( H { 0 } ) h N 0 d 1 : j = 1 d 1 R α j , γ j ( h j ) > ε 2 R α d , γ d 1 ( h ) + h N 0 d 1 : j = 1 d 1 R α j , γ j ( h j ) > ε 2 = h ( H { 0 } ) n ( ε R α d , γ d 1 / 2 ( h ) , APP d 1 ) + n ( ε , APP d 1 ) = h = 1 ε 2 α 1 α 1 γ d 1 α 1 1 n ( ε R α d , γ d 1 / 2 ( h ) , APP d 1 ) + n ( ε , APP d 1 ) ε 2 α 1 α 1 γ d 1 α 1 .
This finishes the proof. □
Lemma 13. 
For j = 1 d γ j 2 > ε 2 and ε ( 0 , 1 ) we have
n ( ε , APP d ) 2 d .
Proof. 
Set
A ( ε , d ) = h N 0 d : j = 1 d R α j , γ j ( h j ) > ε 2 .
If h = { h 1 , h 2 , , h d } { 0 , 1 } d , we have from (6) that
R d , α , γ ( h ) = j = 1 d R α j , γ j ( h j ) j = 1 d γ j 2 .
Thus, we have { 0 , 1 } d A ( ε , d ) for j = 1 d γ j 2 > ε 2 . Hence it follows from (9) that
n ( ε , APP d ) = | A ( ε , d ) | h { 0 , 1 } d : j = 1 d R α j , γ j ( h j ) > ε 2 = 2 d
for j = 1 d γ j 2 > ε 2 . This proof is complete. □
Proof of Theorem 10. 
If there are infinitely many γ j = 0 for j N , the results are obviously true. Without lose of generality we consider only the situation when all the γ j for j N are positive. (1) Let δ > 0 and take ε = j = 1 d γ j 2 1 + δ 2 , then we have
j = 1 d γ j 2 > ε 2 .
It follows from Lemma 13 that
ln n ( ε , APP d ) d + ln ( ε 1 ) d ln 2 d + 1 + δ 2 · ln j = 1 d ( 2 γ j 1 ) d ln 2 d + 1 + δ 2 · d · ln ( 2 γ d 1 ) = ln 2 1 + 1 + δ 2 · ln 2 + ln ( γ d 1 ) .
Assume that App is EC-WT, i.e., for the above fixed ε
lim d ln n ( ε , APP d ) d + ln ( ε 1 ) = 0 .
Combing (11) and the above equality we have
0 = lim d ln n ( ε , APP d ) d + ln ( ε 1 ) lim d ln 2 1 + 1 + δ 2 · ln 2 + ln ( γ d 1 ) .
This implies lim d γ d = 0 .
On the other hand, assume that we have lim d γ d = 0 . For η > 0 we obtain from the upper bound in Lemma 11 that
lim sup d + ε 1 ln n ( ε , APP d ) d + ln ( ε 1 ) lim sup d + ε 1 2 η ln ( ε 1 ) + j = 1 d ln 1 + α 1 α 1 η ζ ( α 1 η ) γ j η d + ln ( ε 1 ) lim sup d + ε 1 2 η ln ( ε 1 ) + j = 1 d α 1 α 1 η ζ ( α 1 η ) γ j η d + ln ( ε 1 ) 2 η + lim sup d α 1 α 1 η ζ ( α 1 η ) j = 1 d γ j η d = 2 η ,
where we used that ln ( 1 + x ) x for all x 0 and lim sup d j = 1 d γ j η d = 0 if lim d γ d = 0 . Setting η 0 , we have
lim sup d + ε 1 ln n ( ε , APP d ) d + ln ( ε 1 ) = 0 ,
which yields that ET-WT holds.
(2) Assume that EC- ( t , 1 ) -WT for t < 1 holds. First, we note that lim d γ d = 0 . Indeed, if lim d γ d 0 , we deduce from Theorem 10 (1) that EC-WT doesn’t hold, i.e.,
0 < lim sup d + ε 1 ln n ( ε , APP d ) d + ln ( ε 1 ) lim sup d + ε 1 ln n ( ε , APP d ) d t + ln ( ε 1 ) .
This means APP is not EC- ( t , 1 ) -WT for all t < 1 .
Next, we want to prove lim j ln j ln ( γ j 1 ) = 0 . Let ε = ε d ( 0 , 1 ) such that
ln ε 2 α 1 α 1 γ d 1 α 1 = d t
for large d N . From the lower bound in Lemma 12 we obtain
ln n ( ε , APP d ) d t + ln ( ε 1 ) ln ε 2 α 1 α 1 γ d 1 α 1 d t + ln ( ε 1 ) ln ε 2 α 1 α 1 γ d 1 α 1 d t + ln ( ε 1 ) = d t d t + ln ( ε 1 ) = d t d t + α 1 d t / 2 + ln ( γ d 1 ) / 2 α 1 ( ln α 1 ) / 2 = 1 1 + α 1 / 2 + ln ( γ d 1 ) / ( 2 d t ) α 1 ( ln α 1 ) / ( 2 d t ) .
It follows from the assumption that
0 = lim sup d + ε 1 ln n ( ε , APP d ) d t + ln ( ε 1 ) lim sup d + ε 1 1 1 + α 1 / 2 + ln ( γ d 1 ) / ( 2 d t ) α 1 ( ln α 1 ) / ( 2 d t ) = lim sup d + ε 1 1 1 + α 1 / 2 + ln ( γ d 1 ) / ( 2 d t ) ,
which implies
lim d d t ln ( γ d 1 ) = 0 .
Using the fact that d t ln d t = t ln d 0 for large d N , we have
0 lim d ln d ln ( γ d 1 ) lim d d t t ln ( γ d 1 ) = 0 ,
i.e.,
lim d ln d ln ( γ d 1 ) = 0 .
On the other hand, assume that lim j ln j ln ( γ j 1 ) = 0 . Then we obtain that for all δ > 0 there is a number N δ > 0 such that
γ j j δ for all j N δ .
Let η > 0 . We get from Lemma 11 that
ln n ( ε , APP d ) 2 η ln ( ε 1 ) + j = 1 d ln 1 + α 1 α 1 η ζ ( α 1 η ) γ j η 2 η ln ( ε 1 ) + j = 1 d α 1 α 1 η ζ ( α 1 η ) γ j η ,
where we used that ln ( 1 + x ) x for all x > 0 . Choose δ = 2 η . By (12) and (13) we get
ln n ( ε , APP d ) d t + ln ( ε 1 ) 2 η ln ( ε 1 ) + j = 1 N 2 / η 1 α 1 α 1 η ζ ( α 1 η ) γ j η + j = N 2 / η max { d , N 2 / η } α 1 α 1 η ζ ( α 1 η ) γ j η d t + ln ( ε 1 ) 2 η + α 1 α 1 η ζ ( α 1 η ) γ 1 η ( N 2 / η 1 ) + α 1 α 1 η ζ ( α 1 η ) j = N 2 / η max { d , N 2 / η } j 2 d t + ln ( ε 1 ) .
It follows that
lim sup d + ε 1 ln n ( ε , APP d ) d t + ln ( ε 1 ) 2 η + α 1 α 1 η ζ ( α 1 η ) lim sup d + ε 1 j = N 2 / η max { d , N 2 / η } j 2 d t + ln ( ε 1 ) 2 η + α 1 α 1 η ζ ( α 1 η ) lim sup d + ε 1 j = 1 j 2 d t + ln ( ε 1 ) = 2 η .
Setting η 0 , we have
lim sup d + ε 1 ln n ( ε , APP d ) d t + ln ( ε 1 ) = 0 .
Therefore Theorem 10 is proved. □
Example 14. 
An example for EC-WT.
Assume that γ j = j 2 and α j = j + 1 for all j N . We consider the above weighted Hilbert spaces H R d , α , γ , R d , α , γ { r d , α , γ , ψ d , α , γ , ω d , α , γ } .
Obviously, we have lim j γ j = 0 . By Lemma 11 we get
lim sup d + ε 1 ln n ( ε , APP d ) d + ln ( ε 1 ) lim sup d + ε 1 2 η ln ( ε 1 ) + j = 1 d ln 1 + α 1 α 1 η ζ ( α 1 η ) γ j η d + ln ( ε 1 ) lim sup d + ε 1 2 η ln ( ε 1 ) + j = 1 d α 1 α 1 η ζ ( α 1 η ) γ j η d + ln ( ε 1 ) 2 η + lim sup d α 1 α 1 η ζ ( α 1 η ) j = 1 d γ j η d = 2 η + lim sup d α 1 α 1 η ζ ( α 1 η ) j = 1 d j 2 η d = 2 η ,
where we used ln ( 1 + x ) x for all x 0 and lim sup d j = 1 d j 2 η d = 0 . Setting η 0 , we have
lim sup d + ε 1 ln n ( ε , APP d ) d + ln ( ε 1 ) = 0 .
Hence APP is EC-WT.
Example 15. 
An example for EC- ( t , 1 ) -WT for t < 1 .
Assume that γ j = 2 j and α j = 2 j for all j N . We consider the above weighted Hilbert spaces H R d , α , γ , R d , α , γ { r d , α , γ , ψ d , α , γ , ω d , α , γ } .
Note that lim j ln j ln ( γ j 1 ) = lim j ln j j ln 2 = 0 . It follows from Lemma 11 that
ln n ( ε , APP d ) 2 η ln ( ε 1 ) + j = 1 d ln 1 + α 1 α 1 η ζ ( α 1 η ) γ j η = 2 η ln ( ε 1 ) + j = 1 d ln 1 + α 1 α 1 η ζ ( α 1 η ) 2 η j 2 η ln ( ε 1 ) + j = 1 d α 1 α 1 η ζ ( α 1 η ) 2 η j ,
where we used that ln ( 1 + x ) x for all x > 0 . It yields that
lim sup d + ε 1 ln n ( ε , APP d ) d t + ln ( ε 1 ) lim sup d + ε 1 2 η ln ( ε 1 ) + j = 1 d α 1 α 1 η ζ ( α 1 η ) 2 η j d t + ln ( ε 1 ) 2 η + lim sup d + ε 1 α 1 α 1 η ζ ( α 1 η ) j = 1 d 2 η j d t + ln ( ε 1 ) 2 η + lim sup d + ε 1 α 1 α 1 η ζ ( α 1 η ) j = 1 2 η j d t + ln ( ε 1 ) = 2 η .
Setting η 0 , we have
lim sup d + ε 1 ln n ( ε , APP d ) d t + ln ( ε 1 ) = 0 .
Hence APP is EC- ( t , 1 ) -WT for t < 1 .
Remark 16. 
We note that for Example 14 with γ j = j 2 and α j = j + 1 for all j N , APP is EC-WT, but not EC- ( t , 1 ) -WT for t < 1 . Indeed, let ε = ε d ( 0 , 1 ) such that
ln ε 2 α 1 α 1 γ d 1 α 1 = d , i . e . , ε 1 = d e d α 1 / 2 α 1 α 1 / 2 ,
for large d N . From Lemma 12 we have
ln n ( ε , APP d ) d t + ln ( ε 1 ) ln ε 2 α 1 α 1 γ d 1 α 1 d t + ln ( ε 1 ) ln ε 2 α 1 α 1 γ d 1 α 1 d t + ln ( ε 1 ) = d d t + ln ( ε 1 ) = d d t + α 1 d / 2 + ln d α 1 ( ln α 1 ) / 2 = 1 d t 1 + α 1 / 2 + ln d / d α 1 ( ln α 1 ) / ( 2 d ) .
For the above fixed ε and t < 1 we obtain
lim d ln n ( ε , APP d ) d + ln ( ε 1 ) lim d 1 d t 1 + α 1 / 2 + ln d / d α 1 ( ln α 1 ) / ( 2 d ) = 2 α 1 .
This means that APP is not EC- ( t , 1 ) -WT for t < 1 .
Remark 17. 
Obviously, for Example 15 with γ j = 2 j and α j = 2 j for all j N , APP is also EC-WT. Indeed, if APP is EC- ( t , 1 ) -WT for t < 1 , then it is EC-WT. Assume that APP is EC- ( t , 1 ) -WT for t < 1 , then we have
lim d + ε 1 ln n ( ε , APP d ) d t + ln ( ε 1 ) = 0 .
Since
0 lim d + ε 1 ln n ( ε , APP d ) d + ln ( ε 1 ) lim d + ε 1 ln n ( ε , APP d ) d t + ln ( ε 1 ) ,
we further get
lim d + ε 1 ln n ( ε , APP d ) d + ln ( ε 1 ) = 0 ,
which means that APP is EC-WT.
In this paper we discuss the EC-WT and EC- ( t , 1 ) -WT with t < 1 for the problem APP in weighted Hilbert spaces H R d , α , γ for R d , α , γ { r d , α , γ , ψ d , α , γ , ω d , α , γ } with parameters 1 γ 1 γ 2 0 and 1 < α 1 α 2 . We obtain the matching necessary and sufficient condition
lim j γ j = 0
on EC-WT, and the matching necessary and sufficient condition
lim j ln j ln ( γ j 1 ) = 0
on EC- ( t , 1 ) -WT with t < 1 . The weights are used to model the importance of the functions from the weighted Hiblert spaces, so we plan to further study the other EC-tractability notions such as EC-UWT and EC-QWT.

Author Contributions

Conceptualization, Chen, J. and Yan, H.; methodology, Chen, J. and Yan, H.; validation, Chen, J.; formal analysis, Chen, J.; investigation, Yan, H.; resources, Yan, H.; data curation, Yan, H.; writing—original draft preparation, Chen, J.; writing—review and editing, Chen, J.; visualization, Chen, J.; supervision, Chen, J. and Yan, H.; project administration, Chen, J. and Yan, H. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by National Natural Science Foundation of China of found grant number 12001342, Scientific and Technological Innovation Project of Colleges and Universities in Shanxi Province of found grant number 2022L438, Basic Youth Research Found Project of Shanxi Datong University of found grant number 2022Q10, and Doctoral Foundation Project of Shanxi Datong University of found grant number 2019-B-10 and found grant number 2021-B-17.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The authors would like to thank all those for important and very useful comments on this paper.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

References

  1. Berlinet, A.; Thomas-Agnan, C. Reproducing Kernel Hilbert Spaces in Probability and Statistics; Springer: New York, NY, USA, 2004. [Google Scholar]
  2. Traub, J.F.; Wasilkowski, G.W.; Woźniakowski, H. Information-Based Complexity; Academic Press: New York, 1988. [Google Scholar]
  3. Glimm, J.; Jaffe, A. Quantum Physics; Springer: New York, NY, USA, 1987. [Google Scholar]
  4. Dick, J.; Kritzer, P.; Pillichshammer, F.; Woźniakowski, H. Approximation of analytic functions in Korobov spaces. J. Complex. 2014, 30, 2–28. [Google Scholar] [CrossRef]
  5. Irrgeher, C.; Kritzer, P.; Pillichshammer, F.; Woźniakowski, H. Tractability of multivariate approximation defined over Hilbert spaces with exponential weights. J. Approx. Theory 2016, 207, 301–338. [Google Scholar] [CrossRef]
  6. Liu, Y.; Xu, G. Average case tractability of a multivariate approximation problem. J. Complex 2017, 43, 76–102. [Google Scholar] [CrossRef]
  7. Wang, H. A note about EC-(s,t)-weak tractability of multivariate approximation with analytic Korobov kernels. J. Complex. 2019, 55, 101412. [Google Scholar] [CrossRef]
  8. Xu, G. EC-tractability of Lp-approximation in Korobov spaces with exponential weights. J. Approx. Theory 2020, 249, 1–20. [Google Scholar] [CrossRef]
  9. Zhang, J. A note on EC-tractability of multivariate approximation in weighted Korobov spaces for the standard information class. J. Complex. 2021, 67, 101573. [Google Scholar] [CrossRef]
  10. Novak, E.; Woźniakowski, H. Tractability of Multivariate Problems, Volume I: Linear Information; EMS: Zürich, 2008. [Google Scholar]
  11. Novak, E.; Woźniakowski, H. Tractability of Multivariate Problems, Volume II: Standard Information for Functionals; EMS: Zürich, 2010. [Google Scholar]
  12. Novak, E.; Woźniakowski, H. Tractability of Multivariate Problems, Volume III: Standard Information for Operators; EMS: Zürich, 2012. [Google Scholar]
  13. Wasilkowski, G.W.; Woźniakowski, H. Weighted tensor product algorithms for linear multivariate problems. J. Complex. 1999, 15(3), 402–447. [Google Scholar] [CrossRef]
  14. Novak, E.; Sloan, I.H.; Woźniakowski, H. Tractability of approximation for weighted Korobov spaces on classical and quantum computers. Found. Comput. Math. 2004, 4(2), 121–156. [Google Scholar]
  15. Eberta, A.; Pillichshammer, F. Tractability of approximation in the weighted Korobov space in the worst-case setting—a complete picture. J. Complex. 2021, 67, 101571. [Google Scholar] [CrossRef]
  16. Yan, H.; Chen, J. Tractability of approximation of functions defined over weighted Hilbert spaces. Axioms 2024, 13, 108. [Google Scholar] [CrossRef]
  17. Chen, J. EC-(t1,t2)-tractability of approximation in weighted Korobov spaces in the worst case setting. J. Complex. 2022, 73, 101680. [Google Scholar] [CrossRef]
  18. Leobacher, G.; Pillichshammer, F.; Ebert, A. Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness. J. Complex. 2023, 78, 101768. [Google Scholar] [CrossRef]
  19. Irrgeher, C.; Leobacher, G. High-dimensional integration on the Rd, weighted Hermite spaces, and orthogonal transforms. J. Complex. 2015, 31, 174–205. [Google Scholar] [CrossRef]
  20. Dick, J.; Irrgeher, C.; Leobacher, G.; Pillichshammer, F. On the optimal order of integration in Hermite spaces with finite smoothness, SIAM J. Numer. Anal. 2018, 56 (2) (2018), 684-707.
  21. Dick, J.; Larcher, G.; Pillichshammer, F.; Woźniakowski, H. Exponential convergence and tractability of multivariate integration for korobov spaces. Math. Comp. 2011, 80, 905–930. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated