2013
DOI: 10.1002/fld.3799
|View full text |Cite
|
Sign up to set email alerts
|

A meshless finite point method for three‐dimensional analysis of compressible flow problems involving moving boundaries and adaptivity

Abstract: This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.A finite point method for solving compressible flow problems involving moving boundaries and adaptivity is presented. The numerical methodology is based on an upwind-biased discretization of the Euler equations, written in arbitrary Lagrangian–Eulerian form and integrated in time by means of a dual-time steeping technique. In order to exploit the meshless potential of the method, a domain defor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 18 publications
(10 citation statements)
references
References 33 publications
(61 reference statements)
0
10
0
Order By: Relevance
“…good quality and automated mesh generation for complex geometries with sharp edges [33], replace the traditionally used grid by a dense cloud of points based on which conservation laws can be discretized [34]. Whilst connectivity information is inherently lost, more programming effort is needed compared to traditional meshbased methods since there is still the need for finding the neighbours which lie within the domain of influence of each node [35], which can be a very time consuming task.…”
Section: Background a Existing Unsteady Cfd Meshing Methodsmentioning
confidence: 99%
“…good quality and automated mesh generation for complex geometries with sharp edges [33], replace the traditionally used grid by a dense cloud of points based on which conservation laws can be discretized [34]. Whilst connectivity information is inherently lost, more programming effort is needed compared to traditional meshbased methods since there is still the need for finding the neighbours which lie within the domain of influence of each node [35], which can be a very time consuming task.…”
Section: Background a Existing Unsteady Cfd Meshing Methodsmentioning
confidence: 99%
“…The reason is that replacing and moving points are much simpler than changing or replacing the edges and volumes. Another attractive property of meshless methods is the ability of adding and subtracting nodes from the pre-existing nodes [16]. There are di erent grid adaptation methods that normally fall in three categories of grid movement, grid re nement/coarsening, and re-gridding strategies.…”
Section: Introductionmentioning
confidence: 99%
“…Until now, these aforementioned research works of meshless methods for steady and unsteady flows past fixed solid bodies have mostly been carried out with serial computing on a single core of the CPU. On the other hand, Ortega et al [10,11] paid attention to the parallelisation of the finite point method on multi-core CPUs with the OpenMP programming model. They observed unsatisfactory scalability problems and pointed out that attainable speedups on multi-core CPUs will drop once the number of processor cores is over 4 due to the high cache miss rate and 2 limited memory bandwidth of CPU.…”
Section: Introductionmentioning
confidence: 99%