In this thesis a methodology is presented to optimise non–linear mathematical models in numerical engineering applications. The method is based on biological evolution and uses known concepts of genetic algorithms and evolutionary compu- tation. The working principle is explained in detail, the implementation is outlined and alternative approaches are mentioned. The optimisation is then tested on a series of benchmark cases to prove its validity. It is then applied to two different types of problems in computational engineering. The first application is the mathematical modeling of turbulence. An overview of existing turbulence models is followed by a series of tests of different models applied to various types of flows. In this thesis the optimisation method is used to find improved coefficient values for the k–ε, the k–ω-SST and the Spalart–Allmaras models. In a second application optimisation is used to improve the quality of a computational mesh automatically generated by a third party software tool. This generation can be controlled by a set of parameters, which are subject to the optimisation. The results obtained in this work show an improvement when compared to non–optimised results. While computationally expensive, the genetic optimisation method can still be used in engineering applications to tune predefined settings with the aim to produce results of higher quality. The implementation is modular and allows for further extensions and modifications for future applications.

Técnicas para geração de malhas volumétricas não estruturadas podem ser divididas em três categorias principais: técnicas baseadas em Octree, técnica de avanço de fronteira e técnicas Delaunay. Este trabalho faz uso de uma proposta para geração de malhas volumétricas não estruturadas baseada em uma técnica que utiliza uma triangulação adaptativa que contém similaridades com os métodos de geração de malhas baseados em Octree. Esta triangulação, além de decompor o domínio, oferece suporte para a construção de funções implícitas que aproximam a superfície do objeto de interesse. As funções implícitas são obtidas a partir de nuvens de pontos pelo método de Partição da Unidade Implícita - PUI. Um processo de poligonalização discretiza a isosuperfície fornecida pela função implícita gerando uma malha de triângulos superficial. Uma malha volumétrica é gerada a partir da malha superficial utilizando os tetraedros que decompõem o domínio criados pela triangulação. Apresentamos nesta tese um método original para a poligonalização de isosuperfícies obtidas através de nuvens de pontos. Apresentamos também uma abordagem para o melhoramento de malhas volumétricas baseadas na aplicação do conceito de molas virtuais. O foco principal é gerar malhas de qualidade para serem usadas em simulações de fluidos em artérias do corpo humano / Techniques for generation of three-dimensional unstructured meshes can be divided into three main categories: Octree-based techniques, advancing front techniques and Delaunay techniques. In the present study it is used a three-dimensional unstructured mesh generation approach based on a technique which uses an adaptive triangulation which contains similarities with Octree-based mesh generation techniques. This triangulation decomposes the domain and supports the construction of implicit functions that approximates the surface of an object of interest. The implicit functions are derived from point clouds by the Partition of Unity Implicits - PUI method. A polygonization process discretizes the isosurface provided by the implicit function generating a triangular mesh surface. A three-dimensional mesh is generated from the surface mesh using the tetrahedra that decomposes the domain created by the triangulation. In this tesis, we present an original polygonization method of isosurfaces obtained from point clouds. We also present an approach to improve tetrahedral meshes based on the application of the concept of virtual springs. The main focus is to generate quality meshes for fluid flow simulations in human arteries

No description available.

Researchers have been developing techniques to predict inlight icing in order to determine aircraft behavior under different icing conditions. A key component of the techniques is the mesh generation strategy. Automated meshing facilitates numerical simulation of ice accretion on realistic aircraft configurations by deforming the surface and volume meshes in response to the evolving ice shape. The objective of this research is to validate an ice accretion strategy for wings, using a previously developed meshing strategy. The intent is to investigate the effect of varying numerical parameters, on the predicted ice shape. Using this framework, results are simulated for rime and glaze ice accretions on a rectangular planform wing with a constant GLC-305 airfoil section. The number of time steps is shown to have a significant effect on the ice shape, depending on the icing time and conditions. Decreasing the height smoothing parameters generally improves the ice shape accuracy.

