betaFeedback

WorksMathematics

Multilevel Monte Carlo for Polytopic DG Discretisations with Spatially Represented Random Coefficients

Abstract

We develop a multilevel Monte Carlo framework for coercive elliptic problems with random diffusion and reaction coefficients on polytopic meshes, with particular emphasis on the approximation and inter-level coupling of random coefficients generated from spatially represented latent fields. The main analytical contribution is a Strang-type error decomposition in a DG norm that separates the forward discretisation error from the error introduced by approximating the random coefficients. On this basis, we study two coefficient-generation and multilevel-coupling strategies, a spectral sampler based on a stationary Gaussian latent field defined on a fixed Cartesian reference grid, and an SPDE-based Matérn sampler in which levels are coupled through projected white-noise loads on agglomerated hierarchies. Both fit into the same coefficient-aware analytical framework and couple adjacent levels directly through a common latent random input. The theory is supported by numerical experiments on general Voronoi and agglomerated polytopic meshes, demonstrating the predicted forward and coefficient-representation errors, decay of multilevel corrections, strong inter-level coupling, and the resulting work-accuracy behaviour relative to single-level Monte Carlo.

Introduction

Elliptic boundary value problems with heterogeneous diffusion and reaction coefficients arise throughout scientific computing and engineering. In many applications these coefficients are not known exactly and are more naturally modelled as random fields. The computational task then becomes the estimation of expectations and other statistics of quantities of interest depending on the solution of a parameter-dependent PDE. For problems of realistic size, the dominant cost lies in the repeated numerical solution of the forward model.

Standard Monte Carlo methods are robust but become prohibitively expensive once fine spatial resolution is required. Multilevel Monte Carlo (MLMC) methods address this by combining many inexpensive coarse solves with far fewer expensive fine solves, and can reduce total work to near that of a single deterministic solve at the target accuracy [Hei01; Gil08; Gil15; BSZ11]. For elliptic PDEs with random coefficients, MLMC theory has been developed for conforming finite element discretisations on nested mesh hierarchies, including pathwise discretisation bounds and complexity results for uniformly elliptic and lognormal models [13, 15 Te+13].

Two related issues arise when MLMC is combined with spatially represented random fields on general meshes. The first is geometric, the forward discretisations may be non-nested or may be constructed by agglomeration. White-noise sampling and MLMC coupling across nested and non-nested finite element hierarchies have been developed in [14], while recent work has combined MLMC with Virtual Element discretisations on general polytopal meshes using agglomerated coarse spaces [4]. The second issue is the representation of the random input itself. When a coefficient is generated through a spatially discretised latent field, its approximation becomes part of the overall discretisation error and its inter-level coupling directly affects the variance of the multilevel corrections. SPDE-based sampling of random-field coefficients has been studied in the multilevel quasi-Monte Carlo setting [10], including coupling on non-nested finite element meshes. The present work focuses on this latter coefficient-representation issue in the setting of polytopic DG discretisations, where strong pairwise coupling remains essential for MLMC efficiency [12].

Discontinuous Galerkin methods on polytopic meshes provide an attractive discretisation route in such settings. They offer geometric flexibility while retaining robust stability and high-order approximation on general polytopic mesh families [11, 9]. Furthermore, the cardinality of local element bases is independent of the element shape. More broadly, recent work on polytopic discretisations has shown that this geometric setting supports a wider family of numerical methods, including recovery-based formulations and their extension to polytopic meshes [22, 16]. In a related direction, recent composite and nodally bound-preserving constructions underline that polytopic meshes can support stable and structure-aware discretisations beyond the standard interior penalty framework [1]. At the same time, agglomeration-based multilevel constructions for DG on polytopic meshes have been developed successfully for linear solver design, including multigrid and Schwarz methods [2, 5, 3].

The present work is motivated by the need to develop an MLMC framework for random-coefficient elliptic problems on general polytopic DG meshes in which level coupling is induced by the underlying random input, rather than by remapping already discretised coefficient fields between meshes. We consider coercive elliptic diffusion–reaction problems with random diffusion and reaction coefficients, discretised by lifting-based symmetric interior penalty DG methods on polytopic meshes. The FFT construction can be used on unrelated forward meshes, while the SPDE construction is developed on agglomerated hierarchies with a natural coarse-to-fine inclusion.

