Recent developments in the algebraic multiblock method for Euler equations (Q1912062)

An algebraic multiblock method is presented which employs two extreme grids aimed at combining multigrid and domain decomposition ideas. The fine grid is used by the discretization method. The coarse grid results from the fine grid and defines the domain partitioning of the solution procedure. The conjugate gradient squared method is used for the approximate solution of numerous large block pentadiagonal systems emerging at each time-step. Additionally, efficient preconditioning and smoothing are employed to accelerate the iterative solution. The proposed method is applied for the solution of the time-marching Euler equations using an implicit upwind finite volume method (EUFLEX). Numerical results and comparisons show the efficiency of the proposed method even for sequential processing.