The development of algorithms for the automatic creation of finite element meshes composed entirely of hexahedra (all-hex) is an active area of research. All-hex meshes are desirable for their characteristic of high accuracy with a low node count. Sweeping is one of the most widely used algorithms for generating all-hex meshes. A limitation of sweeping, however, is that it can currently be applied only to prismatic or extruded geometry types. This thesis develops a method to combine sweeping with another algorithm known as "Grafting". Grafting adjusts the mesh on one volume to conform to a second volume. In this manner it is useful for meshing multi-axis geometry in that a single axis can be meshed with sweeping and then secondary axes can be grafted on. By creating an algorithm for automatically performing these processes, the base set of geometry that can be automatically meshed with these methods is greatly increased. This new algorithm is called Graft-Sweeping. With the combination of sweeping and Grafting, geometry that contains multiple source surfaces, multiple target surfaces, and multiple sweep axes can be meshed. The results of this algorithm on several example geometries are given showing the strengths and weaknesses of this technique. From the results it can be seen that the Graft-Sweep algorithm can produce a finite element mesh in about half the time of manual Grafting and sweeping operations with similar mesh quality. When compared to sweeping alone, Graft-Sweeping is several times faster but the quality is usually reduced. A second area of research for this thesis is to determine when Grafting can be used to enhance the meshing process. It is shown that the best results are obtained when Grafting is used on structured meshes and the mesh size is considerably smaller than the size of the feature that is being grafted.

Hexahedral refinement increases the density of an all-hexahedral mesh in a specified region, improving numerical accuracy. Previous research using solely sheet refinement theory made the implementation computationally expensive and unable to effectively handle multiply-connected transition elements and self-intersecting hexahedral sheets. The Selective Approach method is a new procedure that combines two diverse methodologies to create an efficient and robust algorithm able to handle the above stated problems. These two refinement methods are: 1) element by element refinement and 2) directional refinement. In element by element refinement, the three inherent directions of a hexahedron are refined in one step using one of seven templates. Because of its computational superiority over directional refinement, but its inability to handle multiply-connected transition elements, element by element refinement is used in all areas of the specified region except regions local to multiply-connected transition elements. The directional refinement scheme refines the three inherent directions of a hexahedron separately on a hexahedron by hexahedron basis. This differs from sheet refinement which refines hexahedra using hexahedral sheets. Directional refinement is able to correctly handle multiply-connected transition elements. A ranking system and propagation scheme allow directional refinement to work within the confines of the Selective Approach Algorithm.

A method for extracting linear raised features from laser scanned altimetry (LiDAR) datasets is presented. The objective is to automate the method so that elements in a coastal storm surge simulation finite element mesh might have their edges aligned along vertical terrain features. Terrain features of interest are those that are high and long enough to form a hydrodynamic impediment while being narrow enough that the features might be straddled and not modeled if element edges are not purposely aligned. These features are commonly raised roadbeds but may occur due to other manmade alterations to the terrain or natural terrain. The implementation uses the TauDEM watershed delineation software included in the MapWindow open source Geographic Information System to initially extract watershed boundaries. The watershed boundaries are then examined computationally to determine which sections warrant inclusion in the storm surge mesh. Introductory work towards applying image analysis techniques as an alternate means of vertical feature extraction is presented as well. Vertical feature lines extracted from a LiDAR dataset for Manatee County, Florida are included in a limited storm surge finite element mesh for the county and Tampa Bay. Storm surge simulations using the ADCIRC-2DDI model with two meshes, one which includes linear raised features as element edges and one which does not, verify the usefulness of the method.

This thesis presents the development of an automatic mesh generator, named WoodFrameMesh, using object oriented C++. The program developed is capable of generating complete finite element models of wooden houses incorporating frames, linear links, springs, nodal loads and restraints at the desired locations. The finite element mesh generated by the program may be triangular or quadrilateral. The triangular mesh can be generated over any arbitrary domain with multiple openings and line constraints. The program implements the advancing front method for triangulation as discussed by Lee and Hobbs. The difference is made by implementing the algorithm using object oriented concepts and the extensive use of the powerful C++ Standard Template Library (STL). Quadrilateral mesh generation is limited to simple quadrilateral domains with no openings or constraint lines. A simple structured technique is implemented to generate the quadrilateral mesh. The amount of time spent in manual generation of the complete finite element model of wooden houses has been considerably reduced by automating the modeling process. Overall, the use of object oriented design has facilitated the code development and has provided a platform for further additions. The program relies on the use of STL as it provides dynamic data structures, algorithms for storage, searching, sorting, etc. Efficiency of the program is improved by the use of the in-built features in STL instead of developing new code. Analysis of the finite element models generated by the automatic mesh generator is performed using SAP 2000 and WoodFrameSolver. WoodFrameSolver is a finite element analysis engine for WoodFrameMesh, which was developed at Virginia Tech by a group of graduate students (including the author) and professors as a separate project. A chapter discussing the WoodFrameSolver architecture, its extensibility features and its verification is also presented in this thesis. The solver performance and accuracy are similar to those of SAP 2000, which was chosen as the benchmark for testing the analysis results. / Master of Science

No description available.

No description available.