Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-07T06:52:02.486Z Has data issue: false hasContentIssue false

On the computation of measure-valued solutions

Published online by Cambridge University Press:  23 May 2016

Ulrik S. Fjordholm
Affiliation:
Department of Mathematical Sciences, Norwegian University of Science and Technology, Trondheim, N-7491, Norway E-mail: ulrik.fjordholm@math.ntnu.no
Siddhartha Mishra
Affiliation:
Seminar for Applied Mathematics, ETH Zürich, Rämistrasse 101, Zürich, Switzerland E-mail: smishra@sam.math.ethz.ch
Eitan Tadmor
Affiliation:
Center of Scientific Computation and Mathematical Modeling (CSCAMM), Department of Mathematics, Institute for Physical Sciences and Technology (IPST), University of Maryland, MD 20742-4015, USA E-mail: tadmor@cscamm.umd.edu
Rights & Permissions [Opens in a new window]

Abstract

A standard paradigm for the existence of solutions in fluid dynamics is based on the construction of sequences of approximate solutions or approximate minimizers. This approach faces serious obstacles, most notably in multi-dimensional problems, where the persistence of oscillations at ever finer scales prevents compactness. Indeed, these oscillations are an indication, consistent with recent theoretical results, of the possible lack of existence/uniqueness of solutions within the standard framework of integrable functions. It is in this context that Young measures – parametrized probability measures which can describe the limits of such oscillatory sequences – offer the more general paradigm of measure-valued solutions for these problems.

We present viable numerical algorithms to compute approximate measure-valued solutions, based on the realization of approximate measures as laws of Monte Carlo sampled random fields. We prove convergence of these algorithms to measure-valued solutions for the equations of compressible and incompressible inviscid fluid dynamics, and present a large number of numerical experiments which provide convincing evidence for the viability of the new paradigm. We also discuss the use of these algorithms, and their extensions, in uncertainty quantification and contexts other than fluid dynamics, such as non-convex variational problems in materials science.

Information

Type
Research Article
Copyright
© Cambridge University Press, 2016 
Figure 0

Figure 1.1. Initial data for the Richtmyer–Meshkov problem (7.2).

Figure 1

Figure 1.2. Approximate density at time $t=4$ for a single sample, computed with the high-resolution finite volume scheme of Käppeli et al. (2011), for the Richtmyer–Meshkov problem (7.2) for different grid resolutions.

Figure 2

Figure 1.3. Cauchy rates (1.2) for the density ($y$-axis) in a single sample of the Richtmyer–Meshkov problem (7.2) at time $t=4$, with respect to different grid resolutions ($x$-axis).

Figure 3

Figure 1.4. Initial data for the perturbed vortex sheet (8.1).

Figure 4

Figure 1.5. Flat vortex sheet (8.1) for the incompressible Euler equations. Pointwise kinetic energy at time $t=2$, computed with the spectral method (6.4) at Fourier mode resolutions ranging from $128^{2}$ to $1024^{2}$.

Figure 5

Figure 1.6. Cauchy rates (1.4) for the computation of flat vortex sheet (8.1) for the incompressible Euler equations: non-convergence of the spectral method (6.4) with respect to an increasing number of Fourier modes $N$.

Figure 6

Figure 7.1. The mean density for the Richtmyer–Meshkov problem with initial data (7.2) for different grid resolutions at time $t=4$. All results are obtained with $400$ Monte Carlo samples.

Figure 7

Figure 7.2. Cauchy rates (7.5) for the mean (a) and variance (b) versus grid resolutions ($x$-axis) at time $t=4$ for the Richtmyer–Meshkov problem (7.2). All results are obtained with $400$ Monte Carlo samples.

Figure 8

Figure 7.3. Variance of the density with initial data (7.2) for different grid resolutions at time $t=4$. All results are obtained with $400$ Monte Carlo samples.

Figure 9

Figure 7.4. Approximate density at time $T=2$, computed with the TeCNO2 scheme for a single sample with initial data (7.6) for different initial perturbation amplitudes ${\it\varepsilon}$ on a grid of $1024^{2}$ points.

Figure 10

Figure 7.5. The Cauchy rates ($L^{1}$ difference for successively reduced ${\it\varepsilon}$) for the density at $t=2$ ($y$-axis), versus different values of the perturbation parameter ${\it\varepsilon}$ ($x$-axis).

Figure 11

Figure 7.6. Approximate sample means of the density for the Kelvin–Helmholtz problem (7.6) at time $t=2$ and different values of perturbation parameter ${\it\varepsilon}$. All the computations are on a grid of $1024^{2}$ mesh points and $400$ Monte Carlo samples.

Figure 12

Figure 7.7. Cauchy rates for the sample mean and the sample variance of the density ($y$-axis) for the Kelvin–Helmholtz problem (7.6) for different values of ${\it\varepsilon}$ ($x$-axis). All the computations are on a grid of $1024^{2}$ mesh points and $400$ Monte Carlo samples.

Figure 13

Figure 7.8. Approximate sample variances of the density for the Kelvin–Helmholtz instability at time $t=2$ and different values of perturbation parameter ${\it\varepsilon}$. All the computations are on a grid of $1024^{2}$ mesh points and $400$ Monte Carlo samples.

Figure 14

Figure 7.9. Time evolution of the approximate PDF for density ${\it\rho}$ at the points $x=(0.5,0.7)$ (a–e) and $x=(0.5,0.8)$ (f–j) on a grid of $1024^{2}$ mesh points.

Figure 15

Figure 7.10. The approximate PDF for density ${\it\rho}$ at the points $x=(0.5,0.7)$ (a–d) and $x=(0.5,0.8)$ (e–h) on a series of meshes.

Figure 16

Figure 8.1. Perturbed initial data with ${\it\varepsilon}=0.0512$, ${\it\rho}=0.001$.

Figure 17

Figure 8.2. Passively advected tracer at $t=2$ for ${\it\varepsilon}=0.0512$ (a), 0.0256 (b), 0.0128 (c), 0.0064 (d).

Figure 18

Figure 8.3. Cauchy rates ($L^{2}$ differences in successive approximations) with respect to ${\it\varepsilon}$ for a single sample of the flat vortex sheet (8.1).

Figure 19

Figure 8.4. Convergence of mean of the $x$-component of the velocity at time $t=2$, for the flat vortex sheet with respect to $N$ (number of Fourier modes).

Figure 20

Figure 8.5. Convergence of second moment of the $y$-component of the velocity at time $t=2$, for the flat vortex sheet, with respect to $N$ (number of Fourier modes).

Figure 21

Figure 8.6. Cauchy rates with respect to $N$, at time $t=2$.

Figure 22

Figure 8.7. Convergence of mean, at time $t=2$, for the $x$-component of the velocity, with respect to ${\it\varepsilon}$.

Figure 23

Figure 8.8. Convergence of second moment at time $t=2$, for the $y$-component of the velocity field, with respect to ${\it\varepsilon}$.

Figure 24

Figure 8.9. Cauchy rates with respect to ${\it\varepsilon}$.

Figure 25

Figure 8.10. One-dimensional slices of the mean (a) and the variance (b) computed with different values of ${\it\varepsilon}$.

Figure 26

Figure 8.11. Flat vortex sheet: (a) mean of the $x$-component of the velocity field, (b) second moment of $y$-component of the velocity field (from Leonardi and Mishra 2016) on a $512^{2}$ grid, to be compared with the spectral method.

Figure 27

Figure 8.12. Flat vortex sheet: mean for the $x$-component of the velocity field, at time $t=2$, computed with $N=1024$ Fourier modes and with different types of initial perturbations.

Figure 28

Figure 8.13. Flat vortex sheet: second moment for the $y$-component of the velocity field, at time $t=2$, computed with $N=1024$ Fourier modes and with different types of perturbations.

Figure 29

Figure 11.1. Direct method for the vanishing dispersion limit. The mean and the variance, at time $t=0.15$, of the approximate measure-valued solution for the vanishing dispersion limit of the generalized Burgers equation (11.2), are computed with the direct method (11.1), based on the finite difference discretization of Laumer (2014), and compared with the mean and the variance computed with the method of McLaughlin and Strain (1994). (a) Implicit Euler time-stepping, (b) Crank–Nicolson time-stepping. Both schemes use $M=100$ in (11.1).

Figure 30

Figure 11.2. Perturbation method for the vanishing dispersion limit. The mean and the variance, at time $t=0.15$, of the approximate measure-valued solution for the vanishing dispersion limit of the generalized Burgers equation (11.2), are computed with Algorithm 4.3, based on the finite difference discretization of Laumer (2014), and compared with the mean and the variance computed with the method of McLaughlin and Strain (1994). (a) Implicit Euler time-stepping, (b) comparison of implicit Euler and Crank–Nicolson time-stepping. Both schemes use $100$ Monte Carlo samples.

Figure 31

Figure 11.3. Multi-level Monte Carlo Algorithm 11.1, used to compute the measure-valued solution for the Kelvin–Helmholtz problem for the compressible Euler equations, described in Section 7.2. (a) Variance of the difference in successive levels of mesh resolution ($y$-axis) versus mesh resolution ($x$-axis). (b) Error in the mean (in $L^{1}$ with respect to a reference solution computed with a Monte Carlo simulation on a $2048^{2}$ grid with $2048$ samples) ($y$-axis) versus number of MLMC samples at the finest grid resolution of $1024^{2}$ ($x$-axis). Specifically, $E(M_{L})=\Vert \text{MLMC}(u,M_{L},1024)-\text{MC}(u,2048,2048)\Vert _{L^{1}(D)}$.

Figure 32

Figure 11.4. Stabilized version of the multi-level Monte Carlo Algorithm 11.1, used to compute the measure-valued solution for the Kelvin–Helmholtz problem for the compressible Euler equations, described in Section 7.2. (a) Variance of the difference in successive levels of mesh resolution ($y$-axis) versus mesh resolution ($x$-axis). (b) Error in the mean (in $L^{1}$ with respect to a reference solution computed with a Monte Carlo simulation on a $2048^{2}$ grid with $2048$ samples) ($y$-axis) versus number of MLMC samples at the finest grid resolution of $1024^{2}$ ($x$-axis). Specifically, $E(M_{L})=\Vert \text{MLMC}(u,M_{L},1024)-\text{MC}(u,2048,2048)\Vert _{L^{1}(D)}$.