Search NASA⌕ Search

SEARCH · Search NASA

Results for “Grid forming”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14

Radiation-detector optical-imaging device is of simplified construction

A simplified radiation detector was designed which employs an activated continuous front surface consisting of either the diffused or barrier type of semiconducting material with a grid structure on the nonactivated side of the detector. Its form may be either a rectangular coordinate or a polar coordinate system.

Source record↗

Change in transmittance of fused silica as a means of detecting material sputtered from components on a 5-cm ion thruster

Two endurance tests of a 5-cm mercury bombardment thruster are reported. Both tests used a translational screen-grid system with the beam vectored 10 degrees. The first test lasted 141 hours and the second test operated for 2026 hours. In each test two fused silica samples (solar cell covers), 2.0 cm by 2.1 cm, were placed in shielded holders to detect materials sputtered from the thruster. Spectral optical properties between 0.398 and 2.16 microns were measured on each sample, both before and after the endurance tests. The deposition on each sample was spectrographically analyzed to determine the type of materials sputtered from the thruster. It was found that sputtering from the neutralizer is highly dependent on its position with respect to the beam edge. The sputtering from the accelerator grid of the translational screen-grid system of the 2026 hour test was sufficient to form an opaque film on the sample located in the direction opposite to the vectored beam.

Weigand, A. J.↗

A contribution to the development of an economic atlas of the Houston Area Test Site

An outine description of the Houston Area Test Site was prepared, in the form of an atlas-catalog of Universal Transverse Mercator grid coordinate locations, building on the manufacturing sector and expanding along agreed lines as far as possible. It was concluded that (1) the effort expended in securing and verifying the locations of larger manufacturing plants yielded 5,000-plus usable entries, in addition to certain valuable conclusions about the general feasibility of obtaining ground information by economic sector; (2) on the basis of the number and the quality of the usable entries obtained, the resources expended on nonmanufacturing sectors and on historical data cannot be wholly justified; and (3) even without the 5,000-odd locations of completely satisfactory quality, the relatively modest cost of this pilot study secured enough data to provide a sound basis for obtaining feasibly and systematically some appropriate ground information on almost any economic or social activity, together with some indication of their relative areal and economic significance.

Source record↗

Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics

Most of the recently proposed computational methods for solving partial differential equations on multiprocessor architectures stem from the 'divide and conquer' paradigm and involve some form of domain decomposition. For those methods which also require grids of points or patches of elements, it is often necessary to explicitly partition the underlying mesh, especially when working with local memory parallel processors. In this paper, a family of cost-effective algorithms for the automatic partitioning of arbitrary two- and three-dimensional finite element and finite difference meshes is presented and discussed in view of a domain decomposed solution procedure and parallel processing. The influence of the algorithmic aspects of a solution method (implicit/explicit computations), and the architectural specifics of a multiprocessor (SIMD/MIMD, startup/transmission time), on the design of a mesh partitioning algorithm are discussed. The impact of the partitioning strategy on load balancing, operation count, operator conditioning, rate of convergence and processor mapping is also addressed. Finally, the proposed mesh decomposition algorithms are demonstrated with realistic examples of finite element, finite volume, and finite difference meshes associated with the parallel solution of solid and fluid mechanics problems on the iPSC/2 and iPSC/860 multiprocessors.

Farhat, Charbel↗

Robust unstructured grid generation with VGRID

The objective of this work is to develop a robust, user-oriented, unstructured grid-generation technique for fast generation of Euler/viscous grids around complex 2D and 3D configurations. To do this, two different approaches are employed: the advancing-front method for generation of Euler grids; and the advancing-layers method for generation of viscous grids. A discussion of these topics is presented in viewgraph form.

Shahyar Pirzadeh↗

Implementing Multidisciplinary and Multi-Zonal Applications Using MPI

Multidisciplinary and multi-zonal applications are an important class of applications in the area of Computational Aerosciences. In these codes, two or more distinct parallel programs or copies of a single program are utilized to model a single problem. To support such applications, it is common to use a programming model where a program is divided into several single program multiple data stream (SPMD) applications, each of which solves the equations for a single physical discipline or grid zone. These SPMD applications are then bound together to form a single multidisciplinary or multi-zonal program in which the constituent parts communicate via point-to-point message passing routines. Unfortunately, simple message passing models, like Intel's NX library, only allow point-to-point and global communication within a single system-defined partition. This makes implementation of these applications quite difficult, if not impossible. In this report it is shown that the new Message Passing Interface (MPI) standard is a viable portable library for implementing the message passing portion of multidisciplinary applications. Further, with the extension of a portable loader, fully portable multidisciplinary application programs can be developed. Finally, the performance of MPI is compared to that of some native message passing libraries. This comparison shows that MPI can be implemented to deliver performance commensurate with native message libraries.

