Proceedings of ISP RAS


The LS-STAG Immersed Boundary Method Modification for Viscoelastic Flow Computations

V. Puzikova (BMSTU, Moscow, Russia)

Abstract

The LS-STAG immersed boundary cut-cell method modification for viscoelastic flow computations is presented. Rate type viscoelastic flow models (linear and quasilinear) are considered. Formulae for differential types of convected time derivatives the LS-STAG discretization was obtained. Normal non-newtonian stresses are computed at the centers of base LS-STAG mesh cells and shear non-newtonian stresses are computed at the cell corners. The LS-STAG-discretization of extra-stress equations for viscoelastic Maxwell, Jeffreys, upper-convected Maxwell, Maxwell-A, Oldroyd-B, Oldroyd-A, Johnson — Segalman fluids was developed. Time-stepping algorithm is defined by the following three steps. Firstly, a prediction of the velocity and pressure correction are computed by means of semi-implicit Euler scheme. Secondly, the provisional velocity is corrected to get a solenoidal velocity and the corresponding pressure field. After this the extra-stress equations are solved. Applications to popular benchmarks for viscoelastic flows with stationary boundaries and comparisons with experimental and numerical studies are presented. The results show that the developed LS-STAG method modification demonstrates an accuracy comparable to body-fitted methods. The obtained modification is implemented in the «LS-STAG» software package developed by the author. This software allows to simulate viscous incompressible flows around a moving airfoil of arbitrary shape or airfoils system with one or two degrees of freedom. For example, it allows to simulate rotors autorotation and airfoils system wind resonance. Intel® Cilk™ Plus, Intel® TBB and OpenMP parallel programming technologies are used in the «LS-STAG».

Keywords

Incompressible Flows; Viscoelastic Flows; Rate Type Viscoelastic Flow Models; Immersed Boundary Methods; the LS-STAG Method

Edition

Proceedings of the Institute for System Programming, vol. 29, issue 1, 2017, pp. 71-84.

ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).

DOI: 10.15514/ISPRAS-2017-29(1)-5

Full text of the paper in pdf (in Russian) Back to the contents of the volume