Our first contribution is analytical. We derive a Strang-type decomposition in the DG norm that separates the forward discretisation error from the error introduced by approximating the random coefficients. The formulation is written using a discrete lifting, equivalently an L2L^2-projected numerical flux, so that coefficient traces are avoided in the consistency analysis. This is the key structural point for the multilevel analysis. Once the coefficients are generated only approximately, whether by representation of a spectral sample or by the numerical solution of an auxiliary stochastic PDE, the total bias must distinguish approximation of the forward solution from approximation of the data driving the forward problem.

Our second contribution is to instantiate this coefficient-aware framework with two different coefficient-generation and coupling strategies on polytopic DG meshes. The first is a spectral method in which a stationary Gaussian latent field is generated on a fixed Cartesian reference grid using FFT and circulant-embedding ideas [31, 17, 23] and then evaluated at the quadrature points required for DG assembly. In this way, all levels are driven by the same represented latent-field realisation, without transferring a discretised coefficient field between the forward meshes. The second is an SPDE-based Matérn construction in which the latent field is defined through an auxiliary elliptic stochastic PDE driven by spatial white noise [Whi54; Mat86; LRL11]. On an agglomerated hierarchy, the levels are coupled through the driving noise itself using the exact discrete relation between fine and coarse white-noise loads. The SPDE route is also informed by DG analysis in mesh-dependent norms for rough data, which provides a useful analytical precedent for discretisations driven by irregular right-hand sides [21]. Modern developments in the SPDE viewpoint and in scalable Markov and graph representations provide further context for this route [29, 25, 6].

Our third contribution is to combine these ingredients in a single coefficient-aware multilevel error analysis. For the forward problem we obtain DG-norm bounds in which the influence of coefficient approximation appears explicitly through L1L^1-type norms of the coefficient error. For the spectral sampler these terms are related to the representation and interpolation error of the latent field. For the SPDE sampler they are related to approximation properties of the DG resolvent acting on spatial white noise. This yields a unified MLMC framework in which both coefficient-generation strategies can be analysed using the same forward DG technology.

The distinction from the closest existing multilevel constructions is therefore in the role played by the random coefficient. White-noise sampling and coupling for finite element SPDE discretisations, including non-nested hierarchies, were developed in [14], and this approach was subsequently used for SPDE-generated random-field coefficients in a multilevel quasi–Monte Carlo framework [10]. More recently, [4] developed an MLMC Virtual Element method on general polytopal meshes with agglomerated coarse spaces. In the latter setting the random diffusion coefficient is treated as a given continuum realisation and the multilevel analysis concerns the approximation of the corresponding forward problem.

Here the spatial representation of the random coefficient is included explicitly in the multilevel discretisation. The lifting-based DG formulation gives a coefficient-aware Strang decomposition separating forward spatial approximation, projected-flux consistency and coefficient-representation error without requiring traces of the represented coefficient. This permits two different input-space couplings to be treated within the same analysis. In the FFT construction, all forward levels are driven by a common represented latent field and the forward meshes need not be nested. In the SPDE construction, the agglomerated DG spaces are naturally nested and the coarse white-noise load is obtained by exact restriction of the fine-level load. Thus the coefficient representation controls a separate contribution to the bias, while the coupling of the latent random input controls the strength of the multilevel corrections.

The numerical experiments complement the analysis on general Voronoi and agglomerated polytopic meshes. They verify the expected spatial rates of the P1 DG discretisation, isolate the coefficient-representation contribution predicted by the Strang decomposition, and measure the weak and variance decay of the multilevel corrections. The coupling diagnostics show strong correlation between neighbouring levels for both random-field constructions. The final work experiments compare complete MLMC and single-level Monte Carlo calculations and illustrate how the observed variance decay and sample costs determine the practical multilevel gain.

