Finite-volume droplet trajectories for icing simulation

During a Lagrangian icing simulation, it is necessary to calculate a large number of droplet trajectories to determine the water catch, and as a result it is important that this procedure is as rapid as possible. In order to arrive at a method with minimum complexity, a finite volume representation of streamlines is extended to incorporate the equations of motion for a droplet. Using a finite volume representation means that the accuracy of the droplet motion is consistent with the underlying flow simulation, and that any flow cell may be crossed in a single timestep as the velocity is constant and the trajectory is therefore a sequence of straight line segments. However, since cells vary greatly in size, the method must be implicit to avoid a stability restriction which would otherwise degrade performance. Therefore, an implicit method is implemented by carrying out a handful of coupling iterations for every cell for each timestep, so that the droplet motion is tightly coupled to the underlying flow. By crossing every cell in a single step, and by using the mesh connectivity to track the droplet motion between cells, any need for costly searches is eliminated and the resulting method is very efficient. The final method is able to find 100000 trajectories on a mesh of 460000 cells in only 2-3 minutes, using standard hardware and unoptimised code and carrying an I/O overhead. I. Introduction Calculation of droplet or solid particle trajectories is a problem that arises across a wide range of disciplines, ranging from icing simulation to combustion modelling and chemical engineering. Modern techniques apply CFD to calculate the flow field surrounding droplets, and then integrate Newton’s second law to determine the trajectory. However, this means using the flow field information (which usually consists of just the velocity, but it might also include temperature or other flow parameters), which is Eulerian in nature, within a Lagrangian calculation, and hence requires a method of tracking. The question of tracking a massless particle (to give a streamline) through a finite-volume mesh is straightforward, but does pose the question of finding the most efficient way to perform this tracking. Many hundreds of thousands of droplets may ultimately need to be tracked, so it is important to carry out this part of the calculation as quickly as possible. The level of complexity is substantially increased by introducing the droplet equations of motion, as these can imply stability restrictions, and for efficiency it is necessary to resolve these numerical limitations with the method of tracking. This work starts by describing the simplest possible way to represent streamlines on a finite-volume mesh, before moving on to incorporate the equations of motion and thereby give a trajectory. The final result is a method for finding droplet trajectories that is fast, adaptive to the volume mesh resolution and without timestep restrictions. The basic method is first order accurate in space and time, but these may be increased at the expense of reliability or complexity if desired.

[1]  Michael Breuer,et al.  Comparison of c‐space and p‐space particle tracing schemes on high‐performance computers: accuracy and performance , 2002 .

[2]  Paul Kutler,et al.  Fifteenth International Conference on Numerical Methods in Fluid Dynamics : proceedings of the conference, held in Monterey, CA, USA, 24-28 June 1996 , 1997 .

[3]  Mark G. Potapczuk,et al.  LEWICE/E: An Euler based ice accretion code , 1992 .

[4]  Gregory M. Nielson,et al.  Tools for Computing Tangent Curves for Linearly Varying Vector Fields over Tetrahedral Domains , 1999, IEEE Trans. Vis. Comput. Graph..

[5]  N. Fueyo,et al.  An efficient particle-locating algorithm for application in arbitrary 2D and 3D grids , 2002 .

[6]  Gary A. Ruff,et al.  Users Manual for the NASA Lewis Ice Accretion Prediction Code (LEWICE) , 1990 .

[7]  Lawrence F. Shampine,et al.  A User’s View of Solving Stiff Ordinary Differential Equations , 1979 .

[8]  M. Leschziner,et al.  An improved particle-locating algorithm for Eulerian-Lagrangian computations of two-phase flows in general coordinates , 1999 .

[9]  Dimitri J. Mavriplis,et al.  Revisiting the Least-squares Procedure for Gradient Reconstruction on Unstructured Meshes , 2003 .

[10]  Günther Greiner,et al.  Local Exact Particle Tracing on Unstructured Grids , 2003, Comput. Graph. Forum.

[11]  Uri M. Ascher,et al.  Computer methods for ordinary differential equations and differential-algebraic equations , 1998 .

[12]  W. Habashi,et al.  A finite element eulerian approach to the inflight icing problem , 1997 .

[13]  D. Darmofal,et al.  An Analysis of 3D Particle Path Integration Algorithms , 1996 .

[15]  James P. Ferry,et al.  An efficient and robust particle-localization algorithm for unstructured grids , 2007, J. Comput. Phys..

[16]  Theo van Walsum,et al.  Particle Tracing Algorithms for 3D Curvilinear Grids , 1994, Scientific Visualization.

[17]  J. Bonet,et al.  An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems , 1991 .

[18]  Tien D. Bui Some A-Stable and L-Stable Methods for the Numerical Integration of Stiff Ordinary Differential Equations , 1979, JACM.

[19]  Graham B. Macpherson,et al.  Particle tracking in unstructured, arbitrary polyhedral meshes for use in CFD and molecular dynamics , 2009 .

[20]  G. T. Eigestad,et al.  Improved streamlines and time-of-flight for streamline simulation on irregular grids , 2007 .

[21]  Steven C. Caruso,et al.  LEWICE droplet trajectory calculations on a parallel computer , 1993 .

[22]  Aibing Yu,et al.  A new point-locating algorithm under three-dimensional hybrid meshes , 2008 .

[23]  Wagdi G. Habashi,et al.  FENSAP-ICE's Three-Dimensional In-Flight Ice Accretion Module: ICE3D , 2003 .

[24]  M. Papadakis,et al.  Water Droplet Impingement on Simulated Glaze, Mixed, and Rime Ice Accretions , 2007 .