A Survey of Composite Grid Generation for General Three-dimensional Sections

The generation and use of composite grids for general three-dimensional physical boundary configurations is discussed, and the availability of several codes or procedures is noted. With the composite framework, the physical region is segmented into sub-regions, each bounded by six curved sides, and a grid is generated in each sub-region. These grids may be joined at the interfaces between the sub-regions with various degrees of continuity. This structure allows codes to be constructed to operate on rectangular blocks in computational space, so that existing solution procedures can be readily incorporated in the construction of codes for general configurations. Numerical grid generation is an integral part of the numerical solution of partial differential equations and is one of the pacing items in the development of codes for general configurations. The numerically generated grid frees the computational simulation from restriction to certain boundary shapes and allows general codes to be written in which the boundary shape is specified simply by input. The numerically generated grid allows all computation to be done on a fixed square grid in the computational space, which is always rectangular by construction

Numerical solution of the Navier-Stokes equations for arbitrary two-dimensional multi-element airfoils

Abstracts are presented on a method of numerical solution of the Navier-Stokes equation for the flow about arbitrary airfoils, using a numerically generated curvilinear coordinate system having a coordinate line coincident with the body contour. Results of continuing research are reported and include: application of the Navier-Stokes solution in the vorticity-stream function formulation to a number of single airfoils at Reynolds numbers up to 2000; programming of the Navier-Stokes solution for multiple airfoils in the primitive variable formulation; testing of the potential flow solution of multiple bodies; and development of a generalized coordinate system program

Numerical solution of the Navier-Stokes equations for arbitrary 2-dimensional multi-element airfoils

Numerical solutions of the Navier-Stokes equations, with an algebraic turbulence model, for time-dependent two dimensional flow about multi-element airfoils were developed. Fundamental to these solutions was the use of numerically-generated boundary-conforming curvilinear coordinate systems to allow bodies of arbitrary shape to be treated. A general two dimensional grid generation code for multiple-body configuration was written as a part of this project and made available through the COSMIC code library

Numerical solution of potential flow about arbitrary 2-dimensional multiple bodies

A procedure for the finite-difference numerical solution of the lifting potential flow about any number of arbitrarily shaped bodies is given. The solution is based on a technique of automatic numerical generation of a curvilinear coordinate system having coordinate lines coincident with the contours of all bodies in the field, regardless of their shapes and number. The effects of all numerical parameters involved are analyzed and appropriate values are recommended. Comparisons with analytic solutions for single Karman-Trefftz airfoils and a circular cylinder pair show excellent agreement. The technique of application of the boundary-fitted coordinate systems to the numerical solution of partial differential equations is illustrated

A modified R1 X R1 method for helioseismic rotation inversions

We present an efficient method for two dimensional inversions for the solar rotation rate using the Subtractive Optimally Localized Averages (SOLA) method and a modification of the R1 X R1 technique proposed by Sekii (1993). The SOLA method is based on explicit construction of averaging kernels similar to the Backus-Gilbert method. The versatility and reliability of the SOLA method in reproducing a target form for the averaging kernel, in combination with the idea of the R1 X R1 decomposition, results in a computationally very efficient inversion algorithm. This is particularly important for full 2-D inversions of helioseismic data in which the number of modes runs into at least tens of thousands.Comment: 12 pages, Plain TeX + epsf.tex + mn.te

Errors in finite-difference computations on curvilinear coordinate systems

Curvilinear coordinate systems were used extensively to solve partial differential equations on arbitrary regions. An analysis of truncation error in the computation of derivatives revealed why numerical results may be erroneous. A more accurate method of computing derivatives is presented

Transformation of two and three-dimensional regions by elliptic systems

The research during this period continued to expand the class of numerical algorithms that can be accurately and efficiently implemented on overlapping grids. Whereas previous calculations have been used to solve elliptic equations and to find the steady-state solution of parabolic equations, the present work is aimed towards developing time-accurate solution techniques for parabolic and hyperbolic equations. The primary difficulty here is in the correct treatment of the interior boundary nodes that must be updated at each iteration. The implementation of explicit methods is straightforward. However, the common practice of lagging these values when using an implicit methods leads to inconsistencies in the difference equation. One way to avoid this problem is to alternately calculate with an implicit and an explicit method on each subgrid. With this procedure, the explicit method generates boundary values at the next time level which are then used by the implicit step. It can be shown that when a backward implicit method is combined with a forward explicit method, the composite method is second order accurate and unconditionally stable for linear problems. A second area in which progress can be reported is in the distribution of grid points on curves and surfaces

Quasiconformal mappings and grid generation

A finite difference scheme is developed for constructing quasiconformal mappings for arbitrary simply and doubly connected regions. Computational grids are generated to reduce elliptic equations to canonical form. Examples of conformal mappings on surfaces are also included