whelming. On the other hand, the development of efficient numerical methods for solution of the Navier-Stokes equa-Efficient preconditioned multigrid methods are developed for both inviscid and viscous flow applications. The work is motivated tions remains one of the ongoing challenges in the field
An efficient implicit mesh-less method for compressible flow calculations
✍ Scribed by M. Y. Hashemi; A. Jahangirian
- Publisher
- John Wiley and Sons
- Year
- 2010
- Tongue
- English
- Weight
- 887 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0271-2091
- DOI
- 10.1002/fld.2387
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A dual‐time implicit mesh‐less scheme is presented for calculation of compressible inviscid flow equations. The Taylor series least‐square method is used for approximation of spatial derivatives at each node which leads to a central difference discretization. Several convergence acceleration techniques such as local time stepping, enthalpy damping and residual smoothing are adopted in this approach. The capabilities of the method are demonstrated by flow computations around single and multi‐element airfoils at subsonic, transonic and supersonic flow conditions. Results are presented which indicate good agreements with other reliable finite‐volume results. The computational time is considerably reduced when using the proposed mesh‐less method compared with the explicit mesh‐less and finite‐volume schemes using the same point distributions. Copyright © 2010 John Wiley & Sons, Ltd.
📜 SIMILAR VOLUMES
The development of new aeronautic projects require accurate and ef®cient simulations of compressible ¯ows in complex geometries. It is well known that most ¯ows of interest are at least locally turbulent and that the modelling of this turbulence is critical for the reliability of the computations. A
Classical semi-implicit backward Euler/Adams-Bashforth time discretizations of the Navier-Stokes equations induce, for high-Reynolds number flows, severe restrictions on the time step. Such restrictions can be relaxed by using semi-Lagrangian schemes essentially based on splitting the full problem i