WorksMathematics
Polytopic symmetric interior-penalty approximation of elliptic SPDEs driven by spatial white noise
Abstract
We analyse symmetric interior-penalty discontinuous Galerkin approximations of elliptic stochastic partial differential equations driven by spatial Gaussian white noise on quasi-uniform polytopic meshes. The low regularity of the exact random field precludes the usual SIP consistency argument. We instead restrict the same continuum white-noise functional canonically to the discontinuous polynomial space and separate the error into stochastic forcing-restriction and deterministic discretisation components. For every fixed polynomial degree , we prove the sharp two-sided estimate giving rates in two dimensions and in three dimensions. A finite-dimensional lower bound establishes optimality. The analysis allows polytopic elements with arbitrarily many and arbitrarily small faces, including admissible non-convex elements. In two dimensions we also treat polygons with a single reentrant corner. Although the deterministic approximation exhibits an angle-dependent loss of regularity, the singular resolvent contribution is finite rank, and the sharp first-order stochastic rate is retained. The discontinuous structure yields an exact element-local sampler for the restricted white noise. Numerical experiments on irregular polygonal, non-convex polytopic and reentrant domains support the predicted convergence behaviour.
Introduction
Spatial Gaussian white noise is a canonical model for irregular random forcing and a fundamental ingredient in stochastic partial differential equation representations of Gaussian random fields. The connection between Matérn fields and elliptic SPDEs goes back to Whittle and Matérn and underpins the now standard SPDE approach to spatial statistics [27, 25, 24, 22].
We consider the representative problem
where denotes spatial Gaussian white noise. The aim is to approximate by the classical symmetric interior-penalty discontinuous Galerkin method on general polytopic meshes, while retaining the original continuum white noise rather than replacing it by an independently regularised forcing.
Numerical approximation of SPDEs with additive or white-noise forcing has a substantial history. Early finite-element, finite-difference and lattice analyses include [1, 17, 20]. For conforming finite element methods, strong and weak convergence, fractional elliptic SPDEs and finite-dimensional representations of the driving noise have subsequently been studied in [28, 29, 2, 9, 3]. In particular, sharp strong rates of order are known for conforming approximations of elliptic problems driven by spatial white noise [29, 9, 3]. Related operator and Hilbert–Schmidt formulations for Whittle–Matérn fields are developed in [11].
The representation and coupling of the Gaussian forcing form a separate computational question. Mass-matrix constructions for finite element white noise and multilevel couplings, including couplings between non-nested meshes, are developed in [12, 19, 6].
The principal analytical difficulty in (1) is the low spatial regularity of its solution. White noise has regularity below , and the elliptic resolvent gives, in the regular case,
Thus, in both dimensions considered here, the exact field need not belong to and the usual energy-space formulation is not the natural starting point. Instead, the SPDE is defined through the elliptic resolvent acting on an isonormal Gaussian process [2, 3, 23].
This lack of regularity is particularly relevant for an interior penalty method. Classical SIP consistency is usually expressed by inserting the exact solution into a broken bilinear form containing elementwise gradients and normal traces. Such quantities need not be defined for . Rather than assigning a DG differential structure to the rough random field, we avoid this step completely. We first restrict to the discontinuous polynomial space and solve the corresponding continuum elliptic problem. This produces the decomposition
in which the first term measures only restriction of the stochastic forcing, while the second is an ordinary deterministic SIP error with an right-hand side. The stochastic and deterministic parts can therefore be analysed using the tools appropriate to each.
DG discretisations of white-noise-driven problems have previously been considered in more structured settings. Existing analyses include LDG approximation of elliptic SPDEs in two and three dimensions with piecewise-constant regularisations of white noise on Cartesian meshes, where the stochastic error is controlled through spatial increments of the Green function [28], as well as finite element and DG approximations of white-noise-driven Helmholtz and scattering problems [14, 15]. Here we use the classical SIP method on general polytopic meshes, couple every discretisation to the same continuum white-noise functional, and seek sharp strong convergence rates without introducing a separate regularisation of the driving noise.
Our first main result establishes the sharp strong convergence rate
for fixed polynomial degree on quasi-uniform polytopic meshes. A matching finite-dimensional lower bound shows that these rates are optimal for approximation spaces of comparable dimension.
Our second main result extends the analysis in two dimensions to polytopic domains with a single reentrant corner. Although the deterministic SIP approximation reflects the associated loss of elliptic regularity, we prove that the stochastic approximation retains the sharp first-order rate
The proof exploits the finite-dimensional structure of the corner singularity and shows that it does not alter the leading stochastic approximation error.
The analysis is carried out on general polytopic meshes. Elements are uniformly star-shaped with respect to a ball in their kernel, but may have arbitrarily many and arbitrarily small faces and may be non-convex. The resulting estimates are uniform with respect to the number and relative sizes of the faces [4, 8, 5, 6].
A further computational consequence of the discontinuous formulation is that the canonical restricted white-noise load can be sampled exactly from independent element-local Gaussian vectors. The same construction gives exact couplings across agglomerated mesh hierarchies and is also used in the multilevel Monte-Carlo study [10].
The numerical experiments examine each of these features. Direct continuum-error calculations on regular two- and three-dimensional domains test the rates in (2) across several polytopic mesh families. On reentrant domains, a corner-angle sweep tests the robustness of the first-order stochastic rate in (3) with respect to the strength of the corner singularity.
The remainder of the paper is organised as follows. Section 2 introduces the white-noise-driven elliptic problem and its spectral representation. Section 3 develops the polytopic SIP discretisation, the canonical white-noise restriction and the sharp strong convergence theory. Section 4 treats the reentrant-corner case. Section 5 presents the numerical experiments.
Problem setup
Let , , be a bounded polytopic Lipschitz domain, and let be a complete probability space. We write for the usual Bochner spaces and denote expectation by .
For , define
and let be the positive self-adjoint operator in associated with . Thus, is the Dirichlet realisation of . We consider the white-noise-driven problem
The principal analysis is developed under the following deterministic regularity assumption.
Assumption 2.1 (Elliptic regularity). The Dirichlet realisation of satisfies
and
Assumption 2.1 holds, in particular, on bounded convex polytopic domain. The analysis uses (7) directly rather than convexity. Note in §4 we replace this assumption by an explicit corner-singularity decomposition on reentrant polygons.
Since is bounded, is compact. Consequently, admits an -orthonormal eigensystem satisfying
By Weyl’s law, there exist constants such that
For , let be the Hilbert space
equipped with the norm
In particular, and with equivalent norms. Under Assumption 2.1, interpolation yields
Spatial white noise and the elliptic solution
We regard as an isonormal Gaussian process over . It is a centred Gaussian linear mapping satisfying
In particular,
are independent standard Gaussian random variables. The solution of (5) is defined spectrally by
Theorem 2.3 (Regularity of the white-noise solution). Let and suppose that the eigenvalues of satisfy (9). Then the series (15) converges in and defines the unique -valued solution of (5) in the resolvent sense. Moreover,
whereas
If Assumption 2.1 also holds, then
Thus the available Sobolev regularity is in two dimensions and in three dimensions.
Proof. This is the case and eigenvalue-growth exponent of [3], Proposition 2.3 and Remark 2.4. Indeed, for every ,
By (9), this series has the same convergence behaviour as , and is therefore finite precisely when . The choice gives convergence in , while gives the critical logarithmic divergence. Finally, (18) follows from (12). □
Polytopic symmetric interior-penalty discretisation
The convergence analysis separates restriction of the stochastic forcing from approximation of the elliptic resolvent. Let be the canonical restriction of spatial white noise to a finite element space , defined below, and let solve . Then
The first term measures restriction of the white noise, while the second is a deterministic SIP error with an right-hand side.
Polytopic meshes and discrete spaces
Let be a partition of into non-overlapping open polytopes satisfying
For , let and set
Let be the set of open -dimensional mesh faces. For , fix a unit normal pointing from to ; on boundary faces, is the outward unit normal. We use the face scale
For a piecewise scalar field , define on interior faces
and set and on boundary faces. Averages of vector fields are taken componentwise.
3.2. Assumption (Polytopic mesh regularity). There exists , independent of , such that every contains a ball in its kernel satisfying
Equivalently,
Moreover, the mesh family is quasi-uniform in that there exists , independent of , such that
Assumption 3.2 implies
with constants depending only on and . It also implies the geometric condition required by [4], Lemma 2.2. Indeed, triangulating each face and joining the resulting -simplices to gives
Hence condition (7) of [4] holds uniformly. In particular, no uniform lower bound is required on the size of an individual face, and the number of faces per element may be arbitrarily large.
The quasi-uniformity condition (27) is actually not needed for the local estimates below; it will be used subsequently to pass from local mesh scales to and to obtain .
Introduce the broken Sobolev space
with broken gradient
3.3. Lemma (Trace, inverse and approximation estimates). Under the first part of Assumption 3.2.
For every fixed polynomial degree ,
for all . Consequently,
Let be the elementwise -orthogonal projection, defined by
Then, for every ,
Consequently,
All hidden constants are independent of the number and relative sizes of the faces.
Proof. By (29), the mesh condition of [4], Section 2.2, holds uniformly. Taking in [4], Lemma 2.2 gives
Young’s inequality with the scale yields (32).
The polynomial inverse and approximation estimates on uniformly star-shaped polytopes are standard; see, for example, [8]; [5]; [6]. Combining (32) with (33) gives (34). Moreover,
so (35) follows immediately.
For (36), choose a polynomial satisfying the standard approximation estimates. The best-approximation property of , followed by the polynomial inverse estimate applied to , gives the three volume estimates. Applying (32) first to and then to each component of gives the two boundary estimates. Summing the local estimate and using (27) proves (37).
For fixed , define
By (28), (27) and the fixed polynomial degree,
SIP form and discrete operator
Introduce the broken vector-polynomial space
The lifting is defined by
By (35),
For , set
The SIP form is
Since , the two consistency terms in (44) may equivalently be represented through the lifting. For example,
Thus the lifting estimate (42) controls the face terms without any dependence on the number or relative sizes of the faces.
For , define
3.5. Lemma (SIP stability). For sufficiently large,
for all , with constants independent of and of the number and relative sizes of the element faces.
Proof. Represent the consistency terms through and apply (42). Cauchy–Schwarz and Young’s inequality then give coercivity for sufficiently large and continuity in the DG norm. □
Define by
Lemma 3.5 shows that is symmetric positive definite.
Deterministic resolvent approximation
For the consistency analysis under Assumption 2.1, set
For , let be given by the right-hand side of (44), with replaced by . The face terms are well-defined by the trace regularity, and the restriction of to is precisely .
Set
Cauchy–Schwarz gives
Moreover, Lemma 3.3 implies
Lemma 3.7 (Deterministic resolvent approximation). Suppose Assumptions 2.1 and 3.2 hold, and let be sufficiently large for Lemma 3.5. For , let and let satisfy
Then
Equivalently,
Proof. Elliptic regularity gives
Since , elementwise integration by parts yields
Hence
Let
Galerkin orthogonality gives
Taking and using Lemma 3.5, (50), (51) and (52), we obtain
Therefore, with ,
For the estimate, let
By Assumption 2.1,
Symmetry, consistency and Galerkin orthogonality give
Hence, by (50), (52) and (57),
This proves (54).
Finally,
so , and (55) follows. □
Canonical discrete white noise
The restriction of to is represented by the unique Gaussian random variable satisfying
Its covariance is
Let be a basis of and let
be the local mass matrix. The corresponding load vector
is Gaussian with covariance . It can therefore be sampled as
If denotes the coefficient vector of , then . Basis functions on distinct elements have disjoint support, so the vectors are mutually independent. Thus (60) gives an exact element-local sampler for the continuum white-noise load restricted to .
If is an -orthonormal basis of , then
with independent coefficients. Consequently,
The discrete SPDE is: find such that
or, equivalently,
Restricted noise and strong convergence
Let be the continuum solution driven by :
Since , Assumption 2.1 gives
Lemma (White-noise restriction error). For ,
Consequently,
Proof. For every eigenfunction ,
Therefore
Parseval’s identity and the covariance of give (66). By (37), Assumption 2.1 and the stability of ,
Hence
Using (9) and splitting the sum at gives
Taking square roots proves (67).
Proposition (Optimality over finite-dimensional spaces). Let be any deterministic subspace with , and let be arbitrary. Then
Equality is attained when
and is the -orthogonal projection of onto .
In particular, taking and , under Assumption 3.2,
Proof. Let be the -orthogonal projection. Since takes values in ,
almost surely. Hence
The covariance operator of is , which is trace class for . Therefore,
Since has rank , the variational characterisation of the eigenvalues of gives
This proves (70). Equality is attained by the spectral space .
Finally, take and . By (9),
Since Assumption 3.2 gives ,
Taking square roots proves (71). □
Theorem 3.12 (Sharp strong convergence). Let and let be fixed, let Assumptions 2.1 and 3.2 hold and let be sufficiently large as in Lemma 3.5. Then, there exist constants , independent of , such that the solution of (62) satisfies
Thus the sharp strong rate is in two dimensions and in three dimensions.
Proof. The decomposition (20) and Lemma 3.10 give
Applying Lemma 3.7 samplewise with , followed by (61), gives
This proves the upper bound. The lower bound follows from Proposition 3.11 with . □
Extension to a reentrant polygon
To examine the impact of geometry, we now replace Assumption 2.1 by the regularity structure associated with a single reentrant corner. The deterministic SIPDG analysis for elliptic problems on polygons with corner singularities is well established. In particular, the Dirichlet corner exponent, low-regularity continuity and consistency of the SIP form, Galerkin orthogonality, energy quasi-optimality and adjoint-consistent duality are developed in [26]. We make use of the associated weighted-space framework. The points requiring attention here are instead that the meshes are the star-shaped polytopes of Assumption 3.2, and that the stochastic analysis requires the endpoint behaviour of the leading corner singularity.
Throughout this section, the penalty parameter is chosen sufficiently large for Lemma 3.5 to hold. Let and let be a bounded polygon with one reentrant corner of interior angle
All remaining vertices on are assumed to be convex. We assume that the meshes are boundary-conforming and that is a mesh vertex, see Figure 1. Since ,
Figure 1. Local geometry at the reentrant corner , with interior angle and polar coordinates .
Let be a smooth radial cut-off supported near and equal to one in a neighbourhood of , and set
Then , , and, near ,
Corner structure and deterministic SIP estimates
Write
The classical Dirichlet corner decomposition [21, 16] gives bounded maps
such that
Let denote the Riesz representative of .
We shall also use
Indeed, Weyl’s law gives in two dimensions, while has rank one, so (78) follows from the finite-rank perturbation inequality for singular values.
Since , the gradient of has an trace on every mesh face. Hence, for each fixed mesh, extends naturally to
The uniform trace estimate required for the approximation analysis is proved in Lemma 4.2.
We may therefore define the SIP Ritz map
by
The usual consistency argument remains valid. To see the only nonstandard point, perform elementwise integration by parts after removing a circle of radius about . On that circle,
and the boundary length is . The additional contribution therefore vanishes as . Consequently,
and, with ,
The following estimates collect the deterministic information needed for the stochastic analysis.
Lemma (Corner SIP estimates). For fixed polynomial degree ,
Proof. The estimate (83) follows from (52), coercivity, continuity and Galerkin orthogonality. We therefore concentrate on the singular function .
Introduce the metric corner patch
If , then . Moreover, Assumption 3.2, (28) and (27) give . Since the element interiors are disjoint,
On the other hand,
These two properties separate the corner contribution from the regular part of the mesh.
We first estimate the contribution from . Quasi-uniformity implies that, for ,
with independent of . Hence (76) gives
The only nonstandard estimate is the whole-boundary trace of . Since , choose an exponent such that
Such a choice is possible precisely because . The pointwise behaviour (76) then gives
In particular, .
Apply [4], Lemma 2.2 with and to each component of . The mesh condition required there holds uniformly by (29). Since , we obtain
Thus
Notice that this is a whole-boundary estimate; no lower bound on the size of an individual face is used.
Applying (32) directly to and using (89) similarly gives
Let denote the local projection. Its stability, together with the polynomial inverse and trace estimates of Lemma 3.3, now yields
for every .
We next consider the elements outside the metric corner patch. By (88), the singularity is separated from each such element by at least . Hence (36) and (76) give, for a fixed radius containing the support of ,
Here the fixed term accounts for the smooth cut-off region. Combining this estimate with (95), (87) and the definition of gives
To obtain the corresponding Ritz estimate, set
Consistency and Galerkin orthogonality imply
Taking and using coercivity, (50) and (51) gives
Together with (96), this proves (84).
It remains to prove the estimate. Set
and choose
The regular approximation estimate, (96) and (77) imply
where we used for .
Finally, symmetry, consistency and Galerkin orthogonality give
This proves (85). □
Hilbert–Schmidt resolvent error
The preceding estimates still reflect the deterministic corner loss. For the SPDE, however, the singular contribution in (77) is only rank one. This allows the regular infinite-dimensional part and the corner correction to be estimated separately.
Lemma (Reentrant-corner resolvent estimate). The continuous and discrete resolvents satisfy
Proof. Let and set
For , adjoint consistency gives
Using the corner decomposition (77) and the Galerkin orthogonality
we obtain
The first term on the right is a bounded linear functional of . Hence, by the Riesz representation theorem, there exists a unique such that
Set also
Lemma 4.2 and (77) give
Let be the Riesz representative of , so that
Since the preceding identity holds for every ,
Applying this with and using (77) together with (82), we obtain
We first consider the infinite-dimensional term . By (99),
From
we have, for every ,
The first term takes values in , while the second takes values in . Consequently,
We use the standard finite-rank perturbation inequality for singular values: if and are compact operators and
then
Applying this with
and using (78), we obtain
Combining this with the operator-norm bound above and yields
Hence
The remaining two terms in (100) have rank one. Using (99), (77) and (85), we obtain
and
Since
both exponents are strictly larger than one. Thus the two rank-one corner terms are of higher order than the Hilbert–Schmidt contribution from , and (97) follows. □
Theorem 4.5 (Sharp convergence on a reentrant polygon). Let and let have the corner geometry described above. Under Assumption 3.2, there exist constants , independent of , such that
Proof. Let be any -orthonormal basis and set . Since the continuous and discrete problems are driven by the same isonormal process,
and therefore
Lemma 4.4 gives the upper bound. The lower bound follows from Proposition 3.11, since takes values in and . □
Remark 4.6 (Why the corner does not change the stochastic rate). A global deterministic regularity argument only sees regularity and hence reflects the loss caused by the reentrant corner. The operator decomposition (99) is sharper. The infinite-dimensional regular contribution has Hilbert–Schmidt error , whereas the two corner corrections are rank one and have orders
Both are because . Thus the reentrant corner degrades deterministic approximation rates without changing the sharp first-order strong rate of the white-noise problem.
Numerical experiments
The numerical experiments examine the two main convergence results. On the unit square and cube, the explicit Dirichlet eigensystem is used to estimate the continuum strong error and test the dimension-dependent rate in Theorem 3.12. We then consider a family of reentrant polygonal domains with varying corner angle and test the first-order stochastic rate of Theorem 4.5 using a coupled fine-level reference.
The numerical implementation is based on the polytopic discontinuous Galerkin finite element library [18]. Throughout, and consists of discontinuous piecewise-linear polynomials. We take in two dimensions and in three dimensions. Linear systems are solved by ILU-preconditioned BiCGSTAB with relative tolerance . For each mesh, the SIP matrix and preconditioner are assembled once and reused for all modal right-hand sides or stochastic realisations.
Continuum strong-error estimator on
For , the eigensystem of is
For each mode, let satisfy
Expanding the continuous and discrete random fields with respect to the same isonormal process gives
We evaluate the low-frequency part of (104) explicitly and estimate the remaining infinite sum by importance sampling. Write
For a hierarchy with mesh scales , the tail proposal is the equal mixture
Each component resolves the transition and retains an infinite tail. For independent samples , we use
The same sampled modes are used across every mesh level and mesh family in a fixed dimension. In two dimensions we take and , while in three dimensions we take and . Error bars show one bootstrap standard error of the RMS estimator, obtained from 2000 resamples of the importance-sampled tail contributions with the explicitly summed low-frequency contribution held fixed.
For the convergence plots we use as the mesh scale, where is the number of computational elements. Under Assumption 3.2, .
Experiment 1: regular polytopic meshes
Two dimensions. For , Theorem 3.12 gives the sharp rate . We consider four quasi-uniform mesh families: Voronoi, wave-distorted Voronoi, checkerboard-distorted Voronoi and jittered quadrilateral meshes. Each hierarchy contains six refinement levels, with elements on the finest level. Figure 2 shows representative stochastic fields on the four mesh families.