Fineberg, Samuel A.↗

An Automated Approach to Very High Order Aeroacoustic Computations in Complex Geometries

Computational aeroacoustics requires efficient, high-resolution simulation tools. And for smooth problems, this is best accomplished with very high order in space and time methods on small stencils. But the complexity of highly accurate numerical methods can inhibit their practical application, especially in irregular geometries. This complexity is reduced by using a special form of Hermite divided-difference spatial interpolation on Cartesian grids, and a Cauchy-Kowalewslci recursion procedure for time advancement. In addition, a stencil constraint tree reduces the complexity of interpolating grid points that are located near wall boundaries. These procedures are used to automatically develop and implement very high order methods (>15) for solving the linearized Euler equations that can achieve less than one grid point per wavelength resolution away from boundaries by including spatial derivatives of the primitive variables at each grid point. The accuracy of stable surface treatments is currently limited to 11th order for grid aligned boundaries and to 2nd order for irregular boundaries.

Dyson, Rodger W.↗

Automated Approach to Very High-Order Aeroacoustic Computations

Computational aeroacoustics requires efficient, high-resolution simulation tools. For smooth problems, this is best accomplished with very high-order in space and time methods on small stencils. However, the complexity of highly accurate numerical methods can inhibit their practical application, especially in irregular geometries. This complexity is reduced by using a special form of Hermite divided-difference spatial interpolation on Cartesian grids, and a Cauchy-Kowalewski recursion procedure for time advancement. In addition, a stencil constraint tree reduces the complexity of interpolating grid points that am located near wall boundaries. These procedures are used to develop automatically and to implement very high-order methods (> 15) for solving the linearized Euler equations that can achieve less than one grid point per wavelength resolution away from boundaries by including spatial derivatives of the primitive variables at each grid point. The accuracy of stable surface treatments is currently limited to 11th order for grid aligned boundaries and to 2nd order for irregular boundaries.

Dyson, Rodger W.↗

MPIRUN: A Portable Loader for Multidisciplinary and Multi-Zonal Applications

Multidisciplinary and multi-zonal applications are an important class of applications in the area of Computational Aerosciences. In these codes, two or more distinct parallel programs or copies of a single program are utilized to model a single problem. To support such applications, it is common to use a programming model where a program is divided into several single program multiple data stream (SPMD) applications, each of which solves the equations for a single physical discipline or grid zone. These SPMD applications are then bound together to form a single multidisciplinary or multi-zonal program in which the constituent parts communicate via point-to-point message passing routines. One method for implementing the message passing portion of these codes is with the new Message Passing Interface (MPI) standard. Unfortunately, this standard only specifies the message passing portion of an application, but does not specify any portable mechanisms for loading an application. MPIRUN was developed to provide a portable means for loading MPI programs, and was specifically targeted at multidisciplinary and multi-zonal applications. Programs using MPIRUN for loading and MPI for message passing are then portable between all machines supported by MPIRUN. MPIRUN is currently implemented for the Intel iPSC/860, TMC CM5, IBM SP-1 and SP-2, Intel Paragon, and workstation clusters. Further, MPIRUN is designed to be simple enough to port easily to any system supporting MPI.

Fineberg, Samuel A.↗

TIGER: A graphically interactive grid system for turbomachinery applications

Numerical grid generation algorithm associated with the flow field about turbomachinery geometries is presented. Graphical user interface is developed with FORMS Library to create an interactive, user-friendly working environment. This customized algorithm reduces the man-hours required to generate a grid associated with turbomachinery geometry, as compared to the use of general-purpose grid generation softwares. Bezier curves are utilized both interactively and automatically to accomplish grid line smoothness and orthogonality. Graphical User Interactions are provided in the algorithm, allowing the user to design and manipulate the grid lines with a mouse.

Shih, Ming-Hsin↗

Fast algorithms for visualizing fluid motion in steady flow on unstructured grids

The plotting of streamlines is an effective way of visualizing fluid motion in steady flows. Additional information about the flowfield, such as local rotation and expansion, can be shown by drawing in the form of a ribbon or tube. In this paper, we present efficient algorithms for the construction of streamlines, streamribbons and streamtubes on unstructured grids. A specialized version of the Runge-Kutta method has been developed to speed up the integration of particle paths. We have also derived closed-form solutions for calculating angular rotation rate and radius to construct streamribbons and streamtubes, respectively. According to our analysis and test results, these formulations are two to four times better in performance than previous numerical methods. As a large number of traces are calculated, the improved performance could be significant.

Ueng, S. K.↗

Numerical stability of an explicit finite difference scheme for the solution of transient conduction in composite media

