Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Vectorizable implicit algorithms for the flux-difference split, three-dimensional Navier-Stokes equations

The computational efficiency of four vectorizable implicit algorithms is assessed when applied to calculate steady-state solutions to the three-dimensional, incompressible Navier-Stokes equations in general coordinates. Two of these algorithms are characterized as hybrid schemes; that is, they combine some approximate factorization in two coordinate directions with relaxation in the remaining spatial direction. The other two algorithms utilize an approximate factorization approach which yields two-factor algorithms for three-dimensional systems. All four algorithms are implemented in identical high-resolution upwind schemes for the flux-difference split Navier-Stokes equations. These highly nonlinear schemes are obtained by extending an implicit Total Variation Diminishing (TVD) scheme recently developed for linear one-dimensional systems of hyperbolic conservation laws to the three-dimensional Navier-Stokes equations. The computation of vortical flow over a sharp-edged, thin delta wing has been chosen as a common numerical test case. The convergence of the algorithms is discussed and the accuracy of the computed flow-field results is assessed. The validity of the present results are demonstrated by a comparison with experimental data.

Hartwich, P. M.↗
NASA NTRS1972

An adaptive replacement algorithm for paged-memory computer systems.

A general class of adaptive replacement schemes for use in paged memories is developed. One such algorithm, called SIM, is simulated using a probability model that generates memory traces, and the results of the simulation of this adaptive scheme are compared with those obtained using the best nonlookahead algorithms. A technique for implementing this type of adaptive replacement algorithm with state of the art digital hardware is also presented.

Thorington, J. M., Jr.↗
NASA NTRS2017

JIGSAW-GEO (1.0): Locally Orthogonal Staggered Unstructured Grid Generation for General Circulation Modelling on the Sphere

An algorithm for the generation of non-uniform, locally orthogonal staggered unstructured spheroidal grids is described. This technique is designed to generate very high-quality staggered VoronoiDelaunay meshes appropriate for general circulation modelling on the sphere, including applications to atmospheric simulation, ocean-modelling and numerical weather prediction. Using a recently developed Frontal-Delaunay refinement technique, a method for the construction of high-quality unstructured spheroidal Delaunay triangulations is introduced. A locally orthogonal polygonal grid, derived from the associated Voronoi diagram, is computed as the staggered dual. It is shown that use of the Frontal-Delaunay refinement technique allows for the generation of very high-quality unstructured triangulations, satisfying a priori bounds on element size and shape. Grid quality is further improved through the application of hill-climbing-type optimisation techniques. Overall, the algorithm is shown to produce grids with very high element quality and smooth grading characteristics, while imposing relatively low computational expense. A selection of uniform and non-uniform spheroidal grids appropriate for high-resolution, multi-scale general circulation modelling are presented. These grids are shown to satisfy the geometric constraints associated with contemporary unstructured C-grid-type finite-volume models, including the Model for Prediction Across Scales (MPAS-O). The use of user-defined mesh-spacing functions to generate smoothly graded, non-uniform grids for multi-resolution-type studies is discussed in detail.

geophysical fluid dynamics↗
NASA NTRS1986

The evaluation of the OSGLR algorithm for restructurable controls

The detection and isolation of commercial aircraft control surface and actuator failures using the orthogonal series generalized likelihood ratio (OSGLR) test was evaluated. The OSGLR algorithm was chosen as the most promising algorithm based on a preliminary evaluation of three failure detection and isolation (FDI) algorithms (the detection filter, the generalized likelihood ratio test, and the OSGLR test) and a survey of the literature. One difficulty of analytic FDI techniques and the OSGLR algorithm in particular is their sensitivity to modeling errors. Therefore, methods of improving the robustness of the algorithm were examined with the incorporation of age-weighting into the algorithm being the most effective approach, significantly reducing the sensitivity of the algorithm to modeling errors. The steady-state implementation of the algorithm based on a single cruise linear model was evaluated using a nonlinear simulation of a C-130 aircraft. A number of off-nominal no-failure flight conditions including maneuvers, nonzero flap deflections, different turbulence levels and steady winds were tested. Based on the no-failure decision functions produced by off-nominal flight conditions, the failure detection performance at the nominal flight condition was determined. The extension of the algorithm to a wider flight envelope by scheduling the linear models used by the algorithm on dynamic pressure and flap deflection was also considered. Since simply scheduling the linear models over the entire flight envelope is unlikely to be adequate, scheduling of the steady-state implentation of the algorithm was briefly investigated.

Bonnice, W. F.↗
NASA NTRS1977

