Potential Flow Simulation through Lagrangian Interpolation Meshless Method Coding

From the past many decades, mesh generation posed many challenges in the field of computational sciences for many researches. High rise in computational power has enabled many researches to tackle the problems of complex geometries. Due to the high need of computational power, computational cost als...

Full description

Saved in:
Bibliographic Details
Published inJournal of applied fluid mechanics Vol. 11; no. SI; p. 129
Main Authors Avudaiappan, T, Vijayan, V, S. Sundara Pandiyan, Saravanan, M, Dinesh, S
Format Journal Article
LanguageEnglish
Published Isfahan Isfahan University of Technology 01.10.2018
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:From the past many decades, mesh generation posed many challenges in the field of computational sciences for many researches. High rise in computational power has enabled many researches to tackle the problems of complex geometries. Due to the high need of computational power, computational cost also increased abruptly. In today’s world, many academic and industry researches are willing to increase the use of present simulation technology; mesh generation plays a vital role in this aspect. we can say that many real-world simulation problems are dependent on mesh generation which has more chances in giving an inaccurate simulation results. In order to make the simulation process simpler, Meshless methods are introduced to the field of Computational Fluid Dynamics. This technique requires a less computational power compared to the computational power needed for generating the mesh. In the present dissertation, our main objective is to develop a scheme for Meshless method for the field of Computational Fluid Dynamics for flow over a blunt body. The performance of the present scheme is evaluated by comparing the simulation results with existing experimental data and also compared with the results obtained by generation of mesh using commercial CFD software.
ISSN:1735-3572
1735-3645
DOI:10.36884/jafm.11.SI.29429