Abstract
We study -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 and for . We consider algorithms using the class of arbitrary linear functionals. We discuss the exponential convergence--weak tractability of these -approximation problems. In particular, we obtain the sufficient and necessary conditions on the weights for exponential convergence-weak tractability and exponential convergence--weak tractability with .
MSC:
41A81; 47A58; 47B02
1. Introduction
We study multivariate approximation problems of functions defined over Hilbert spaces with large or huge d in the worst case setting (approximation error by the worst case error). Such problems appear in quantum physics (see [1]), computational chemistry (see [2]), and economics (see [3]). We consider algorithms using the class of arbitrary linear functionals. The information complexity is the minimal number n of linear functionals for which the approximation error of some algorithm is at most . Tractability describes the dependence of the information complexity on the threshold and the dimension d. We consider the classical tractability which is polynomially convergent, and the exponential convergence-tractability (EC-tractability) which is exponentially convergent. Recently many authors discuss classical tractability and EC-tractability in weighted Hilbert spaces (see [4] by linear information, ref. [5] by standard information for functionals, and [6] by standard information for operators), especially in analytic Korobov spaces, such as exponential convergence and uniform exponential convergence (see [7]), classical tractability (see [8]) and EC-tractability for -approximation (see [9] for exponential convergence--weak tractability and [10] for other EC-tractability results by algorithms using continuous linear functionals, and see [11] for EC-tractability by algorithms using function values), and EC-tractability for -approximation with by algorithms using continuous linear functionals (see [12]). Some authors consider tractability in weighted Hilbert spaces, such as classical tractability in weighted Korobov spaces (see [13] for strong polynomial tractability and polynomial tractability, [14] for other classical tractability results by algorithms using continuous linear functionals, and [15] by algorithms using function values), EC-tractability in weighted Korobov spaces (see [16]), and classical tractability in weighted Gaussian ANOVA spaces (see [17,18] with different weights, respectively).
In this paper, we investigate EC-tractability of -approximation problems from the weighted Hilbert spaces with some weights. Let be a Hilbert space with weight , where and are two positive sequences satisfying and In the worst case setting, we consider the -approximation problem
The classical tractability for -approximation problem in weighted Korobov spaces such as strong polynomial tractability and polynomial tractability were discussed in [13,15,17]; quasi-polynomial tractability, uniform weak tractability, weak tractability and -weak tractability were investigated in [14,17]. Additionally, ref. [17] 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 [16]. 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 [18]. These weighted Hilbert spaces are similar but also different. The authors in [18] studied the polynomial tractability, strong polynomial tractability, weak tractability, and -weak tractability for and of the problems in these three weighted Hilbert spaces. However, there are no results about EC-tractability of the approximation problems in the above three weighted Hilbert spaces. We will study exponential convergence--weak tractability (EC--WT) for some , and obtain the complete sufficient and necessary conditions for and , , respectively.
The paper is structured in the following ways. We present three cases of weighted Hilbert spaces in Section 2. Section 3 gives preliminaries about the -approximation problem in the weighted Hilbert space. Section 4.1 is devoted to recall some notions about the tractability, such as classical tractability and exponential convergence-tractability and state the main results. In Section 4.2 we give the proof of Theorem 1. In Section 5 we present a summary.
2. Weighted Reproducing Kernel Hilbert Spaces
In this section we consider weighted reproducing kernel Hilbert spaces with different weights.
Let be a Hilbert space defined in . The function of is called a reproducing kernel of if for every and every ,
The Hilbert space is a so-called reproducing kernel Hilbert space. We can study more details on reproducing kernel Hilbert spaces in the reference [19].
In this paper, let and be two positive sequences of the Hilbert space with satisfying
Assume that the function of the space with is of product form
where is a universal weighted function
Here, let weight be a summable function, i.e., . Then we have
the inner product
and
where
and
We can ascertain that is well defined for and for all , since
Note that the Hilbert space is a reproducing kernel Hilbert space with the reproducing kernel . Indeed, for every we have
The kernel with weight is called a weighted reproducing kernel and the space is called a weighted reproducing kernel Hilbert space. If and , then the space is called unweighted space. Here, and .
There are many ways to introduce weighted reproducing kernel Hilbert spaces with weights . In this paper we consider three weights like the cases in the reference [18].
2.1. A Weighted Korobov Space
Let and be two sequences satisfying (1). We consider a weighted Korobov space with weight
where
for and . We can see the case in the references [18,20]. Then we have the kernel function (2) with
for , and the inner product (3) with
Remark 1.
Obviously, the kernel is well defined for and satisfying (1), due to
where is the Riemann zeta function.
2.2. A First Variant of the Weighted Korobov Space
Let and be two sequences satisfying (1). We discuss a first variant of the weighted Korobov space with weight
where 1.5
for and .
Lemma 1
([18] Lemma 2). For all we have
Remark 2.
From Lemma 1 and we get
Hence, the kernel is well defined.
2.3. A Second Variant of the Weighted Korobov Space
Let and be two sequences satisfying (1). We study a second variant of the weighted Korobov space (see the references [18,21]) with weight
where
for and and 1.5
Lemma 2
([18] Lemma 3). For all we have
Remark 3.
We note that the kernel is also well defined. Indeed, it follows from Lemma 2 and that
Lemma 3.
Let for all . Then we have for all ,
Particularly, we have for all ,
Proof.
On the one hand, it is obvious from Lemmas 1 and 2 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 (4) we further get for all , that
□
Remark 4.
Let for all . Then we obtain
for all . Indeed, for all we have
which means . As a result of all , we get
which yields
3. -Approximation in the Weighted Hilbert Spaces
In this paper we investigate the -approximation given by
in weighted Hilbert space with weight . We note from Remarks 1–3, and [15] that this -approximation is compact for .
We approximate by using the algorithm of the form
where belong to and are continuous linear functionals on .
We consider the worst case setting in which the error of the algorithm of the form (6) is defined as
The error is also called the worst case error. The nth minimal worst case error is defined as
which is the infimum error among all algorithms (6). For , we set . We call
the initial error of the problem .
We are interested in how the worst case error for the algorithm depends on the numbers n and d. We define the information complexity as
where and . In this paper, we set and .
By the references [2,4] we know that the nth minimal worst case errors and the information complexity are related to the eigenvalues of the continuously linear operator , where is the operator dual to . The eigenvalues of are denoted by satisfying
and the corresponding orthogonal eigenvectors of by satisfying
where
Here for and for . Then the nth minimal worst case error is attained for the algorithm
and
The initial error . Hence, we have for all . This deduces that the information complexity is equal to
Since the eigenvalues with of the operator are with (see [4] p. 215), by (7) the information complexity of from the space is equal to
with and , where denotes the cardinality of set A.
Note that for the -approximation from the space the absolute error criterion and the normalized error criterion are the same, since the initial error .
4. Tractability in Weighted Hilbert Spaces and Main Results
In this paper we will study the classical tractability and 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 study several notions about the classical tractability and the exponential convergence-tractability (EC-tractability) notions (see [4,5,6,7,8,9,11,12,16,22]).
Definition 1.
Let . We say the following:
- Strong polynomial tractability (SPT) if there are positive numbers C and p such thatIn this case we define the exponent of SPT as
- Polynomial tractability (PT) if there are positive numbers C, p, and q such that
- Quasi-polynomial tractability (QPT) if there are positive numbers C and t such that
- Uniform weak tractability (UWT) if for all ,
- Weak tractability (WT) if
- -weak tractability (-WT) for fixed positive t and s if
We find that (1,1)-WT is the same as WT and
In the above definitions regarding classical tractability, replacing with , we will have the following definitions about exponential convergence-tractability (EC-tractability).
Definition 2.
Let . We say we have the following:
- Exponential convergence-strong polynomial tractability (EC-SPT) if there are positive numbers C and p such thatThe exponent of EC-SPT is defined as
- Exponential convergence-polynomial tractability (EC-PT) if there are positive 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
Obviously, if the problem has exponential convergence-tractability, then it has classical tractability and
In the worst case setting the classical tractability and EC-tractability of the problem in the weighted Hilbert space with and satisfying
have been solved by [13,14,16,18] as follows:
- For , SPT holds iff PT holds iffand the exponent of SPT is
- For , QPT, UWT, and WT are equivalent and hold iffFor ,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), i.e.,
has been solved by [18] as follows:
- For , SPT holds iff PT holds iffThe exponent of SPT is
- 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). We obtain sufficient and necessary conditions for EC--WT with and .
Theorem 1.
Let and satisfy (1). Then the problem in 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 1 we need the following Lemmas.
Lemma 4.
Let , . We have for any
Proof.
By Lemma 3 we have
This yields
which means
It follows from the above inequality and (7)
that
This proof is complete. □
Lemma 5.
Let . We have for any
Proof.
Lemma 6.
For and we have
Proof.
Proof of Theorem 1.
If there are infinitely many for , the results are obviously true. Without loss of generality we discuss only that the are positive for .
- (1)
- Let and take , then we haveIt follows from Lemma 6 thatAssume that App is EC-WT, i.e., for the above fixedCombing (10) and the above equality we haveThis implies .On the other hand, assume that we have . For we obtain from the upper bound in Lemma 4 thatwhere we used for all and if . Setting , we havewhich yields that ET-WT holds.
- (2)
- Assume that APP is EC--WT for . First, we note that . Indeed, if , we deduce from Theorem 1 (1) that EC-WT doesn’t hold, i.e.,This deduces that EC--WT for does not hold.Next, we will prove . Let such thatfor large . From the lower bound in Lemma 5 we obtainIt follows from the assumption thatwhich impliesUsing the fact that for large , we havei.e.,On the other hand, assume that . Then we obtain that for all there exists a positive number such thatIt follows thatSetting , we haveTherefore, Theorem 1 is proved.
□
Example 1.
An example for EC-WT.
Assume that and for all . Next, we will study EC-WT for the weighted Hilbert spaces with weight .
Obviously, we have . By Lemma 4 we get
where in the second inequality we used for all and . Setting , we have
Hence, APP is EC-WT.
Example 2.
An example for EC--WT for .
Assume that and for all . Next, we will study EC--WT for for the weighted Hilbert spaces with weight .
Note that . It follows from Lemma 4 that
where in the last inequality we used for all . It yields that
Setting , we have
Hence, APP is EC--WT for .
Remark 5.
We note that for Example 1 with and for all , APP is EC-WT, but not EC--WT for . Indeed, let such that
for large . From Lemma 5 we have
For the above fixed ε and we obtain
This means that APP is not EC--WT for .
Remark 6.
Obviously, for Example 2 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.
5. Conclusions
In this paper we discuss the EC-WT and EC--WT with for the approximation 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 Hilbert spaces, so we will further research the other EC-tractability notions such as EC-SPT, EC-PT, EC-QWT, and EC-UWT.
Author Contributions
Conceptualization, J.C. and H.Y.; methodology, J.C. and H.Y.; validation, J.C.; formal analysis, J.C.; investigation, H.Y.; resources, H.Y.; data curation, H.Y.; writing—original draft preparation, J.C.; writing—review and editing, H.Y.; visualization, J.C.; supervision, J.C. and H.Y.; project administration, J.C. and H.Y. All authors have read and agreed to the published version of the manuscript.
Funding
Jia Chen is supported by the National Natural Science Foundation of China (Project 12001342), and the Doctoral Foundation Project of Shanxi Datong University (Project 2019-B-10). Huichao Yan is supported by the Scientific and Technological Innovation Project of Colleges and Universities in Shanxi Province (Project 2022L438), the Basic Youth Research Found Project of Shanxi Datong University (Project 2022Q10), and the Doctoral Foundation Project of Shanxi Datong University (Project 2021-B-17).
Data Availability Statement
The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding author.
Acknowledgments
The authors would like to thank all referees and the editor for suggestions on this paper.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Glimm, J.; Jaffe, A. Quantum Physics; Springer: New York, NY, USA, 1987. [Google Scholar]
- Le Bris, C. Computational chemistry from the perspective of numerical analysis. Acta Numer. 2005, 14, 363–444. [Google Scholar] [CrossRef]
- Rust, J.; Traub, J.F.; Woźniakowski, H. Is there a curse of dimensionality for contraction fixed points in the worst case. Econometrica 2002, 70, 285–329. [Google Scholar] [CrossRef]
- Novak, E.; Woźniakowski, H. Tractability of Multivariate Problems, Volume I: Linear Information; EMS Zürich: Zurich, Swtizerland, 2008. [Google Scholar]
- Novak, E.; Woźniakowski, H. Tractability of Multivariate Problems, Volume II: Standard Information for Functionals; EMS Zürich: Zurich, Swtizerland, 2010. [Google Scholar]
- Novak, E.; Woźniakowski, H. Tractability of Multivariate Problems, Volume III: Standard Information for Operators; EMS Zürich: Zurich, Swtizerland, 2012. [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]
- 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]
- Liu, Y.; Xu, G. Average case tractability of a multivariate approximation problem. J. Complex. 2017, 43, 76–102. [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]
- Xu, G. EC-tractability of Lp-approximation in Korobov spaces with exponential weights. J. Approx. Theory 2020, 249, 1–20. [Google Scholar] [CrossRef]
- Wasilkowski, G.W.; Woźniakowski, H. Weighted tensor product algorithms for linear multivariate problems. J. Complex. 1999, 15, 402–447. [Google Scholar] [CrossRef]
- 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]
- 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, 121–156. [Google Scholar]
- 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]
- Yan, H.; Chen, J. Tractability of approximation of functions defined over weighted Hilbert spaces. Axioms 2024, 13, 108. [Google Scholar] [CrossRef]
- Aronszajn, N. Theory of reproducing kernels. Trans. Am. Math. Soc. 1950, 68, 337–404. [Google Scholar] [CrossRef]
- Irrgeher, C.; Leobacher, G. High-dimensional integration on the ℝd, weighted Hermite spaces, and orthogonal transforms. J. Complex. 2015, 31, 174–205. [Google Scholar]
- 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, 684–707. [Google Scholar] [CrossRef]
- 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 (https://creativecommons.org/licenses/by/4.0/).