The remainder of the paper is organised as follows. Section 2 introduces the random elliptic diffusion–reaction problem, the admissible random-coefficient models and the quantities of interest. Section 3 formulates the lifting-based polytopic DG discretisation and derives the Strang-type decomposition separating spatial discretisation, projected-flux and coefficient-representation errors. Section 4 develops the two random-field constructions: the common-reference FFT sampler and the SPDE Matérn sampler with white-noise coupling on agglomerated hierarchies. Section 5 combines these approximation estimates with the MLMC bias–variance decomposition, derives the corresponding error and work estimates, and describes the optimal sample allocation. Finally, Section 6 presents numerical experiments on Voronoi and agglomerated polytopic meshes, verifying the forward and coefficient-representation errors, the strength of the multilevel couplings, and the resulting work–accuracy behaviour.

Problem setup

Throughout, Lp(Ω)L^p(\Omega) and Hs(Ω)H^s(\Omega) denote the usual Lebesgue and Sobolev spaces, and (Ξ,F,P)(\Xi,\mathcal{F},\mathbb{P}) is a complete probability space. Bochner spaces are denoted by Lp(Ξ;X)L^p(\Xi;X), with expectation E\mathbb{E} and variance V\mathbb{V} in the usual sense.

Elliptic model with random coefficients

Elliptic model with random coefficients. Let

V:=H01(Ω).(1)V := H_0^1(\Omega). \tag*{(1)}

We model the diffusion and reaction coefficients as random fields

A:Ω×Ξ→Rsymd×d,c:Ω×Ξ→R,(2)A:\Omega\times\Xi\to\mathbb{R}_{\mathrm{sym}}^{d\times d}, \qquad c:\Omega\times\Xi\to\mathbb{R}, \tag*{(2)}

measurable in ξ∈Ξ\xi\in\Xi and essentially bounded in x∈Ωx\in\Omega. We assume that there exist deterministic constants

0<a≤a‾<∞,0<c‾≤c‾<∞,(3)0<a\le\underline{a}<\infty,\qquad0<\underline{c}\le\overline{c}<\infty, \tag*{(3)}

such that

a‾∣η∣2≤ηTA(x,ξ)η≤a‾∣η∣2,c‾≤c(x,ξ)≤c‾,(4)\underline{a}\lvert\eta\rvert^2\le\eta^\mathsf{T}A(x,\xi)\eta\le\overline{a}\lvert\eta\rvert^2,\qquad\underline{c}\le c(x,\xi)\le\overline{c}, \tag*{(4)}

for almost every x∈Ωx\in\Omega, every η∈Rd\eta\in\mathbb{R}^d, and almost every ξ∈Ξ\xi\in\Xi.

Given F∈L2(Ω)F\in L^2(\Omega), for almost every ξ∈Ξ\xi\in\Xi we consider the problem: find u(ξ)∈Vu(\xi)\in V such that

a(u(ξ),v;A(ξ),c(ξ))=⟨F,v⟩∀v∈V,(5)a(u(\xi),v;A(\xi),c(\xi))=\langle F,v\rangle\qquad\forall v\in V, \tag*{(5)}

where

a(w,v;A,c):=∫ΩA(x)∇w⋅∇v dx+∫Ωc(x)wv dx.(6)a(w,v;A,c):=\int_{\Omega} A(x)\nabla w\cdot\nabla v\,\mathrm{d}x+\int_{\Omega} c(x)wv\,\mathrm{d}x. \tag*{(6)}

By (4), a(⋅,⋅;A(ξ),c(ξ))a(\cdot,\cdot;A(\xi),c(\xi)) is uniformly coercive,

a(v,v;A(ξ),c(ξ))≥min⁡{a‾,c‾}∥v∥H1(Ω)2∀v∈V,(7)a(v,v;A(\xi),c(\xi))\ge\min\{\underline{a},\underline{c}\}\lVert v\rVert_{H^1(\Omega)}^2 \qquad\forall v\in V, \tag*{(7)}

and uniformly continuous,