Pure field theories and MACSYMA algorithms

A pure field theory attempts to describe physical phenomena through singularity-free solutions of field equations resulting from an action principle. The physics goes into forming the action principle and interpreting specific results. Algorithms for the intervening mathematical steps are sketched. Vacuum general relativity is a pure field theory, serving as model and providing checks for generalizations. The fields of general relativity are the 10 components of a symmetric Riemannian metric tensor; those of the Einstein-Straus generalization are the 16 components of a nonsymmetric. Algebraic properties are exploited in top level MACSYMA commands toward performing some of the algorithms of that generalization. The light cone for the theory as left by Einstein and Straus is found and simplifications of that theory are discussed.

Ament, W. S.↗
NASA NTRS2005

High Gain Antenna Pointing on the Mars Exploration Rovers

This paper describes the algorithm used to point the high gain antennae on NASA/JPL's Mars exploration rovers. Each rover's gimballed antenna must track the Earth as it moves across the Martian sky during communication sessions. The pointing algorithm accounts for obstacles to the line-of-sight posed by (1) features on the rover and in the surrounding environment (2) gimbal range limitations, and (3) kinematic singularities in the gimbal mechanism. The algorithm treats all obstacles with a generalized approach that computes the intercept-times to each obstacle. Where possible, the algorithm takes advantage of pairs of joint-space solutions arising from the mechanism design. The algorithm chooses the solution that provides the longest obstruction-free tracking time. Upon encountering an obstacle, the algorithm automatically switches to the other solution if it is not also obstructed. This algorithm has successfully provided obstruction-free pointing for both rovers throughout the mission.

inverse kinematics↗
NASA NTRS1975

Time domain desensitized specific optimal system design

A digital computer algorithm for desensitized specific optimal system design for general time-invariant nonlinear systems is presented. The algorithm utilizes a technique of partitioning and uncoupling of the original specific closed-loop system state and sensitivity equations into linear, nonlinear, and control subsystems. Results of the application of the algorithm in the design of a Saturn V Launch Vehicle analog attitude control system and an LST image motion compensation digital controller are given.

Henson, T. F.↗
NASA NTRS1989

Eigensolution of finite element problems in a completely connected parallel architecture

A parallel algorithm is presented for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on a completely connected parallel architecture in which each processor is allowed to communicate with all other processors. The algorithm is successfully implemented on a tightly coupled MIMD parallel processor. A finite element model is divided into m domains each of which is assumed to process n elements. Each domain is then assigned to a processor or to a logical processor (task) if the number of domains exceeds the number of physical processors. The effect of the number of domains, the number of degrees-of-freedom located along the global fronts, and the dimension of the subspace on the performance of the algorithm is investigated. For a 64-element rectangular plate, speed-ups of 1.86, 3.13, 3.18, and 3.61 are achieved on two, four, six, and eight processors, respectively.

Akl, F.↗
NASA NTRS1991

A parallel-vector Lanczos eigen-solver for structural vibration problems

The Lanczos algorithm for the solution of generalized eigen-problem has been receiving a lot of attention in recent years due to its computational efficiency. The focus of this paper is to develop a Lanczos algorithm which can exploit both the parallel and vector capabilities provided by modern high-performance computers. A partial restoring orthogonality scheme is also developed and incorporated into the basic Lanczos algorithm. The numerical performance in terms of accuracy and efficiency of the proposed parallel-vector Lanczos algorithm is demonstrated by solving for the frequencies and mode shapes of structural problems on multiprocessor supercomputers.

Qin, Jiangning↗
NASA NTRS1987

Integration of symbolic and algorithmic hardware and software for the automation of space station subsystems

Traditional expert systems, such as diagnostic and training systems, interact with users only through a keyboard and screen, and are usually symbolic in nature. Expert systems that require access to data bases, complex simulations and real-time instrumentation have both symbolic as well as algorithmic computing needs. These needs could both be met using a general purpose workstation running both symbolic and algorithmic code, or separate, specialized computers networked together. The latter approach was chosen to implement TEXSYS, the thermal expert system, developed by NASA Ames Research Center in conjunction with Johnson Space Center to demonstrate the ability of an expert system to autonomously monitor the thermal control system of the space station. TEXSYS has been implemented on a Symbolics workstation, and will be linked to a microVAX computer that will control a thermal test bed. This paper will explore the integration options, and present several possible solutions.

Gregg, Hugh↗
NASA NTRS1987

Integration of symbolic and algorithmic hardware and software for the automation of space station subsystems

