SEARCH · Search NASA
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.
The calculation of sensitivity derivatives of solutions of iteratively solved systems of algebraic equations is investigated. A modified finite difference procedure is presented which improves the accuracy of the calculated derivatives. The procedure is demonstrated for a simple algebraic example as well as an element-by-element preconditioned conjugate gradient iterative solution technique applied to truss examples.
Acceleration methods are presented for solving the steady state incompressible equations. These systems are preconditioned by introducing artificial time derivatives which allow for a faster convergence to the steady state. The compressible equations in conservation form with slow flow are also considered. Two arbitrary functions, alpha and beta, are introduced in the general preconditioning. An analysis of this system is presented and an optimal value for beta is determined given a constant, alpha. It is further shown that the resultant incompressible equations form a symmetric hyperbolic system and so are well posed. Several generalizations to the compressible equations are presented which generalize previous results.
The development, use and operation of the XTRAN2L program that solves the two dimensional unsteady transonic small disturbance potential equation are described. The XTRAN2L program is used to calculate steady and unsteady transonic flow fields about airfoils and is capable of performing self contained transonic flutter calculations. Operation of the XTRAN2L code is described, and tables defining all input variables, including default values, are presented. Sample cases that use various program options are shown to illustrate operation of XTRAN2L. Computer listings containing input and selected output are included as an aid to the user.
An experimental tool for the investigation of human problem-solving behavior is introduced. Production Levels and Network Troubleshooting (PLANT) is a computer-based process-control task which may be used to provide opportunities for subjects to control a dynamic system and diagnose, repair, and compensate for system failures. The task is described in detail, and experiments which have been conducted using PLANT are briefly discussed.
A method of solving a class of linear matrix equations over various rings is proposed, using results from linear geometric control theory. An algorithm, successfully implemented, is presented, along with non-trivial numerical examples. Applications of the method to the algebraic control system design methodology are discussed.
Rule-based models of human problem solving have typically not been tested for statistical significance. Three methods of testing rules - analysis of variance, randomization, and contingency tables - are presented. Advantages and disadvantages of the methods are also described.
An efficient numerical procedure for solving a set of nonlinear partial differential equations, the steady Euler equations, using Newton's linearization procedure is presented. A theorem indicating quadratic convergence for the case of differential equations is demonstrated. A condition for the domain of quadratic convergence Omega(2) is obtained which indicates that whether an approximation lies in Omega(2) depends on the rate of change and the smoothness of the flow vectors, and hence is problem-dependent. The choice of spatial differencing, of particular importance for the present method, is discussed. The treatment of boundary conditions is addressed, and the system of equations resulting from the foregoing analysis is summarized and solution strategies are discussed. The convergence of calculated solutions is demonstrated by comparing them with exact solutions to one and two-dimensional problems.
A global-local approach was proposed to solve dynamic problems involving truss beams. A continuum Timoshenko beam was used to model sections of truss beams wherever possible and accurate. Near applied loads the continuum model was not adequate and detailed truss finite elements (discrete model) were employed. This approach was also proven efficient for an odd-shaped truss structure connected to a truss beam. Between the continuum model and the discrete model, compatibility conditions were derived.
The present iterative procedure combines the Clebsch potentials and the Munk-Prim (1947) substitution principle with an extension of a semidirect Cauchy-Riemann solver to three dimensions, in order to solve steady, inviscid three-dimensional rotational flow problems in either subsonic or incompressible flow regimes. This solution procedure can be used, upon discretization, to obtain inviscid subsonic flow solutions in a 180-deg turning channel. In addition to accurately predicting the behavior of weak secondary flows, the algorithm can generate solutions for strong secondary flows and will yield acceptable flow solutions after only 10-20 outer loop iterations.
Multiple arc data from repeated ground track are combined to reduce the error due to gravity field uncertainty in the determination of TOPEX orbit. The TOPEX dynamics is modeled with relatively few gravity parameters to account for the effect of the local gravity field. The gravity parameters are common to all arcs. The estimation algorithm uses the Householder transformation to combine multiple arc data and solve for the gravity parameters. The earth gravity field can be recovered with very modest amount of calculation.
An overview is given on considerations involved in the computation of solution to problems involving several scales. Examples of problems with multiple scales are studied, showing that the presence of multiple scales in a physical system may be manifested in different ways which depend on the degree of interaction between the various scales. Numerical methods commonly used to solve problems with multiple scales discussed, and it is found that the effective methods are based on subspace projection.
Presented are schemes for implementing multigrid algorithms on message based MIMD multiprocessor systems. To address the various issues involved, a nontrivial problem of solving the 2-D incompressible Navier-Stokes equations is considered as the model problem. Three different multigrid algorithms are considered. Results from implementing these algorithms on an Intel iPSC are presented.
The single instruction stream, multiple data stream Massively Parallel Processor (MPP) unit consists of 16,384 bit serial arithmetic processors configured as a 128 x 128 array whose speed can exceed that of current supercomputers (Cyber 205). The applicability of the MPP for solving reaction network problems is presented and discussed, including the mapping of the calculation to the architecture, and CPU timing comparisons.
The implementation of Pan and Reif's Parallel Nested Dissection (PND) algorithm on mesh connected parallel computers is described. This is the first known algorithm that allows very large, sparse linear systems of equations to be solved efficiently in polylog time using a small number of processors. How the processor bound of PND can be matched to the number of processors available on a given parallel computer by slowing down the algorithm by constant factors is described. Also, for the important class of problems where G(A) is a grid graph, a unique memory mapping that reduces the inter-processor communication requirements of PND to those that can be executed on mesh connected parallel machines is detailed. A description of an implementation on the Goodyear Massively Parallel Processor (MPP), located at Goddard is given. Also, a detailed discussion of data mappings and performance issues is given.
A procedure is outlined which utilizes parallel processing to solve the inviscid form of the average-passage equation system for multistage turbomachinery along with a description of its implementation in a FORTRAN computer code, MSTAGE. A scheme to reduce the central memory requirements of the program is also detailed. Both the multitasking and I/O routines referred to in this paper are specific to the Cray X-MP line of computers and its associated SSD (Solid-state Storage Device). Results are presented for a simulation of a two-stage rocket engine fuel pump turbine.
Distributed computing in intelligent systems is investigated from a different perspective. From the viewpoint that problem solving can be viewed as intelligent knowledge retrieval, the use of distributed knowledge sources in intelligent systems is proposed.
A procedure is outlined which utilizes parallel processing to solve the inviscid form of the average-passage equation system for multistage turbomachinery along with a description of its implementation in a FORTRAN computer code, MSTAGE. A scheme to reduce the central memory requirements of the program is also detailed. Both the multitasking and I/O routines referred to are specific to the Cray X-MP line of computers and its associated SSD (Solid-State Disk). Results are presented for a simulation of a two-stage rocket engine fuel pump turbine.
The introduction of artificial time derivatives which permit faster convergence to the steady state is used to precondition steady state incompressible equation-solving acceleration methods. An optimal value is obtained for beta, given constant alpha, where alpha and beta are arbitrary functions in the general preconditioning stage. A symmetric hyperbolic system is formed by the resulting incompressible equations. Compressible equations in conservation form with slow flow are also considered.