High order efficient algorithm for computation of MHD flow ensembles

by   Muhammad Mohebujjaman, et al.

In this paper, we propose, analyze, and test a new fully discrete, efficient, decoupled, stable, and practically second-order time-stepping algorithm for computing MHD ensemble flow averages under uncertainties in the initial conditions and forcing. For each viscosity and magnetic diffusivity pair, the algorithm picks the largest possible parameter θ∈[0,1] to avoid the instability that arises due to the presence of some explicit viscous terms. At each time step, the algorithm shares the same system matrix with all J realizations but with different right-hand-side vectors. That saves assembling time and computer memory, allows the reuse of the same preconditioner, and can take the advantage of block linear solvers. For the proposed algorithm, we prove stability and convergence rigorously. To illustrate the predicted convergence rates of our analysis, numerical experiments with manufactured solutions are given on a unit square domain. Finally, we test the scheme on a benchmark channel flow over a step problem and it performs well.



page 15

page 16


An efficient algorithm for simulating ensembles of parameterized MHD flow problems

In this paper, we propose, analyze, and test an efficient algorithm for ...

Analysis of A New Time Filter Algorithm for The Unsteady Stokes/Darcy Model

This paper first presents a first order θ-scheme which is one parameter ...

Computing optimal experimental designs on finite sets by log-determinant gradient flow

Optimal experimental designs are probability measures with finite suppor...

An embedded variable step IMEX scheme for the incompressible Navier-Stokes equations

This report presents a series of implicit-explicit (IMEX) variable times...

Eigensolution analysis of immersed boundary method based on volume penalization: applications to high-order schemes

This paper presents eigensolution and non-modal analyses for immersed bo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.