Figure 2. Representative two-dimensional stochastic fields on the four quasi-uniform polytopic mesh families.
Figure 3 shows the continuum RMS error computed from (105), plotted against . The dotted line shows the first-order reference slope.
Figure 3. Continuum RMS error on the four two-dimensional polytopic mesh families. The horizontal axis is and the dotted line shows the sharp rate from Theorem 3.12. Error bars show one bootstrap standard error of the modal estimator.
Three dimensions. For , Theorem 3.12 gives the sharp rate . We consider regular hexahedral, jittered hexahedral and non-convex polyhedral mesh families. Each hierarchy contains five refinement levels. The regular and jittered families have elements on the finest level, while the non-convex family is generated from a background partition.
The non-convex computational elements are connected agglomerates of tetrahedra, with a single affine polynomial defined on each resulting polyhedron. Figure 4 illustrates the computational geometry.
(a) Cut-away polyhedral mesh
(b) Representative non-convex cell
Figure 4. Non-convex polyhedral geometry used in the three-dimensional experiment. The displayed boundaries are those of the computational polyhedra.
Figure 5 shows the continuum RMS error computed from (104), plotted against . The dotted line shows the reference slope.
Figure 5. Continuum RMS error on the regular hexahedral, jittered hexahedral and non-convex polyhedral mesh families. The horizontal axis is and the dotted line shows the sharp rate from Theorem 3.12. Error bars show one bootstrap standard error of the modal estimator.
Experiment 2: stochastic reentrant problem
We consider a family of polygonal domains with
The corresponding reentrant angle is
so varies from to across the angle sweep.
The reentrant vertex is preserved exactly at every refinement level. The meshes are constructed from a perturbed Cartesian background, cut to the polygonal domain and agglomerated into general polygons. The resulting hierarchies contain many-sided and non-convex elements. Figure 6 shows representative stochastic fields for four openings.

