Sparse-grid polynomial interpolation approximation and integration for parametric and stochastic elliptic PDEs with lognormal inputs
Dinh D\~ung

TL;DR
This paper develops sparse-grid polynomial interpolation and quadrature methods for efficiently solving parametric and stochastic elliptic PDEs with lognormal inputs, providing explicit convergence rates and improved accuracy over existing methods.
Contribution
It introduces fully discrete sparse-grid polynomial interpolation and quadrature methods for elliptic PDEs with lognormal inputs, with proven convergence rates and explicit construction.
Findings
Convergence rates of the proposed methods are explicitly derived.
Sparse-grid collocation methods effectively approximate solutions and integrals.
The methods outperform previous approaches in accuracy and efficiency.
Abstract
By combining a certain approximation property in the spatial domain, and weighted -summability of the Hermite polynomial expansion coefficients in the parametric domain obtained in [M. Bachmayr, A. Cohen, R. DeVore and G. Migliorati, ESAIM Math. Model. Numer. Anal. (2017), 341-363] and [M. Bachmayr, A. Cohen, D. D\~ung and C. Schwab, SIAM J. Numer. Anal. (2017), 2151-2186], we investigate linear non-adaptive methods of fully discrete polynomial interpolation approximation as well as fully discrete weighted quadrature methods of integration for parametric and stochastic elliptic PDEs with lognormal inputs. We explicitly construct such methods and prove corresponding convergence rates in of the approximations by them, where is a number characterizing computation complexity. The linear non-adaptive methods of fully discrete polynomial interpolation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Another algorithm template
names
Dinh Dũng
Information Technology Institute
Vietnam National University
144 Xuan Thuy
Cau Giay
Hanoi
Vietnam
Sparse-grid polynomial interpolation approximation and integration for parametric and stochastic elliptic PDEs with lognormal inputs
names
Dinh Dũng
Information Technology Institute
Vietnam National University
144 Xuan Thuy
Cau Giay
Hanoi
Vietnam
Abstract
By combining a certain approximation property in the spatial domain, and weighted -summability of the Hermite polynomial expansion coefficients in the parametric domain obtained in [M. Bachmayr, A. Cohen, R. DeVore and G. Migliorati, ESAIM Math. Model. Numer. Anal. 51(2017), 341-363] and [M. Bachmayr, A. Cohen, D. Dũng and C. Schwab, SIAM J. Numer. Anal. 55(2017), 2151-2186], we investigate linear non-adaptive methods of fully discrete polynomial interpolation approximation as well as fully discrete weighted quadrature methods of integration for parametric and stochastic elliptic PDEs with lognormal inputs. We construct such methods and prove convergence rates of the approximations by them. The linear non-adaptive methods of fully discrete polynomial interpolation approximation are sparse-grid collocation methods which are certain sums taken over finite nested Smolyak-type indices sets of mixed tensor products of dyadic scale successive differences of spatial approximations of particular solvers, and of successive differences of their parametric Lagrange interpolating polynomials. The Smolyak-type sparse interpolation grids in the parametric domain are constructed from the roots of Hermite polynomials or their improved modifications. Moreover, they generate in a natural way fully discrete weighted quadrature formulas for integration of the solution to parametric and stochastic elliptic PDEs and its linear functionals, and the error of the corresponding integration can be estimated via the error in the Bochner space norm of the generating methods where is the Gaussian probability measure on and is the energy space. We also briefly consider similar problems for parametric and stochastic elliptic PDEs with affine inputs, and problems of non-fully discrete polynomial interpolation approximation and integration. In particular, the convergence rates of non-fully discrete polynomial interpolation approximation and integration obtained in this paper significantly improve the known ones.
Keywords and Phrases: High-dimensional approximation; Parametric and stochastic elliptic PDEs; Lognormal inputs; Collocation approximation; Fully discrete non-adaptive polynomial interpolation approximation; Fully discrete non-adaptive integration.
Mathematics Subject Classifications (2010): 65C30, 65D05, 65D32, 65N15, 65N30, 65N35.
1 Introduction
One of basic problems in Uncertainty Quantification are approximation and numerical integration for parametric and stochastic PDEs. Since the number of parametric variables may be very large or even infinite, they are treated as high-dimensional or infinite-dimensional approximation problems. Let be a bounded Lipschitz domain. Consider the diffusion elliptic equation
[TABLE]
for a given fixed right-hand side and spatially variable scalar diffusion coefficient . Denote by the energy space and let be the conjungate space of . If satisfies the ellipticity assumption
[TABLE]
by the well-known Lax-Milgram lemma, for any , there exists a unique solution in weak form which satisfies the variational equation
[TABLE]
We consider diffusion coefficients having a parametrized form , where is a sequence of real-valued parameters ranging in the set which is either or . In this case, the solution to the parametrized diffusion elliptic equation
[TABLE]
can be considered as a map from to the space . The objective is to achieve numerical approximation of this complex map by a small number of parameters with some guaranteed error in a given norm. Depending on the nature of the modeled object, the parameter may be either deterministic or random. In the present paper, we consider the so-called lognormal case when and the diffusion coefficient is of the form
[TABLE]
where the are i.i.d. standard Gaussian random variables and . We also birefly consider the affine case when and the diffusion coefficient is of the form
[TABLE]
In order to study fully discrete approximations of the solution to the parametrized elliptic PDEs (1.1), we assume that and , and hence we obtain that has the second higher regularity, i.e., where is the space
[TABLE]
equipped with the norm
[TABLE]
which coincides with the Sobolev space with equivalent norms if the domain has smoothness, see [19, Theorem 2.5.1.1]. Moreover, we assume that there holds the following approximation property for the spaces and .
Assumption I There are a sequence of subspaces of dimension , and a sequence of linear operators from into , and a number such that
[TABLE]
A basic role in the approximation and numerical integration for parametric and stochastic PDEs are generalized polynomial chaos (gpc) expansions for the dependence on the parametric variables. We refer the reader to [9, 13, 20, 29, 28] and references there for different aspects in approximation for parametric and stochastic PDEs. In [5]–[11], based on the conditions \big{(}\|\psi_{j}\|_{W^{1}_{\infty}(D)}\big{)}_{j\in{\mathbb{N}}}\in\ell_{p}({\mathbb{N}}) for some on the affine expansion (1.4), the authors have proven the -summability of the coefficients in a Taylor or Legendre polynomials expansion and hence proposed best adaptive -term methods of Galerkin and collocation approximations in energy norm by choosing the set of the most useful terms in these expansions. To derive a fully discrete approximation the best -term approximants are then approximated by finite element methods. Simlilar results have been received in [24] for Galerkin approximation in the lognormal case based on the conditions \big{(}j\|\psi_{j}\|_{W^{1}_{\infty}(D)}\big{)}_{j\in{\mathbb{N}}}\in\ell_{p}({\mathbb{N}}) for some . In these papers, they did not take into account support properties of the functions .
A different approach to studying summability that takes into account the support properties has been recently proposed in [2] for the affine case and [3] for the lognormal case. This approach leads to significant improvements on the results on -summability when the functions have limited overlap, such as splines, finite elements or wavelet bases. These results by themselve do not imply practical applications, because they do not cover the approximation of the expansion coefficients which are functions of the spatial variable.
In the recent paper [1], the rates of fully discrete adaptive best -term Taylor, Jacobi and Hermite polynomial approximations for elliptic PDEs with affine or lognornal parametrizations of the diffusion coefficients have been obtained based on combining a certain approximation property on the spatial domain, and extensions of the results on -summability of [2, 3] to higher-order Sobolev norms of corresponding Taylor, Jacobi and Hermite expansion coefficients. These results providing a benchmark for convergence rates, are not constructive. In the case when -summable sequences of Sobolev norms of expansion coefficients have an -summable majorant sequence, these convergence rates can be achieved by linear methods of gpc expansion and collocation approximations in the affine case [9, 14, 15, 16, 32, 33]. However, this non-adaptive approach is not applicable for the improvement of -summability in [2, 3, 1] since the weakened -assumption leads only to the -summability of expansion coefficients, but not to an -summable majorant sequence. Non-adaptive non-fully discrete methods have been considered in [18] for polynomial collocation approximation, and in [4] for weighted integration (see also [2, Remark 3.2] and [3, Remark 5.1] for briefly considering non-adaptive non-fully discrete approximations by truncated gpc expansions).
Let us briefly describe the main contribution of the present paper. By combining spatial and parametric aproximability, namely, the approximation property in Assumptions I in the spatial domain and weighted -summability of the and norms of Hermite polynomial expansion coefficients obtained in [3, 1], we investigate linear non-adaptive methods of fully discrete approximation by truncated Hermite gpc expansion and polynomial interpolation approximation as well as fully discrete weighted quadrature methods of integration for parametric and stochastic elliptic PDEs with lognormal inputs (1.3). We construct such methods and prove convergence rates of the approximations by them. We show that the convergence rate in terms of the dimension of the approximation space of adaptive fully discrete approximation by truncated Hermite gpc expansion obtained in [1], is achieved by linear non-adaptive methods of fully discrete approximation by truncated Hermite gpc expansion approximation. The linear non-adaptive methods of fully discrete polynomial interpolation approximation are sparse-grid collocation methods which are certain sums taken over finite nested Smolyak-type indices sets of tensor products of dyadic scale successive differences of spatial approximations of particular solvers, and of successive differences of their parametric Lagrange interpolating polynomials. The Smolyak-type sparse interpolation grids in the parametric domain are constructed from the roots of Hermite polynomials or their improved modifications. Moreover, these methods generate in a natural way fully discrete weighted quadrature formulas for integration of the solution and its linear functionals, and the error of the corresponding integration can be estimated via the error in the space norm of the generating methods where is the Gaussian probability measure on . The convergence rate of fully discrete integration is better than the convergence rate of the generating fully discrete polynomial interpolation approximation due to the simple but useful observation that the integral is zero if is an odd function and is the Gaussian probability measure on . (This property has been used in [32, 33, 34] for improving convergence rate of integration in the affine case.) We also briefly consider similar problems for parametric and stochastic elliptic PDEs with affine inputs (1.4) by using counterparts-results in [2, 1], and problems of non-fully discrete polynomial interpolation approximation and integration similar to those treated in [18] and [4]. In particular, the convergence rates of non-fully discrete interpolation approximation and integration in terms of number of the evaluation points obtained in this paper, are significantly better than those which have been proven in [18] and in [4].
Finally, let us notice that the aim of this paper is to establish approximation results which should show posibilities of non-adaptive approximation methods and convergence rates of approximation by such methods for the parametrized diffusion elliptic equation (1.2) with lognormal inputs. The two most popular numerical methods are Galerkin projection and collocation. Since in the lognormal case, the diffusion coefficient is not uniformly bounded in , there is no a well-posed linear variational problem on the space for Galerkin approximation. Some best -term Galerkin approximations with respect to a ”stronger” Gaussian measure were considered in [24]. Collocation methods will be discussed in a forthcoming paper which extends the results in the affine case [33, 34].
The paper is organized as follows. In Sections 2–4, we construct general linear fully discrete and non-fully discrete methods of Hermite gpc expansion and polynomial interpolation approximations in the Bochner space , and quadrature of functions taking values in and having a weighted -summability of Hermite expansion coefficients for Hilbert spaces and satisfying a certain “spatial” approximation property (see (2.3)). In particular, in Section 2, we prove convergence rates of general linear fully discrete methods of approximation approximation by truncated Hermite gpc expansion; in Section 3, we prove convergence rates of general linear fully discrete and non-fully discrete polynomial interpolation methods of approximation; in Section 4, we prove convergence rates of general linear fully discrete and non-fully discrete quadrature for integration. In Section 5, we apply the results of Sections 2–4 to obtain the main results of this paper on convergence rates of linear non-adaptive methods of fully discrete approximation by truncated Hermite gpc expansion, and fully discrete and non-fully discrete polynomial interpolation approximation and weighted quadrature methods of integration for parametric and stochastic elliptic PDEs with lognormal inputs. In Section 6, by extending the theory in Sections 2–4, we briefly consider similar problems for parametric and stochastic elliptic PDEs with affine inputs.
2 Linear approximation by truncated Hermite gpc expansion
In this section, we treat a general linear fully discrete approximation by truncated Hermite gpc series of functions from the Bochner space . The approximation error is measured in the Bochner space with . Here, and are Hilbert spaces, and is the infinite tensor product Gausian probability measure. We construct linear (non-adapptive) methods of this approximation and prove convergence rates for the approximation error.
We first recall a concept of infinite tensor product of probability measures. (For details see, e.g., [23, pp. 429–435].) Let be a probability measrure on , where is either or . We introduce the probability measure on as the infinite tensor product of probability measures :
[TABLE]
The sigma algebra for is generated by the set of cylinders , where are univariate -measurable sets and only a finite number of are different from . For such a set , we have . If is the density of , i.e., , then we write
[TABLE]
Let be a Hilbert space and . The probability measure induces the Bochner space of strongly -measurable mappings from to which are -summable. The (quasi-)norm in is defined by
[TABLE]
Notice that if is separable, is the tensor product of the Hilbert spaces and .
In the present paper, we focus our attention mainly to the lognormal case with and , the infinite tensor product Gaussian probability measure. Let be the probability measrure on with the standard Gaussian density:
[TABLE]
Then the infinite tensor product Gausian probability measure on can be defined by
[TABLE]
A powerful strategy for the approximation of functions in is based on the truncation of the Hermite gpc expansion
[TABLE]
Here is the set of all sequences of non-negative integers such that their support is a finite set, and
[TABLE]
with being the Hermite polynomials normalized according to It is well-known that is an orthonormal basis of . Moreover, for every represented by the series (2.2) it holds Parseval’s identity
[TABLE]
We make use of the abbreviations: ; for . We use letter to denote a general positive constant which may take different values, and a constant depending on .
To construct general linear fully discrete methods of approximation in the Bochner space and of integration of functions taking values in , we need the following assumption on approximation property for and , which is a generalization of Assumption I.
Assumption II The Hilbert space is a linear subspace of the Hilbert space and that . There are a sequence of subspaces of dimension , and a sequence of linear operators from into , and a number such that
[TABLE]
For , we define
[TABLE]
We can represent every by the series
[TABLE]
converging in and satisfying the estimate
[TABLE]
For a finite subset in , denote by the subspace in of all functions of the form
[TABLE]
Let Assumption II hold for Hilbert spaces and . We define the linear operator by
[TABLE]
for represented by the series
[TABLE]
Lemma 2.1
Let Assumption II hold for Hilbert spaces and . Then for every ,
[TABLE]
where .
Proof. Obviously, by the definition,
[TABLE]
From Parseval’s identity and (2.3) it follows that
[TABLE]
This means that . Hence, by Parseval’s identity and (2.3) we deduce that
[TABLE]
which proves the lemma.
Theorem 2.1
Let . Let Assumption II hold for Hilbert spaces and . Let be represented by the series (2.5). Assume that for there exist sequences of numbers strictly larger than such that
[TABLE]
and for some . Define for
[TABLE]
Then for each there exists a number such that and
[TABLE]
The rate corresponds to the approximation of a single function in as given by (2.3), and the rate is given by
[TABLE]
The constant in (2.8) is independent of and .
Proof. Due to the inequality , it is sufficient to prove the theorem for .
We first consider the case . Let be given and take arbitrary positive number . Since is finite, from the definition of and Lemma 2.1 it follows that there exists such that and
[TABLE]
By the triangle inequality,
[TABLE]
We have by Parseval’s identity and (2.4) that
[TABLE]
Hence, by the inequalities and we derive that
[TABLE]
Since is arbitrary, from the last estimates and (2.10) and (2.11) we derive that
[TABLE]
For the dimension of the space we have that
[TABLE]
where M:=2\big{\|}\big{(}\sigma_{2;{\boldsymbol{s}}}^{-1}\big{)}\big{\|}_{\ell_{q_{2}}({\mathbb{F}})}^{q_{2}}. For any , letting be a number satisfying the inequalities
[TABLE]
we derive that . On the other hand, from (2.14) it follows that This together with (2.12) proves that
[TABLE]
We now consider the case . Putting
[TABLE]
we get
[TABLE]
The norms in the right hand side can be estimated using Parseval’s identity and the hypothesis of the theorem. Thus, for the norm we have that
[TABLE]
For the norm , with we obtain
[TABLE]
These estimates yield that
[TABLE]
For the dimension of the space , with and we have that
[TABLE]
where M:=2\big{\|}\big{(}\sigma_{2;{\boldsymbol{s}}}^{-1}\big{)}\big{\|}_{\ell_{q_{2}}({\mathbb{F}})}^{q_{2}/q}\,\big{\|}\big{(}\sigma_{1;{\boldsymbol{s}}}^{-1}\big{)}\big{\|}_{\ell_{q_{1}}({\mathbb{F}})}^{q_{1}/q^{\prime}}. For any , letting be a number satisfying the inequalities
[TABLE]
we derive that . On the other hand, by (2.18),
[TABLE]
This together with (2.17) proves that
[TABLE]
By combining the last esimate and (2.15) we obtain (2.8).
Remark 2.1
Let us compare the non-adaptive fully discrete method constructed in Theorem 2.1 with adaptive one considered in [1, Theorem 3.1]. Both the methods give the same convergence rate . However, the ways to form them are different. Let us explain this.
In [1, Theorem 3.1] for the lognormal case, for a given , a preliminary polynomial approximation is taken by truncation of the Hermite gpc expansion (2.5), where is a set corresponding to largest . The coefficients then is approximated by , and is approximated by the resulting approximant . An optimal choice of \big{(}m_{\boldsymbol{s}}\big{)}_{{\boldsymbol{s}}\in\Lambda_{m}} give the rate in terms of where is the dimension of the space of all functions of the form , . This is an adaptive approximation method, since the choice of largest essentially depends of .
In Theorem 2.1, the approximant belongs to the space . The convergence rate of approximation by is given in terms of where the thresholding parameter is choosen such that . Notice that and the space consists of all functions of the form , , for a certain set depending on , i.e., formally they are similar to those in [1, Theorem 3.1]. The difference here is that the set is defined independently of . Hence, our approximation methods are non-adaptive provided that there is a sequence of linear operators from into -dimensional subspaces satisfying (2.3) for all (Assumption II). See also [1, Remark 3.2]. **
3 Polynomial interpolation approximation
In this section, we construct general linear fully discrete polynomial interpolation methods of approximation in the Bochner space of functions taking values in and having a weighted -summability of Hermite expansion coefficients for Hilbert spaces and satisfying a certain “spatial” approximation property. In particular, we prove convergence rates for these methods of approximation. We also briefly consider linear non-fully discrete polynomial interpolation methods of approximation.
3.1 Auxiliary results
Let , where is an even function on and is positive and increasing in , with limits [math] and at [math] and . Notice that for the standard Gaussian density defined in (2.1), is such a function. For , the th Mhaskar-Rakhmanov-Saff number is defined as the positive root of the equation
[TABLE]
From [25, Page 11] we have for ,
[TABLE]
For , we introduce the quantity
[TABLE]
Lemma 3.1
Let . Then there exists a positive constant such that for every polynomial of degree , the Nikol’skii-type inequality holds
[TABLE]
Proof. This lemma is an immediate consequence of (3.1) and the inequality
[TABLE]
which follows from [25, Theorem 9.1, p. 61], where
[TABLE]
Lemma 3.2
We have
[TABLE]
Proof. From Cramér’s bound (see, e.g., [17, Page 208, (19)]) we have for every and every , , where . This implies (3.2).
For our application the estimate (3.2) is sufficient, see [12] for an improvement.
For , we define the sequence
[TABLE]
Lemma 3.3
Let and be a Hilbert space. Let be represented by the series (2.2). Assume that there exists a sequence of positive numbers such that
[TABLE]
We have the following.
- (i)
If for some and , then for such that .
- (ii)
If for some , then the series (2.2) converges absulutely in to .
Proof. Since , with and by the Hölder inequality we have that
[TABLE]
This proves the assersion (i).
We have by the inequality and (i) for ,
[TABLE]
This yields that the series (2.2) absolutely converges in to , since by the assumption this series converges in to . The assertion (ii) is proven for the case . The case is derived from the case and the inequality .
Lemma 3.4
Let . Let Assumption II hold for Hilbert spaces and , and let the assumptions of Lemma 3.3(ii) hold for the space . Then every can be represented as the series
[TABLE]
converging absolutely in to .
Proof. This lemma can be proven in a way similar to the proof of [16, Lemma 2.1]. For completeness, let us give a detailed proof. As in the proof of Lemma 3.3, it is sufficient to prove the lemma for the case . Put . It is well known that the unconditional convergence in a Banach space follows from the absolute convergence. Using this fact, from Lemma 3.3(ii) and Assumption II we derive that on one hand, the series converges unconditionally in , and uniformly for , and on the other hand, the series converges absulutely in , and uniformly for to . Hence, since the series (2.5) converges unconditionally in , we have that
[TABLE]
where the last series converges unconditionally in . This means that the series in (3.4) converges absolutely to , since by Lemma 2.6 the sum converges in to when .
We will need the following two lemmata for application in estimating the convergence rate of the fully discrete polynomial interpolation approximation in this section and of integration in Section 4.
Lemma 3.5
Under the hypothesis of Theorem 2.1, assume in addition that . Define for
[TABLE]
where
[TABLE]
Then for each ,
[TABLE]
The rate is given by (2.3). The constant in (3.7) is independent of and .
Proof. Similarly to the proof of Lemma 3.3, it is sufficient to prove the lemma for . Since in the case , the formulas (2.7) and (3.5) define the same set for , from (2.12) follows the lemma for this case. Let us consider the case . Putting
[TABLE]
we get
[TABLE]
As in the proof of Lemma 3.4, by Lemma 3.3(ii) the series (2.2) converges unconditionally in to . Hence the norm can be estimated by
[TABLE]
For the norm , with and N=N(\xi,{\boldsymbol{s}}):=2^{\big{\lfloor}\log_{2}\big{(}\sigma_{2;{\boldsymbol{s}}}^{-1/\alpha^{*}}\xi^{\vartheta/\alpha^{*}}\big{)}\big{\rfloor}} we have
[TABLE]
With and , by the Hölder inequality we obtain
[TABLE]
Summing up, we find
[TABLE]
due to the equality . This, (3.8) and (3.9) prove the lemma for the case .
We make use the notation: . The following lemma can be proven in a similar way.
Lemma 3.6
Let . Let Assumption II hold for Hilbert spaces and . Let be represented by the series
[TABLE]
Assume that for there exist sequences of numbers strictly larger than such that
[TABLE]
and for some with . Define for ,
[TABLE]
where is as in (3.6). Then for each ,
[TABLE]
The rate is given by (2.3). The constant in (3.12) is independent of and .
3.2 Interpolation approximation
For every , let be a sequence of points in such that
[TABLE]
If is a function on taking value in a Hilbert space and , we define the function on taking value in by
[TABLE]
interpolating at , i.e., . Notice that for a function , the function is the Lagrange polynomial having degree , and that for every polynomial of degree .
Let
[TABLE]
be the Lebesgue constant, see, e.g., [25, Page 78]. We want to choose a sequence so that for some positive numbers and , there holds the inequlity
[TABLE]
We present two examples of satisfying (3.15). The first example is where are the strictly increasing sequences of the roots of . Indeed, it was proven by Matjila and Szabados [26, 27, 30] that
[TABLE]
for some positive constant independent of (with the obvious inequality ). Hence, for every , there exists a positive constant independent of such that
[TABLE]
The minimum distance between consecutive roots satisfies the inequalities see [31, pp. 130–131]. The sequences have been used in [4] for sparse quadrature for non-fully discrete integration with the measure , and in [18] non-fully disctere polynomial interpolation approximation with the measure .
The inequality (3.16) can be improved if is slightly modified by the “method of adding points” suggested by Szabados [30] (for details, see also [25, Section 11]). More precisely, for , he added to two points , near , which are defined by the condition . By this way, he obtained the strictly increasing sequences
[TABLE]
for which the sequence satisfies the inequality
[TABLE]
which yields that for every , there exists a positive constant independent of such that
[TABLE]
For a given sequence , we define the univariate operator for by
[TABLE]
with the convention , and the univariate operator for even by
[TABLE]
with the convention .
Lemma 3.7
Assume that is a sequence satisfying the condition (3.15) for some positive numbers and . Then for every , there exists a positive constant independent of such that for every function on ,
[TABLE]
whenever the norm in the right-hand side is finite.
Proof. From the assumptions we have that
[TABLE]
which simlilarly to (3.16) gives (3.17).
We are interested in sparse-grid interpolation approximation and integration of functions from the space . In order to have a correct definition of interpolation operator let us impose some neccessary restrictions on . Let be a -measurable subset in such that and contains all with , where denotes the number of nonzero components of . For a given and Hilbert space , we define as the subspace in of all elements such that the point value (of a representative of ) is well-defined for all . In what folllows, is fixed.
For , we introduce the tensor product operator for by
[TABLE]
where the univariate operator is applied to the univariate function by considering as a function of variable with the other variables held fixed. From the definition of one can see that the operators are well-defined for all .
Next, we introduce the interpolation operator for a given finite set by
[TABLE]
Let Assumption II hold for Hilbert spaces and . We introduce the interpolation operator for a given finite set by
[TABLE]
The interpolation operators for , for a finite set , and for a finite set , are defined in a similar way by replacing with , .
Notice that is a linear (non-adaptive) method of fully discrete polynomial interpolation approximation which is the sum taken over the indices set , of mixed tensor products of dyadic scale successive differences of “spatial” approximations to , and of successive differences of their parametric Lagrange interpolating polynomials. It has been introduced in [14] (see also [16]). A similar construction for the multi-index stochastic collocation method for computing the expected value of a functional of the solution to elliptic PDEs with random data has been introduced in [21, 22] by using Clenshaw-Curtis points for quadrature.
A set is called downward closed in (in ) if the inclusion yields the inclusion for every () such that . The inequality means that , . A sequence () is called increasing if for . Put and .
Theorem 3.1
Let . Let Assumption II hold for Hilbert spaces and . Assume that is a sequence satisfying the condition (3.15) for some positive numbers and . Let be represented by the series (2.5). Assume that for there exist increasing sequences of numbers strictly larger than such that
[TABLE]
and for some with , where
[TABLE]
, are as in Lemma 3.1, is arbitrary positive number and is as in Lemma 3.7. For , let be the set defined as in (3.5).
Then for each there exists a number such that for the intepolation operator , we have that and
[TABLE]
The rate corresponds to the approximation of a single function in as given by (2.3). The rate is given by
[TABLE]
The constant in (3.19) is independent of and .
Proof. Clearly, by the inequality it is sufficient to prove the theorem for . By Lemmata 3.3 and 3.4 the series (2.5) and (3.4) converge absolutely, and therefore, unconditionally in the Hilbert space to . We have that for every . Moreover, if is downward closed set in , then for every , and hence we can write
[TABLE]
Let us first consider the case . Let be given. For , put
[TABLE]
Observe that for all , and consequently, we have that
[TABLE]
Since the sequence is increasing, are downward closed sets in , and consequently, the sequence \big{\{}\Lambda_{k}\big{\}}_{k=0}^{k^{*}} is nested in the inverse order, i.e., if , and is the largest and . Therefore, from the unconditional convergence of the series (3.4) to , (3.22) and (3.21) we derive that
[TABLE]
This implies that
[TABLE]
Hence,
[TABLE]
Lemma 3.5 gives
[TABLE]
Let us estimate the sum in the right-hand side of (3.23). We have that
[TABLE]
We estimate the norm in the sum in the right-hand side. Assuming to be such that , we have . Since is a polynomial of degree in variable , from Lemma 3.1 we obtain that
[TABLE]
where , and is the constant in Lemma 3.1. Due to the assumption (3.15), we have by Lemmata 3.7 and 3.2 that
[TABLE]
and consequently,
[TABLE]
where
[TABLE]
Substituting \|\Delta^{{\rm I}}_{{\boldsymbol{s}}^{\prime}}(H_{\boldsymbol{s}})\big{\|}_{L_{2}({\mathbb{R}}^{\infty},\gamma)} in (3.25) with the right-hand side of (3.26) gives that
[TABLE]
where and are as in (3.27). Hence,
[TABLE]
where and are as in (3.18). Denote by the sum in the right-hand side of (3.23). By using (3.28) and (2.4) we estimate as
[TABLE]
By the inequalities and and the assumptions we have that
[TABLE]
Thus, we obtain the estimate
[TABLE]
This together with (3.23) and (3.24) implies that
[TABLE]
Hence, similarly to (2.13)–(2.15), for each we can find a number such that and
[TABLE]
We now consider the case . Observe that the unconditional convergence of the series (2.5) and the uniform boundedness of the operators in imply that
[TABLE]
and
[TABLE]
with convergence of the series in . Put \Lambda(\xi):=\big{\{}{\boldsymbol{s}}\in{\mathbb{F}}:\,\sigma_{1;{\boldsymbol{s}}}^{q_{1}}\leq\xi\big{\}} and B(\xi,{\boldsymbol{s}}):=\big{\{}k\in{\mathbb{N}}_{0}:\,2^{k}\leq\sigma_{2;{\boldsymbol{s}}}^{-(\alpha+1/2)^{-1}}\xi^{\vartheta(\alpha+1/2)^{-1}}\big{\}} for with as in (3.6). By using of these equalities and the uniconditional convergence of the series (2.5) and (3.4), with N(\xi,{\boldsymbol{s}}):=2^{\big{\lfloor}\log_{2}\big{(}\sigma_{2;{\boldsymbol{s}}}^{-(\alpha+1/2)^{-1}}\xi^{\vartheta(\alpha+1/2)^{-1}}\big{)}\big{\rfloor}} we derive the equalities
[TABLE]
Hence,
[TABLE]
Lemma 3.5 gives
[TABLE]
The sum in the right-hand side of (3.31) can be estimated by
[TABLE]
Similarly to (3.28), we have
[TABLE]
with the same and as in (3.18). This gives the estimate
[TABLE]
We have by the Hölder inequality and the hypothesis of the theorem,
[TABLE]
Combining (3.31)–(3.34) leads to the estimate
[TABLE]
For the dimension of the space , with and we have that
[TABLE]
where M:=2\big{\|}\big{(}\sigma_{2;{\boldsymbol{s}}}^{-1}\big{)}\big{\|}_{\ell_{q_{2}}({\mathbb{F}})}^{q_{2}/q}\,\big{\|}\big{(}\sigma_{1;{\boldsymbol{s}}}^{-1}\big{)}\big{\|}_{\ell_{q_{1}}({\mathbb{F}})}^{q_{1}/q^{\prime}}. For any , letting be a number satisfying the inequalities
[TABLE]
we derive that . On the other hand, by (3.36),
[TABLE]
This together with (3.35) proves that
[TABLE]
By combining the last esimate and (3.29) we derive (3.19).
Denote by and the set of interpolation points in the operators and , respectively. We have that and , where is the subset in of all such that is or [math] if , and is [math] if , and .
Remark 3.1
(i) Observe that the operator in Theorem 3.1 can be represented in the form of a multilevel approximation method with levels:
[TABLE]
where and for and ,
[TABLE]
Moreover, are downward closed sets, and consequently, the sequence \big{\{}\Lambda_{k}(\xi_{n})\big{\}}_{k=0}^{k_{n}} is nested in the inverse order, i.e., if , and is the largest and .
(ii) Theorem 3.1 is a non-apdaptive ”collocation” extension of [1, Theorem 3.1] for the lognormal case. The approximant belongs to the space . The convergence rate of the approximation by is given in terms of where the thresholding parameter is choosen such that . This rate is the same as the rate of the approximation by the truncated Hermite gpc expansion . The fully discrete polynomial interpolation approximation of by operators is based on the finite point-wise information in , more precisely, on of particular values of at the interpolation points and the approximations of , , by for . Moreover, we have that
[TABLE]
(iii) Under the assumptions of Theorem 3.1, by (3.30) we have that for every and every ,
[TABLE]
Theorem 3.2
Let . Let Assumption II hold for Hilbert spaces and . Let be represented by the series (3.10). Assume that is a sequence satisfying the condition (3.15) for some positive numbers and . Assume that for there exist increasing sequences of numbers strictly larger than such that
[TABLE]
and for some with , where and are as in (3.18). For , let be the set defined as in (3.11).
Then for each there exists a number such that for the operator , we have that and
[TABLE]
The rate corresponds to the approximation of a single function in as given by (2.3). The rate is given by (3.20). The constant in (3.37) is independent of and .
Proof. The proof of this theorem is similar to the proof of Theorem 3.1 with some modification. For example, all the indices sets are taken from the sets and instead and ; estimates similar to (3.24) and (3.32) are given by Lemma 3.6 instead Lemma 3.5.
Corollary 3.1
Let . Let be represented by the series (2.2) for a Hilbert space . Assume that is a sequence satisfying the condition (3.15) for some positive numbers and . Assume that there exists an increasing sequence of numbers strictly larger than such that
[TABLE]
and for some , where and are as in (3.18). For , define
[TABLE]
Then for each there exists a number such that and
[TABLE]
The constant in (3.39) is independent of and .
Proof. Similarly to the proof of Theorem 3.1 it is sufficient to prove (3.39) for . In the same way as in proving (3.31), we can show that
[TABLE]
where
[TABLE]
By estimating \big{\|}v-S_{\Lambda(\xi)}v\big{\|}_{{\mathcal{L}}_{2}(X^{1})} and \sum_{{\boldsymbol{s}}\not\in\Lambda(\xi)}\|v_{\boldsymbol{s}}\|_{X^{1}}\big{\|}I_{\Lambda(\xi)\cap R_{\boldsymbol{s}}}\,H_{\boldsymbol{s}}\big{\|}_{L_{2}({\mathbb{R}}^{\infty},\gamma)} similarly to (2.16) and (3.33)–(3.34), respectively, we derive
[TABLE]
Since , we have from the definition
[TABLE]
where by the assumption. For any , by choosing a number satisfying the inequalities , we derive (3.39).
Similarly to Corollary 3.1 we have the following
Corollary 3.2
Let be represented by the series (3.10) for a Hilbert space . Assume that is a sequence satisfying the condition (3.15) for some positive numbers and . Assume that there exists an increasing sequence of numbers strictly larger than such that
[TABLE]
and for some , where and are as in (3.18). For ,, define
[TABLE]
Then for each there exists a number such that and
[TABLE]
The constant in (3.42) is independent of and .
Remark 3.2
(i) Theorem 3.2 and Corollary 3.2 will be applied in proving the convergence rates of fully and non-fully discrete integration in the next section.
(ii) The bound has been obtained in [18, Theorem 3.14] for a Hilbert space , where is the set of corresponding to the largest elements of an -summable majorant of the sequence .
(iii) The operators and represent non-adaptive collocation methods of approximation of based on the particular values at the points in the grids and , respectively. Moreover, the sparsity of is much higher than that of : the generating set contains only even indices of . This remarkable property, in particular, plays an important role in improving the rate of quadrature of the solution to the parametrized elliptic PDEs with lognormal inputs (1.1), see Corollary 5.2 and its proof as well as Remark 5.4. **
4 Integration
In this section, we construct general linear fully discrete methods for integration of functions taking values in and having a weighted -summability of Hermite expansion coefficients for Hilbert spaces and satisfying a certain ”spatial” approximation property, and their bounded linear functionals. In particular, we give convergence rates for these methods of integration which are derived from results on convergence rate of polynomial interpolation approximation in in Theorem 3.2. We also briefly consider linear non-fully discrete methods for integration.
If is a function defined on taking values in a Hilbert space , the function in (3.14) generates the quadrature formula defined as
[TABLE]
where
[TABLE]
Notice that
[TABLE]
for every polynomial of degree , due to the identity .
For integration purpose, we additionally assume that the sequence as in (3.13) is symmetric for every , i. e., for . The sequences of the of the roots of the Hermite polynomilas and their modifications are symmetric. Also, for the sequence , it is well-known that
[TABLE]
For a given sequence , we define the univariate operator for even by
[TABLE]
with the convention .
For a function , we introduce the operator defined for by
[TABLE]
where the univariate operator is applied to the univariate function by considering as a function of variable with the other variables held fixed. As , the operators are well-defined for all . For a finite set , we introduce the quadrature operator which is generated by the interpolation operator as follows
[TABLE]
Further, if is a bounded linear functional on , denote by the value of in . For a finite set , the quadrature formula generates the quadrature formula for integration of by
[TABLE]
Let Assumption II hold for Hilbert spaces and , and . For a finite set , we introduce the quadrature operator which is generated by the interpolation operator , and which is defined for by
[TABLE]
Further, if is a bounded linear functional on , for a finite set , the quadrature formula generates the quadrature formula for integration of by
[TABLE]
For a function and is represented by the series (2.2), consider the function defined by
[TABLE]
Notice that
[TABLE]
Moreover, if is symmetric for every ,
[TABLE]
Theorem 4.1
Under the hypothesis of Theorem 3.1, assume additionally that the sequences , , are symmetric. For , let be the set defined as in (3.11). Then we have the following.
- (i)
For each there exists a number such that and
[TABLE]
- (ii)
Let be a bounded linear functional on . Then for each there exists a number such that and
[TABLE]
The rate corresponds to the approximation of a single function in as given by (2.3). The rate is given by (3.20). The constants in (4.4) and (4.5) are independent of and .
Proof. For a given , we approximate the integral in the right-hand side of (4.2) by where is as in Theorem 3.2. By Lemmata 3.3 and 3.4 the series (2.5) and (3.4) converge absolutely, and therefore, unconditionally in the Hilbert space to . Hence, by (4.3) we derive that . Due to (4.1) and (4.2) there holds the equality
[TABLE]
Hence, applying (3.37) in Theorem 3.2 for , we obtain (i):
[TABLE]
For a given , we approximate the integral by where is as in Corollary 3.2. Similarly to (4.6), there holds the equality
[TABLE]
Hence, applying (3.37) in Theorem 3.2 for , we prove (ii):
[TABLE]
Similarly to the proof of Theorem 4.1, applying (3.42) in Corollary 3.2 for , we can derive the following
Corollary 4.1
Under the hypothesis of Corollary 3.1, assume additionally that the sequences , , are symmetric. For , let be the set defined as in (3.41).Then we have the following.
- (i)
For each there exists a number such that and
[TABLE]
- (ii)
Let be a bounded linear functional on . Then for each there exists a number such that and
[TABLE]
The constants in (4.7) and (4.8) are independent of and .
There is another way to construct quadrature operators which perform the same convergence rates as in (4.4), (4.5) and (4.7), (4.8). We brifefly consider it. For a given sequence , we define the univariate operator for by
[TABLE]
with the convention .
The operators for , for a finite set , and for a finite set , are defined in similar way as the operators , and , respectively, by replacing with , .
Theorem 4.2
Under the hypothesis of Theorem 3.1, assume additionally that the sequences , , are symmetric. Define for
[TABLE]
Then we have the following.
- (i)
For each there exists a number such that and
[TABLE]
- (ii)
Let be a bounded linear functional on . Then for each there exists a number such that and
[TABLE]
The rate corresponds to the approximation of a single function in as given by (2.3). The rate is given by (3.20). The constants in (4.10) and (4.11) are independent of and .
Corollary 4.2
Under the hypothesis of Corollary 3.1, assume additionally that the sequences , , are symmetric. For , define
[TABLE]
Then we have the following.
- (i)
For each there exists a number such that and
[TABLE]
- (ii)
Let be a bounded linear functional on . Then for each there exists a number such that and
[TABLE]
The constants in (4.13) and (4.14) are independent of and .
Theorem 4.2 and Corollary 4.2 can be proven in a similar manner as Theorem 4.1 and Corollary 4.1 with a modification.
5 Elliptic PDEs with lognormal inputs
In this section, we apply the results in Sections 2–4 to Hermite gpc expansion and polynomial interpolation approximations as well as integration for the parametrized diffusion elliptic equation (1.2) with lognormal inputs (1.3).
We approximate the solusion to this equation by truncation of the Hermite series
[TABLE]
For convenience, we introduce the conventions: ; ; ; . Constructions of fully discrete approximations and integration are based on the approximation property (1.5) in Assumption I and the weighted -summability of the series , in the following lemma which has been proven in [3] for and in [1] for .
Lemma 5.1
Let . Assume that the right side in (1.1) belongs to , that the domain has smoothness, that all functions belong to . Assume that there exist a number and a sequence of positive numbers such that and
[TABLE]
Then we have that for any ,
[TABLE]
We need two auxiliary lemmata.
Lemma 5.2
Let the assumptions of Lemma 5.1 hold for the space with . Then the solution map is -measurable and . Moreover, where
[TABLE]
having and containing all with .
Proof. The proof of this lemma already is in [3]. Indeed, under the assumptions of Lemma 5.1 for the space with , by [3, Remark 2.5] Assumption A in [3, Page 349] holds for the sequence . Hence, by [3, Corollary 2.3] the solution map is -measurable and . Moreover, [3, (2.23)] and, obviously, contains all with . For a point , by the Lax-Milgram lemma the solution is well-defined if . This inclusion holds true if [3, (2.26)]. This means that .
We make use the following notation: for ,
[TABLE]
The set has been introduced in [34]. The set plays an important role in establishing improved convergence rates for sparse-grid Smolyak quadrature in [33, 34].
The following lemma is a generalization of [3, Lemma 5.1].
Lemma 5.3
Let , , of positive numbers such the sequence belongs to . Let be arbitrary positive numbers and the sequence given in (3.3). Let for numbers the sequence be defined by
[TABLE]
Then for any , we have
[TABLE]
Proof. With , we have that
[TABLE]
and
[TABLE]
We estimate and . We have
[TABLE]
From the inequalities and we derive that
[TABLE]
Summing up we obtain that
[TABLE]
Since the sequence belongs to , there exists large enough such that for all . Hence, there exists a constant independent of such that for all , and consequently,
[TABLE]
In the present paper, as noticed in Introduction we want to show posibilities of non-adaptive approximation methods and convergence rates of approximation by such methods for the parametrized diffusion elliptic equation (1.2) with lognormal inputs. Here we do not consider Galerkin approximations. To treat fully discrete approximations we assume that and that it holds the approximation property (1.5) in Assumption I for all , see, for instance, [8, Theorem 3.2.1] for the case when is a polygonal set. Notice that classical error estimates yield the convergence rate by using Lagrange finite elements of order at least on quasi-uniform partitions. Also, the spaces do not always coincide with . For example, for , we know that is strictly larger than when is a polygon with re-entrant corner. In this case, it is well known that the optimal rate is yet attained, when using spaces associated to meshes with proper refinement near the re-entrant corners where the functions might have singularities.
Theorem 5.1
Let . Let Assumption I hold. Let the assumptions of Lemma 5.1 hold for the spaces and with some . For , let be the set defined by (2.7) for as in (5.1), .
Then for each there exists a number such that and
[TABLE]
The rate corresponds to the spatial approximation of a single function in as given by (1.5), and the rate is given by (2.9). The constant in (5.2) is independent of and .
Proof. To prove the theorem it is sufficient to notice that the assumptions of Theorem 2.1 are satisfied for and . This can be done by using Lemmata 5.1 – 5.3. (By multiplying the sequences in Lemma 5.1 with a positive constant we can get for .)
Remark 5.1
(i) The rate in (5.2) is the rate of best adaptive -term Hermite gpc expansion approximation in based on -summability of and -summability of proven in [1], where for .
(ii) Observe that can be represented in the form of a multilevel approximation method with levels:
[TABLE]
where for , and for and ,
[TABLE]
Remark 5.2
Since the index set defined as in (2.7) plays a key role in determining the operator , we give an algorithm for constructing it, for instance, for the case . The case can be done similarly. We additionally assume that the sequences , , are monotonically increasing. This assumption yields that if and are such that , than , , where . Observe that
[TABLE]
where k_{\xi}:=\big{\lfloor}\frac{1}{\alpha q_{1}}\log_{2}\xi\big{\rfloor} and is defined as in (5.3), . Moreover, are downward closed sets, and consequently, the sequence \big{\{}\Lambda_{k}(\xi)\big{\}}_{k=0}^{k_{\xi}} is nested in the inverse order, i.e., if , and is the largest and is the smallest. Hence, the index set can be constructed as in Algorithm 1. **
Let us estimate the computational complexity of Algorithm 1, by using some results from [32, Lemmata 3.1.12 and 3.1.13]. Each from 1st to 5th lines and 10th to 21st lines in this algorithm is executed at most times. For every multiindex we store . Each multiindex therefore occupies a memory of size , where . Assuming elementary operations such as multiplications and divisions to be of complexity , we can deduce that the computational complexity executing each from 1st to 5th lines and 10th to 21st lines in Algorithm 1 is bounded by , where . Algorithm 1 terminates and gives before . Hence the overall computational complexity and memory consumption of Algorithm 1 behave like
[TABLE]
In the last step we used the equality which follows from the inequality (cf. (3.40)). **
We now consider the problem of sparse-grid interpolation approximation and intergration of the solution to the parametrized diffusion elliptic equation (1.2) with lognormal inputs. By using Lemmata 5.1 – 5.3, in the same way as the proof of Theorem 5.1, from Theorems 2.1 and 3.1 and Corollary 3.1 we derive the following two theorems and two corollaries.
Theorem 5.2
Let . Let Assumption I hold. Let the assumptions of Lemma 5.1 hold for the spaces and with some with . Assume that is a sequence satisfying the condition (3.15) for some positive numbers and . For , let be the set defined by (3.5) for as in (5.1), .
Then for each there exists a number such that for the interpolation operator , we have that and
[TABLE]
The rate corresponds to the spatial approximation of a single function in as given by (1.5). The rate is given by (3.20). The constant in (5.4) is independent of and .
Remark 5.3
(i) Observe that can be represented in the form of a multilevel approximation method, see Remarks 3.1(i) for details.
(ii) The fully discrete polynomial interpolation approximation by operators is a collocation approximation based on the finite number of the particular solvers , , where, we recall, and ( denotes the subset in of all such that is or [math] if , and is [math] if , and .) **
Corollary 5.1
Let . Under the hypothesis of Lemma 5.1 for the spaces with some . For , let be the set defined by (3.38) for as in (5.1). Then for each there exists a number such that and
[TABLE]
The constant in (5.5) is independent of and .
The rate in Corollary 5.1 is much better than the rate which hase been obtained in [18, Theorem 3.18] for a similar approximation in .
Similarly to , the approximation to by the operator , is a collocation approximation based on the finite number of the particular solvers , .
Theorem 5.3
Let Assumption I hold. Let the assumptions of Lemma 5.1 hold for the spaces and with some with . Assume that is a sequence satisfying the condition (3.15) for some positive numbers and , and such that is summetric for every . For , let be the set defined by (3.11) for as in (5.1), . Then we have the following.
- (i)
For each there exists a number such that and
[TABLE]
- (ii)
Let be a bounded linear functional on . Then for each there exists a number such that and
[TABLE]
The rate corresponds to the spatial approximation of a single function in as given by (1.5). The rate is given by
[TABLE]
The constants in (5.6) and (5.7) are independent of and .
Proof. Observe that . From Lemma 5.1 and Lemma 5.3 we can see that the assumptions of Theorem 3.1 hold for and with and . Hence, by applying Theorem 4.1 we prove the theorem.
Observe that the rate in (5.6) and (5.7) can be improved as if the sequences and have - and -summable majorant sequences, respectively, where and . Similarly to , the quadrature operator can be represented in the form of a multilevel integration method with levels:
[TABLE]
where and for and ,
[TABLE]
In the same way, from Corollary 4.1 we derive the following
Corollary 5.2
Let the assumptions of Lemma 5.1 hold for the spaces with some . Assume that is a sequence satisfying the condition (3.15) for some positive numbers and , and such that is summetric for every . For , let be the set defined by (3.41) for as in (5.1). Then we have the following.
- (i)
For each there exists a number such that and
[TABLE]
- (ii)
Let a bounded linear functional on . For each there exists a number such that and
[TABLE]
The constants in (5.8) and (5.9) are independent of and .
In a similar way, from Theorem 4.2 and Corollary 4.2 we obtain
Theorem 5.4
Let Assumption I hold. Let the assumptions of Lemma 5.1 hold for the spaces and with some with . Assume that is a sequence satisfying the condition (3.15) for some positive numbers and , and such that is summetric for every . For , let be the set defined as in (4.9) for as in (5.1), . Then we have the following.
- (i)
For each there exists a number such that and
[TABLE]
- (ii)
Let be a bounded linear functional on . Then for each there exists a number such that and
[TABLE]
The rate corresponds to the spatial approximation of a single function in as given by (1.5). The rate is given by
[TABLE]
The constants in (5.10) and (5.11) are independent of and .
Corollary 5.3
Let the assumptions of Lemma 5.1 hold for the spaces with some . Assume that is a sequence satisfying the condition (3.15) for some positive numbers and , and such that is summetric for every . For , let be the set defined by (4.12) for as in (5.1). Then we have the following.
- (i)
For each there exists a number such that and
[TABLE]
- (ii)
Let a bounded linear functional on . For each there exists a number such that and
[TABLE]
The constants in (5.12) and (5.13) are independent of and .
Remark 5.4
(i) As noticed in Section 4, the sparsity of the grids and of the evaluation points in the quadrature operators and are much higher than the sparsity of the grids and of the evaluation points in the generating interpolation operators and .
(ii) The rate in Corollary 5.2 is a significant improvement of the rate which has been recently obtained in [4, Corllary 3.12].
(iii) Since the use and analysis of non-adaptive construction methods for sparse-grid interpolation are important, let us compare in details our methods in Corollary 5.2 with those which has been also discussed in [4]. To construct a quadrature of the form , the author of the last work used the set of all indices (including non-even) corresponding to the smallest values of . The number of quadrature points in is estimated as [18, Proposition 3.16]. This lead to the rate . In the present paper, we used the set of all only even indices by thresholding . Formally, this is similar to choosing all even indices corresponding to the smallest values of satisfying . Then for a given , we selected a number such that the number of quadrature points in the grid does not exceed . Hence, due to the evenness of the indices in the set we obtained the improved rate and that the sparsity of is much higher then that of . **
6 Elliptic PDEs with affine inputs
The theory of non-addaptive approximation and integration of functions in Bochner spaces with infinite tensor product Gaussian measure in Sections 2–4 can be generalized and extended to other situations. In this section, we present some results on similar problems for the parametrized diffusion elliptic equation (1.2) with the affine inputs (1.4).
In the affine case, for given , we consider the orthogonal Jacobi expansion of the solution of the form
[TABLE]
where
[TABLE]
[TABLE]
and is the sequence of Jacobi polynomials on normalized with respect to the Jacobi probability measure One has the Rodrigues’ formula
[TABLE]
where and
[TABLE]
Examples corresponding to the values is the family of the Legendre polynomials, and to the values the family of the Chebyshev polynomials.
We introduce the space for with the convention . This space is equipped with the norm , and coincides with the Sobolev space with equivalent norms if the domain has smoothness, see [19, Theorem 2.5.1.1]. The following lemma has been proven in [2] for and in [1] for .
Lemma 6.1
For a given , assume that is such that , and that there exists a sequence of positive numbers such that
[TABLE]
Assume that the right side in (1.1) belongs to , that the domain has smoothness, that and all functions belong to and that
[TABLE]
Then
[TABLE]
Lemma 6.2
Let , of numbers larger than 1 such the sequence belongs to , is a sequence of the form (3.3) with arbitrary nonnegative . Then for every , we have
[TABLE]
Proof. We have
[TABLE]
Since of numbers larger than one, and such the sequens belongs to , we have . Hence, there exists a constant independent of such that
[TABLE]
and consequently,
[TABLE]
We assume that there holds the following approximation property for and with .
Assumption III There are a sequence of subspaces of dimension , and a sequence of linear operators from into , and a number such that
[TABLE]
In this section, we make use the abbreviations: and and assume that . From Lemmata 6.1 and 6.2 we can prove the following results on non-adaptive fully and non-fully discrete Jacobi gpc expansion and polynomial interpolation approximations and integration for the affine case.
Theorem 6.1
Let . Let Assumption III hold. Let the assumptions of Lemma 6.1 hold for the spaces and with some . For , let be the set defined by (2.7) for and as in (6.1). Then for each there exists a number such that and
[TABLE]
The rate corresponds to the spatial approximation of a single function in as given by (6.2), and the rate is given by (2.9). The constant in (6.3) is independent of and .
The rate in (6.3) is the same rate of fully discrete best adaptive -term approximation in based on -summability of and -summability of proven in [1], where and . This rate can be achieved by linear fully discrete non-adaptive approximation when and have -summable and -summable majorant sequences, respectively [33].
Theorem 6.2
Let . Let Assumption III hold. Let the assumptions of Lemma 6.1 hold for the spaces and with some with . For , let be the set defined by in (3.5) for and as in (6.1). Then for each there exists a number such that and
[TABLE]
The rate corresponds to the spatial approximation of a single function in as given by (6.2). The rate is given by (3.20) The constant in (6.4) is independent of and .
For polynomial interpolation approximation and integration, we keep all definitions and notations in Section 3 with a proper modification for the affine case. For example, for univariate interpolation and integration we take a sequence of points in such that
[TABLE]
Sequences of points satisfying the inequality (3.15), are the symmetric sequences of the Chebyshev points, the symmetric sequences of the Gauss-Lobatto (Clenshaw-Curtis) points and the nested sequence of the -Leja points, see [9] for details.
Theorem 6.3
Let . Let Assumption III hold. Let the assumptions of Lemma 6.1 hold for the spaces and with some with . Assume that is a sequence satisfying the condition (3.15) for some positive numbers and . For , let be the set defined by (3.5) for and as in (6.1). Then for each there exists a number such that for the operator , we have that and
[TABLE]
The rate corresponds to the spatial approximation of a single function in as given by (6.2). The rate is given by (3.20). The constant in (6.5) is independent of and .
The rates in (6.3)–(6.5) for some non-adaptive approximations have been proven in the case when and have -summable and -summable majorant sequences, respectively, which are derived from the analyticity of the solution , where and , see [33].
Theorem 6.4
Let Assumption III hold. Let for the Jacobi probability measure , and the assumptions of Lemma 6.1 hold for the spaces and with some with . Assume that is a sequence satisfying the condition (3.15) for some positive numbers and , and such that is summetric for every . For , let be the set defined by (3.11) for and as in (6.1). Then for the quadrature operator generated by the interpolation operator , we have the following.
- (i)
For each there exists a number such that and
[TABLE]
- (ii)
Let be a bounded linear functional on . For each there exists a number such that and
[TABLE]
The rate corresponds to the spatial approximation of a single function in as given by (6.2). The rate is given by
[TABLE]
The constants in (6.6) and (6.7) are independent of and .
The rate in (6.6)–(6.7) can be improved as if and have - and -summable majorant sequences, respectively, where and , see [33].
Corollary 6.1
Let for the Jacobi probability measure , and the assumptions of Lemma 6.1 hold for the spaces with some . Assume that is a sequence satisfying the condition (3.15) for some positive numbers and , and such that is symmetric for every . For , let be the set defined by (3.41) for as in (6.1). Then we have the following.
- (i)
For each there exists a number such that and
[TABLE]
- (ii)
Let be a bounded linear functional on . For each there exists a number such that and
[TABLE]
The constants in (6.8) and (6.9) are independent of and .
The rate in (6.8) in Corollary 6.1 improves the rate with arbitrary , which hase been obtained in [34, Corollary 3.13].
We can also prove counterparts of Theorem 5.4 and Corollary 5.3 for the parametrized diffusion elliptic equation (1.2) with the affine inputs (1.4).
Acknowledgments. This work is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under Grant No. 102.01-2020.03. It was partially supported by a grant from the Simon Foundation and EPSRC Grant Number EP/R014604/1. The author would like to thank the Isaac Newton Institute for Mathematical Sciences for partial support and hospitality during the programme Approximation, sampling and compression in data science when work on this paper was partially undertaken. He is grateful to the referees for their comments and suggestions which helped him to tremendously improve the presentation of the paper. He expresses special thanks to Christoph Schwab, Nguyen Van Kien and Jacob Zech for valuable remarks, comments and suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Bachmayr, A. Cohen, D. Dũng and C. Schwab, Fully discrete approximation of parametric and stochastic elliptic PD Es, SIAM J. Numer. Anal. 55 (2017), 2151-2186.
- 2[2] M. Bachmayr, A. Cohen, and G. Migliorati, Sparse polynomial approximation of parametric elliptic PD Es. Part I: affine coefficients, ESAIM Math. Model. Numer. Anal. 51 (2017), 321-339.
- 3[3] M. Bachmayr, A. Cohen, R. De Vore and G. Migliorati, Sparse polynomial approximation of parametric elliptic PD Es. Part II: lognormal coefficients, ESAIM Math. Model. Numer. Anal. 51 (2017), 341-363.
- 4[4] P. Chen, Sparse quadrature for high-dimensional integration with Gaussian measure. ESAIM Math. Model. Numer. Anal. 52 (2018), 631-657.
- 5[5] A. Chkifa, A. Cohen and C. Schwab, Breaking the curse of dimensionality in sparse polynomial approximation of parametric PD Es, Journal de Mathématiques Pures et Appliquées 103 (2)(2015), 400-428.
- 6[6] A. Chkifa, A. Cohen, R. De Vore, Ch. Schwab, Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PD Es, ESAIM Math. Model. Numer. Anal. 47 (1)(2013), 253-280.
- 7[7] A. Chkifa, A. Cohen, and C. Schwab. High-dimensional adaptive sparse polynomial interpolation and applications to parametric PD Es. Found. Comp. Math 14 (2014), 601-633.
- 8[8] P. Ciarlet, The Finite Element Method for Elliptic Problems , North Holland Publ., 1978.
