Search arXiv⌕ Search

arXiv · 2009.03522

Curl constraint-preserving reconstruction and the guidance it gives for mimetic scheme design

Abstract

Several important PDE systems, like magnetohydrodynamics and computational electrodynamics, are known to support involutions where the divergence of a vector field evolves in divergence-free or divergence constraint-preserving fashion. Recently, new classes of PDE systems have emerged for hyperelasticity, compressible multiphase flows, so-called first order reductions of the Einstein field equations, or a novel first order hyperbolic reformulation of Schrödinger's equation, to name a few, where the involution in the PDE supports curl-free or curl constraint-preserving evolution of a vector field. Since mimetic numerical schemes for the solution of the former class of PDEs are well-developed, we draw guidance from them for the solution of the latter class of PDEs. We show that a study of the curl constraint-preserving reconstruction gives us a great deal of insight into the design of consistent, mimetic schemes for these involutionary PDEs. The importance of multidimensional Riemann solvers in facilitating the design of such schemes is also documented. We study the problem of curl constraint-preserving reconstruction as it pertains to the design of mimetic discontinuous Galerkin (DG) and finite volume (FV) schemes for PDEs that support such an involution. This is done for two and three dimensional structured mesh problems where we deliver closed form expressions for the reconstruction. The role that this reconstruction plays in the curl-free, or curl-preserving prolongation of vector fields in adaptive mesh refinement (AMR) is also discussed. In two dimensions, a von Neumann analysis of structure-preserving DG-like schemes that mimetically satisfy the curl constraints, is also presented. Numerical results are also presented to show that the schemes meet their design accuracy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dinshaw S. Balsara, Roger Käppeli, Walter Boscheri, Michael Dumbser. 2021-09-04. Curl constraint-preserving reconstruction and the guidance it gives for mimetic scheme design. https://arxiv.org/abs/2009.03522

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Uniform-in-time Strong Error Estimates of Tamed-FEM to Superlinear SPDEs driven by Multiplicative Noise

We establish sharp, uniform-in-time strong error estimates for a nonlinearity-explicit tamed finite element method (FEM) applied to a class of superlinear stochastic partial differential equations (SPDEs) driven by multiplicative noise, including the stochastic Allen--Cahn equation with a moderately thick interface. This tamed-FEM was first introduced in {\it Z. Liu and J. Shen, J. Sci. Comput., 109:Paper No. 61, 26, 2026} to ensure long-time unconditional stability and to preserve the Lyapunov structure of this class of SPDEs. We further prove that the scheme is exponentially ergodic and derive the convergence rate of the numerical invariant measure to the exact one in the Wasserstein-2 distance. Finally, we present numerical experiments that verify the ergodicity, sharpness, and time-independence of the strong convergence rates for this tamed-FEM.

math.NA↗

Solution Analysis of Tensor Equation $\mathcal{A} \ltimes \mathcal{X} \ltimes \mathcal{B}= \mathcal{C}$ via Semi Tensor Product with t-product

Tensor equations involving both left and right tensor operators arise naturally in applications where multidimensional data are coupled through transformations acting from both sides. Motivated by the need to analyze such equations, this manuscript investigates a detailed solution analysis of $\mathcal{A}\ltimes \mathcal{X}\ltimes \mathcal{B} = \mathcal{C}$ via the semi-tensor product with the $t$-product. The manuscript provides a more general framework that includes, as a special case, the tensor equation $\mathcal{A}\ltimes\mathcal{X}=\mathcal{B}$ considered in \cite{J.FathitensorequationAX=BunderSTP}. Necessary and sufficient conditions are derived for the existence of vector and matrix valued solutions. Explicit compatibility conditions are established, and constructive Moore-Penrose-inverse-based algorithms are provided for the vector and matrix valued cases. The computational complexity and execution times are compared for Discrete Fourier Transform(DFT) and Fast Fourier Transform(FFT) based \(t\)-product implementations. The practical relevance of the proposed framework is further demonstrated through a color image deblurring application. Examples throughout illustrate the theoretical results.

math.NA↗

A nonoverlapping spectral additive Schwarz method for interior penalty discontinuous Galerkin discretizations of Anisotropic Elliptic Problems

We design and analyze a nonoverlapping additive Schwarz preconditioner for interior penalty discontinuous Galerkin discretizations of anisotropic elliptic problems. The preconditioned method coupled with a Krylov subspace iteration is shown to be independent of the highly discontinuous (and anisotropic) jump coefficients as well as the subdomain size. To increase efficacy, various auxiliary spaces are considered to reduce the size of the coarse grid operator. We demonstrate how to modify the additive Schwarz preconditioner such that it is applicable to the nonsymmetric IPDG schemes. Several numerical experiments verify the theory and validate the robustness of the preconditioner.

math.NA↗