Parallel algorithm for particle-grid dual discretization

Particle-grid dual discretization methods employ one group of Lagrangian particles and one set of background grid, which demonstrate attractive properties because they inherit both the advantages of Lagrangian and Eulerian methods. An efficient parallel algorithm for particle-grid dual discretizatio...

Full description

Saved in:

Bibliographic Details
Published in:	Computational mechanics Vol. 71; no. 2; pp. 257 - 276
Main Authors:	Zhao, LeiYang, Wang, Shuai, Liu, Yan
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2023 Springer Springer Nature B.V
Subjects:	Algorithms Classical and Continuum Physics Computational Science and Engineering Coupling (molecular) Discretization Domain decomposition methods Dynamic loads Engineering Molecular dynamics Multiprocessing Multiscale analysis Original Paper Theoretical and Applied Mechanics Material point method Parallel communication Load balancing Domain decomposition Smoothed molecular dynamics
ISSN:	0178-7675, 1432-0924
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!