arXiv Analytics

Sign in

arXiv:2108.05110 [math.NA]AbstractReferencesReviewsResources

An efficient algorithm for simulating ensembles of parameterized MHD flow problems

Muhammad Mohebujjaman, Hongwei Wang, Leo G. Rebholz, Md. Abdullah Al Mahbub

Published 2021-08-11Version 1

In this paper, we propose, analyze, and test an efficient algorithm for computing ensemble average of incompressible magnetohydrodynamics (MHD) flows, where instances/members correspond to varying kinematic viscosity, magnetic diffusivity, body forces, and initial conditions. The algorithm is decoupled in Els\"asser variables and permits a shared coefficient matrix for all members at each time-step. Thus, the algorithm is much more computationally efficient than separately computing simulations for each member using usual MHD algorithms. We prove the proposed algorithm is unconditionally stable and convergent. Several numerical tests are given to support the predicted convergence rates. Finally, we test the proposed scheme and observe how the physical behavior changes as the coupling number increases in a lid-driven cavity problem with mean Reynolds number $Re\approx 15000$, and as the deviation of uncertainties in the initial and boundary conditions increases in a channel flow past a step problem.

Related articles: Most relevant | Search more
arXiv:2406.06008 [math.NA] (Published 2024-06-10)
Efficient algorithm for the oscillatory matrix functions
arXiv:1502.06401 [math.NA] (Published 2015-02-23)
An efficient algorithm based on splitting for the time integration of the Schrödinger equation
arXiv:1705.09350 [math.NA] (Published 2017-05-25)
An efficient algorithm for simulating ensembles of parameterized flow problems