Parallel mesh partitioning based on space filling curves

DOI10.1016/j.compfluid.2018.01.040zbMath1410.65470OpenAlexW2794175931MaRDI QIDQ1615518

R. Smith

Publication date: 31 October 2018

Published in: Computers and Fluids (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/125789

zbMATH Keywords

sfcparallel computinggeometric partitioningspace filling curvemesh partitioning

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (6)

Dynamic resource allocation for efficient parallel CFD simulations ⋮ A deep learning energy method for hyperelasticity and viscoelasticity ⋮ Enhanced physics‐informed neural networks for hyperelasticity ⋮ A cache-efficient reordering method for unstructured meshes with applications to wall-resolved large-eddy simulations ⋮ A hierarchical parallel implementation for heterogeneous computing. Application to algebra-based CFD simulations on hybrid supercomputers ⋮ Dynamic load balance of chemical source term evaluation in high-fidelity combustion simulations

Uses Software

• PT-Scotch
• Zoltan
• Alya

Cites Work

• Extension of fractional step techniques for incompressible flows: the preconditioned Orthomin(1) for the pressure Schur complement
• A massively parallel fractional step solver for incompressible flows
• Space-filling curves
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

This page was built for publication: Parallel mesh partitioning based on space filling curves