Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms”

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 1,621 records · Page 90

Experimental validation of clock synchronization algorithms

The objective of this work is to validate mathematically derived clock synchronization theories and their associated algorithms through experiment. Two theories are considered, the Interactive Convergence Clock Synchronization Algorithm and the Midpoint Algorithm. Special clock circuitry was designed and built so that several operating conditions and failure modes (including malicious failures) could be tested. Both theories are shown to predict conservative upper bounds (i.e., measured values of clock skew were always less than the theory prediction). Insight gained during experimentation led to alternative derivations of the theories. These new theories accurately predict the behavior of the clock system. It is found that a 100 percent penalty is paid to tolerate worst-case failures. It is also shown that under optimal conditions (with minimum error and no failures) the clock skew can be as much as three clock ticks. Clock skew grows to six clock ticks when failures are present. Finally, it is concluded that one cannot rely solely on test procedures or theoretical analysis to predict worst-case conditions.

Palumbo, Daniel L.↗

Verifying the interactive convergence clock synchronization algorithm using the Boyer-Moore theorem prover

The application of formal methods to the analysis of computing systems promises to provide higher and higher levels of assurance as the sophistication of our tools and techniques increases. Improvements in tools and techniques come about as we pit the current state of the art against new and challenging problems. A promising area for the application of formal methods is in real-time and distributed computing. Some of the algorithms in this area are both subtle and important. In response to this challenge and as part of an ongoing attempt to verify an implementation of the Interactive Convergence Clock Synchronization Algorithm (ICCSA), we decided to undertake a proof of the correctness of the algorithm using the Boyer-Moore theorem prover. This paper describes our approach to proving the ICCSA using the Boyer-Moore prover.

Young, William D.↗

Comparison between the PISO algorithm and preconditioning methods for compressible flow

Two widely used family of algorithms, pressure-based and density-based methods, have been developed for computational fluid dynamics (CFD) problems over the years. Pressure-based methods (such as SIMPLE and PISO) use a Poisson-like equation for updating pressure instead of the continuity equation, while density-based methods use the continuity equation to update density (an equation of state is used to provide density in pressure based schemes and pressure in density based schemes). Pressure-based methods were developed originally for incompressible flows at low Reynolds numbers and were then extended to high Reynolds numbers and compressible applications. On the other hand, density based methods were originally developed for transonic flows and have been extended down to low Mach numbers through the use of preconditioning techniques. We compare these two very different approaches to solving the Navier-Stokes equations in order to gain an understanding of their similarities and differences. Specifically, we consider the PISO scheme as a representative pressure-based method and contrast it with a recently developed preconditioning scheme. We also compare the relative performance of the PISO algorithm with a Euler implicit algorithm that is employed to solve the preconditioned equations by means of a vector stability analysis.

Merkle, Charles L.↗

Computational algorithms for increased control of depth-viewing volume for stereo three-dimensional graphic displays

Three-dimensional pictorial displays incorporating depth cues by means of stereopsis offer a potential means of presenting information in a natural way to enhance situational awareness and improve operator performance. Conventional computational techniques rely on asymptotic projection transformations and symmetric clipping to produce the stereo display. Implementation of two new computational techniques, as asymmetric clipping algorithm and piecewise linear projection transformation, provides the display designer with more control and better utilization of the effective depth-viewing volume to allow full exploitation of stereopsis cuing. Asymmetric clipping increases the perceived field of view (FOV) for the stereopsis region. The total horizontal FOV provided by the asymmetric clipping algorithm is greater throughout the scene viewing envelope than that of the symmetric algorithm. The new piecewise linear projection transformation allows the designer to creatively partition the depth-viewing volume, with freedom to place depth cuing at the various scene distances at which emphasis is desired.

Williams, Steven P.↗

A direct algorithm for convective adjustment of the vertical temperature profile for an arbitrary critical lapse rate

An efficient direct algorithm of convective adjustment for an arbitrary critical value of the vertical temperature lapse rate gamma is proposed. The algorithm provides an exact and unique solution of a standard convective adjustment problem for models with temperature specified either on nonuniformly spaced levels or for layers of different thicknesses in pressure, sigma, or other vertical coordinate related to pressure. The algorithm may be recommended for use either directly in atmospheric models not explicitly including a hydrologic cycle with prescribed gamma, or as a part of more complicated parameterizations of moist convection, where gamma may be calculated depending on relative humidity.

