Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-09T10:32:26.289Z Has data issue: false hasContentIssue false

Symmetry-plane model of 3D Euler flows and mapping to regular systems to improve blowup assessment using numerical and analytical solutions

Published online by Cambridge University Press:  20 April 2015

Rachel M. Mulungye
Affiliation:
Complex and Adaptive Systems Laboratory, School of Mathematical Sciences, University College Dublin, Belfield, Dublin 4, Ireland
Dan Lucas
Affiliation:
Complex and Adaptive Systems Laboratory, School of Mathematical Sciences, University College Dublin, Belfield, Dublin 4, Ireland
Miguel D. Bustamante*
Affiliation:
Complex and Adaptive Systems Laboratory, School of Mathematical Sciences, University College Dublin, Belfield, Dublin 4, Ireland
*
†Email address for correspondence: miguel.bustamante@ucd.ie

Abstract

Motivated by the work on stagnation-point-type exact solutions (with infinite energy) of 3D Euler fluid equations by Gibbon et al. (Physica D, vol. 132 (4), 1999, pp. 497–510) and the subsequent demonstration of finite-time blowup by Constantin (Int. Math. Res. Not. IMRN, vol. 9, 2000, pp. 455–465) we introduce a one-parameter family of models of the 3D Euler fluid equations on a 2D symmetry plane. Our models are seen as a deformation of the 3D Euler equations which respects the variational structure of the original equations so that explicit solutions can be found for the supremum norms of the basic fields: vorticity and stretching rate of vorticity. In particular, the value of the model’s parameter determines whether or not there is finite-time blowup, and the singularity time can be computed explicitly in terms of the initial conditions and the model’s parameter. We use a representative of this family of models, whose solution blows up at a finite time, as a benchmark for the systematic study of errors in numerical simulations. Using a high-order pseudospectral method, we compare the numerical integration of our ‘original’ model equations against a ‘mapped’ version of these equations. The mapped version is a globally regular (in time) system of equations, obtained via a bijective nonlinear mapping of time and fields from the original model equations. The mapping can be constructed explicitly whenever a Beale–Kato–Majda type of theorem is available therefore it is applicable to the 3D Euler equations (Bustamante, Physica D, vol. 240 (13), 2011, pp. 1092–1099). We show that the mapped system’s numerical solution leads to more accurate (by three orders of magnitude) estimates of supremum norms and singularity time compared with the original system. The numerical integration of the mapped equations is demonstrated to entail only a small extra computational cost. We study the Fourier spectrum of the model’s numerical solution and find that the analyticity strip width (a measure of the solution’s analyticity) tends to zero as a power law in a finite time. This is in agreement with the finite-time blowup of the fields’ supremum norms, in the light of rigorous bounds stemming from the bridge (Bustamante & Brachet, Phys. Rev. E, vol. 86 (6), 2012, 066302) between the analyticity-strip method and the Beale–Kato–Majda type of theorems. We conclude by discussing the implications of this research on the analysis of numerical solutions to the 3D Euler fluid equations.

Information

Type
Papers
Copyright
© 2015 Cambridge University Press 
Figure 0

Figure 1. Singular/non-singular behaviour of system (3.2)–(3.4) depending on the value of the model’s parameter ${\it\lambda}.$ The limiting case ${\it\lambda}=-1$ (not analysed in this paper) gives an infinite-time singularity.

Figure 1

Table 1. Summary of analytical results for the case studied in this paper. Supremum of vorticity is computable numerically from formula (3.3).

Figure 2

Figure 2. Stretching rate (${\it\gamma}$) and vorticity (${\it\omega}$) plots for ${\it\lambda}=-3/2$ at $t=0$ (a,b), 0.5 (c,d) and 1.0 (e, f) from the original 2D Euler model.

Figure 3

