Font Size: a A A

Efficient Numerical Methods for Magnetohydrodynamic Flo

Posted on:2018-03-25Degree:Ph.DType:Dissertation
University:Clemson UniversityCandidate:Mohebujjaman, MuhammadFull Text:PDF
GTID:1440390002497126Subject:Mathematics
Abstract/Summary:PDF Full Text Request
This dissertation studies efficient numerical methods for approximating solutions to viscous, incompressible, time-dependent magnetohydrodynamic (MHD) flows and computing MHD flows ensembles.;Chapter 3 presents and analyzes a fully discrete, decoupled efficient algorithm for MHD flow that is based on the Elsasser variable formulation, proves its unconditional stability with respect to the timestep size, and proves its unconditional convergence. Numerical experiments are given which verify all predicted convergence rates of our analysis, show the results of the scheme on a set of channel flow problems match well the results found when the computation is done with MHD in primitive variables, and finally illustrate that the scheme performs well for channel flow over a step.;In chapter 4, we propose, analyze, and test a new MHD discretization which decouples the system into two Oseen problems at each timestep, yet maintains unconditional stability with respect to timestep size. The scheme is optimally accurate in space, and behaves like second order in time in practice. The proposed method chooses theta ∈ [0,1], dependent on the viscosity nu and magnetic diffusivity num, so that unconditionally stability is achieved, and gives temporal accuracy O(Delta t2 + (1 -- theta)|nu -- nu m|Deltat). In practice, nu and nu m are small, and so the method behaves like second order. We show the theta-method provides excellent accuracy in cases where usual BDF2 is unstable.;Chapter 5 proposes an efficient algorithm and studies for computing flow ensembles of incompressible MHD flows under uncertainties in initial or boundary data. The ensemble average of J realizations is approximated through an efficient algorithm that, at each time step, uses the same coefficient matrix for each of the J system solves. Hence, preconditioners need to be built only once per time step, and the algorithm can take advantage of block linear solvers. Additionally, an Elsasser variable formulation is used, which allows for a stable decoupling of each MHD system at each time step. We prove stability and convergence of the algorithm, and test it with two numerical experiments.;This work concludes with chapter 6, which proposes, analyzes and tests high order algebraic splitting methods for MHD flows. The key idea is to applying Yosida-type algebraic splitting to the incremental part of the unknowns at each time step. This reduces the block Schur complement by decoupling it into two Navier-Stokes-type Schur complements, each of which is symmetric positive definite and the same at each time step. We prove the splitting is third order in Deltat, and if used together with (block-)pressure correction, is fourth order. A full analysis of the solver is given, both as a linear algebraic approximation, and as a finite element discretization of an approximation to the un-split discrete system. Numerical tests are given to illustrate the theory and show the effectiveness of the method.;Finally, conclusions and future works are discussed in the final chapter.
Keywords/Search Tags:Method, MHD, Numerical, Efficient, Each time step, Chapter
PDF Full Text Request
Related items