Search NASA⌕ Search

SEARCH · Search NASA

Results for “SOR”

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 37 records · Page 2

Finite element analysis of periodic transonic flow problems

Flow about an oscillating thin airfoil in a transonic stream was considered. It was assumed that the flow field can be decomposed into a mean flow plus a periodic perturbation. On the surface of the airfoil the usual Neumman conditions are imposed. Two computer programs were written, both using linear basis functions over triangles for the finite element space. The first program uses a banded Gaussian elimination solver to solve the matrix problem, while the second uses an iterative technique, namely SOR. The only results obtained are for an oscillating flat plate.

Fix, G. J.↗

Artificial compressibility methods for numerical solutions of transonic full potential equation

New methods for transonic flow computations based on the full potential equation in conservation form are presented. The idea is to modify slightly the density (due to the artificial viscosity in the supersonic region), and solve the resulting elliptic-like problem iteratively. It is shown that standard discretization techniques (central differencing) as well as some standard iterative procedures (SOR, ADI, and explicit methods) are applicable to the modified transonic mixed-type equation. Calculations of transonic flows around cylinders and airfoils are discussed with special emphasis on the explicit methods that are suitable for vector processing on the STAR 100 computer.

Hafez, M.↗

On the solution of the unsteady Navier-Stokes equations for hypersonic flow about axially-symmetric blunt bodies

A formulation of the complete Navier-Stokes problem for a viscous hypersonic flow in general curvilinear coordinates is presented. This formulation is applicable to both the axially symmetric and three dimensional flows past bodies of revolution. The equations for the case of zero angle of attack were solved past a circular cylinder with hemispherical caps by point SOR finite difference approximation. The free stream Mach number and the Reynolds number for the test case are respectively 22.04 and 168883. The whole algorithm is presented in detail along with the preliminary results for pressure, temperature, density and velocity distributions along the stagnation line.

Warsi, Z. U. A.↗

Black box multigrid

The black box multigrid (BOXMG) code, which only needs specification of the matrix problem for application in the multigrid method was investigated. It is contended that a major problem with the multigrid method is that each new grid configuration requires a major programming effort to develop a code that specifically handles that grid configuration. The SOR and ICCG methods only specify the matrix problem, no matter what the grid configuration. It is concluded that the BOXMG does everything else necessary to set up the auxiliary coarser problems to achieve a multigrid solution.

Dendy, J. E., Jr.↗

Numerical simulation of a conducting disk partially covered by an insulator interacting with a plasma

A numerical simulation has been made of the 'pinhole effect' which produces the characteristic 'S-shaped' current-voltage curve. A disk-shaped conducting probe immersed in a plasma is modeled using a particle-in-cell (PIC) code. A probe partially covered by a very thin insulating layer is considered, as well as a probe mounted on an insulating disk. The simulation uses a cylindrical particle mover and allows for a variable number of particles in the system. The simulation space grid uses three different mesh sizes, the coarsest being away from the probe and the finest near the probe, in order to accurately calculate the trajectories of the simulation particles contributing the current to the probe and to the surface charge density on the dielectric. The calculation of the electrostatic potential is done self-consistently using successive over-relaxation (SOR). Backscattering and secondary electron emission are included for the case of positive probe voltage.

Chaky, R. C.↗

A fully vectorized numerical solution of the incompressible Navier-Stokes equations

A vectorizable algorithm is presented for the implicit finite difference solution of the incompressible Navier-Stokes equations in general curvilinear coordinates. The unsteady Reynolds averaged Navier-Stokes equations solved are in two dimension and non-conservative primitive variable form. A two-layer algebraic eddy viscosity turbulence model is used to incorporate the effects of turbulence. Two momentum equations and a Poisson pressure equation, which is obtained by taking the divergence of the momentum equations and satisfying the continuity equation, are solved simultaneously at each time step. An elliptic grid generation approach is used to generate a boundary conforming coordinate system about an airfoil. The governing equations are expressed in terms of the curvilinear coordinates and are solved on a uniform rectangular computational domain. A checkerboard SOR, which can effectively utilize the computer architectural concept of vector processing, is used for iterative solution of the governing equations.

Patel, N.↗

Reordering computations for parallel execution

The computations are reordered in the SOR algorithm to maintain the same asymptotic rate of convergence as the rowwise ordering to obtain parallelism at different levels. A parallel program is written to illustrate these ideas and actual machines for implementation of this program are discussed.

Adams, L.↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, J. H.↗

Reduction of the effects of the communication delays in scientific algorithms on message passing MIMD architectures

The efficient implementation of algorithms on multiprocessor machines requires that the effects of communication delays be minimized. The effects of these delays on the performance of a model problem on a hypercube multiprocessor architecture is investigated and methods are developed for increasing algorithm efficiency. The model problem under investigation is the solution by red-black Successive Over Relaxation YOUN71 of the heat equation; most of the techniques described here also apply equally well to the solution of elliptic partial differential equations by red-black or multicolor SOR methods. Methods for reducing communication traffic and overhead on a multiprocessor are identified and results of testing these methods on the Intel iPSC Hypercube reported. Methods for partitioning a problem's domain across processors, for reducing communication traffic during a global convergence check, for reducing the number of global convergence checks employed during an iteration, and for concurrently iterating on multiple time-steps in a time-dependent problem. Empirical results show that use of these models can markedly reduce a numewrical problem's execution time.

Saltz, J. H.↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, Joel H.↗

Recent enhancements to the GRIDGEN structured grid generation system

