Solving Upwind-Biased Discretizations

This paper studies a novel multigrid approach to the solution for a second order upwind biased discretization of the convection equation in two dimensions. This approach is based on semi-coarsening and well balanced explicit correction terms added to coarse-grid operators to maintain on coarse-grid the same cross-characteristic interaction as on the target (fine) grid. Colored relaxation schemes are used on all the levels allowing a very efficient parallel implementation. The results of the numerical tests can be summarized as follows: 1) The residual asymptotic convergence rate of the proposed V(0, 2) multigrid cycle is about 3 per cycle. This convergence rate far surpasses the theoretical limit (4/3) predicted for standard multigrid algorithms using full coarsening. The reported efficiency does not deteriorate with increasing the cycle, depth (number of levels) and/or refining the target-grid mesh spacing. 2) The full multi-grid algorithm (FMG) with two V(0, 2) cycles on the target grid and just one V(0, 2) cycle on all the coarse grids always provides an approximate solution with the algebraic error less than the discretization error. Estimates of the total work in the FMG algorithm are ranged between 18 and 30 minimal work units (depending on the target (discretizatioin). Thus, the overall efficiency of the FMG solver closely approaches (if does not achieve) the goal of the textbook multigrid efficiency. 3) A novel approach to deriving a discrete solution approximating the true continuous solution with a relative accuracy given in advance is developed. An adaptive multigrid algorithm (AMA) using comparison of the solutions on two successive target grids to estimate the accuracy of the current target-grid solution is defined. A desired relative accuracy is accepted as an input parameter. The final target grid on which this accuracy can be achieved is chosen automatically in the solution process. the actual relative accuracy of the discrete solution approximation obtained by AMA is always better than the required accuracy; the computational complexity of the AMA algorithm is (nearly) optimal (comparable with the complexity of the FMG algorithm applied to solve the problem on the optimally spaced target grid)

Euler solvers for transonic applications

The 1980s may well be called the Euler era of applied aerodynamics. Computer codes based on discrete approximations of the Euler equations are now routinely used to obtain solutions of transonic flow problems in which the effects of entropy and vorticity production are significant. Such codes can even predict separation from a sharp edge, owing to the inclusion of artificial dissipation, intended to lend numerical stability to the calculation but at the same time enforcing the Kutta condition. One effect not correctly predictable by Euler codes is the separation from a smooth surface, and neither is viscous drag; for these some form of the Navier-Stokes equation is needed. It, therefore, comes as no surprise to observe that the Navier-Stokes has already begun before Euler solutions were fully exploited. Moreover, most numerical developments for the Euler equations are now constrained by the requirement that the techniques introduced, notably artificial dissipation, must not interfere with the new physics added when going from an Euler to a full Navier-Stokes approximation. In order to appreciate the contributions of Euler solvers to the understanding of transonic aerodynamics, it is useful to review the components of these computational tools. Space discretization, time- or pseudo-time marching and boundary procedures, the essential constituents are discussed. The subject of grid generation and grid adaptation to the solution are touched upon only where relevant. A list of unanswered questions and an outlook for the future are covered

Convergence of Defect-Correction and Multigrid Iterations for Inviscid Flows

Convergence of multigrid and defect-correction iterations is comprehensively studied within different incompressible and compressible inviscid regimes on high-density grids. Good smoothing properties of the defect-correction relaxation have been shown using both a modified Fourier analysis and a more general idealized-coarse-grid analysis. Single-grid defect correction alone has some slowly converging iterations on grids of medium density. The convergence is especially slow for near-sonic flows and for very low compressible Mach numbers. Additionally, the fast asymptotic convergence seen on medium density grids deteriorates on high-density grids. Certain downstream-boundary modes are very slowly damped on high-density grids. Multigrid scheme accelerates convergence of the slow defect-correction iterations to the extent determined by the coarse-grid correction. The two-level asymptotic convergence rates are stable and significantly below one in most of the regions but slow convergence is noted for near-sonic and very low-Mach compressible flows. Multigrid solver has been applied to the NACA 0012 airfoil and to different flow regimes, such as near-tangency and stagnation. Certain convergence difficulties have been encountered within stagnation regions. Nonetheless, for the airfoil flow, with a sharp trailing-edge, residuals were fast converging for a subcritical flow on a sequence of grids. For supercritical flow, residuals converged slower on some intermediate grids than on the finest grid or the two coarsest grids

