Algorithms for particle remeshing applied to smoothed particle hydrodynamics

This thesis outlines adaptivity schemes for particle-based methods for the simulation of nearly incompressible fluid flows. As with the remeshing schemes used in mesh and grid-based methods, there is a need to use localized refinement in particle methods to reduce computational costs. Various forms of particle refinement have been proposed for particle-based methods such as Smoothed Particle Hydrodynamics (SPH). However, none of the techniques that exist currently are able to retain the original degree of randomness among particles. Existing methods reinitialize particle positions on a regular grid. Using such a method for region localized refinement can lead to discontinuities at the interfaces between refined and unrefined particle domains. In turn, this can produce inaccurate results or solution divergence. This thesis outlines the development of new localized refinement algorithms that are capable of retaining the initial randomness of the particles, thus eliminating transition zone discontinuities. The algorithms were tested through SPH simulations of Couette Flow and Poiseuille Flow with spatially varying particle spacing. The determined velocity profiles agree well with theoretical results. In addition, the algorithms were also tested on a flow past a cylinder problem, but with a complete domain remeshing. The original and the remeshed particle distributions showed similar velocity profiles. The algorithms can be extended to 3-D flows with few changes, and allow the simulation of multi-scale flows at reduced computational costs.

Department dc:contributor.department

Massachusetts Institute of Technology. Computation for Design and Optimization Program.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2009

Author dc:creator

• Galagali, Nikhil

Advisor dc:contributor.advisor

• John R. Williams.

• Computation for Design and Optimization Program.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/55074

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/55074