Javascript must be enabled to continue!
Study on divergence approximation formula for pressure calculation in particle method
View through CrossRef
The moving particle semi-implicit method is a meshless particle method for incompressible fluid and has proven useful in a wide variety of engineering applications of free-surface flows. Despite its wide applicability, the moving particle semi-implicit method has the defects of spurious unphysical pressure oscillation. Three various divergence approximation formulas, including basic divergence approximation formula, difference divergence approximation formula, and symmetric divergence approximation formula are proposed in this paper. The proposed three divergence approximation formulas are then applied for discretization of source term in pressure Poisson equation. Two numerical tests, including hydrostatic pressure problem and dam-breaking problem, are carried out to assess the performance of different formulas in enhancing and stabilizing the pressure calculation. The results demonstrate that the pressure calculated by basic divergence approximation formula and difference divergence approximation formula fluctuates severely. However, application of symmetric divergence approximation formula can result in a more accurate and stabilized pressure.
Title: Study on divergence approximation formula for pressure calculation in particle method
Description:
The moving particle semi-implicit method is a meshless particle method for incompressible fluid and has proven useful in a wide variety of engineering applications of free-surface flows.
Despite its wide applicability, the moving particle semi-implicit method has the defects of spurious unphysical pressure oscillation.
Three various divergence approximation formulas, including basic divergence approximation formula, difference divergence approximation formula, and symmetric divergence approximation formula are proposed in this paper.
The proposed three divergence approximation formulas are then applied for discretization of source term in pressure Poisson equation.
Two numerical tests, including hydrostatic pressure problem and dam-breaking problem, are carried out to assess the performance of different formulas in enhancing and stabilizing the pressure calculation.
The results demonstrate that the pressure calculated by basic divergence approximation formula and difference divergence approximation formula fluctuates severely.
However, application of symmetric divergence approximation formula can result in a more accurate and stabilized pressure.
Related Results
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Let [Formula: see text] be a connected graph of order at least two with vertex set [Formula: see text]. For [Formula: see text], let [Formula: see text] denote the length of an [Fo...
Theoretical study of laser-cooled SH<sup>–</sup> anion
Theoretical study of laser-cooled SH<sup>–</sup> anion
The potential energy curves, dipole moments, and transition dipole moments for the <inline-formula><tex-math id="M13">\begin{document}${{\rm{X}}^1}{\Sigma ^ + }$\end{do...
A saturation problem in meshes
A saturation problem in meshes
Let [Formula: see text] and [Formula: see text] be graphs, where we view [Formula: see text] as the “host” graph and [Formula: see text] as a “forbidden” graph. A spanning subgraph...
When is R[θ] integrally closed?
When is R[θ] integrally closed?
Let [Formula: see text] be an integrally closed domain with quotient field [Formula: see text] and [Formula: see text] be an element of an integral domain containing [Formula: see ...
Revisiting near-threshold photoelectron interference in argon with a non-adiabatic semiclassical model
Revisiting near-threshold photoelectron interference in argon with a non-adiabatic semiclassical model
<sec> <b>Purpose:</b> The interaction of intense, ultrashort laser pulses with atoms gives rise to rich non-perturbative phenomena, which are encoded within th...
Inductive graph invariants and approximation algorithms
Inductive graph invariants and approximation algorithms
We introduce and study an inductively defined analogue [Formula: see text] of any increasing graph invariant [Formula: see text]. An invariant [Formula: see text] is increasing if ...
Ld(2,1)-labeling on T-graphs
Ld(2,1)-labeling on T-graphs
In this paper, we are concerned with the [Formula: see text]-Graphs, which are graphs defined based on the Topological structure of the given set. Precisely, for a given topology [...
The Aα-eigenvalues of the generalized subdivision graph
The Aα-eigenvalues of the generalized subdivision graph
Let [Formula: see text] be a graph with an adjacency matrix [Formula: see text] and a diagonal degree matrix [Formula: see text]. For any graph [Formula: see text] and a real numbe...

