A novel partitioning method for block-structured adaptive meshes
DOI10.1016/j.jcp.2016.11.016zbMath1376.76049OpenAlexW2551287835WikidataQ61612698 ScholiaQ61612698MaRDI QIDQ1686600
Lin Fu, Nikolaus A. Adams, Sergej Litvinov, Xiangyu Y. Hu
Publication date: 15 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.2016.11.016
adaptive mesh refinementLagrangian particle methodgrid partitioningsmoothed-particle hydrodynamicsdynamic ghost particle methodmultiresolution cell-linked list
Particle methods and lattice-gas methods (76M28) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Probabilistic methods, particle methods, etc. for initial value and initial-boundary value problems involving PDEs (65M75)
Related Items (10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unified semi-analytical wall boundary conditions applied to 2-D incompressible SPH
- Adaptive multi-resolution method for compressible multi-phase flows with sharp interface model and pyramid data structure
- A new 3D parallel SPH scheme for free surface flows
- A new adaptive mesh refinement data structure with an application to detonation
- SPH particle boundary forces for arbitrary boundaries
- A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries
- Adaptive mesh refinement for hyperbolic partial differential equations
- Parallel adaptation of general three-dimensional hybrid meshes
- Space-filling curves
- Dynamic load balancing in computational mechanics
- Graph partitioning models for parallel computing
- Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM
- Smoothed particle hydrodynamics modeling of viscous liquid drop without tensile instability
- Parallel mesh-partitioning algorithms for generating shape optimised partitions using evolutionary computing
- A multi-phase SPH method for macroscopic and mesoscopic flows
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- The priority R-tree
- Space filling curves and mathematical programming
This page was built for publication: A novel partitioning method for block-structured adaptive meshes