An empirical comparison of decomposition algorithms for complex finite element meshes

DOI10.1007/3-540-48086-2_54MaRDI QIDQ4737403zbMATH OpenFDO

Authors Tomasz Jurczyk, Barbara Głut, Jacek Kitowski

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2328/23280493.htm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Recommendations

• Domain decomposition coupled with Delaunay mesh generation
• scientific article; zbMATH DE number 990998
• Finite element mesh decomposition using complementary Laplacian matrix
• EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS
• scientific article; zbMATH DE number 3940667

Cited in

(3)

• Performance comparison and workload analysis of mesh untangling and smoothing algorithms
• Data decomposition for TIM-2D code parallelizing method and its quality evaluation criteria
• Domain decomposition coupled with Delaunay mesh generation

This page was built for publication: An empirical comparison of decomposition algorithms for complex finite element meshes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737403)