A theoretical evaluation of the stability of an explicit finite difference solution of the transient temperature field in a composite medium is presented. The grid points of the field are assumed uniformly spaced, and media interfaces are either vertical or horizontal and pass through grid points. In addition, perfect contact between different media (infinite interfacial conductance) is assumed. A finite difference form of the conduction equation is not valid at media interfaces; therefore, heat balance forms are derived. These equations were subjected to stability analysis, and a computer graphics code was developed that permitted determination of a maximum time step for a given grid spacing.

Campbell, W.↗

Incompressible and anelastic flow simulations on numerically generated grids

In the numerical simulation of incompressible and anelastic flows, it is necessary to solve an elliptic equation at each time step. When the boundaries of such flows are nonrectangular, it may be advantageous to solve the equations on a new, numerically generated coordinate grid, in which the property of orthogonality has been preserved. Flow equations in general curvilinear coordinates maintaining the conservative form are given for both anelastic models using the momentum equations, and for incompressible models, using the vorticity equation. The general problem of grid-generation in two dimensions is presented, and a quasi-conformal transformation technique is discussed in detail. Some examples of grids generated by this technique are exhibited. Three examples of the flow of a stratified fluid over obstacles are presented, in which the grid-generation permits some new results to be obtained.

Sharman, R. D.↗

On automating domain connectivity for overset grids

An alternative method for domain connectivity among systems of overset grids is presented. Reference uniform Cartesian systems of points are used to achieve highly efficient domain connectivity, and form the basis for a future fully automated system. The Cartesian systems are used to approximated body surfaces and to map the computational space of component grids. By exploiting the characteristics of Cartesian Systems, Chimera type hole-cutting and identification of donor elements for intergrid boundary points can be carried out very efficiently. The method is tested for a range of geometrically complex multiple-body overset grid systems.

Chiu, Ing-Tsau↗

On automating domain connectivity for overset grids

An alternative method for domain connectivity among systems of overset grids is presented. Reference uniform Cartesian systems of points are used to achieve highly efficient domain connectivity, and form the basis for a future fully automated system. The Cartesian systems are used to approximate body surfaces and to map the computational space of component grids. By exploiting the characteristics of Cartesian systems, Chimera type hole-cutting and identification of donor elements for intergrid boundary points can be carried out very efficiently. The method is tested for a range of geometrically complex multiple-body overset grid systems. A dynamic hole expansion/contraction algorithm is also implemented to obtain optimum domain connectivity; however, it is tested only for geometry of generic shapes.

Chiu, Ing-Tsau↗

Optical beam forming techniques for phased array antennas

Conventional phased array antennas using waveguide or coax for signal distribution are impractical for large scale implementation on satellites or spacecraft because they exhibit prohibitively large system size, heavy weight, high attenuation loss, limited bandwidth, sensitivity to electromagnetic interference (EMI) temperature drifts and phase instability. However, optical beam forming systems are smaller, lighter, and more flexible. Three optical beam forming techniques are identified as applicable to large spaceborne phased array antennas. They are (1) the optical fiber replacement of conventional RF phased array distribution and control components, (2) spatial beam forming, and (3) optical beam splitting with integrated quasi-optical components. The optical fiber replacement and the spatial beam forming approaches were pursued by many organizations. Two new optical beam forming architectures are presented. Both architectures involve monolithic integration of the antenna radiating elements with quasi-optical grid detector arrays. The advantages of the grid detector array in the optical process are the higher power handling capability and the dynamic range. One architecture involves a modified version of the original spatial beam forming approach. The basic difference is the spatial light modulator (SLM) device for controlling the aperture field distribution. The original liquid crystal light valve SLM is replaced by an optical shuffling SLM, which was demonstrated for the 'smart pixel' technology. The advantages are the capability of generating the agile beams of a phased array antenna and to provide simultaneous transmit and receive functions. The second architecture considered is the optical beam splitting approach. This architecture involves an alternative amplitude control for each antenna element with an optical beam power divider comprised of mirrors and beam splitters. It also implements the quasi-optical grid phase shifter for phase control and grid amplifier for RF power. The advantages are no SLM is required for this approach, and the complete antenna system is capable of full monolithic integration.

Wu, Te-Kao↗

Grid generation for 3D turbomachinery configurations

A numerical grid generation algorithm associated with the flow field about turbomachinery geometries is presented. Graphical user interface is developed with the FORMS Library to create an interactive, user-friendly working environment. This customized algorithm reduces the man-hours required to generate a grid associated with turbomachinery geometry, as compared to those required by general-purpose grid generation softwares. Bezier curves are utilized both interactively and automatically to accomplish grid line smoothness and orthogonality. Graphical user interactions are provided in the algorithm and allow the user to design and manipulate the grid lines with a mouse.

Shih, Ming-Hsin↗