Date of Award

Summer 1985

Document Type


Degree Name

Doctor of Philosophy (PhD)


Mathematics and Statistics


Computational and Applied Mathematics

Committee Director

Philip W. Smith

Committee Member

John Tweed

Committee Member

Robert Smith

Committee Member

James Schwing


In general, finite difference methods are more successful if the accompanying grid has lines which are smooth and nearly orthogonal. This thesis discusses the development of an algorithm which produces such a grid when given the boundary description.

Topological considerations in structuring the grid generation mapping are discussed. In particular, this thesis examines the concept of the degree of a mapping and how it can be used to determine what requirements are necessary if a mapping is to produce a suitable grid.

The grid generation algorithm uses a mapping composed of bicubic B-splines. Boundary coefficients are chosen so that the splines produce Schoenberg's variation diminishing spline approximation to the boundary. Interior coefficients are initially chosen to give a variation diminishing approximation to the transfinite bilinear interpolant of the function mapping the boundary of the unit square onto the boundary of the grid.

The practicality of optimizing the grid by minimizing a functional involving the Jacobian of the grid generation mapping at each interior grid point and the dot product of vectors tangent to the grid lines is investigated.

Grids generated by using the algorithm are presented.



Included in

Mathematics Commons