Abstract
Lax-Wendroff Flux Reconstruction (LWFR) is a single-stage, high order, quadrature free method for solving hyperbolic conservation laws. We develop a subcell based limiter by blending LWFR with a lower order scheme, either first order finite volume or MUSCL-Hancock scheme. While the blending with a lower order scheme helps to control spurious oscillations, it may not guarantee admissibility of discrete solution, e.g., positivity property of quantities like density and pressure. By exploiting the subcell structure and admissibility of lower order schemes, we devise a strategy to ensure that the blended scheme is admissibility preserving for the mean values and then use a scaling limiter to obtain admissibility of the polynomial solution. For MUSCL-Hancock scheme on non-cell-centered subcells, we develop a slope limiter, time step restrictions and suitable blending of higher order fluxes, that ensures admissibility of lower order updates and hence that of the cell averages. By using the MUSCL-Hancock scheme on subcells and Gauss-Legendre points in flux reconstruction, we improve small-scale resolution compared to the subcell-based RKDG blending scheme with first order finite volume method and Gauss-Legendre-Lobatto points. We demonstrate the performance of our scheme on compressible Euler’s equations, showcasing its ability to handle shocks and preserve small-scale structures.
Similar content being viewed by others
References
Ames Resarch Staff - National Advisory Committee for Aeronautics, Report 1135 - equations, tables and charts for compressible flow, (1951)
Attig, N., Gibbon, P., Lippert, T.: Trends in supercomputing: the European path to exascale. Comput. Phys. Commun. 182, 2041–2046 (2011)
Babbar, A., Chandrashekar, P., Kenettinkara, S.K.: Admissibility preserving subcell based blending limiter with Tenkai.jl. https://github.com/Arpit-Babbar/jsc2023, (2023)
Babbar, A., Chandrashekar, P., Kenettinkara, S.K.: Tenkai.jl: temporal discretizations of high-order PDE solvers. https://github.com/Arpit-Babbar/Tenkai.jl, (2023)
Babbar, A., Kenettinkara, S.K., Chandrashekar, P.: Lax-wendroff flux reconstruction method for hyperbolic conservation laws. J. Comput. Phys. 467, 111423 (2022)
Balsara, D., Altmann, C., Munz, C., Dumbser, M.: A sub-cell based indicator for troubled zones in RKDG schemes and a novel class of hybrid RKDG+HWENO schemes. J. Comp. Phys. 226, 586–620 (2007)
Berthon, C.: Why the MUSCL–hancock scheme is l1-stable. Numer. Math. 104, 27–46 (2006)
Bezanson, J., Edelman, A., Karpinski, S., Shah, B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59, 65–98 (2017)
Biswas, R., Devine, K.D., Flaherty, J.E.: Parallel, adaptive finite element methods for conservation laws. Appl. Numeri. Math. 14, 255–283 (1994)
Burbeau, A., Sagaut, P., Bruneau, C.-H.: A problem-independent limiter for high-order runge–kutta discontinuous galerkin methods. J. Comput. Phys. 169, 111–150 (2001)
Bürger, R., Kenettinkara, S.K., Zorío, D.: Approximate Lax–Wendroff discontinuous Galerkin methods for hyperbolic conservation laws. Comput. Math. Appl. 74, 1288–1310 (2017)
Canuto, C., Hussaini, M., Quarteroni, A., Zang, T.: Spectral Methods: Fundamentals in Single Domains. Scientific Computation, Springer, Berlin Heidelberg (2007)
Carrillo, H., Macca, E., París, C., Russo, G., Zorío, D.: An order-adaptive compact approximation Taylor method for systems of conservation laws. J. Comput. Phys. 438, 110358 (2021)
Carrillo, H., Parés, C., Zorío, D.: Lax–Wendroff approximate taylor methods with fast and optimized weighted essentially non-oscillatory reconstructions. J. Sci. Comput. 86, 15 (2021)
Casoni, E., Peraire, J., Huerta, A.: One-dimensional shock-capturing for high-order discontinuous Galerkin methods. Int. J. Numer. Meth. Fluids 71, 737–755 (2013)
Chen, Z., Huang, H., Yan, J.: Third order maximum-principle-satisfying direct discontinuous galerkin methods for time dependent convection diffusion equations on unstructured triangular meshes. J. Comput. Phys. 308, 198–217 (2016)
Cicchino, A., Nadarajah, S., Del Rey Fernández, D.C.: Nonlinearly stable flux reconstruction high-order methods in split form. J. Comput. Phys. 458, 111094 (2022)
Clain, S., Diot, S., Loubère, R.: A high-order finite volume method for hyperbolic systems: multi-dimensional optimal order detection (MOOD). J. Comp. Phys. 230, 4028–4050 (2011)
Cockburn, B., Karniadakis, G.E., Shu, C.-W., Griebel, M., Keyes, D.E., Nieminen, R.M., Roose, D., Schlick, T., eds.: Discontinuous Galerkin Methods: Theory, Computation and Applications, vol. 11 of Lecture Notes in Computational Science and Engineering, Springer Berlin Heidelberg, Berlin, Heidelberg, (2000). bibtex: Cockburn2000
Cockburn, B., Lin, S.-Y., Shu, C.-W.: TVB Runge–Kutta local projection discontinuous Galerkin finite element method for conservation laws III: one-dimensional systems. J. Comput. Phys. 84, 90–113 (1989)
Cockburn, B., Shu, C.-W.: TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws II. General framework. Math. Comput. 52, 411–411 (1989)
Cockburn, B., Shu, C.-W.: The runge-kutta local projection \(p^1\)-discontinuous-galerkin finite element method for scalar conservation laws. ESAIM Math. Model. Numer. Anal.- Modélisation Mathématique et Analyse Numérique 25, 337–361 (1991)
Cui, S., Ding, S., Wu, K.: Is the classic convex decomposition optimal for bound-preserving schemes in multiple dimensions? J. Comput. Phys. 476, 111882 (2023)
de la Rosa, J.N., Munz, C.D.: Hybrid DG/FV schemes for magnetohydrodynamics and relativistichydrodynamics. Comp. Phys. Commun. 222, 113–135 (2018)
Diot, S., Clain, S., Loubère, R.: Improved detection criteria for the multi-dimensional optimal order detection (MOOD) on unstructured meshes with very high-order polynomials. Comput. Fluids 64, 43–63 (2012)
Diot, S., Loubère, R., Clain, S.: The MOOD method in the three-dimensional case: very-high-order finite volume method for hyperbolic systems. Int. J. Numer. Meth. Fluids 73, 362–392 (2013)
Dumbser, M., Balsara, D.S., Toro, E.F., Munz, C.-D.: A unified framework for the construction of one-step finite volume and discontinuous Galerkin schemes on unstructured meshes. J. Comput. Phys. 227, 8209–8253 (2008)
Dumbser, M., Loubère, R.: A simple robust and accurate a posteriorisub-cell finite volume limiter for the discontinuousGalerkin method on unstructured meshes. J. Comp. Phys. 319, 163–199 (2016)
Dumbser, M., Zanotti, O., Loubère, R., Diot, S.: A posteriori subcell limiting of the discontinuous Galerkin finite element method for hyperbolic conservation laws. J. Comp. Phys. 278, 47–75 (2014)
Dzanic, T., Witherden, F.: Positivity-preserving entropy-based adaptive filtering for discontinuous spectral element methods. J. Comput. Phys. 468, 111501 (2022)
Emery, A.F.: An evaluation of several differencing methods for inviscid fluid flow problems. J. Comput. Phys. 2, 306–331 (1968)
Glimm, J., Klingenberg, C., McBryan, O., Plohr, B., Sharp, D., Yaniv, S.: Front tracking and two-dimensional riemann problems. Adv. Appl. Math. 6, 259–290 (1985)
Ha, Y., Gardner, C., Gelb, A., Shu, C.: Numerical simulation of high mach number astrophysical jets with radiative cooling. J. Sci. Comput. 24, 597–612 (2005)
Hennemann, S., Rueda-Ramírez, A.M., Hindenlang, F.J., Gassner, G.J.: A provably entropy stable subcell shock capturing approach for high order split form dg for the compressible euler equations. J. Comput. Phys. 426, 109935 (2021)
Huerta, A., Casoni, E., Peraire, J.: A simple shock-capturing technique for high-order discontinuous Galerkin methods. Int. J. Numer. Meth. Fluids 69, 1614–1632 (2012)
Huynh, H.T.: A Flux Reconstruction Approach to High-Order Schemes Including Discontinuous Galerkin Methods, Miami, FL, AIAA (June 2007)
Jameson, A., Vincent, P.E., Castonguay, P.: On the non-linear stability of flux reconstruction schemes. J. Sci. Comput. 50, 434–445 (2012)
Klöckner, A., Warburton, T., Hesthaven, J.: Viscous shock capturing in a time-explicit discontinuous galerkin method. Math. Model. Nat. Phenom. 6, 57 (2011)
Krivodonova, L.: Limiters for high-order discontinuous galerkin methods. J. Comput. Phys. 226, 879–896 (2007)
Lax, P.D., Liu, X.-D.: Solution of two-dimensional riemann problems of gas dynamics by positive schemes. SIAM J. Sci. Comput. 19, 319–340 (1998)
Lee, Y., Lee, D.: A single-step third-order temporal discretization with Jacobian-free and Hessian-free formulations for finite difference methods. J. Comput. Phys. 427, 110063 (2021)
LeVeque, R.J.: High-resolution conservative algorithms for advection in incompressible flow. SIAM J. Numer. Anal. 33, 627–665 (1996)
Lu, J., Liu, Y., Shu, C.-W.: An oscillation-free discontinuous galerkin method for scalar hyperbolic conservation laws. SIAM J. Numer. Anal. 59, 1299–1324 (2021)
Meena, A.K., Kumar, H.: Robust MUSCL Schemes for Ten-Moment Gaussian Closure Equations with Source Terms, Int. J. Finite Vol., (2017)
Moe, S.A., Rossmanith, J.A., Seal, D.C.: Positivity-preserving discontinuous galerkin methods with lax-wendroff time discretizations. J. Sci. Comput. 71, 44–70 (2017)
Pazner, W.: Sparse invariant domain preserving discontinuous galerkin methods with subcell convex limiting. Comput. Methods Appl. Mech. Eng. 382, 113876 (2021)
Persson, P.-O., Peraire, J.: Sub-Cell Shock Capturing for Discontinuous Galerkin Methods, in 44th AIAA Aerospace Sciences Meeting and Exhibit. Aerospace Sciences Meetings, American Institute of Aeronautics and Astronautics (2006)
Qiu, J., Dumbser, M., Shu, C.-W.: The discontinuous Galerkin method with Lax-Wendroff type time discretizations. Comput. Methods Appl. Mech. Eng. 194, 4528–4543 (2005)
Qiu, J., Shu, C.-W.: Finite difference WENO schemes with Lax-Wendroff-type time discretizations. SIAM J. Sci. Comput. 24, 2185–2198 (2003)
Qiu, J., Shu, C.-W.: Runge Kutta discontinuous Galerkin method using WENO limiters. SIAM J. Sci. Comput. 26, 907–929 (2005)
Ranocha, H., Schlottke-Lakemper, M., Winters, A.R., Faulhaber, E., Chan, J., Gassner, G.: Adaptive numerical simulations with Trixi.jl: a case study of Julia for scientific computing, Proceedings of the JuliaCon Conferences, 1, p. 77 (2022)
Reed, W.H., Hill, T.R.: Triangular Mesh Methods for the Neutron Transport Equation, in National Topical Meeting on Mathematical Models and Computational Techniques for Analysis of Nuclear Systems, Ann Arbor, Michigan, Los Alamos Scientific Lab., N.Mex. (USA) (Oct. 1973)
Rueda-Ramírez, A., Gassner, G.: A Subcell Finite Volume Positivity-Preserving Limiter for DGSEM Discretizations of the Euler Equations, in 14th WCCM-ECCOMAS Congress, CIMNE, (2021)
Rueda-Ram’irez, A.M., Hennemann, S., Hindenlang, F., Winters, A.R., Gassner, G.J.: An entropy stable nodal discontinuous galerkin method for the resistive mhd equations. Part ii: subcell finite volume shock capturing. J. Comput. Phys. 444, 110580 (2020)
Rueda-Ramírez, A.M., Pazner, W., Gassner, G.J.: Subcell limiting strategies for discontinuous galerkin spectral element methods. Comput. Fluids 247, 105627 (2022)
Rusanov, V.: The calculation of the interaction of non-stationary shock waves and obstacles. USSR Comput. Math. Math. Phys. 1, 304–320 (1962)
Schlottke-Lakemper, M., Winters, A.R., Ranocha, H., Gassner, G.J.: A purely hyperbolic discontinuous Galerkin approach for self-gravitating gas dynamics. J. Comput. Phys. 442, 110467 (2021)
SEDOV, L.: Chapter iv - one-dimensional unsteady motion of a gas, in Similarity and Dimensional Methods in Mechanics, L. SEDOV, ed., Academic Press, pp. 146–304 (1959)
Shu, C.-W., Osher, S.: Efficient implementation of essentially non-oscillatory shock-capturing schemes, II. J. Comput. Phys. 83, 32–78 (1989)
Sonntag, M., Munz, C.D.: Shock capturing for discontinuous Galerkin methods using finite volume subcells, in Finite Volumes for Complex Applications VII, Springer, pp. 945–953 (2014)
Spiegel, S.C., DeBonis, J.R., Huynh, H.:Overview of the NASA Glenn Flux Reconstruction Based High-Order Unstructured Grid Code, in 54th AIAA Aerospace Sciences Meeting, San Diego, California, USA, American Institute of Aeronautics and Astronautics. (2016)
Springel, V.: E pur si muove: Galilean-invariant cosmological hydrodynamical simulations on a moving mesh. Mon. Not. R. Astron. Soc. 401, 791–851 (2010)
Subcommittee, A., et al.: Top ten exascale research challenges, US Department Of Energy Report, (2014)
Takayama, K., Inoue, O.: Shock wave diffraction over a 90 degree sharp corner ? Posters presented at 18th ISSW. Shock Waves 1, 301–312 (1991)
Titarev, V., Toro, E.: ADER schemes for three-dimensional non-linear hyperbolic systems. J. Comput. Phys. 204, 715–736 (2005)
Titarev, V.A., Toro, E.F.: ADER: arbitrary high order godunov approach. J. Sci. Comput. 17, 609–618 (2002)
Trojak, W., Witherden, F.D.: A new family of weighted one-parameter flux reconstruction schemes. Comput. Fluids 222, 104918 (2021)
Van Leer, B.: Towards the ultimate conservative difference scheme. iv. A new approach to numerical convection. J. Comput. Phys. 23, 276–299 (1977)
van Leer, B.: On the relation between the upwind-differencing schemes of godunov, engquist-osher and roe. SIAM J. Sci. Stat. Comput. 5, 1–20 (1984)
Vilar, F.: A posteriori correction of high-order discontinuous Galerkin scheme through subcell finite volume formulation and flux reconstruction. J. Comput. Phys. 387, 245–279 (2019)
Vincent, P.E., Castonguay, P., Jameson, A.: A new class of high-order energy stable flux reconstruction schemes. J. Sci. Comput. 47, 50–72 (2011)
Vincent, P.E., Farrington, A.M., Witherden, F.D., Jameson, A.: An extended range of stable-symmetric-conservative flux reconstruction correction functions. Comput. Methods Appl. Mech. Eng. 296, 248–272 (2015)
Witherden, F., Vincent, P.: On nodal point sets for flux reconstruction. J. Comput. Appl. Math 381, 113014 (2021)
Woodward, P., Colella, P.: The numerical simulation of two-dimensional fluid flow with strong shocks. J. Comput. Phys. 54, 115–173 (1984)
Xu, Z., Shu, C.-W.: Third order maximum-principle-satisfying and positivity-preserving lax-wendroff discontinuous galerkin methods for hyperbolic conservation laws. J. Comput. Phys. 470, 111591 (2022)
Yee, H., Sandham, N., Djomehri, M.: Low-dissipative high-order shock-capturing methods using characteristic-based filters. J. Comput. Phys. 150, 199–238 (1999)
Zhang, T., Zheng, Y.: Conjecture on the structure of solutions of the riemann problem for two-dimensional gas dynamics systems. SIAM J. Math. Anal. 21, 593–630 (1990)
Zhang, X., Shu, C.-W.: On maximum-principle-satisfying high order schemes for scalar conservation laws. J. Comput. Phys. 229, 3091–3120 (2010)
Zhang, X., Shu, C.-W.: On positivity-preserving high order discontinuous galerkin schemes for compressible euler equations on rectangular meshes. J. Comput. Phys. 229, 8918–8934 (2010)
Zhang, X., Shu, C.-W.: Positivity-preserving high order finite difference weno schemes for compressible euler equations. J. Comput. Phys. 231, 2245–2258 (2012)
Zorío, D., Baeza, A., Mulet, P.: An Approximate Lax-Wendroff-Type Procedure for High Order Accurate Schemes for Hyperbolic Conservation Laws. J. Sci. Comput. 71, 246–273 (2017)
Funding
The work of Arpit Babbar and Praveen Chandrashekar is supported by the Department of Atomic Energy, Government of India, under project no. 12-R &D-TFR\(-\)5.01-0520. The work of Sudarshan Kumar Kenettinkara is supported by the Science and Engineering Research Board, Government of India, under MATRICS project no. MTR/2017/000649.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix A: Admissibility of MUSCL-Hancock Scheme for General Grids
For the conservation law (1), define \(\sigma \left( u_1, u_2 \right) \) as
where \(\rho (A)\) denotes the spectral radius of matrix A. For the 2-D hyperbolic conservation law
where (f, g) are Cartesian components of the flux vector; the wave speed estimates in x, y directions are defined as follows
We assume that the admissibility set \(\mathcal {U}_{\text {ad}}\) of the conservation law is a convex subset of \(\mathbb {R}^d\) which can be written as (2). The following assumption is made concerning the admissibility of first order finite volume scheme.
Admissibility of first order finite volume scheme. Under the time step restriction
the first order finite volume method
is admissibility preserving, i.e., \(u_j^n \in \mathcal {U}_{\text {ad}}\) for all j implies that \(u_j^{n+1} \in \mathcal {U}_{\text {ad}}\) for all j.
1.1 A.1 Review of MUSCL-Hancock Scheme
Here we review the MUSCL-Hancock scheme for general uniform grids that need not be cell-centered (Fig. 22) in the sense that
for some j where \(x_j\) is the solution point in finite volume element \((x_{j-\frac{1}{2}}, x_{j+\frac{1}{2}})\). The grid used in the blending limiter (Fig. 2) is a special case of (36).
For the \(j^{\text {th}}\) finite volume element \((x_{j - \frac{1}{2}}, x_{j + \frac{1}{2}})\), the constant state is denoted \(u_j^n\) and the linear approximation will be denoted \(r^n_j (x)\). For conservative reconstruction, the linear reconstruction is given by
The values on left and right faces will be computed as
We use Taylor’s expansion to evolve the solution to \(t_n + \frac{1}{2}\Delta t\)
where \(\Delta x_j = x_{{j+\frac{1}{2}}} - x_{{j-\frac{1}{2}}}\). The final update is performed by using an approximate Riemann solver on the evolved quantities
where
is some numerical flux function. The key idea of the proof is to write the evolution \(u_{j}^{{n+\frac{1}{2}}, \pm }\) from (38) as a convex combination of exact solution of some Riemann problem and the final update \(u_j^{n+1}\) from (39) as a convex combination of first order finite volume updates on appropriately chosen subcells.
1.2 A.2 Primary Generalization for Proof
For the uniform, cell-centered case, Berthon [7] defined \(u_j^{*,\pm }\) to satisfy
We generalize it for non-cell centred grids (36)
where
This choice was made to keep the natural extension of \(u_j^{*,\pm }\) in the conservative reconstruction case:
noting that \(u_j^{n, \pm }\) are given by (37).
1.3 A.3 Proving Admissibility
The following lemma about conservation laws will be crucial in the proof.
Lemma 1
Consider the 1-D Riemann problem
in \([-h,h] \times [0,\Delta t]\) where
Then, for all \(t \le \Delta t\),
Proof
Integrate the conservation law over \((- h, 0) \times (0, t)\)
where, by self-similarity of solution of Riemann problem, \(\tilde{u}\) is defined so that \(u(x,t) = \tilde{u}(x/t)\) and \(f(u(-h,t)) = f(u_l)\) is obtained as characteristics from [0, h] do not reach \(x=-h\) due to the time restriction (41). Rewriting gives
Similarly,
If \(\tilde{u}\) is discontinuous at \(x=0\), by Rankine-Hugoniot conditions, we will have a stationary jump at \(x/t=0\) and obtain \(f(\tilde{u}(0^+)) = f(\tilde{u}(0^-))\). The same trivially holds if \(\tilde{u}\) is continuous at \(x/t=0\). Thus, we can sum the previous two identities to get (42). \(\square \)
We will now give a criterion under which we can prove \(u_j^{{n+\frac{1}{2}},\pm } \in \mathcal {U}_{\text {ad}}\), i.e., the evolution step (38) preserves \(\mathcal {U}_{\text {ad}}\).
Lemma 2
Define \(\mu _\pm \) by (40) and pick \(u_j^{*, \pm }\) to satisfy
Assume \(u_j^{n, \pm }, u_j^{*, \pm } \in \mathcal {U}_{\text {ad}}\) and the CFL restrictions
are satisfied. Then, \(u_j^{n + \frac{1}{2}, \pm }\) given by the first step (38) of the MUSCL-Hancock scheme is in \(\mathcal {U}_{\text {ad}}\).
Proof
We will prove that \(u_j^{n + \frac{1}{2}, +} \in \mathcal {U}_{\text {ad}}\), and the proof for \(u_j^{n + \frac{1}{2}, -}\) shall follow similarly. The key idea is to write \(u_j^{n + \frac{1}{2}, {+}}\) as the exact solution of some Riemann problems. Define \(u^h (x, t): (x_{j-\frac{1}{2}}, x_{j+\frac{1}{2}}) \times (0, \Delta t/2) \rightarrow \mathcal {U}_{\text {ad}}\) to be the weak solution of the Cauchy problem with initial data
where
Under our time step restrictions (44), the solution \(u^h\) at time \(\frac{\Delta t}{2}\) is made up of non-interacting Riemann problems centered at \(x_{j \pm \frac{1}{4}}\), see Fig. 23. We take the projection of \(u^h (x, \Delta t / 2)\) on piecewise-constant functions
Since we assumed that the conservation law preserves \(\mathcal {U}_{\text {ad}}\), we get \(\tilde{u}_j^{n + \frac{1}{2}, +} \in \mathcal {U}_{\text {ad}}\). If we prove \(\tilde{u}_j^{n + \frac{1}{2}, +} = u_j^{n + \frac{1}{2}, +}\), we will have our claim. Applying Lemma 42 to the two non-interacting Riemann problems, we get
This proves our claim. \(\square \)
Now, we introduce a new variable \(u_j^{n + \frac{1}{2}, *}\) defined as follows:
As illustrated in Fig. 24, we evolve each state according to the associated first order scheme to define the following
Recall that (39) is
Thus, assuming \(u_j^{n + \frac{1}{2}\pm }, u_j^{n + \frac{1}{2}, *} \in \mathcal {U}_{\text {ad}}\) for all j, and since \(\frac{1}{2}\mu _-+ \frac{1}{2}\mu _+= 1\), we get \(u_j^{n+1} \in \mathcal {U}_{\text {ad}}\) under the following time step restrictions arising from the assumed time step requirement (35) for admissibility of the first order finite volume method
This can be summarised in the following Lemma.
Lemma 3
Assume that the states \(\left\{ u_j^{n + \frac{1}{2}, \pm } \right\} _j\), \(\left\{ u_j^{n + \frac{1}{2}, *} \right\} _j\) belong to \(\mathcal {U}_{\text {ad}}\), where \(u_j^{n + \frac{1}{2}, *}\) is defined as in (45). Then, the updated solution \(u_j^{n+1}\) of MUSCL-Hancock scheme (37–39) is in \(\mathcal {U}_{\text {ad}}\) under the CFL conditions (47).
Since Lemma 2 states that \(u_j^{n + \frac{1}{2}, \pm } \in \mathcal {U}_{\text {ad}}\) if \(u_j^{*, \pm } \in \mathcal {U}_{\text {ad}}\), the only new condition pertains to \(u_j^{n + \frac{1}{2}, *}\). Our goal now is to understand this condition, and ultimately prove that it follows from the requirement that \(u_j^{*,\pm } \in \mathcal {U}_{\text {ad}}\) in case of conservative reconstruction.
Recall that \(u_j^{n + \frac{1}{2}, *}\) was defined by (45); expanding the definition of \(u_j^{n + \frac{1}{2}, \pm }\) given by (38) yields
This identity (48) will be seen as an evolution update similar to (38) with \(u_j^{n, +}\) and \(u_j^{n, -}\) being swapped and \(u_j^n\) replaced with \(2 u_j^n - \left( \mu _-u_j^{n, -} + \mu _+u_j^{n, +} \right) \). The admissibility of \(u_j^{n + \frac{1}{2}, *}\) will be studied by adapting the proof of admissibility for (38), accounting for the differences in the case of (48). Define \(u_j^{*,*}\) so that
i.e.,
The following Lemma extends the proof of Lemma 2 to obtain conditions for \(u_j^{n + \frac{1}{2}, *} \in \mathcal {U}_{\text {ad}}\).
Lemma 4
Assume that \(u_j^n \in \mathcal {U}_{\text {ad}}\) for all j. Consider the reconstructions \(u_j^{n,\pm }\) and the \(u_j^{*, *}\) defined in (49). Assume \(u_j^{n, \pm }, u_j^{*, *} \in \mathcal {U}_{\text {ad}}\) and the time step restrictions
Then \(u_j^{n + \frac{1}{2}, *} \in \mathcal {U}_{\text {ad}}\).
Proof
We will use the identity which follows from (48, 49)
to fall back to previous case of Lemma 2.
Define \(u^h (x, t): (x_{j-\frac{1}{2}}, x_{j+\frac{1}{2}}) \times (0, \Delta t/2) \rightarrow \mathcal {U}_{\text {ad}}\) to be the weak solution of the Cauchy problem with initial data
where
Note that we have already accounted for the swapped \(u_j^{n,-}\) and \(u_j^{n,+}\) while defining this initial condition, see Fig. 25.
Under the assumed CFL conditions (51), the solution \(u^h\) at time \(\frac{\Delta t}{2}\) is made up of non-interacting Riemann problems centered at \(x_{j \pm \frac{1}{4}}\). Take the projection of \(u^h (x, t / 2)\) on piecewise-constant functions
As in Lemma 2, we will show \(u_j^{n + \frac{1}{2}, *} \in \mathcal {U}_{\text {ad}}\) by showing \(u_j^{n + \frac{1}{2}, *} = \tilde{u}_j^{n + \frac{1}{2}, *}\). Applying Lemma 42 to the two non-interacting Riemann problems, we get
This proves our claim. \(\square \)
For conservative reconstruction,
and thus by (50), \(u_j^{*, *} = u_j^n\). The previous lemma can thus be specialized as follows.
Lemma 5
Assume that \(u_j^n \in \mathcal {U}_{\text {ad}}\) and \(u_j^{n, \pm } \in \mathcal {U}_{\text {ad}}\) for all j with conservative reconstruction. Also assume the CFL restrictions
where \(\mu ^{\pm }\) are defined in (40). Then, \(u_j^{n + \frac{1}{2}, *}\) defined in (45) is in \(\mathcal {U}_{\text {ad}}\).
Combining Lemmas 2, 3, 5, we obtain the final criterion for admissibility preservation of MUSCL-Hancock with conservative reconstruction in the following Theorem 3.
Theorem 3
Let \(u_j^n \in \mathcal {U}_{\text {ad}}\) for all j and \(u_j^{n, \pm }\) be the conservative reconstructions defined as
so that \(u_j^{*, \pm }\) defined in (43) is also given by
Assume the slope \(\delta _j\) is chosen such that \(u_j^{*, \pm } \in \mathcal {U}_{\text {ad}}\) and the CFL restrictions (44, 47, 53) hold. Then, the updated solution \(u_j^{n + 1}\), defined by MUSCL-Hancock scheme (39) is in \(\mathcal {U}_{\text {ad}}\).
Proof
Once we obtain \(u_j^{n, \pm } \in \mathcal {U}_{\text {ad}}\), the claim follows from Lemmas 2–5. To prove that \(u_j^{n, \pm }\) is indeed in \(\mathcal {U}_{\text {ad}}\), we make the straight forward observation that
Since \(u_j^{*, \pm }\) and \(u_j^n\) are in \(\mathcal {U}_{\text {ad}}\), the proof is completed by the convex property of \(\mathcal {U}_{\text {ad}}\). \(\square \)
Remark 2
The strictest time step restriction for admissibility of the MUSCL-Hancock scheme is imposed by (47). Thus, we can find the CFL coefficient for grid used by subcell-based blending scheme (10) by minimizing the denominator in (47) which is given by
where \(\xi _0,w_0\) are the first Gauss-Legendre quadrature point (3) and weight in [0, 1]. This coefficient is less than half of the optimal CFL coefficient that arises from Fourier stability analysis of the LWFR scheme with D2 dissipation, see Table 1 of [5].
1.4 A.4 Non-conservative Reconstruction
To maintain the simple admissibility criterion (Theorem 3), we have restricted ourselves to conservative reconstruction in this work. In this section, we explain the complexities that will arise in enforcing admissibility if we perform reconstruction with non-conservative variables \(v\) defined by the change of variables formula
The linear approximation is given by
and thus the trace values are
Since the arguments of proof of admissibility depend on constraints on the conservative variables, we have to take the inverse map on our reconstructions. For example, conservative variables at the face are obtained as
Due to the non-linearity of the map \(\kappa \), unlike the conservative case, we have
which is why several reductions of admissibility constraints will fail. The admissibility criteria for non-conservative reconstruction is stated in Theorem 4.
Theorem 4
Assume that \(u_j^n \in \mathcal {U}_{\text {ad}}\) for all j. Consider \(u_j^{n,\pm }\) defined in (55), \(u_j^{*,\pm }\) defined in (43) and \(u_j^{*,*}\) defined so that
Assume that the slope \(\delta _j\) is chosen so that \(u_j^{n,\pm }, u_j^{*,\pm }, u_j^{*,*} \in \mathcal {U}_{\text {ad}}\) and that the CFL restrictions (44, 47, 51) are satisfied. Then the updated solution \(u_j^{n+1}\) of MUSCL-Hancock scheme (39) is in \(\mathcal {U}_{\text {ad}}\).
1.5 A.5 MUSCL-Hancock Scheme in 2-D
Consider the 2-D hyperbolic conservation law (34) with fluxes \(f, g\). For simplicity, assume that the reconstruction is performed on conservative variables. Thus, the linear reconstructions are given by
and the approximations at the face \(u^{n, +x}, u^{n, -x}, u^{n, +y}, u^{n, -y}\) are
and the derivative approximations are given by
The evolutions to time level \({n+\frac{1}{2}}\) are given by
and then the final update is performed as
where the numerical fluxes are computed as
1.5.1 A.5.1 First Evolution Step
As in 1-D, define \(u^{*, \pm x}_{i j}, u^{*, \pm y}_{ij}\) so that
where
Since we assume conservative reconstruction
Thus, we have
We will particularly discuss admissibility of the updates
Admissibility of the other three updates \(u^{{n+\frac{1}{2}}, -x}_{i j}, u^{{n+\frac{1}{2}}, \pm y}_{i j}\) will follow similarly. For some \(k_x, k_y\) chosen such that \(k_x + k_y = 1,\) we write (61) as
where
and
We will choose the slopes \(\delta ^x_i, \delta ^y_j\) and time step \(\Delta t\) so that \(\mathcal {\theta }_{ij}^{+x}, \mathcal {\theta }_{ij}^{+y}\in \mathcal {U}_{\text {ad}}\). Then, we can take convex combinations of the two terms to obtain admissibility of \(u^{{n+\frac{1}{2}}, +x}_{i j}\). The choice of \(k_x, k_y\) will not influence the slope restriction, but only the time step restriction required to obtain admissibility. In this work, we only use the Fourier CFL restriction imposed by the Lax–Wendroff scheme (32) and observe admissibility preservation in all our numerical experiments and thus do not study the choice of \(k_x,k_y\). However, in a similar context, [78] proposed the choice of
where
In [23], it was shown that the time step restriction imposed by the above decomposition is suboptimal and optimal decompositions were proposed. After choosing \(k_x, k_y\), following the 1-D procedures from Sect. 1, the slopes \(\delta ^x_i, \delta ^y_j\) will be limited to enforce admissibility of \(\mathcal {\theta }_{ij}^{+x}, \mathcal {\theta }_{ij}^{+y}\) (62, 63). The admissibility preservation of \(\mathcal {\theta }_{ij}^{+x}\) (62) follows directly from the arguments used in Lemma 2, enforcing slope restriction so that \(u^{n, \pm x}_{i j}\) and \(u^{*, +x}_{i j}\) are admissible, and appropriate time step restrictions. For admissibility of \(\mathcal {\theta }_{ij}^{+y}\) (63), we define \(u^{*, +xy}_{ij}\) so that
Thus, the proof of Lemma 2 shall apply as in 1-D under the assumption of admissibility of \(u^{n, \pm y}_{i j}, u^{*, +xy}_{ij}\) and some CFL conditions. Thus, we will have admissibility of \(\mathcal {\theta }_{ij}^{+y}\in \mathcal {U}_{\text {ad}}\). We obtain further simplifications because of conservative reconstructions
and thus the slope limiting for enforcing admissibility of \(u^{*, +x}_{ij}\) will suffice. We note the precise slope and CFL restrictions are in Lemma 6.
Lemma 6
For \(\mu _{\pm x}, \mu _{\pm y}\) defined in (60), \(u^{n, \pm x}_{ij}, u^{n, \pm y}_{ij}\) reconstructed in (56), \(u^{*, \pm x}_{ij}, u^{*, \pm y}_{ij}\) picked as in (59), assume
and the CFL restrictions
where \(\lambda _{x_i} = \frac{\Delta t}{k_x \Delta x_i}, \lambda _{y_j} = \frac{\Delta t}{k_y \Delta y_j}\) for all i, j and \(k_x + k_y = 1\). Then, the updates \(u^{{n+\frac{1}{2}}, \pm x}_{i j}, u^{{n+\frac{1}{2}}, \pm y}_{i j}\) (61) of the first step of 2-D MUSCL-Hancock scheme are admissible.
1.5.2 A.5.2 Finite volume step
The final update is given by
where the numerical fluxes are computed as
As in the previous step, the expression (68) is split into a convex combination
where
for some \(k_x,k_y \ge 0\) with \(k_x+k_y=1.\) The admissibility of \(\zeta _{ij}^{x}\) and \( \zeta _{ij}^{y}\) will imply the admissibility of \(u_{i j}^{n + 1}.\) The admissibility of \(\zeta _{ij}^{x}, \zeta _{ij}^{y}\) will follow exactly as from the procedure in 1-D (Lemma 3) with appropriate time step restrictions and assumption of admissibility of terms \(u^{{n+\frac{1}{2}}, \pm x}_{ij}, u^{{n+\frac{1}{2}}, \pm y}_{ij}, u^{{n+\frac{1}{2}}, *x}_{ij}, u^{{n+\frac{1}{2}}, *y}_{ij}\) for \(u^{{n+\frac{1}{2}}, *x}_{ij}, u^{{n+\frac{1}{2}}, *y}_{ij}\) defined as
The precise CFL restrictions and admissibility constraints are in the following Lemma 7.
Lemma 7
Assume that the states \(\left\{ u^{{n+\frac{1}{2}}, \pm x}_{ij}, u^{{n+\frac{1}{2}}, \pm y}_{ij}, u^{{n+\frac{1}{2}}, *x}_{ij}, u^{{n+\frac{1}{2}}, *y}_{ij} \right\} _{i,j}\) belong to \(\mathcal {U}_{\text {ad}}\), where \( u^{{n+\frac{1}{2}}, *x}_{ij}, u^{{n+\frac{1}{2}}, *y}_{ij}\) are defined as in (69). Then, the updated solution \(u_{ij}^{n+1}\) of MUSCL-Hancock scheme is in \(\mathcal {U}_{\text {ad}}\) under the CFL conditions
where \(\lambda _{x_i} = \frac{\Delta t}{k_x \Delta x_i}, \lambda _{y_j} = \frac{\Delta t}{k_y \Delta y_j}\) for all i, j.
As in 1-D, we now show that admissibility of \(u_{i j}^{n + \frac{1}{2}, *x}, u_{i j}^{n + \frac{1}{2}, *y}\) can also be reduced to admissibility of \(u^{*, \pm x}_{i j}, u^{*, \pm y}_{ij}\), similar to Lemma 5. Expanding the definition of \(u^{{n+\frac{1}{2}}, *y}_{ij}\) gives us
If we obtain the admissibility of
and
for some \(k_x,k_y \in [0,1]\) with \(k_x+k_y=1,\) then the admissibility of \(u_{i j}^{{n+\frac{1}{2}}, *y}\) follows as we can write it as a convex combination
and obtain the admissibility of \(u_{ij}^{{n+\frac{1}{2}}, *y}\). Thus, we need to limit the slope so that (72, 73) are admissibile. To that end, define \(u_{i j}^{**{y x}}, u_{ij}^{**{y y}}\) to satisfy
respectively. Consequently,
Then, assuming the admissibility of \(u_{ij}^{**{y x}}, u_{i j}^{**{y y}}\) and proceeding as in the proof of Lemma 4, we can ensure that \(\eta _{ij}^{* {yx}}, \eta _{ij}^{* {yy}} \in \mathcal {U}_{\text {ad}}\) and thus \(u_{i j}^{{n+\frac{1}{2}}, *y} \in \mathcal {U}_{\text {ad}}\). Furthermore, since the reconstruction is conservative
Thus, admissibility of \(u_{ij}^{**{yx}}, u_{ij}^{**{yy}}\) is obtained as
The arguments for admissibility of \(u_{i j}^{{n+\frac{1}{2}}, *x}\) are similar. The admissibility criteria of \(u_{i j}^{{n+\frac{1}{2}}, *x}, u_{i j}^{{n+\frac{1}{2}}, *y}\) are summarised in the following lemma.
Lemma 8
Assume that \({u_{ij}^n} \in \mathcal {U}_{\text {ad}}\) and \(u^{n, \pm x}_{ij}, u^{n, \pm y}_{ij} \in \mathcal {U}_{\text {ad}}\) for all i, j with conservative reconstruction. Also assume the CFL restrictions
where \(\lambda _{x_i} = \frac{\Delta t}{k_x \Delta x_i}, \lambda _{y_j} = \frac{\Delta t}{k_y \Delta y_j}\) and \(\mu _{\pm x}, \mu _{\pm y}\) are defined in (60). Then, \(u_{i j}^{{n+\frac{1}{2}}, *x}, u_{i j}^{{n+\frac{1}{2}}, *y}\) defined in (69) are in \(\mathcal {U}_{\text {ad}}\).
Combining Lemmas 6, 7, 8, we will have the 2-D result corresponding to Theorem 3 with the same proof.
Theorem 5
Let \(u_{ij}^n \in \mathcal {U}_{\text {ad}}\) for all i, j and \(u^{n, \pm x}_{ij}, u^{n, \pm y}_{ij}\) be the conservative reconstructions defined as
so that \(u^{*, \pm x}_{ij}, u^{*, \pm y}_{ij}\) (59) are given by
Assume that the slopes \(\delta ^x_i, \delta ^y_j\) are chosen to satisfy \(u^{*, \pm x}_{ij}, u^{*, \pm y}_{ij} \in \mathcal {U}_{\text {ad}}\) for all i, j and that the CFL restrictions (67, 70, 74) are satisfied. Then the updated solution \(u_{ij}^{n+1}\) of MUSCL-Hancock procedure is in \(\mathcal {U}_{\text {ad}}\).
B Limiting Numerical Flux in 2-D
Consider the 2-D hyperbolic conservation law (34). The Lax–Wendroff update is
where \(F^\textbf{e}_h, G^\textbf{e}_h\) are continuous time-averaged fluxes (5) in the x, y directions for the grid element \(\textbf{e}= (e_x, e_y)\). The reader is referred to Section 10 of [5] for more details of the 2-D Lax–Wendroff Flux Reconstruction (LWFR) scheme. Since the 2-D scheme is formed by taking a tensor product of the 1-D scheme, Theorem 2 applies, i.e., the scheme will be admissibility preserving in means (Definition 2) if we choose the blended numerical flux such that the lower order updates are admissible at solution points adjacent to the interfaces. Thus, we now explain the process of constructing the numerical flux where, to minimize storage requirements and memory reads, we will perform the correction within the interface loop where only one of x or y flux will be available in one iteration. Thus theoretical justification for the algorithm comes from breaking 2-D lower order updates into 1-D convex combinations. The general structure of the LWFR Algorithm 1 will remain the same. Here, we justify Algorithm 2 for construction of blended x flux with knowledge of only the x flux. The algorithm for blended y fluxes will be analogous.
We consider the calculation of the blended numerical flux for a corner solution point of the element, as this situation differs from 1-D, due to the fact that a corner solution point is adjacent to both x and y interfaces. In particular, we consider the bottom-left corner point \(\textbf{0}= (0,0)\) and show that the procedure in Algorithm 2 ensures admissibility at such points. The same justification applies to other corner and non-corner points. For the element \(\textbf{e}= (e_x, e_y)\), denoting interfaces along x, y directions as \({(e_x \pm \frac{1}{2}, e_y)}\), \({(e_x, e_y\pm \frac{1}{2})}\), we consider the update at the bottom left corner \(\textbf{0}= (0,0)\), suppressing the local solution point index \(i=0\) or \(j=0\) when considering the FR interface fluxes. The lower order update is given by
where \(\tilde{F}_{(e_x- \frac{1}{2}, e_y)}, \tilde{G}_{(e_x, {e_y-\frac{1}{2}})}\) are heuristically guessed candidates for the blended numerical flux (12). Pick \(k_x, k_y > 0\) such that \(k_x + k_y = 1\) and
satisfy
Such \(k_x, k_y\) exist because the lower order scheme with lower order flux at element interfaces is admissibility preserving. The choice of \(k_x, k_y\) should be made so that (76) is satisfied with the least time step restriction, but we have found the Fourier stability restriction imposed by (32) to be sufficient even with the most trivial choice of \(k_x = k_y = \frac{1}{2}\). The discussion of literature for the optimal choice of \(k_x,k_y\) is the same as the one made for the 2-D MUSCL Hancock scheme (64) and is not repeated here. After the choice of \(k_x, k_y\) is made, if we repeat the same procedure as in the 1-D case, we can perform slope limiting to find \(F_{e_x - \frac{1}{2}, e_y}\), \(F_{e_x, e_y - \frac{1}{2}}\) such that
are also in the admissible region. Then, we will get
We now justify Algorithm 2 as follows. Algorithm 2 corrects the numerical fluxes during the loop over x interfaces to enforce admissibility of \(\tilde{u}_x^{n + 1}\) (77) at all solution points neighbouring x interfaces including the corner solution points, and the analogous algorithm for y interfaces will ensure admissibility of \(\tilde{u}_y^{n + 1}\) (78) at all solution points neighbouring y interfaces including the corner points. At the end of the loop over interfaces, (79) will ensure that lower order updates at all solutions points neighbouring interfaces are admissible and Algorithm 1 will be an admissibility preserving Lax–Wendroff scheme for 2-D if we compute the blended numerical fluxes \(F_{(e_x+\frac{1}{2}, e_y)}, F_{(e_x, e_y+\frac{1}{2})}\) using Algorithm 2 and its counterpart in the y direction.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Babbar, A., Kenettinkara, S.K. & Chandrashekar, P. Admissibility Preserving Subcell Limiter for Lax–Wendroff Flux Reconstruction. J Sci Comput 99, 31 (2024). https://doi.org/10.1007/s10915-024-02482-9
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10915-024-02482-9