Akmaev, Rashid A.↗

A fast algorithm for spectral differentiation

A simple algorithm is presented for matrix multiplication in just over half the number of operations entailed by the conventional algorithm, in cases where the matrix possesses the degree of symmetry widely exhibited by derivative matrices. The algorithm is used to multiply the Chebyshev derivative matrix by a vector. For the larger values of n, the ratio of execution times approached the expected value of 2.

Solomonoff, Alex↗

A new multirate sampled-data control law structure and synthesis algorithm

A new multirate sampled-data control law structure is defined and a new parameter-optimization-based synthesis algorithm for that structure is introduced. The synthesis algorithm can be applied to multirate, multiple-input multiple-output, sampled-data control laws having a prescribed dynamic order and structure, and a priori specified sampling/update rates for all sensors, processor states, and control inputs. The synthesis algorithm is applied to design two-input, two-output tip position controllers of various dynamic orders for a sixth-order, two-link robot arm model.

Berg, Martin C.↗

A non-linearly stable implicit finite element algorithm for hypersonic aerodynamics

A generalized curvilinear coordinate Taylor weak statement implicit finite element algorithm is developed for the two-dimensional and axisymmetric compressible Navier-Stokes equations for ideal and reacting gases. For accurate hypersonic simulation, air is modeled as a mixture of five perfect gases, i.e., molecular and atomic oxygen and nitrogen as well as nitric oxide. The associated pressure is then determined via Newton solution of the classical chemical equilibrium equation system. The directional semidiscretization is achieved using an optimal metric data Galerkin finite element weak statement, on a developed 'companion conservation law system', permitting classical test and trial space definitions. Utilizing an implicit Runge-Kutta scheme, the terminal algorithm is then nonlinearly stable, and second-order accurate in space and time on arbitrary curvilinear coordinates. Subsequently, a matrix tensor product factorization procedure permits an efficient numerical linear algebra handling for large Courant numbers. For ideal- and real-gas hypersonic flows, the algorithm generates essentially nonoscillatory numerical solutions in the presence of strong detached shocks and boundary layer-inviscid flow interactions.

Iannelli, G. S.↗

An unsymmetric Lanczos algorithm for damped structural dynamics systems

A one-sided, unsymmetric block Lanczos algorithm is proposed for the model reduction of structural dynamics systems with unsymmetric damping and/or stiffness matrices. The algorithm is a three-term iteration scheme, which transforms the system matrix into an almost skew-symmetric, block-tridiagonal form. The Lanczos reduced-order model is guaranteed to be stable if the full-order system is stable. For unstable systems, a shifting method is available. Also, the algorithm offers flexibility in the choice of starting vectors and thus can yield more accurate reduced-order models. A linear system example and a plane truss structure example are used to show the efficacy of the proposed method.

Su, Tzu-Jeng↗

NASA, Navy, and AES/York sea ice concentration comparison of SSM/I algorithms with SAR derived values

Previous research studies have focused on producing algorithms for extracting geophysical information from passive microwave data regarding ice floe size, sea ice concentration, open water lead locations, and sea ice extent. These studies have resulted in four separate algorithms for extracting these geophysical parameters. Sea ice concentration estimates generated from each of these algorithms (i.e., NASA/Team, NASA/Comiso, AES/York, and Navy) are compared to ice concentration estimates produced from coincident high-resolution synthetic aperture radar (SAR) data. The SAR concentration estimates are produced from data collected in both the Beaufort Sea and the Greenland Sea in March 1988 and March 1989, respectively. The SAR data are coincident to the passive microwave data generated by the Special Sensor Microwave/Imager (SSM/I).

Jentz, R. R.↗

A discrete momentum-conserving explicit algorithm for multibody dynamics analysis

A discrete momentum-conserving, explicit time integration is presented. The accurate feature and simplicity of the present algorithm are realized by a mid-point implicit formula for integrating the Euler parameters and a second-order discrete momentum-conserving form of the central difference algorithm, respectively. The accuracy and robustness of the algorithm is demonstrated by example problems which exhibit large overall rigid motions under holonomic constraints.

Park, K. C.↗

