In meshfree methods, partial differential equations are solved on an unstructured cloud of points distributed throughout the computational domain. In collocated meshfree methods, the differential operators are directly approximated at each grid point based on a local cloud of neighboring points. The set of neighboring nodes used to construct the local approximation is determined using a variable search radius. The variable search radius establishes an implicit nodal connectivity and hence a mesh is not required. As a result, meshfree methods have the potential flexibility to handle problem sets where the computational grid may undergo large deformations as well as where the grid may need to undergo adaptive refinement. In this work we develop the sharp interface formulation of the immersed boundary method for collocated meshfree approximations. We use the framework to implement three meshfree methods: General Finite Differences (GFD), Smoothed Particle Hydrodynamics (SPH), and Moving Least Squares (MLS). We evaluate the numerical accuracy and convergence rate of these methods by solving the 2D Poisson equation. We demonstrate that GFD is computationally more efficient than MLS and show that its accuracy is superior to a popular corrected form of SPH and comparable to MLS. We then use GFD to solve several canonic steady state fluid flow problems on meshfree grids generated using uniform and variable radii Poisson disk algorithm.
| Identifer | oai:union.ndltd.org:GATECH/oai:smartech.gatech.edu:1853/54425 |
| Date | 07 January 2016 |
| Creators | Vasyliv, Yaroslav V. |
| Contributors | Alexeev, Alexander |
| Publisher | Georgia Institute of Technology |
| Source Sets | Georgia Tech Electronic Thesis and Dissertation Archive |
| Language | en_US |
| Detected Language | English |
| Type | Thesis |
| Format | application/pdf |
Page generated in 0.0021 seconds