Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 3 of 3
Full-Text Articles in Computational Engineering
Tetrahedral Mesh Optimization And Generation Via Topological Transformations And Gradient Based Node Perturbation, Christopher B. Hilbert
Tetrahedral Mesh Optimization And Generation Via Topological Transformations And Gradient Based Node Perturbation, Christopher B. Hilbert
Masters Theses and Doctoral Dissertations
A general tetrahedral mesh optimization scheme utilizing both topological changes (i.e. flips) and gradient-based vertex optimization (i.e. smoothing) is demonstrated. This scheme is used in the optimization of tetrahedral meshes created by third-party software as well as a grid generation methodology created for this work. The particular algorithms involved are explained in detail including, an explication of the primary optimization metric, weighted condition number. In addition, a thorough literature review regarding tetrahedral mesh generation is given.
Fully Anisotropic Split-Tree Adaptive Refinement Mesh Generation Using Tetrahedral Mesh Stitching, Vincent Charles Betro
Fully Anisotropic Split-Tree Adaptive Refinement Mesh Generation Using Tetrahedral Mesh Stitching, Vincent Charles Betro
Masters Theses and Doctoral Dissertations
Due to the myriad of geometric topologies that modern computational fluid dynamicists desire to mesh and run solutions on, the need for a robust Cartesian Mesh Generation algorithm is paramount. Not only do Cartesian meshes require less elements and often help resolve flow features but they also allow the grid generator to have a great deal of control in so far as element aspect ratio, size, and gradation. Fully Anisotropic Split-Tree Adaptive Refinement (FASTAR) is a code that allows the user to exert a great deal of control and ultimately generate a valid, geometry conforming mesh. Due to the split-tree …
Cyclo-Static Scheduling Of Large Grain Dataflow Algorithms On A Local Area Atamm Multicomputing Testbed, Sudeepto Roy
Cyclo-Static Scheduling Of Large Grain Dataflow Algorithms On A Local Area Atamm Multicomputing Testbed, Sudeepto Roy
Electrical & Computer Engineering Theses & Dissertations
A strategy for cyclo-statically scheduling deterministic large grain dataflow (LGDF) algorithms for distributed execution on loosely coupled multicomputer architectures is presented in this research. The computational paradigm used is the ODU/NASA developed Algorithm To Architecture Mapping Model (ATAMM), which consists of marked graphs and Gantt chart representations that model the iterative execution of deterministic LGDF algorithms for different values of throughput and computation time. It is postulated that the behavior of these algorithms could be represented by the aggregate execution of an ensemble of cyclically shifted threads of a specific node sequence. Assuming the existence of one or more such …