Significant enhancements are being implemented into the GRIDGEN3D, multiple block, structured grid generation software. Automatic, point-to-point, interblock connectivity will be possible through the addition of the domain entity to GRIDBLOCK's block construction process. Also, the unification of GRIDGEN2D and GRIDBLOCK has begun with the addition of edge grid point distribution capability to GRIDBLOCK. The geometric accuracy of surface grids and the ease with which databases may be obtained is being improved by adding support for standard computer-aided design formats (e.g., PATRAN Neutral and IGES files). Finally, volume grid quality was improved through addition of new SOR algorithm features and the new hybrid control function type to GRIDGEN3D.

Steinbrenner, John P.↗

Simulations of curved turbulent boundary layers

The objective of this work is to develop a space-time accurate numerical method for the solution of incompressible Navier-Stokes equations in generalized coordinates. The resulting code is to be used for direct and large-eddy simulation of turbulence in complex geometries. In a previous paper, the system of Navier-Stokes equations in general curvilinear coordinates was solved by a second-order accurate finite-difference scheme. Satisfactory results were obtained for several flows in two and three dimensions. The system of Navier-Stokes for the fluxes are given in Orlandi (1989). The main deficiency of the numerical scheme was the large CPU time required for the solution of the Poisson equation for the 'pressure' field. The point SOR relaxation, in conjunction with a multigrid scheme, was used for the Poisson equation. In some cases, particularly with very fine grids, it was impossible to obtain a divergent-free flow. A preliminary attempt is made to compute the spatially evolving flow of Swearingen & Blackwelder. To reduce the streamwise distance, the inflow was at a distance x = 60 cm from the leading edge.

Orlandi, Paolo↗

An overview of the Galileo Optical Experiment (GOPEX)

Uplink optical communication to a deep-space vehicle was demonstrated. In the Galileo Optical Experiment (GOPEX), optical transmissions were beamed to the Galileo spacecraft by Earth-based transmitters at the Table Mountain Facility (TMF), California, and Starfire Optical Range (SOR), New Mexico. The demonstration took place over an eight-day period (9 Dec. through 16 Dec. 1992) as Galileo receded from Earth on its way to Jupiter, and covered ranges from 1-6 million km. At 6 million km (15 times the Earth-Moon distance), the laser beam transmitted from TMF eight days after Earth flyby covered the longest known range for transmission and detection.

Wilson, K. E.↗

Data analysis for GOPEX image frames

The data analysis based on the image frames received at the Solid State Imaging (SSI) camera of the Galileo Optical Experiment (GOPEX) demonstration conducted between 9-16 Dec. 1992 is described. Laser uplink was successfully established between the ground and the Galileo spacecraft during its second Earth-gravity-assist phase in December 1992. SSI camera frames were acquired which contained images of detected laser pulses transmitted from the Table Mountain Facility (TMF), Wrightwood, California, and the Starfire Optical Range (SOR), Albuquerque, New Mexico. Laser pulse data were processed using standard image-processing techniques at the Multimission Image Processing Laboratory (MIPL) for preliminary pulse identification and to produce public release images. Subsequent image analysis corrected for background noise to measure received pulse intensities. Data were plotted to obtain histograms on a daily basis and were then compared with theoretical results derived from applicable weak-turbulence and strong-turbulence considerations. Processing steps are described and the theories are compared with the experimental results. Quantitative agreement was found in both turbulence regimes, and better agreement would have been found, given more received laser pulses. Future experiments should consider methods to reliably measure low-intensity pulses, and through experimental planning to geometrically locate pulse positions with greater certainty.

Levine, B. M.↗

A multi-level solution algorithm for steady-state Markov chains

A new iterative algorithm, the multi-level algorithm, for the numerical solution of steady state Markov chains is presented. The method utilizes a set of recursively coarsened representations of the original system to achieve accelerated convergence. It is motivated by multigrid methods, which are widely used for fast solution of partial differential equations. Initial results of numerical experiments are reported, showing significant reductions in computation time, often an order of magnitude or more, relative to the Gauss-Seidel and optimal SOR algorithms for a variety of test problems. The multi-level method is compared and contrasted with the iterative aggregation-disaggregation algorithm of Takahashi.

Horton, Graham↗

Algorithms for parallel and vector computations

This is a final report on work performed under NASA grant NAG-1-1112-FOP during the period March, 1990 through February 1995. Four major topics are covered: (1) solution of nonlinear poisson-type equations; (2) parallel reduced system conjugate gradient method; (3) orderings for conjugate gradient preconditioners, and (4) SOR as a preconditioner.

Ortega, James M.↗

An Architectural Concept for Intrusion Tolerance in Air Traffic Networks

The goal of an intrusion tolerant network is to continue to provide predictable and reliable communication in the presence of a limited num ber of compromised network components. The behavior of a compromised network component ranges from a node that no longer responds to a nod e that is under the control of a malicious entity that is actively tr ying to cause other nodes to fail. Most current data communication ne tworks do not include support for tolerating unconstrained misbehavio r of components in the network. However, the fault tolerance communit y has developed protocols that provide both predictable and reliable communication in the presence of the worst possible behavior of a limited number of nodes in the system. One may view a malicious entity in a communication network as a node that has failed and is behaving in an arbitrary manner. NASA/Langley Research Center has developed one such fault-tolerant computing platform called SPIDER (Scalable Proces sor-Independent Design for Electromagnetic Resilience). The protocols and interconnection mechanisms of SPIDER may be adapted to large-sca le, distributed communication networks such as would be required for future Air Traffic Management systems. The predictability and reliabi lity guarantees provided by the SPIDER protocols have been formally v erified. This analysis can be readily adapted to similar network stru ctures.

Maddalon, Jeffrey M.↗