Abstract
AbstractNew versions of implicit algorithms are developed for the efficient solution of the Euler and Navier–Stokes equations of compressible flow. The methods are based on a preconditioned, lower‐upper (LU) implementation of a non‐linear, symmetric Gauss‐Seidel (SGS) algorithm for use as a smoothing algorithm in a multigrid method. Previously, this method had been implemented for flows in quasi‐one‐dimensional ducts and for two‐dimensional flows past airfoils on boundary‐conforming ‘O’‐type grids for a variety of symmetric limited positive (SLIP) spatial approximations, including the scalar dissipation and convective upwind split pressure (CUSP) schemes. Here results are presented for both inviscid and viscous (laminar) flows past airfoils on boundary‐conforming ‘C’‐type grids. The method is significantly faster than earlier explicit or implicit methods for inviscid problems, allowing solution of these problems to the level of truncation error in three to five multigrid cycles. Viscous solutions still require as many as twenty multigrid cycles. Copyright © 2003 John Wiley & Sons, Ltd.
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call