Parallel tetrahedral mesh refinement
| dc.contributor | Graduate Program in Computer Engineering. | |
| dc.contributor.advisor | Özturan, Can. | |
| dc.contributor.author | Balman, Mehmet. | |
| dc.date.accessioned | 2023-03-16T10:04:35Z | |
| dc.date.available | 2023-03-16T10:04:35Z | |
| dc.date.issued | 2006. | |
| dc.description.abstract | The Adaptive Mesh Refinement is one of the main techniques used for the solutionof Partial Differential Equations. Since 3-dimensional structures are more complex,there are few refinement methods especially for parallel environments. On the other hand, many algorithms have been proposed for 2-dimensional structures. Weanalyzed the Rivara̕s longest-edge bisection algorithm, studied parallelization techniquesfor the problem, and presented a parallel methodology for the refinement ofnon-uniform tetrahedral meshes. The proposed algorithm is practical for real-life applicationsand it is also scalable for large mesh structures. We describe a usable datastructure for distributed environments and present a utility using the inter-process communication. The PTMR utility is capable of distributing the mesh data amongprocessors and it can accomplish the refinement process within acceptable time limits. | |
| dc.format.extent | 30cm. | |
| dc.format.pages | xi, 84 leaves; | |
| dc.identifier.other | CMPE 2006 B35 | |
| dc.identifier.uri | https://digitalarchive.library.bogazici.edu.tr/handle/123456789/12423 | |
| dc.publisher | Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2006. | |
| dc.relation | Includes appendices. | |
| dc.relation | Includes appendices. | |
| dc.subject.lcsh | Tetrahedra. | |
| dc.subject.lcsh | Parallel algorithms. | |
| dc.title | Parallel tetrahedral mesh refinement |
Files
Original bundle
1 - 1 of 1