Entropy Stable Finite Volume Approximations for Ideal Magnetohydrodynamics

This article serves as a summary outlining the mathematical entropy analysis of the ideal magnetohydrodynamic (MHD) equations. We select the ideal MHD equations as they are particularly useful for mathematically modeling a wide variety of magnetized fluids. In order to be self-contained we first motivate the physical properties of a magnetic fluid and how it should behave under the laws of thermodynamics. Next, we introduce a mathematical model built from hyperbolic partial differential equations (PDEs) that translate physical laws into mathematical equations. After an overview of the continuous analysis, we thoroughly describe the derivation of a numerical approximation of the ideal MHD system that remains consistent to the continuous thermodynamic principles. The derivation of the method and the theorems contained within serve as the bulk of the review article. We demonstrate that the derived numerical approximation retains the correct entropic properties of the continuous model and show its applicability to a variety of standard numerical test cases for MHD schemes. We close with our conclusions and a brief discussion on future work in the area of entropy consistent numerical methods and the modeling of plasmas

Discrete Geometric Structures in Homogenization and Inverse Homogenization with application to EIT

We introduce a new geometric approach for the homogenization and inverse homogenization of the divergence form elliptic operator with rough conductivity coefficients $\sigma(x)$ in dimension two. We show that conductivity coefficients are in one-to-one correspondence with divergence-free matrices and convex functions $s(x)$ over the domain $\Omega$. Although homogenization is a non-linear and non-injective operator when applied directly to conductivity coefficients, homogenization becomes a linear interpolation operator over triangulations of $\Omega$ when re-expressed using convex functions, and is a volume averaging operator when re-expressed with divergence-free matrices. Using optimal weighted Delaunay triangulations for linearly interpolating convex functions, we obtain an optimally robust homogenization algorithm for arbitrary rough coefficients. Next, we consider inverse homogenization and show how to decompose it into a linear ill-posed problem and a well-posed non-linear problem. We apply this new geometric approach to Electrical Impedance Tomography (EIT). It is known that the EIT problem admits at most one isotropic solution. If an isotropic solution exists, we show how to compute it from any conductivity having the same boundary Dirichlet-to-Neumann map. It is known that the EIT problem admits a unique (stable with respect to $G$-convergence) solution in the space of divergence-free matrices. As such we suggest that the space of convex functions is the natural space in which to parameterize solutions of the EIT problem

Numerical Computation of Exponential Functions of Nabla Fractional Calculus

In this article, we illustrate the asymptotic behaviour of exponential functions of nabla fractional calculus. For this purpose, we propose a novel matrix technique to compute these functions numerically

On the algorithmic complexity of twelve covering and independence parameters of graphs

The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to covering and independence, each of which has been studied previously in some form. Here we survey briefly results concerning total coverings and total matchings of graphs, and consider the aforementioned 12 covering and independence parameters with regard to algorithmic complexity. We survey briefly known results for several graph classes, and obtain new NP-completeness results for the minimum total cover and maximum minimal total cover problems in planar graphs, the minimum maximal total matching problem in bipartite and chordal graphs, and the minimum independent dominating set problem in planar cubic graphs

Infinitely many solutions to the Yamabe problem on noncompact manifolds

We establish the existence of infinitely many complete metrics with constant scalar curvature on prescribed conformal classes on certain noncompact product manifolds. These include products of closed manifolds with constant positive scalar curvature and simply-connected symmetric spaces of noncompact or Euclidean type; in particular, $\mathbb S^m \times\mathbb R^d$, $m\geq2$, $d\geq1$, and $\mathbb S^m\times\mathbb H^d$, $2\leq d<m$. As a consequence, we obtain infinitely many periodic solutions to the singular Yamabe problem on $\mathbb S^m\setminus\mathbb S^k$, for all $0\leq k<(m-2)/2$, the maximal range where nonuniqueness is possible. We also show that all Bieberbach groups in $Iso(\mathbb R^d)$ are periods of bifurcating branches of solutions to the Yamabe problem on $\mathbb S^m\times\mathbb R^d$, $m\geq2$, $d\geq1$