Search NASA⌕ Search

Engineering topics

Mastin, C. Wayne

Publications and source records attributed to Mastin, C. Wayne.

13 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

Arc Length Based Grid Distribution For Surface and Volume Grids

Techniques are presented for distributing grid points on parametric surfaces and in volumes according to a specified distribution of arc length. Interpolation techniques are introduced which permit a given distribution of grid points on the edges of a three-dimensional grid block to be propagated through the surface and volume grids. Examples demonstrate how these methods can be used to improve the quality of grids generated by transfinite interpolation.

Mastin, C. Wayne↗
NASA NTRS1996

Geometric Model for a Parametric Study of the Blended-Wing-Body Airplane

A parametric model is presented for the blended-wing-body airplane, one concept being proposed for the next generation of large subsonic transports. The model is defined in terms of a small set of parameters which facilitates analysis and optimization during the conceptual design process. The model is generated from a preliminary CAD geometry. From this geometry, airfoil cross sections are cut at selected locations and fitted with analytic curves. The airfoils are then used as boundaries for surfaces defined as the solution of partial differential equations. Both the airfoil curves and the surfaces are generated with free parameters selected to give a good representation of the original geometry. The original surface is compared with the parametric model, and solutions of the Euler equations for compressible flow are computed for both geometries. The parametric model is a good approximation of the CAD model and the computed solutions are qualitatively similar. An optimal NURBS approximation is constructed and can be used by a CAD model for further refinement or modification of the original geometry.

Mastin, C. Wayne↗
NASA NTRS1995

Multilevel elliptic smoothing of large three-dimensional grids

Elliptic grid generation methods have been used for many years to smooth and improve grids generated by algebraic interpolation schemes. However, the elliptic system that must be solved is nonlinear and convergence is generally very slow for large grids. In an attempt to make elliptic methods practical for large three-dimensional grids, a two-stage implementation is developed where the overall grid point locations are set using a coarse grid generated by the elliptic system. The coarse grid is then interpolated to generate a finer grid which is smoothed using only a few iterations of the elliptic system.

Mastin, C. Wayne↗
NASA NTRS1994

Transformation of two and three-dimensional regions by elliptic systems

Several reports are attached to this document which contain the results of our research at the end of this contract period. Three of the reports deal with our work on generating surface grids. One is a preprint of a paper which will appear in the journal Applied Mathematics and Computation. Another is the abstract from a dissertation which has been prepared by Ahmed Khamayseh, a graduate student who has been supported by this grant for the last two years. The last report on surface grids is the extended abstract of a paper to be presented at the 14th IMACS World Congress in July. This report contains results on conformal mappings of surfaces, which are closely related to elliptic methods for surface grid generation. A preliminary report is included on new methods for dealing with block interfaces in multiblock grid systems. The development work is complete and the methods will eventually be incorporated into the National Grid Project (NGP) grid generation code. Thus, the attached report contains only a simple grid system which was used to test the algorithms to prove that the concepts are sound. These developments will greatly aid grid control when using elliptic systems and prevent unwanted grid movement. The last report is a brief summary of some timings that were obtained when the multiblock grid generation code was run on the Intel IPSC/860 hypercube. Since most of the data in a grid code is local to a particular block, only a small fraction of the total data must be passed between processors. The data is also distributed among the processors so that the total size of the grid can be increase along with the number of processors. This work is only in a preliminary stage. However, one of the ERC graduate students has taken an interest in the project and is presently extending these results as a part of his master's thesis.

Mastin, C. Wayne↗
NASA NTRS1993

Transformation of two and three-dimensional regions by elliptic systems

During this contract period, our work has focused on improvements to elliptic grid generation methods. There are two principle objectives in this project. One objective is to make the elliptic methods more reliable and efficient, and the other is to construct a modular code that can be incorporated into the National Grid Project (NGP), or any other grid generation code. Progress has been made in meeting both of these objectives. The two objectives are actually complementary. As the code development for the NGP progresses, we see many areas where improvements in algorithms can be made.

Mastin, C. Wayne↗
NASA NTRS1992

Application of three-dimensional Bezier patches in grid generation

Bezier and B-spline patches are popular tools in surface modeling. With these methods, a surface is represented by the tensor product of univariate approximations. The extension of this concept to three-dimensions is obvious and can be applied to the problem of grid generation. This report will demonstrate how three-dimensional patches can be used in solid modeling and in the generation of grids. Examples will be given demonstrating the ability to generate three-dimensional grids directly from a wire frame without having to first set up the boundary surfaces. Many geometric grid properties can be imposed by the proper choice of the control net.

Mastin, C. Wayne↗
NASA NTRS1991

Transformation of two and three-dimensional regions by elliptic systems

A reliable linear system is presented for grid generation in 2-D and 3-D. The method is robust in the sense that convergence is guaranteed but is not as reliable as other nonlinear elliptic methods in generating nonfolding grids. The construction of nonfolding grids depends on having reasonable approximations of cell aspect ratios and an appropriate distribution of grid points on the boundary of the region. Some guidelines are included on approximating the aspect ratios, but little help is offered on setting up the boundary grid other than to say that in 2-D the boundary correspondence should be close to that generated by a conformal mapping. It is assumed that the functions which control the grid distribution depend only on the computational variables and not on the physical variables. Whether this is actually the case depends on how the grid is constructed. In a dynamic adaptive procedure where the grid is constructed in the process of solving a fluid flow problem, the grid is usually updated at fixed iteration counts using the current value of the control function. Since the control function is not being updated during the iteration of the grid equations, the grid construction is a linear procedure. However, in the case of a static adaptive procedure where a trial solution is computed and used to construct an adaptive grid, the control functions may be recomputed at every step of the grid iteration.

Mastin, C. Wayne↗
NASA NTRS1990

Application of three-dimensional Bezier patches in grid generation

Bezier and B-spline patches are popular tools in surface modeling. With these methods, a surface is represented by the tensor product of univariate approximations. The extension of this concept to three dimensions is obvious and can be applied to the problem of grid generation. This report will demonstrate how three dimensional patches can be used in solid modeling and in the generation of grids. Examples will be given demonstrating the ability to generate three dimensional grids directly from a wire frame without having to first set up the boundary surfaces. Many geometric grid properties can be imposed by the proper choice of the control net.

Mastin, C. Wayne↗
NASA NTRS1988

Fast interpolation schemes for moving grids

Search algorithms are developed for efficiently locating interpolation points to facilitate transfer of data in moving grid and related problems. Applications in the construction of adaptive grids and in the solution of problems on composite grids are included.

Mastin, C. Wayne↗
NASA NTRS1987

Implicit finite difference methods on composite grids

Techniques for eliminating time lags in the implicit finite-difference solution of partial differential equations are investigated analytically, with a focus on transient fluid dynamics problems on overlapping multicomponent grids. The fundamental principles of the approach are explained, and the method is shown to be applicable to both rectangular and curvilinear grids. Numerical results for sample problems are compared with exact solutions in graphs, and good agreement is demonstrated.

Mastin, C. Wayne↗
NASA NTRS1986

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↗
NASA NTRS1986

Interface procedures for overlapping grids

The solution of partial differential equations by means of either implicit or conservative explicit finite-difference methods, on the one hand, or multicomponent overlapping grid schemes on the other, is presently subjected to interpolation at grid boundaries in an attempt to eliminate the time lag. The accuracy of the transient solution of a hyperbolic or parabolic partial differential equation is dependent on the procedures used to transfer information between grids in a composite grid system. The present techniques reduce numerical solution errors.

Mastin, C. Wayne↗