∣a(w,v;A(ξ),c(ξ))∣≤max⁡{a‾,c‾}∥w∥H1(Ω)∥v∥H1(Ω)∀w,v∈V.(8)\lvert a(w,v;A(\xi),c(\xi))\rvert\le\max\{\overline{a},\overline{c}\}\lVert w\rVert_{H^1(\Omega)}\lVert v\rVert_{H^1(\Omega)} \qquad\forall w,v\in V. \tag*{(8)}

Hence, by the Lax–Milgram theorem, (5) admits a unique solution for almost every ξ∈Ξ\xi\in\Xi. Moreover, there exists a constant Cstab>0C_{\mathrm{stab}}>0, depending only on a‾\underline{a}, a‾\overline{a}, c‾\underline{c}, c‾\overline{c} and Ω\Omega, such that

∥u(ξ)∥H1(Ω)≤Cstab∥F∥L2(Ω)for a.e. ξ∈Ξ.(9)\lVert u(\xi)\rVert_{H^1(\Omega)}\le C_{\mathrm{stab}}\lVert F\rVert_{L^2(\Omega)} \qquad\text{for a.e. }\xi\in\Xi. \tag*{(9)}

2.2. Remark (Almost sure well-posedness and moment bounds). Under the stated measurability assumptions, the solution map u:Ξ→Vu : \Xi\to V is strongly measurable. Since (9) is uniform in ξ\xi,

u∈L∞(Ξ;V),∥u∥L∞(Ξ;V)≤Cstab∥F∥L2(Ω).(10)u \in L^\infty(\Xi;V), \qquad\lVert u\rVert_{L^\infty(\Xi;V)} \le C_{\mathrm{stab}}\lVert F\rVert_{L^2(\Omega)}. \tag*{(10)}

Consequently, u∈Lp(Ξ;V)u \in L^p(\Xi;V) for every p∈[1,∞)p \in[1,\infty) and

E[∥u∥H1(Ω)p]<∞∀p∈[1,∞).(11)\mathbb{E}\left[\lVert u\rVert_{H^1(\Omega)}^p\right] < \infty\qquad\forall p \in[1,\infty). \tag*{(11)}

Random input models

The analysis below uses only the pathwise bounds (4). We therefore allow different constructions of the random coefficients, provided these bounds hold uniformly, either directly or after a deterministic truncation. We record here the models used subsequently in the analysis and numerical experiments.

A convenient scalar model is obtained from truncated lognormal fields. Let YaY_a and YcY_c be mean-zero Gaussian fields, which may be correlated, and let ma,mc∈L∞(Ω)m_a,m_c \in L^\infty(\Omega) be deterministic. Define

Π[−β,β](y):=min⁡{β,max⁡{−β,y}}.(12)\Pi_{[-\beta,\beta]}(y) := \min\{\beta,\max\{-\beta,y\}\}. \tag*{(12)}

For truncation parameters βa,βc>0\beta_a,\beta_c > 0, set

a(x,ξ):=exp⁡(ma(x)+Π[−βa,βa]Ya(x,ξ)),(13)a(x,\xi) := \exp\left(m_a(x)+\Pi_{[-\beta_a,\beta_a]}Y_a(x,\xi)\right), \tag*{(13)}

and

c(x,ξ):=exp⁡(mc(x)+Π[−βc,βc]Yc(x,ξ)).(14)c(x,\xi) := \exp\left(m_c(x)+\Pi_{[-\beta_c,\beta_c]}Y_c(x,\xi)\right). \tag*{(14)}

Then

a‾:=exp⁡(ess inf⁡Ωma−βa),a‾:=exp⁡(ess sup⁡Ωma+βa),(15)\underline{a} := \exp\left(\operatorname*{ess\,inf}_{\Omega}m_a-\beta_a\right), \qquad\overline{a} := \exp\left(\operatorname*{ess\,sup}_{\Omega}m_a+\beta_a\right), \tag*{(15)}

and

c‾:=exp⁡(ess inf⁡Ωmc−βc),c‾:=exp⁡(ess sup⁡Ωmc+βc).(16)\underline{c} := \exp\left(\operatorname*{ess\,inf}_{\Omega}m_c-\beta_c\right), \qquad\overline{c} := \exp\left(\operatorname*{ess\,sup}_{\Omega}m_c+\beta_c\right). \tag*{(16)}

