Committee Chair

Taylor, Lafayette K.

Committee Member

Karman, Steve L., Jr.; Newman, James C., III; Sreenivas, Kidambi

Department

Dept. of Computational Engineering

College

College of Engineering and Computer Science

Publisher

University of Tennessee at Chattanooga

Place of Publication

Chattanooga (Tenn.)

Abstract

A grid generator is developed that produces all quadrilateral meshes. The scheme is automated to work for arbitrary choice of geometry. In addition, a Non-Uniform Rational B-Spline curve fitter is implemented to replicate the curvature of the geometries. The grid elements on the boundaries conform to the curved structure to support high order accuracy for a finite element scheme. Various geometries are used to test the robustness and generality of the meshing algorithm. The initial problems that were encountered are discussed and the solutions explained. The speed of the algorithm is discussed together with the effect of grid and geometry size on runtime. A finite element solver is used to validate the grids. The order of accuracy of the scheme is demonstrated for quadrilateral grids and increased order is compared with a refined grid study.

Acknowledgments

I would like to thank my thesis advisor Professor Lafayette Taylor for his patience, encouragement and unending help during this process. Also I am deeply grateful to Arash Ghasemi for many stimulating discussions and helpful ideas. Without their help this work would not have succeeded.

Degree

M. S.; A thesis submitted to the faculty of the University of Tennessee at Chattanooga in partial fulfillment of the requirements of the degree of Master of Science.

Date

12-2015

Subject

Numerical grid generation (Numerical analysis); Computer algorithms

Keyword

Mesh Generation; Finite Element; Chebyshev Points

Document Type

Masters theses

Extent

xii, 77 leaves

Language

English

Rights

Under copyright.

License

http://creativecommons.org/licenses/by/3.0/

Share

COinS