To date two techniques have been used to create the grids used to
develop the surface plots: simple transfinite interpolation and a
tensor product spline algorithm developed by one of the authors [2].
The tensor product algorithm uses the mapping
(1)
where
and each is the tensor product
of cubic B-splines. Hence,
where and are elements of cubic B-spline sequences
associated with finite nondecreasing knot sequences, say,
and
,
respectively.
The initial coefficients are chosen so that the mapping approximates
transfinite blending function interpolation. More specifically, the
coefficients are selected to produce a variation diminishing spline
approximation to the transfinite blending function interpolant.
In short, this means the
coefficients are obtained by evaluating the interpolant at average
knot values as discussed in [5]. If more orthogonality and
smoothness are needed, the coefficients can be adjusted to minimize
the discrete functional
(2)
where is the Jacobian value and is the dot
product of
and
at mesh point
on the unit
square. The code has been updated to handle larger problems. Both the
transfinite code and the tensor product spline code allow the user to easily
change the size of the grid while guaranteeing that certain boundary
grid points are fixed to maintain the accuracy of the boundary
approximation.