A physics-motivated centroidal Voronoi particle domain decomposition method

DOI10.1016/j.jcp.2017.01.051zbMath1380.65263OpenAlexW2581612763WikidataQ61612648 ScholiaQ61612648MaRDI QIDQ1685464

Xiangyu Y. Hu, Lin Fu, Nikolaus A. Adams

Publication date: 14 December 2017

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2017.01.051

zbMATH Keywords

partitioningcentroidal Voronoi tessellationhigh-performance parallel computingVoronoi particle dynamics

Mathematics Subject Classification ID

Particle methods and lattice-gas methods (76M28) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60)

Related Items (11)

A block-based adaptive particle refinement SPH method for fluid-structure interaction problems ⋮ An optimal particle setup method with centroidal Voronoi particle dynamics ⋮ A new particle shifting technique for SPH methods based on Voronoi diagram and volume compensation ⋮ A Lagrangian inertial centroidal Voronoi particle method for dynamic load balancing in particle-based simulations ⋮ Dynamic domain decomposition method based on weighted Voronoi diagrams ⋮ A semi-meshless Lagrangian finite-volume framework based on Voronoi diagram for general elastoplastic Reissner-Mindlin shell ⋮ Large-scale flow simulations using lattice Boltzmann method with AMR following free-surface on multiple GPUs ⋮ A new multi-resolution parallel framework for SPH ⋮ A consistent parallel isotropic unstructured mesh generation method based on multi-phase SPH ⋮ A new adaptation strategy for multi-resolution method ⋮ Multi-level adaptive particle refinement method with large refinement scale ratio and new free-surface detection algorithm for complex fluid-structure interaction problems

Uses Software

• Scotch
• adsimp

Cites Work

• Adaptive reconnection-based arbitrary Lagrangian Eulerian method
• Graph partitioning models for parallel computing
• Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations
• Grid generation and optimization based on centroidal Voronoi tessellations
• The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space
• Advances in Studies and Applications of Centroidal Voronoi Tessellations
• Acceleration schemes for computing centroidal Voronoi tessellations
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Anisotropic Centroidal Voronoi Tessellations and Their Applications
• Centroidal Voronoi Tessellations: Applications and Algorithms
• Least squares quantization in PCM
• An adaptive numerical cubature algorithm for simplices
• Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
• Unnamed Item
• Unnamed Item

This page was built for publication: A physics-motivated centroidal Voronoi particle domain decomposition method