Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAdaptive two- and three-dimensional multiresolution computations of resistive magnetohydrodynamics
125
0
0.0
(
0
)
Added by
Anna Karina Fontes Gomes
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Fully adaptive computations of the resistive magnetohydrodynamic (MHD) equations are presented in two and three space dimensions using a finite volume discretization on locally refined dyadic grids. Divergence cleaning is used to control the incompressibility constraint of the magnetic field. For automatic grid adaptation a cell-averaged multiresolution analysis is applied which guarantees the precision of the adaptive computations, while reducing CPU time and memory requirements. Implementation issues of the open source code CARMEN-MHD are discussed. To illustrate its precision and efficiency different benchmark computations including shock-cloud interaction and magnetic reconnection are presented.
rate research
Read More
In this paper, we study an adaptive planewave method for multiple eigenvalues of second-order elliptic partial equations. Inspired by the technique for the adaptive finite element analysis, we prove that the adaptive planewave method has the linear convergence rate and optimal complexity.
We present a fully adaptive multiresolution scheme for spatially two-dimensional, possibly degenerate reaction-diffusion systems, focusing on combustion models and models of pattern formation and chemotaxis in mathematical biology. Solutions of these equations in these applications exhibit steep gradients, and in the degenerate case, sharp fronts and discontinuities. The multiresolution scheme is based on finite volume discretizations with explicit time stepping. The multiresolution representation of the solution is stored in a graded tree. By a thresholding procedure, namely the elimination of leaves that are smaller than a threshold value, substantial data compression and CPU time reduction is attained. The threshold value is chosen optimally, in the sense that the total error of the adaptive scheme is of the same slope as that of the reference finite volume scheme. Since chemical reactions involve a large range of temporal scales, but are spatially well localized (especially in the combustion model), a locally varying adaptive time stepping strategy is applied. It turns out that local time stepping accelerates the adaptive multiresolution method by a factor of two, while the error remains controlled.
We present a scalable block preconditioning strategy for the trace system coming from the high-order hybridized discontinuous Galerkin (HDG) discretization of incompressible resistive magnetohydrodynamics (MHD). We construct the block preconditioner with a least squares commutator (BFBT) approximation for the inverse of the Schur complement that segregates out the pressure unknowns of the trace system. The remaining velocity, magnetic field, and Lagrange multiplier unknowns form a coupled nodal unknown block (the upper block), for which a system algebraic multigrid (AMG) is used for the approximate inverse. The complexity of the MHD equations together with the algebraic nature of the statically condensed HDG trace system makes the choice of smoother in the system AMG part critical for the convergence and performance of the block preconditioner. Our numerical experiments show GMRES preconditioned by ILU(0) of overlap zero as a smoother inside system AMG performs best in terms of robustness, time per nonlinear iteration and memory requirements. With several transient test cases in 2D and 3D including the island coalescence problem at high Lundquist number we demonstrate the robustness and parallel scalability of the block preconditioner. Additionally for the upper block a preliminary study of an alternate nodal block system solver based on a multilevel approximate nested dissection is presented. On a 2D island coalescence problem the multilevel approximate nested dissection preconditioner shows better scalability with respect to mesh refinement than the system AMG, but is relatively less robust with respect to Lundquist number scaling.
The notion of a tensor captures three great ideas: equivariance, multilinearity, separability. But trying to be three things at once makes the notion difficult to understand. We will explain tensors in an accessible and elementary way through the lens of linear algebra and numerical linear algebra, elucidated with examples from computational and applied mathematics.
This paper develops three high-order accurate discontinuous Galerkin (DG) methods for the one-dimensional (1D) and two-dimensional (2D) nonlinear Dirac (NLD) equations with a general scalar self-interaction. They are the Runge-Kutta DG (RKDG) method and the DG methods with the one-stage fourth-order Lax-Wendroff type time discretizaiton (LWDG) and the two-stage fourth-order accurate time discretization (TSDG). The RKDG method uses the spatial DG approximation to discretize the NLD equations and then utilize the explicit multistage high-order Runge-Kutta time discretization for the first-order time derivatives, while the LWDG and TSDG methods, on the contrary, first give the one-stage fourth-order Lax-Wendroff type and the two-stage fourth-order time discretizations of the NLD equations, respectively, and then discretize the first- and higher-order spatial derivatives by using the spatial DG approximation. The $L^{2}$ stability of the 2D semi-discrete DG approximation is proved in the RKDG methods for a general triangulation, and the computational complexities of three 1D DG methods are estimated. Numerical experiments are conducted to validate the accuracy and the conservative properties of the proposed methods. The interactions of the solitary waves, the standing and travelling waves are investigated numerically and the 2D breathing pattern is observed.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