On (essentially) non-oscillatory discretizations of evolutionary convection-diffusion equations

Finite element and finite difference discretizations for evolutionary convection-diffusion-reaction equations in two and three dimensions are studied which give solutions without or with small under- and overshoots. The studied methods include a linear and a nonlinear FEM-FCT scheme, simple upwinding, an ENO scheme of order 3, and a fifth order WENO scheme. Both finite element methods are combined with the Crank--Nicolson scheme and the finite difference discretizations are coupled with explicit total variation diminishing Runge--Kutta methods. An assessment of the methods with respect to accuracy, size of under- and overshoots, and efficiency is presented, in the situation of a domain which is a tensor product of intervals and of uniform grids in time and space. Some comments to the aspects of adaptivity and more complicated domains are given. The obtained results lead to recommendations concerning the use of the methods

On (essentially) non-oscillatory discretizations of evolutionary convection-diffusion equations

Finite element and finite difference discretizations for evolutionary convection-dif\-fusion-reaction equations in two and three dimensions are studied which give solutions without or with small under- and overshoots. The studied methods include a linear and a nonlinear FEM-FCT scheme, simple upwinding, an ENO scheme of order 3, and a fifth order WENO scheme. Both finite element methods are combined with the Crank--Nicolson scheme and the finite difference discretizations are coupled with explicit total variation diminishing Runge--Kutta methods. An assessment of the methods with respect to accuracy, size of under- and overshoots, and efficiency is presented, in the situation of a domain which is a tensor product of intervals and of uniform grids in time and space. Some comments to the aspects of adaptivity and more complicated domains are given. The obtained results lead to recommendations concerning the use of the methods

Efficient upwind algorithms for solution of the Euler and Navier-stokes equations

An efficient three-dimensionasl tructured solver for the Euler and Navier-Stokese quations is developed based on a finite volume upwind algorithm using Roe fluxes. Multigrid and optimal smoothing multi-stage time stepping accelerate convergence. The accuracy of the new solver is demonstrated for inviscid flows in the range 0.675 :5M :5 25. A comparative grid convergence study for transonic turbulent flow about a wing is conducted with the present solver and a scalar dissipation central difference industrial design solver. The upwind solver demonstrates faster grid convergence than the central scheme, producing more consistent estimates of lift, drag and boundary layer parameters. In transonic viscous computations, the upwind scheme with convergence acceleration is over 20 times more efficient than without it. The ability of the upwind solver to compute viscous flows of comparable accuracy to scalar dissipation central schemes on grids of one-quarter the density make it a more accurate, cost effective alternative. In addition, an original convergencea cceleration method termed shock acceleration is proposed. The method is designed to reduce the errors caused by the shock wave singularity M -+ 1, based on a localized treatment of discontinuities. Acceleration models are formulated for an inhomogeneous PDE in one variable. Results for the Roe and Engquist-Osher schemes demonstrate an order of magnitude improvement in the rate of convergence. One of the acceleration models is extended to the quasi one-dimensiona Euler equations for duct flow. Results for this case d monstrate a marked increase in convergence with negligible loss in accuracy when the acceleration procedure is applied after the shock has settled in its final cell. Typically, the method saves up to 60% in computational expense. Significantly, the performance gain is entirely at the expense of the error modes associated with discrete shock structure. In view of the success achieved, further development of the method is proposed

Research in Applied Mathematics, Fluid Mechanics and Computer Science

This report summarizes research conducted at the Institute for Computer Applications in Science and Engineering in applied mathematics, fluid mechanics, and computer science during the period October 1, 1998 through March 31, 1999