Search NASASearch

Engineering topics

Thompson, Joe F.

Publications and source records attributed to Thompson, Joe F..

Enhancement of surface definition and gridding in the EAGLE code

Algorithms for smoothing of curves and surfaces for the EAGLE grid generation program are presented. The method uses an existing automated technique which detects undesirable geometric characteristics by using a local fairness criterion. The geometry entity is then smoothed by repeated removal and insertion of spline knots in the vicinity of the geometric irregularity. The smoothing algorithm is formulated for use with curves in Beta spline form and tensor product B-spline surfaces.

Thompson, Joe F.

Transonic flow solutions on general 3D regions using composite-block grids

The construction of computational fluid dynamics (CFD) codes for complicated regions is greatly simplified by a composite-block grid structure since, with the use of a surrounding layer of points on each block, a flow code is then only required basically to operate on rectangular computational regions. The necessary correspondence of points on the surrounding layers (image points) with interior points (object points) is set up by the grid code and made available to the CFD solution code.

Thompson, Joe F.

Transformation of two and three-dimensional regions by elliptic systems

Grid smoothing and orthogonalization procedures were developed and implemented in the construction of two and three dimensional grids. The procedures are based on the variational methods of grid generation. The two-dimensional examples were computed using the MSU IRIS Graphics Workstation. It was demonstrated that the elliptic grid generation equations, with arbitrary forcing functions, can be solved, in their variational formulation, using a gradient method. Since gradient methods have a global convergence property, the divergence problems often encountered when using SOR iterative methods can be avoided. It is not to be concluded, however, that SOR methods should be abandoned, since gradient methods tend to converge very slowly. In fact, slow convergence was the major problem encountered in the three-dimensional grids. Further progress was made on the continuing effort to develop conservative interpolation formulas for overlapping grids.

Mastin, C. Wayne