Thus the resulting coefficients satisfy (4) almost surely.

2.4. Remark (Scalar diffusion). In the scalar case we take

A(x,ξ)=a(x,ξ)I.(17)A(x,\xi)=a(x,\xi)I. \tag*{(17)}

The diffusion condition in (4) then reduces to

a‾≤a(x,ξ)≤a‾.\underline{a}\le a(x,\xi)\le\overline{a}.

This is the setting used in the numerical experiments below. A single latent field may be used for both coefficients by taking Ya=YcY_a=Y_c, while distinct or correlated fields are equally admissible for the analysis.

Quantities of interest

We consider quantities of interest of the form

Q:V→R,Q⋆(ξ):=Q(u(ξ)).(18)Q:V\to\mathbb{R}, \qquad Q^\star(\xi):=Q(u(\xi)). \tag*{(18)}

For the multilevel analysis we focus on functionals which are Lipschitz continuous with respect to the H1(Ω)H^1(\Omega) norm. The stability and forward approximation estimates can then be transferred directly to the bias and to the multilevel corrections.

A canonical example is a bounded linear functional

Q(u):=⟨g,u⟩V∗,V,g∈V∗.(19)Q(u):=\langle g,u\rangle_{V^\ast,V}, \qquad g\in V^\ast. \tag*{(19)}

Indeed,

∣Q(w)−Q(z)∣≤∥g∥V∗∥w−z∥H1(Ω)∀w,z∈V.(20)\lvert Q(w)-Q(z)\rvert\le\lVert g\rVert_{V^\ast}\lVert w-z\rVert_{H^1(\Omega)} \qquad\forall w,z\in V. \tag*{(20)}

In particular, if g∈L2(Ω)g\in L^2(\Omega), then

Q(u)=(g,u)L2(Ω).Q(u)=(g,u)_{L^2(\Omega)}.

Another useful example is a regional average. If ω⊂Ω\omega\subset\Omega is measurable with ∣ω∣>0\lvert\omega\rvert>0, define

Q(u):=1∣ω∣∫ωu(x) dx.(21)Q(u):=\frac{1}{\lvert\omega\rvert}\int_{\omega}u(x)\,\mathrm{d}x. \tag*{(21)}

Then