Figure 3. The errors $Q_{{\it\gamma}}$ (a) and $Q_{{\it\omega}}$ (b) for both the original 2D Euler model and the mapped 2D Euler model at various resolutions. Labels are (a) $N=256$ mapped system, (b) $N=256$ original system, (c) $N=512$ mapped system, (d) $N=512$ original, (e) $N=1024$ mapped, (f) $N=1024$ original, (g) $N=2048$ mapped, (h) $N=2048$ original. There is a clear accuracy gain by performing the mapping; the errors remain small for later times. Grey dotted vertical line is at ${\it\tau}=4.34$, representing the reliability time at which the $N=2048$ case becomes unresolved, see § 5.3 and table 2.

Figure 4

Figure 4. (a) Ratio between the terms $(2+{\it\lambda})\!\int _{0}^{{\it\tau}}\!{\it\sigma}_{\infty }\langle {\it\gamma}_{map}^{2}\rangle \,\text{d}{\it\tau}^{\prime }$ and $-(1+{\it\lambda})\int _{0}^{{\it\tau}}{\it\sigma}_{\infty }\,\text{d}{\it\tau}^{\prime },$ case ${\it\lambda}=-3/2,$ appearing in the exponent in (4.11). (b) Resolution study. Plots of $\langle {\it\gamma}_{map}(\cdot ,{\it\tau})^{2}\rangle$ as a function of ${\it\tau}$ using data from the numerical integration of the mapped system, at different resolutions: from top to bottom, $N=256$, 512, 1024, 2048. The curves converge to the analytically-obtained asymptotic regime $\langle {\it\gamma}_{map}(\cdot ,{\it\tau})^{2}\rangle \sim (3/11)\exp (-{\it\tau}).$

Figure 5

Figure 5. Two different resolution studies of the data from original system at different resolutions $N=256$, 512, 1024, 2048. (a) Classical plot of $1/\Vert {\it\gamma}(\cdot ,t)\Vert _{\infty },$ giving a convergence to the analytically obtained asymptotic regime $1/\Vert {\it\gamma}(\cdot ,t)\Vert _{\infty }\sim (T^{\ast }-t)/2$ (solid line). (b) New plot, in lin–log scaling, of $\Vert {\it\gamma}(\cdot ,t({\it\tau}))\Vert _{\infty }$ as a function of ${\it\tau},$ giving a convergence to the analytically-obtained asymptotic regime $\Vert {\it\gamma}(\cdot ,t({\it\tau}))\Vert _{\infty }\sim \sqrt{11/2}\exp ({\it\tau}/2)$ (solid line).

Figure 6

Figure 6. Evolution of errors of global quantities $\langle {\it\gamma}^{2}\rangle$ and $\langle {\it\gamma}_{map}^{2}\rangle$ at resolution $N=1024$, as a function of the total integration time ${\it\tau}$, obtained from (5.6)–(5.8). Note that the curves $Q_{\langle {\it\gamma}_{map}^{2}\rangle }^{\ast }$ (obtained from original system numerical data) and $Q_{\langle {\it\gamma}_{map}^{2}\rangle }$ (obtained from mapped system numerical data) are nearly the same, illustrating that their source of errors is the same. Grey dotted vertical line is at ${\it\tau}=4.34$, representing the reliability time at which the $N=2048$ case becomes unresolved, see § 5.3 and table 2.

Figure 7

Figure 7. Results at resolution $N=2048$ (except (a)) for the fit parameters of the $L^{2}$ spectra $E(k,t)$ and $L^{1}$ spectra $F(k,t)$ at several times (as function of mapped time ${\it\tau}$). (a) Resolution study ($N=256,512,1024,2048$) for $n_{E}(t({\it\tau})).$ Progressive convergence is observed towards $n_{E}\approx 5/3$ (within a $5\,\%$ error) near reliability time. (b) Results for $n_{F}(t({\it\tau}))$ (circles). Solid and dashed curves represent the upper and lower bounds $n_{E}/2$ and $(n_{E}-1)/2,$ respectively, cf. inequality (5.15). The curve $n_{F}$ is consistently between these bounds. (c) Results for $C_{E}(t({\it\tau}))$ ($+$ symbols) and $C_{F}(t({\it\tau}))$ (circles). At late times these coincide, thus confirming the isotropy of the 2D spectrum. (d) Results for ${\it\delta}_{E}(t({\it\tau}))$ ($+$ symbols) and ${\it\delta}_{F}(t({\it\tau}))$ (circles). These coincide, in agreement with inequalities (5.15). The horizontal line is the smallest resolved scale ${\rm\Delta}x=2{\rm\pi}/2048$ and the dotted line corresponds to the numerical fit ${\it\delta}=\exp (0.53{-}1.33{\it\tau})$ obtained using data in the range $3\leqslant {\it\tau}\leqslant 4.34.$

