CPAFT: A consistent parallel advancing front technique for unstructured triangular/tetrahedral mesh generation: CPAFT: a consistent parallel advancing front technique for unstructured triangular/tetrahedral mesh generation
Gespeichert in:
| Titel: | CPAFT: A consistent parallel advancing front technique for unstructured triangular/tetrahedral mesh generation: CPAFT: a consistent parallel advancing front technique for unstructured triangular/tetrahedral mesh generation |
|---|---|
| Autoren: | Chengdi Ma, Jizu Huang, Hao Luo, Chao Yang |
| Quelle: | Computer Physics Communications. 310:109535 |
| Publication Status: | Preprint |
| Verlagsinformationen: | Elsevier BV, 2025. |
| Publikationsjahr: | 2025 |
| Schlagwörter: | Computational Geometry (cs.CG), FOS: Computer and information sciences, Multigrid methods, domain decomposition for boundary value problems involving PDEs, 65M50, 65M55, 68W10, parallel computing, Parallel numerical computation, advancing front technique, Numerical Analysis (math.NA), maximal independent set, Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs, domain decomposition, FOS: Mathematics, Computer Science - Computational Geometry, unstructured triangular/tetrahedral mesh generation, Mathematics - Numerical Analysis |
| Beschreibung: | Compared with the remarkable progress made in parallel numerical solvers of partial differential equations,the development of algorithms for generating unstructured triangular/tetrahedral meshes has been relatively sluggish. In this paper, we propose a novel, consistent parallel advancing front technique (CPAFT) by combining the advancing front technique, the domain decomposition method based on space-filling curves, the distributed forest-of-overlapping-trees approach, and the consistent parallel maximal independent set algorithm. The newly proposed CPAFT algorithm can mathematically ensure that the generated unstructured triangular/tetrahedral meshes are independent of the number of processors and the implementation of domain decomposition. Several numerical tests are conducted to validate the parallel consistency and outstanding parallel efficiency of the proposed algorithm, which scales effectively up to two thousand processors. This is, as far as we know, the first parallel unstructured triangular/tetrahedral mesh generator with scalability to O(1,000) CPU processors. |
| Publikationsart: | Article |
| Dateibeschreibung: | application/xml |
| Sprache: | English |
| ISSN: | 0010-4655 |
| DOI: | 10.1016/j.cpc.2025.109535 |
| DOI: | 10.48550/arxiv.2405.20618 |
| Zugangs-URL: | http://arxiv.org/abs/2405.20618 https://zbmath.org/8020990 https://doi.org/10.1016/j.cpc.2025.109535 |
| Rights: | Elsevier TDM arXiv Non-Exclusive Distribution |
| Dokumentencode: | edsair.doi.dedup.....0f5df9c8b48e3bab2fc2e4892d2bc91e |
| Datenbank: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | Compared with the remarkable progress made in parallel numerical solvers of partial differential equations,the development of algorithms for generating unstructured triangular/tetrahedral meshes has been relatively sluggish. In this paper, we propose a novel, consistent parallel advancing front technique (CPAFT) by combining the advancing front technique, the domain decomposition method based on space-filling curves, the distributed forest-of-overlapping-trees approach, and the consistent parallel maximal independent set algorithm. The newly proposed CPAFT algorithm can mathematically ensure that the generated unstructured triangular/tetrahedral meshes are independent of the number of processors and the implementation of domain decomposition. Several numerical tests are conducted to validate the parallel consistency and outstanding parallel efficiency of the proposed algorithm, which scales effectively up to two thousand processors. This is, as far as we know, the first parallel unstructured triangular/tetrahedral mesh generator with scalability to O(1,000) CPU processors. |
|---|---|
| ISSN: | 00104655 |
| DOI: | 10.1016/j.cpc.2025.109535 |