## An Implicit Upwind Algorithm for Computing Turbulent Flows on Unstructured Grids. (1994)

Venue: | Computers and Fluids |

Citations: | 78 - 12 self |

### BibTeX

@ARTICLE{Anderson94animplicit,

author = {W. Kyle Anderson and Daryl L. Bonhaus},

title = {An Implicit Upwind Algorithm for Computing Turbulent Flows on Unstructured Grids.},

journal = {Computers and Fluids},

year = {1994},

volume = {23},

pages = {1--21}

}

### Years of Citing Articles

### OpenURL

### Abstract

Introduction For computing flows on complicated geometries such as multielement airfoils, the use of unstructured grids offers a good alternative to more traditional methods of analysis. This is primarily due to the promise of dramatically decreased time required to generate grids over complicated geometries. Also, unstructured grids offer the capability to locally adapt the grid to improve the accuracy of the computation without incurring the penalties associated with global refinement. While work remains to be done to fully realize their potential, much progress has been made in computing viscous flows on unstructured grids. While several advances have been made for computing turbulent flow on unstructured grids (e.g. [1] [2]), probably the most mature and widely used code for computing two-dimensional turbulent viscous flow on unstructured grids is that of Mavriplis [3]. In this reference, the solution algorithm is a Galerkin finite-element discretization and a Runge-Kutta