Figure 8

Figure 8. (a) and (b) Snapshots of stretching-rate 1D shell spectra $E(k,t)$ at mapped times ${\it\tau}=1,2,3,4,5$ (curves progressing from bottom to top) in log–log scale (a) and lin–log scale (b). The slopes of the straight lines on the left panel are proportional to the exponent $n_{E}(t)$. The slopes of the straight lines on the right panel are proportional to the logarithmic decrement ${\it\delta}_{E}(t).$ Resolution $N=2048.$

Figure 9

Figure 9. Snapshots of stretching-rate 2D spectra at mapped times ${\it\tau}=2$ (a) and ${\it\tau}=4$ (b). Resolution $N=2048.$

Figure 10

Figure 10. Errors in the running estimates of singularity time $T^{\ast }$ using data from original system’s numerical integration (lines) and mapped system’s numerical integration (symbols) at different resolutions: from top to bottom in each case, $N=256$, 512, 1024, 2048.

Figure 11

Figure 11. The singularity-time error $\mathscr{E}_{A,B}$ (error between estimated singularity time and analytically computed singularity time $T^{\ast }$, (5.33)), as a function of CPU time for both the original system, method A (filled symbols) and the mapped system, method B (open symbols) at various resolutions: $N=256$ (squares, red online), $N=512$ (circles, green online), $N=1024$ (triangles, blue online), $N=2048$ (diamonds, magenta online). The CPU overhead of applying the mapping is shown to be more than covered by the accuracy gain.

Figure 12

Table 2. Summary of results for a range of resolutions: reliability times, obtained using the stretching-rate spectra (original or mapped system give the same reliability times); relative error of the estimated singularity time $T_{A}^{0}$ stemming from original system’s numerical data (method A); relative error of the estimated singularity time $T_{B}^{0}$ stemming from mapped system’s numerical data (method B).

Figure 13

Figure 12. Schematic of point stencil for bisection and quarter-section interpolation centred about the current maximum. Unfilled circles are the adjacent collocation points (at the first iteration, neighbouring interpolated points at following steps), larger filled circles the midpoint stencil, small filled circles (plus the midpoints) the $7\times 7$ interpolated grid.

Figure 14

Table 3. Table showing CPU and error measures for the interpolation methods investigated at resolution $N=512$ and $T=1.0$ (top) and $T=0.8$ (bottom). Note CPU time is evaluated by 1000 executions of the interpolation subroutine. No interpolation simply means we take the maximal collocation value. Gaussian fails after $t=0.65$ and reverts to collocation points thereafter. Here ${\it\omega}_{num}(X_{+}(t),Y_{+}(t),t)$ is evaluated in each case using $P_{N,k}$ but $(X_{+}(t),Y_{+}(t),t)$ found from the method indicated.

Figure 15

Figure 13. Plot of errors for a selection of interpolation methods investigated at resolution $N=512$. Black thick line, no interpolation; (blue online) thick dashed line, $P_{6,k}$ quarter-section; (red online) thin dashed line, $P_{4,k}$ quarter-section; thin grey line, $P_{6,k}$ on $10^{2}$ points; (green online) circles, $P_{4,k}$ maximisation; (magenta online) stars, Gaussian fit.