1. Introduction
We study multivariate approximation problems
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
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
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
-approximation problems from the weighted Hilbert spaces in the worst case setting. Let
be a Hilbert space with weight
, where
and
are two positive sequences satisfying
and
We consider the
-approximation problem
In the worst case setting the classical tractability of the problem
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
-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
in weighted Korobov spaces such as EC-
-weak tractability for
were studied in [
17]. However, the above weighted Hilbert spaces
with weights
satisfy
and
In this paper we present three cases of weighted Hilbert spaces
with weights
for
and
, 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
-weak tractability for
of the problems
in these three weighted Hilbert spaces. However, EC-tractability have not yet been considered for the approximation problems
for the above three weighted Hilbert spaces. We will investigate EC-
-weak tractability for some
,
and get the sufficient and necessary conditions for the EC-
-weak tractability (EC-weak tractability) and EC-
-weak tractability with
.
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
-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
and
be two positive sequences of the reproducing kernel Hilbert space
with weight
satisfying
and
Assume that the weighted reproducing kernel function
of the space
is of product form
where
is a universal weighted function,
Here, let weight
be a summable function, i.e.,
. Then we have
and the inner product
and
where
and
Note that
is well defined for
and for all
, since
If
and
, then the space
is called unweighted space. Here,
and
.
There are many ways for introducing weighted reproducing kernel Hilbert spaces with weights
. In this paper we consider three weights like the cases in the reference [
16].
2.1. A Weighted Korobov Space
Let
and
satisfy (
1) and (
2). We consider a weighted Korobov space
with weight
where
for
and
. We can see the case in the references [
16,
19]. Then we have the kernel function (
3) and the inner product (
4) as follows:
and
Remark 1.
Obviously, the kernel is well defined for and satisfying (1) and (2), due to
where is the Riemann zeta function.
2.2. A First Variant of the Weighted Korobov Space
Let
and
satisfy (
1) and (
2), respectively. We consider a first variant of the weighted Korobov space with weight
where 1.5
for
and
.
Then we have the kernel function (
3) and the inner product (
4) as follows:
and
Lemma 2.
([16] Lemma 2) For all we have
Remark 3.
From Lemma 2 and we obtain
Hence the kernel is well defined.
2.3. A Second Variant of the Weighted Korobov Space
Let
and
satisfy (
1) and (
2), respectively. We consider a second variant of the weighted Korobov space
(see the references [
16,
20]) with weight
where
for
and
, and 1.5
Then we have the kernel function (
3) and the inner product (
4) as follows:
and
Lemma 4.
([16] Lemma 3) For all we have
Remark 5.
We note that the kernel is also well defined. Indeed, it follows from Lemma 4 and that
Lemma 6.
Let for all . Then we have for all , ,
Especially, we have for all , ,
Proof. On the one hand, it is obvious from Lemma 2 and Lemma 4 that
for all
. Since for all
we have
Thus we have for all
,
that
On the other hand, noting for all
and for all
we have for all
,
that
Hence by (
5) we further get for all
,
that
□
Remark 7.
Let for all . Then we obtain
for all . Indeed, for all we have
which means . Due to for all , we get
which yields
3. -Approximation in the Weighted Hilbert Spaces
In this paper we investigate the
-approximation
for all
in Hilbert space
with weight
. It is well known from Remark 1, Remark 3, Remark 5 and [
14] that this
-approximation is compact for
. We approximation
by algorithm
of the form
where
belong to
and
are continuous linear functionals on
. The worst case error for the algorithm
of the form (
7) is defined as
The
nth minimal worst-case error, for
, is defined by
where the infimum is taken over all linear algorithms of the form (
7). For
, we use
. We call
the initial error of the problem
.
We are interested in how the worst case error for the algorithm
depend on the number
n and
d. To this end, we define the so-called information complexity as
where
and
. Here,
and
.
It is well known, see e.g., [
2,
10], that the
nth minimal worst case errors
and the information complexity
depend on the eigenvalues of the continuously linear operator
. Let
be the eigenpairs of
, i.e.,
where the eigenvalues
are ordered,
and the eigenvectors
are orthonormal,
Then the
nth minimal worst-case error,
, is obtained for the algorithm
and
The initial error
. Hence we have
for all
. The information complexity is
Since the eigenvalues
with
of the operator
are
with
(see [
10], p. 215), by (
8) the information complexity of
from the space
is equal to
with
and
.
Note that for the -approximation from the space we do not need to distinguish between the absolute error criterion and the normalized error criterion since the initial error .
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 in the weighted Hilbert space .
4.1. Tractability and Main Results
We focus on the behaviours of the information complexity
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 . We say we have:
-
Strong polynomial tractability (SPT) if there exist non-negative numbers C and p such that
In this case we define the exponent of SPT as
Polynomial tractability (PT) if there exist non-negative numbers C, p and q such that
Quasi-polynomial tractability (QPT) if there exist two constants such that
Uniform weak tractability (UWT) if for all ,
Weak tractability (WT) if
-weak tractability (-WT) for fixed positive t and s if
suffers from the curse of the dimensionality if there exist positive numbers , , such that
We find that (1,1)-WT is the same as WT and
In the above definitions about classical tractability, if we replace
by
we will get the following definitions about exponential convergence-tractability (EC-tractability).
Definition 9. Let . We say we have:
-
Exponential convergence-strong polynomial tractability (EC-SPT) if there exist non-negative numbers C and p such that
In this case we define the exponent of EC-SPT as
Exponential convergence-polynomial tractability (EC-PT) if there exist non-negative numbers C, p and q such that
Exponential convergence-uniform weak tractability (EC-UWT) if for all
Exponential convergence-weak tractability (EC-WT) if
Exponential convergence--weak tractability (EC--WT) for fixed positive t and s if
We note that EC-
-WT is the same as EC-WT, and
If the problem
has exponential convergence-tractability, then it has classical tractability. Hence we have
In the worst case setting the classical tractability and EC-tractability of the problem
in the weighted Hilbert space
with
and
satisfying
and
have been solved by [
13,
15,
16] and [
17], respectively. The following results have been obtained:
For
, PT holds iff SPT holds iff
and the exponent of SPT is
-
For
, QPT, UWT and WT are equivalent and hold iff
For
,
implies QPT.
For and , -WT holds for all .
For
, EC-WT holds iff
For
and
, EC-
-WT holds iff
In the worst case setting the classical tractability such as SPT, PT and WT of the problem
in the weighted Hilbert space
with
and
satisfying (
1) and (
2), i.e.,
and
has been solved by [
16] as follows:
-
For
, SPT and PT are equivalent and hold iff
For
, WT holds iff
For and , -WT holds.
In this paper, we investigate the EC-tractability of the problem
in the weighted Hilbert space
with
and
satisfying (
1) and (
2). We obtain sufficient and necessary conditions for EC-
-WT with
and
.
Theorem 10.
Let the sequences and satisfy (1) and (2). Then the problem for the weighted Hilbert spaces with
(1) is EC-WT, if and only if
(2) is EC--WT with , if and only if
4.2. The Proof
In order to prove Theorem 10 we need the following Lemmas.
Lemma 11.
Let , . We have for any
Proof. By Lemma 6 we have
This yields
which means
It follows from the above inequality and (
8)
that
This proof is complete. □
Lemma 12.
Let . We have for any
Proof. Set
If
and
, by Lemma 6 we have
for any
, which means
for all
. It follows from (
9) and (
10) that
This finishes the proof. □
Lemma 13.
For and we have
Proof. Set
If
, we have from (
6) that
Thus, we have
for
. Hence it follows from (
9) that
for
. This proof is complete. □
Proof of Theorem 10. If there are infinitely many
for
, the results are obviously true. Without lose of generality we consider only the situation when all the
for
are positive. (1) Let
and take
, then we have
It follows from Lemma 13 that
Assume that App is EC-WT, i.e., for the above fixed
Combing (
11) and the above equality we have
This implies
.
On the other hand, assume that we have
. For
we obtain from the upper bound in Lemma 11 that
where we used that
for all
and
if
. Setting
, we have
which yields that ET-WT holds.
(2) Assume that EC-
-WT for
holds. First, we note that
. Indeed, if
, we deduce from Theorem 10 (1) that EC-WT doesn’t hold, i.e.,
This means APP is not EC-
-WT for all
.
Next, we want to prove
. Let
such that
for large
. From the lower bound in Lemma 12 we obtain
It follows from the assumption that
which implies
Using the fact that
for large
, we have
i.e.,
On the other hand, assume that
. Then we obtain that for all
there is a number
such that
Let
. We get from Lemma 11 that
where we used that
for all
. Choose
. By (
12) and (
13) we get
It follows that
Setting
, we have
Therefore Theorem 10 is proved. □
Example 14. An example for EC-WT.
Assume that and for all . We consider the above weighted Hilbert spaces , .
Obviously, we have . By Lemma 11 we get
where we used for all and . Setting , we have
Hence APP is EC-WT.
Example 15. An example for EC--WT for .
Assume that and for all . We consider the above weighted Hilbert spaces , .
Note that . It follows from Lemma 11 that
where we used that for all . It yields that
Setting , we have
Hence APP is EC--WT for .
Remark 16.
We note that for Example 14 with and for all , APP is EC-WT, but not EC--WT for . Indeed, let such that
for large . From Lemma 12 we have
For the above fixed ε and we obtain
This means that APP is not EC--WT for .
Remark 17.
Obviously, for Example 15 with and for all , APP is also EC-WT. Indeed, if APP is EC--WT for , then it is EC-WT. Assume that APP is EC--WT for , then we have
Since
we further get
which means that APP is EC-WT.
In this paper we discuss the EC-WT and EC-
-WT with
for the problem APP in weighted Hilbert spaces
for
with parameters
and
. We obtain the matching necessary and sufficient condition
on EC-WT, and the matching necessary and sufficient condition
on EC-
-WT with
. 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
- Berlinet, A.; Thomas-Agnan, C. Reproducing Kernel Hilbert Spaces in Probability and Statistics; Springer: New York, NY, USA, 2004. [Google Scholar]
- Traub, J.F.; Wasilkowski, G.W.; Woźniakowski, H. Information-Based Complexity; Academic Press: New York, 1988. [Google Scholar]
- Glimm, J.; Jaffe, A. Quantum Physics; Springer: New York, NY, USA, 1987. [Google Scholar]
- 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]
- 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]
- Liu, Y.; Xu, G. Average case tractability of a multivariate approximation problem. J. Complex 2017, 43, 76–102. [Google Scholar] [CrossRef]
- 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]
- Xu, G. EC-tractability of Lp-approximation in Korobov spaces with exponential weights. J. Approx. Theory 2020, 249, 1–20. [Google Scholar] [CrossRef]
- 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]
- Novak, E.; Woźniakowski, H. Tractability of Multivariate Problems, Volume I: Linear Information; EMS: Zürich, 2008. [Google Scholar]
- Novak, E.; Woźniakowski, H. Tractability of Multivariate Problems, Volume II: Standard Information for Functionals; EMS: Zürich, 2010. [Google Scholar]
- Novak, E.; Woźniakowski, H. Tractability of Multivariate Problems, Volume III: Standard Information for Operators; EMS: Zürich, 2012. [Google Scholar]
- Wasilkowski, G.W.; Woźniakowski, H. Weighted tensor product algorithms for linear multivariate problems. J. Complex. 1999, 15(3), 402–447. [Google Scholar] [CrossRef]
- 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]
- 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]
- Yan, H.; Chen, J. Tractability of approximation of functions defined over weighted Hilbert spaces. Axioms 2024, 13, 108. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
- 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.
- 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. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).