Expert systems that require access to data bases, complex simulations and real time instrumentation have both symbolic as well as algorithmic computing needs. These needs could both be met using a general computing workstation running both symbolic and algorithmic code, or separate, specialized computers networked together. The later approach was chosen to implement TEXSYS, the thermal expert system, developed to demonstrate the ability of an expert system to autonomously control the thermal control system of the space station. TEXSYS has been implemented on a Symbolics workstation, and will be linked to a microVAX computer that will control a thermal test bed. Integration options are explored and several possible solutions are presented.

Gregg, Hugh↗
NASA NTRS1988

Integration of symbolic and algorithmic hardware and software for the automation of space station subsystems

Expert systems that require access to data bases, complex simulations and real time instrumentation have both symbolic and algorithmic needs. Both of these needs could be met using a general purpose workstation running both symbolic and algorithmic codes, or separate, specialized computers networked together. The later approach was chosen to implement TEXSYS, the thermal expert system, developed by the NASA Ames Research Center in conjunction with the Johnson Space Center to demonstrate the ability of an expert system to autonomously monitor the thermal control system of the space station. TEXSYS has been implemented on a Symbolics workstation, and will be linked to a microVAX computer that will control a thermal test bed. The integration options and several possible solutions are presented.

Gregg, Hugh↗
NASA NTRS1993

Computation of selected eigenvalues of generalized eigenvalue problems

The Arnoldi (1951) and Lanczos (1950) iterative algorithms are used to obtain a few selected eigenvalues of the generalized eigenvalue problem A(x) = lambdaB(x), where A and B are n x n nonsymmetric banded complex matrices. A shift-and-invert strategy is used to increase the rate of convergence toward the desired eigenvalues, and the two approaches are evaluated in view of their performance in a model problem concerning the linear stability of compressible boundary layers. A general scheme for computing the eigenvalues that lie within a 'box' in the complex plane is presented.

Nayar, Narinder↗
NASA NTRS1989

Numerical solution of the incompressible Navier-Stokes equations for steady-state and time-dependent problems

An algorithm for the solution of the incompressible Navier-Stokes equations in three-dimensional generalized curvilinear coordinates is presented. The algorithm can be used to compute both steady-state and time-dependent flow problems. The algorithm is based on the method of artificial compressibility and uses a higher-order flux-difference splitting technique for the convective terms and a second-order central difference for the viscous terms. The steady-state solution of flow through a square duct with a 90 deg bend is computed and the results are compared with experimental data. Good agreement is observed. A comparison with an analytically known exact solution is then performed to verify the time accuracy of the algorithm. Finally, the flow through an artificial heart configuration with moving boundaries is calculated and presented.

Rogers, Stuart E.↗
NASA NTRS1991

Steady and unsteady solutions of the incompressible Navier-Stokes equations

An algorithm for the solution of the incompressible Navier-Stokes equations in three-dimensional generalized curvilinear coordinates is presented. The algorithm can be used to compute both steady-state and time-dependent flow problems. The algorithm is based on the method of artificial compressibility and uses a third-order flux-difference splitting technique for the convective terms and the second-order central difference for the viscous terms. The accuracy is obtained in the numerical solutions by subiterating the equations in pseudotime for each physical time step. The equations are solved with a line-relaxation scheme that allows the use of very large pseudotime steps leading to fast convergence for steady-state problems as well as for the subiterations of time-dependent problems. The steady-state solution of flow through a square duct with a 90-deg bend is computed, and the results are compared with experimental data. Good agreement is observed. Computations of unsteady flow over a circular cylinder are presented and compared to other experimental and computational results. Finally, the flow through an artificial heart configuration with moving boundaries is calculated and presented.

Rogers, Stuart E.↗
NASA NTRS1998

Efficient and Optimal Attitude Determination Using Recursive Global Positioning System Signal Operations

In this paper, a new and efficient algorithm is developed for attitude determination from Global Positioning System signals. The new algorithm is derived from a generalized nonlinear predictive filter for nonlinear systems. This uses a one time-step ahead approach to propagate a simple kinematics model for attitude determination. The advantages of the new algorithm over previously developed methods include: it provides optimal attitudes even for coplanar baseline configurations; it guarantees convergence even for poor initial conditions; it is a non-iterative algorithm; and it is computationally efficient. These advantages clearly make the new algorithm well suited to on-board applications. The performance of the new algorithm is tested on a dynamic hardware simulator. Results indicate that the new algorithm accurately estimates the attitude of a moving vehicle, and provides robust attitude estimates even when other methods, such as a linearized least-squares approach, fail due to poor initial starting conditions.

Crassidis, John L.↗