References

  1. [1]A. Amiri, G. R. Barrenechea, and T. Pryer. “A nodally bound-preserving finite element method for time-dependent convection–diffusion equations”. In: Journal of Computational and Applied Mathematics 470 (2025), p. 116691.
  2. [2]P. F. Antonietti, P. Houston, X. Hu, M. Sarti, and M. Verani. “Multigrid Algorithms for hp-Version Interior Penalty Discontinuous Galerkin Methods on Polygonal and Polyhedral Meshes”. In: Calcolo 54.4 (2017), pp. 1169–1198. DOI: 10.1007/s10092-017-0223-6.DOI
  3. [3]P. F. Antonietti, P. Houston, G. Pennesi, and E. Süli. “An Agglomeration-based Massively Parallel Non-overlapping Additive Schwarz Preconditioner for High-order Discontinuous Galerkin Methods on Polytopic Grids”. In: Mathematics of Computation 89.325 (2020), pp. 2047–2083. DOI: 10.1090/mcom/3510.DOI
  4. [4]P. F. Antonietti, F. Bonizzoni, I. Perugia, and M. Verani. A Multilevel Monte Carlo Virtual Element Method for Uncertainty Quantification of Elliptic Partial Differential Equations. 2026. DOI: 10.48550/arXiv.2604.08135.DOI
  5. [5]P. F. Antonietti and G. Pennesi. “V-cycle Multigrid Algorithms for Discontinuous Galerkin Methods on Non-nested Polytopic Meshes”. In: Journal of Scientific Computing 78.1 (2019), pp. 625–652. DOI: 10.1007/s10915-018-0783-x.DOI
  6. [6]D. Bolin and K. Kirchner. “The Rational SPDE Approach for Gaussian Random Fields with General Smoothness”. In: Journal of Computational and Graphical Statistics 29.2 (2020), pp. 274–285. DOI: 10.1080/10618600.2019.1665537.DOI
  7. [7]M. Botti and L. Mascotto. “Trace inequalities for piecewise W1,p functions over general polytopic meshes”. In: arXiv preprint arXiv:2512.09752 (2025).arxiv.org/abs/2512.09752
  8. [9]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
  9. [10]M. Croci, M. B. Giles, and P. E. Farrell. “Multilevel Quasi Monte Carlo Methods for Elliptic PDEs with Random Field Coefficients via Fast White Noise Sampling”. In: SIAM Journal on Scientific Computing 43.4 (2021), A2840–A2868. DOI: 10.1137/20M1329044.DOI
  10. [11]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
  11. [12]N. K. Chada, H. Hoel, A. Jasra, and G. E. Zouraris. “Improved Efficiency of Multilevel Monte Carlo for Stochastic PDE through Strong Pairwise Coupling”. In: Journal of Scientific Computing 93 (2022). Article number 62, p. 62. DOI: 10.1007/s10915-022-02031-2.DOI
  12. [13]K. A. Cliffe, M. B. Giles, R. Scheichl, and A. L. Teckentrup. “Multilevel Monte Carlo Methods and Applications to Elliptic PDEs with Random Coefficients”. In: Computing and Visualization in Science 14.1 (2011), pp. 3–15. DOI: 10.1007/s00791-011-0160-x.
  13. [14]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. [15]J. Charrier, R. Scheichl, and A. L. Teckentrup. “Finite Element Error Analysis of Elliptic PDEs with Random Coefficients and Its Application to Multilevel Monte Carlo Methods”. In: SIAM Journal on Numerical Analysis 51.1 (2013), pp. 322–352. DOI: 10.1137/110853054.DOI
  15. [16]Z. Dong, E. H. Georgoulis, and T. Pryer. “Recovered finite element methods on polygonal and polyhedral meshes”. In: ESAIM: Mathematical Modelling and Numerical Analysis 54.4 (2020), pp. 1309–1337.
  16. [17]C. R. Dietrich and G. N. Newsam. “Fast and Exact Simulation of Stationary Gaussian Processes through Circulant Embedding of the Covariance Matrix”. In: SIAM Journal on Scientific Computing 18.4 (1997), pp. 1088–1107. DOI: 10.1137/S1064827592240555.DOI
  17. [20]M. B. Giles. “Multilevel Monte Carlo Methods”. In: Acta Numerica 24 (2015), pp. 259–328. DOI: 10.1017/S096249291500001X.DOI
  18. [21]E. H. Georgoulis and T. Pryer. “Analysis of discontinuous Galerkin methods using mesh-dependent norms and applications to problems with rough data”. In: Calcolo 54.4 (2017), pp. 1533–1551.arxiv.org/abs/1610.04994
  19. [22]E. H. Georgoulis and T. Pryer. “Recovered finite element methods”. In: Computer methods in applied mechanics and engineering 332 (2018), pp. 303–324.DOI
  20. [23]I. G. Graham, F. Y. Kuo, D. Nuyens, R. Scheichl, and I. H. Sloan. “Analysis of circulant embedding methods for sampling stationary random fields”. In: SIAM Journal on Numerical Analysis 56.3 (2018), pp. 1871–1895. DOI: 10.1137/17M1149730.DOI
  21. [25]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
  22. [28]T. Pryer. “Polytopic symmetric interior-penalty approximation of elliptic SPDEs driven by spatial white noise”. In: arXiv preprint arXiv:2609.06082 (2026).arxiv.org/abs/2609.06082
  23. [29]D. Sanz-Alonso and R. Yang. “The SPDE approach to Matérn fields: graph representations”. In: Statistical Science 37.4 (2022), pp. 519–540. DOI: 10.1214/21-STS838.
  24. [31]A. T. A. Wood and G. Chan. “Simulation of Stationary Gaussian Processes in [0,1]^d”. In: Journal of Computational and Graphical Statistics 3.4 (1994), pp. 409–432. DOI: 10.1080/10618600.1994.10474655.DOI

Paper details

vlnc:W_nx7863fq
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents