1990
DOI: 10.1016/0021-9991(90)90146-r
|View full text |Cite
|
Sign up to set email alerts
|

A particle-grid superposition method for the Navier-Stokes equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
24
0

Year Published

1991
1991
2005
2005

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 30 publications
(24 citation statements)
references
References 8 publications
0
24
0
Order By: Relevance
“…Matching subdomains impose strong geometrical constraints on the grids defined on each sub-domain. By contrast, the flexibility added by overlapping sub-domains has already been useful to derive domain decomposition algorithms that combine Eulerian and Lagrangian solvers [3,15].…”
Section: Variable Blobs Local Mappings and Domain Decompositionmentioning
confidence: 99%
See 1 more Smart Citation
“…Matching subdomains impose strong geometrical constraints on the grids defined on each sub-domain. By contrast, the flexibility added by overlapping sub-domains has already been useful to derive domain decomposition algorithms that combine Eulerian and Lagrangian solvers [3,15].…”
Section: Variable Blobs Local Mappings and Domain Decompositionmentioning
confidence: 99%
“…• Particles x 1 p and x 2 p lying in 1 ∩ 3 and 2 ∩ 3 , respectively, are remeshed on the uniform mesh 3 ; we thus obtain a new distributionω 3 …”
mentioning
confidence: 99%
“…As for the particle method, since the values of the weights are not affected by the convection, the mechanism for such an acceleration of the dissipation must involve the deformation of the Lagrangian mesh appearing in the diffusion formula (1.6). Actually, it can be observed that this deformation eventually leads to a local value of the viscosity which can exceed v significantly (see [2] for a discussion of this point). We have performed experiments with smooth and nonsmooth forcing terms.…”
Section: Numerical Illustrationsmentioning
confidence: 99%
“…A large number of the solvers, coming from the tremendous progress in the domain decomposition methods (see [30,31,38,43]), can be explored and possibly applied to problems set on unbounded domains. Currently, not much work achieved on the Schwarz algorithm for exterior problems has provided encouraging results (see, for instance, [2,9,32,33]). The core of this contribution is the new iterative method introduced in [3], for the Poisson model set in open domains, for which a full analysis is detailed.…”
mentioning
confidence: 99%