(a)

(b)

(c)

(d)
Figure 6. Representative stochastic fields on the reentrant polygonal domains for four mouth openings spanning the angle sweep.
For every mouth opening, the stochastic hierarchy contains five reported levels followed by two additional refinement levels. The final level is generated from a background partition and is used as the coupled reference. For each angle we use independent white-noise realisations.
For each realisation, the same continuum white-noise functional is restricted to every discrete space in the hierarchy. Thus the solutions and are driven by the same Gaussian realisation. On each reported level we compute the coupled fine-reference RMS difference
For each angle, the stochastic convergence rate is estimated from a least-squares fit of against , omitting the coarsest reported level. Its sampling uncertainty is estimated by resampling the coupled realisations simultaneously across all mesh levels and repeating the slope fit. We use 2000 paired bootstrap resamples.
Figure 7 reports the resulting stochastic convergence. Panel (A) shows the coupled fine-reference RMS differences for representative , plotted against together with a first-order reference slope. Panel (B) shows the estimated exponent across the complete angle sweep.
Figure 7. Strong stochastic convergence on the reentrant polygonal domains. Panel (A) shows the coupled fine-reference RMS difference against for representative mouth openings; the dotted line shows the first-order rate. Panel (B) shows the fitted stochastic exponent for all seven mouth openings. Error bars show bootstrap standard errors of the RMS differences in panel (A) and of the fitted exponent in panel (B).
The experiments recover the two convergence behaviours established in the analysis. On regular polygonal and polyhedral domains, the continuum estimator exhibits the dimension-dependent rate across several polytopic mesh families. Across the reentrant angle sweep, the coupled stochastic approximation exhibits the first-order rate of eq:4.5.
Acknowledgments
TP is supported by the EPSRC programme grant Mathematics of Radiation Transport (MaThRad) EP/W026899/2 which is gratefully acknowledged.
References
¹ Institute for Mathematical Innovation, University of Bath, Bath, UK. ² Department of Mathematical Sciences, University of Bath, Bath, UK.
References
- [1]E. J. Allen, S. J. Novosel, and Z. Zhang. “Finite Element and Difference Approximation of Some Linear Stochastic Partial Differential Equations”. In: Stochastics and Stochastics Reports 64.1–2 (1998), pp. 117–142. DOI: 10.1080/17442509808834159.DOI
- [2]D. Bolin, K. Kirchner, and M. Kovács. “Weak convergence of Galerkin approximations for fractional elliptic stochastic PDEs with spatial white noise”. In: BIT Numerical Mathematics 58.4 (2018), pp. 881–906. DOI: 10.1007/s10543-018-0719-8.DOI
- [3]D. Bolin, K. Kirchner, and M. Kovács. “Numerical Solution of Fractional Elliptic Stochastic PDEs with Spatial White Noise”. In: IMA Journal of Numerical Analysis 40.2 (2020), pp. 1051–1073. DOI: 10.1093/imanum/dry091.
- [4]M. Botti and L. Mascotto. “Trace inequalities for piecewise W^{1,p} functions over general polytopic meshes”. In: arXiv preprint arXiv:2512.09752 (2025).arxiv.org/abs/2512.09752
- [5]A. Cangiani, Z. Dong, E. H. Georgoulis, and P. Houston. “hp-Version Discontinuous Galerkin Methods for Advection-Diffusion-Reaction Problems on Polytopic Meshes”. In: ESAIM: Mathematical Modelling and Numerical Analysis 50.3 (2016), pp. 699–725. DOI: 10.1051/m2an/2015059.DOI
- [6]A. Cangiani, Z. Dong, and E. H. Georgoulis. “hp-Version Discontinuous Galerkin Methods on Essentially Arbitrarily-Shaped Elements”. In: Mathematics of Computation 91.333 (2022), pp. 1–35. DOI: 10.1090/mcom/3667.DOI
- [8]A. Cangiani, E. H. Georgoulis, and P. Houston. “hp-Version Discontinuous Galerkin Methods on Polygonal and Polyhedral Meshes”. In: Mathematical Models and Methods in Applied Sciences 24.10 (2014), pp. 2009–2041. DOI: 10.1142/S0218202514500146.DOI
- [9]Y. Cao, J. Hong, and Z. Liu. “Well-Posedness and Finite Element Approximations for Elliptic SPDEs with Gaussian Noises”. In: Communications in Mathematical Research 36.2 (2020), pp. 113–127. DOI: 10.4208/cmr.2020–0006.
- [10]V. Cronholm, M. Evans, E. H. Georgoulis, and T. Pryer. “Multilevel Monte Carlo for Polytopic DG Discretisations with Spatially Represented Random Coefficients”. Manuscript. 2026.
- [11]S. G. Cox and K. Kirchner. “Regularity and convergence analysis in Sobolev and Hölder spaces for generalized Whittle–Matérn fields”. In: Numerische Mathematik 146.4 (2020), pp. 819–873. DOI: 10.1007/s00211–020–01151–x.
- [12]M. Croci, M. B. Giles, M. E. Rognes, and P. E. Farrell. “Efficient White Noise Sampling and Coupling for Multilevel Monte Carlo with Non-nested Meshes”. In: SIAM/ASA Journal on Uncertainty Quantification 6.4 (2018), pp. 1630–1655. DOI: 10.1137/18M1175239.DOI
- [14]Y. Cao, R. Zhang, and K. Zhang. “Finite Element and Discontinuous Galerkin Method for Stochastic Helmholtz Equation in Two- and Three-Dimensions”. In: Journal of Computational Mathematics 26.5 (2008), pp. 702–715.
- [15]Y. Cao, R. Zhang, and K. Zhang. “Finite element method and discontinuous Galerkin method for stochastic scattering problem of Helmholtz type in R^d (d= 2, 3)”. In: Potential Analysis 28.4 (2008), pp. 301–319.
- [16]M. Dauge. Elliptic Boundary Value Problems on Corner Domains: Smoothness and Asymptotics of Solutions. Vol. 1341. Lecture Notes in Mathematics. Berlin, Heidelberg: Springer, 1988. ISBN: 978-3-540-50169-5. DOI: 10.1007/BFb0086682.DOI
- [17]Q. Du and T. Zhang. “Numerical Approximation of Some Linear Stochastic Partial Differential Equations Driven by Special Additive Noises”. In: SIAM Journal on Numerical Analysis 40.4 (2002), pp. 1421–1445. DOI: 10.1137/S0036142901387956.DOI
- [18]M. Evans and T. Pryer. “Reyna: A minimal overhead polytopal discontinuous Galerkin finite element library”. In: Journal of Open Source Software 11.118 (2026), p. 9292.
- [19]H. R. Fairbanks, U. Villa, and P. S. Vassilevski. “Multilevel Hierarchical Decomposition of Finite Element White Noise with Application to Multilevel Markov Chain Monte Carlo”. In: SIAM Journal on Scientific Computing 43.5 (2021), S293–S316. DOI: 10.1137/20M1349606.DOI
- [20]I. Gyöngy and T. Martínez. “On Numerical Solution of Stochastic Partial Differential Equations of Elliptic Type”. In: Stochastics 78.4 (2006), pp. 213–231. DOI: 10.1080/17442500600805047.DOI
- [21]P. Grisvard. Elliptic Problems in Nonsmooth Domains. Vol. 24. Monographs and Studies in Mathematics. Boston, MA: Pitman Advanced Publishing Program, 1985. ISBN: 0-273-08647-2.
- [22]F. Lindgren, D. Bolin, and H. Rue. “The SPDE approach for Gaussian and non-Gaussian fields: 10 years and still running”. In: Spatial Statistics 50 (2022), p. 100599. DOI: 10.1016/j.spasta.2022.100599.DOI
- [23]S. Lasanen, L. Roininen, and J. M. J. Huttunen. “Elliptic Boundary Value Problems with Gaussian White Noise Loads”. In: Stochastic Processes and their Applications 128.11 (2018), pp. 3607–3627. DOI: 10.1016/j.spa.2017.11.007.DOI
- [24]F. Lindgren, H. Rue, and J. Lindström. “An Explicit Link Between Gaussian Fields and Gaussian Markov Random Fields: The Stochastic Partial Differential Equation Approach”. In: Journal of the Royal Statistical Society: Series B 73.4 (2011), pp. 423–498. DOI: 10.1111/j.1467-9868.2011.00777.x.DOI
- [25]B. Matérn. Spatial Variation. 2nd ed. Vol. 36. Lecture Notes in Statistics. New York, NY: Springer, 1986. DOI: 10.1007/978-1-4615-7892-5.DOI
- [26]F. Müller, D. Schötzau, and C. Schwab. “Symmetric Interior Penalty Discontinuous Galerkin Methods for Elliptic Problems in Polygons”. In: SIAM Journal on Numerical Analysis 55.5 (2017), pp. 2490–2521. DOI: 10.1137/17M1120634.DOI
- [27]P. Whittle. “On Stationary Processes in the Plane”. In: Biometrika 41.3–4 (1954), pp. 434–449. DOI: 10.1093/biomet/41.3-4.434.DOI
- [28]R.-M. Yao and L.-J. Bo. “Discontinuous Galerkin method for elliptic stochastic partial differential equations on two and three dimensional spaces”. In: Science in China Series A: Mathematics 50.11 (2007), pp. 1661–1672. DOI: 10.1007/s11425-007-0103-7.DOI
- [29]Z. Zhang, B. Rozovskii, and G. E. Karniadakis. “Strong and weak convergence order of finite element methods for stochastic PDEs with spatial white noise”. In: Numerische Mathematik 134.1 (2016), pp. 61–89. DOI: 10.1007/s00211-015-0768-8.DOI





