On the fourth-order accurate compact ADI scheme for solving the unsteady Nonlinear Coupled Burgers' Equations

The two-dimensional unsteady coupled Burgers' equations with moderate to severe gradients, are solved numerically using higher-order accurate finite difference schemes; namely the fourth-order accurate compact ADI scheme, and the fourth-order accurate Du Fort Frankel scheme. The question of numerical stability and convergence are presented. Comparisons are made between the present schemes in terms of accuracy and computational efficiency for solving problems with severe internal and boundary gradients. The present study shows that the fourth-order compact ADI scheme is stable and efficient

HIGH ORDER SHOCK CAPTURING SCHEMES FOR HYPERBOLIC CONSERVATION LAWS AND THE APPLICATION IN OPEN CHANNEL FLOWS

Many applications in engineering practice can be described by thehyperbolic partial differential equations (PDEs). Numerical modeling of this typeof equations often involves large gradients or shocks, which makes it achallenging task for conventional numerical methods to accurately simulate suchsystems. Thus developing accurate and efficient shock capturing numericalschemes becomes important for the study of hyperbolic equations.In this dissertation, a detailed study of the numerical methods for linearand nonlinear unsteady hyperbolic equations was carried out. A new finitedifference shock capturing scheme of finite volume style was developed. Thisscheme is based on the high order Pad?? type compact central finite differencemethod with the weighted essentially non-oscillatory (WENO) reconstruction toeliminate non-physical oscillations near the discontinuities while maintain stablesolution in the smooth areas. The unconditionally stable semi-implicit Crank-Nicolson (CN) scheme is used for time integration.The theoretical development was conducted based on one-dimensionalhomogeneous scalar equation and system equations. Discussions were alsoextended to include source terms and to deal with problems of higher dimension.For the treatment of source terms, Strang splitting was used. For multidimensionalequations, the ?? -form Douglas-Gunn alternating direction implicit(ADI) method was employed. To compare the performance of the scheme withENO type interpolation, the current numerical framework was also applied usingENO reconstruction.The numerical schemes were tested on 1-D and 2-D benchmark problems,as well as published experimental results. The simulated results show thecapability of the proposed scheme to resolve discontinuities while maintainingaccuracy in smooth regions. Comparisons with the experimental results validatethe method for dam break problems. It is concluded that the proposed scheme isa useful tool for solving hyperbolic equations in general, and from engineeringapplication perspective it provides a new way of modeling open channel flows

Alternating direction implicit time integrations for finite difference acoustic wave propagation: Parallelization and convergence

This work studies the parallelization and empirical convergence of two finite difference acoustic wave propagation methods on 2-D rectangular grids, that use the same alternating direction implicit (ADI) time integration. This ADI integration is based on a second-order implicit Crank-Nicolson temporal discretization that is factored out by a Peaceman-Rachford decomposition of the time and space equation terms. In space, these methods highly diverge and apply different fourth-order accurate differentiation techniques. The first method uses compact finite differences (CFD) on nodal meshes that requires solving tridiagonal linear systems along each grid line, while the second one employs staggered-grid mimetic finite differences (MFD). For each method, we implement three parallel versions: (i) a multithreaded code in Octave, (ii) a C++ code that exploits OpenMP loop parallelization, and (iii) a CUDA kernel for a NVIDIA GTX 960 Maxwell card. In these implementations, the main source of parallelism is the simultaneous ADI updating of each wave field matrix, either column-wise or row-wise, according to the differentiation direction. In our numerical applications, the highest performances are displayed by the CFD and MFD CUDA codes that achieve speedups of 7.21x and 15.81x, respectively, relative to their C++ sequential counterparts with optimal compilation flags. Our test cases also allow to assess the numerical convergence and accuracy of both methods. In a problem with exact harmonic solution, both methods exhibit convergence rates close to 4 and the MDF accuracy is practically higher. Alternatively, both convergences decay to second order on smooth problems with severe gradients at boundaries, and the MDF rates degrade in highly-resolved grids leading to larger inaccuracies. This transition of empirical convergences agrees with the nominal truncation errors in space and time.Comment: 20 pages, 5 figure