A new finite element formulation for computational fluid dynamics. IX - Fourier analysis of space-time Galerkin/least-squares algorithms

A Fourier stability and accuracy analysis of the space-time Galerkin/least-squares method as applied to a time-dependent advective-diffusive model problem is presented. Two time discretizations are studied: a constant-in-time approximation and a linear-in-time approximation. Corresponding space-time predictor multi-corrector algorithms are also derived and studied. The behavior of the space-time algorithms is compared to algorithms based on semidiscrete formulations.

Shakib, Farzin↗

A globally convergent matrix-free algorithm for implicit time-marching schemes arising in finite element analysis in fluids

A solution procedure for solving nonlinear time-marching problems is presented. The nonsymmetric systems of equations arising from a Newton-type linearization of these time-marching problems are solved using an iterative strategy based on the generalized minimal residual (GMRES) algorithm. Matrix-free techniques leading to reduction in storage are presented. Incorporation of a linesearch algorithm in the Newton-GMRES scheme is discussed. An automatic time-increment control strategy is developed to increase the stability of the time-marching process. High-speed flow computations demonstrate the effectiveness of these algorithms.

Johan, Zdenek↗

A solution-adaptive mesh algorithm for dynamic/static refinement of two and three dimensional grids

An adaptive grid algorithm has been developed in two and three dimensions that can be used dynamically with a solver or as part of a grid refinement process. The algorithm employs a transformation from the Cartesian coordinate system to a general coordinate space, which is defined as a parallelepiped in three dimensions. A weighting function, independent for each coordinate direction, is developed that will provide the desired refinement criteria in regions of high solution gradient. The adaptation is performed in the general coordinate space and the new grid locations are returned to the Cartesian space via a simple, one-step inverse mapping. The algorithm for relocation of the mesh points in the parametric space is based on the center of mass for distributed weights. Dynamic solution-adaptive results are presented for laminar flows in two and three dimensions.

Benson, Rusty A.↗

New multirate sampled-data control law structure and synthesis algorithm

A new multirate sampled-data control law structure is defined and a new parameter-optimization-based synthesis algorithm for that structure is introduced. The synthesis algorithm can be applied to multirate, multiple-input/multiple-output, sampled-data control laws having a prescribed dynamic order and structure, and a priori specified sampling/update rates for all sensors, processor states, and control inputs. The synthesis algorithm is applied to design two-input, two-output tip position controllers of various dynamic orders for a sixth-order, two-link robot arm model.

Berg, Martin C.↗

Algorithmic improvements for simulator motion drive

Contemporary simulator motion drive algorithms typically are designed in an analog (continuous) environment, but are implemented in a digital (discrete) environment. The intended continuous system, specified as frequency domain (Laplace transform) transfer functions, may not be represented properly by the algorithms used for digital implementation. The motion drive software in use with the Vertical Motion Simulator at Ames Research Center was investigated recently; the original algorithms (Euler) were changed to a state transition method. Comparison of the frequency responses of the original and new implementations showed that the state transition method more closely approximates the desired analog responses. In addition, test pilots who evaluated both implementations preferred the motions generated with the state transition method over those generated with the Euler integration method.

Laforce, Soren↗

A general explicit or semi-explicit algorithm for compressible and incompressible flows

A unified finite element algorithm is developed which is applicable to a wide range of problems of fluid mechanics without recourse to artificial, empirically determined factors. In its explicit form, the algorithm is similar to the Taylor-Galerkin scheme and is easily adopted to standard codes. The scheme proposed here possesses sufficient natural balancing diffusion and thus reduces and sometimes eliminates the need for special 'shock capturing' diffusion. The efficiency of the algorithm is demonstrated using several examples ranging from incompressible through transonic regions to supersonic flows.

Zienkiewicz, O. C.↗

Improved Algorithm Computes Incompressible Flow

Algorithm numerically integrates Navier-Stokes equations of time-dependent or steady flow of incompressible, viscous fluid. Simulates realistic three-dimensional flows bounded by stationary or moving surface(s) of complicated shape(s). Only two arbitrary parameters specified by user. Algorithm described in "Numerical Simulation Of Flow Through An Artificial Heart" (ARC-12478). Algorithm tested by application to number of steady and unsteady flows, including flow in artificial heart discussed in noted prior article.

Rogers, Stuart E.↗