Search NASA⌕ Search

SEARCH · Search NASA

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 811 records · Page 45

Entropy condition satisfying approximations for the full potential equation of transonic flow

A class of conservative difference approximations for the steady full potential equation was presented. They are, in general, easier to program than the usual density biasing algorithms, and in fact, differ only slightly from them. Rigorous proof indicated that these new schemes satisfied a new discrete entropy inequality, which ruled out expansion shocks, and that they have sharp, steady, discrete shocks. A key tool in the analysis is the construction of a new entropy inequality for the full potential equation itself. Results of some numerical experiments using the new schemes are presented.

Osher, S.↗

Optimal post-experiment estimation of poorly modeled dynamic systems

Recently, a novel strategy for post-experiment state estimation of discretely-measured dynamic systems has been developed. The method accounts for errors in the system dynamic model equations in a more general and rigorous manner than do filter-smoother algorithms. The dynamic model error terms do not require the usual process noise assumptions of zero-mean, symmetrically distributed random disturbances. Instead, the model error terms require no prior assumptions other than piecewise continuity. The resulting state estimates are more accurate than filters for applications in which the dynamic model error clearly violates the typical process noise assumptions, and the available measurements are sparse and/or noisy. Estimates of the dynamic model error, in addition to the states, are obtained as part of the solution of a two-point boundary value problem, and may be exploited for numerous reasons. In this paper, the basic technique is explained, and several example applications are given. Included among the examples are both state estimation and exploitation of the model error estimates.

Mook, D. Joseph↗

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block tridiagonal matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconstant coefficients. A method was recently proposed to parallelize and vectorize BCR. In this paper, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational compelxity lower than that of parallel BCR.

Gallopoulos, E.↗

Solution of three-dimensional afterbody flow using reduced Navier-Stokes equations

The flow over afterbody geometries was investigated using the reduced Navier-Stokes (RNS) approximation. Both pressure velocity flux-split and composites velocity primitive variable formulations were considered. Pressure or pseudopotential relaxation procedures are combined with sparse matrix or coupled strongly implicit algorithms to form a three-dimensional solver for general non-orthogonal coordinates. Three-dimensional subsonic and transonic viscous/inviscid interacting flows were evaluated. Solutions with and without regions of recirculation were obtained.

Almahroos, H. M. H.↗

Electrostatic Particle-In-Cell Code For Hypercube Computer

Code simulates two-dimensional motions of plasma particles in self-consistent electrostatic field and externally applied magnetic field developed for execution on Mark IIIfp hypercube computer. Based on generalization of one-dimensional particle-in-cell algorithm applicable to many different parallel computing architectures. Intermediate product of continuing effort to speed particle-in-cell computations by taking advantage of distributed-memory parallel computers like those of hypercube class.

Ferraro, Robert D.↗

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block triangular matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconsistant coefficients. A method was recently proposed to parallelize and vectorize BCR. Here, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches, including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational complexity lower than that of parallel BCR.

Gallopoulos, E.↗

A computer code for multiphase all-speed transient flows in complex geometries. MAST version 1.0

The operation of the MAST code, which computes transient solutions to the multiphase flow equations applicable to all-speed flows, is described. Two-phase flows are formulated based on the Eulerian-Lagrange scheme in which the continuous phase is described by the Navier-Stokes equation (or Reynolds equations for turbulent flows). Dispersed phase is formulated by a Lagrangian tracking scheme. The numerical solution algorithms utilized for fluid flows is a newly developed pressure-implicit algorithm based on the operator-splitting technique in generalized nonorthogonal coordinates. This operator split allows separate operation on each of the variable fields to handle pressure-velocity coupling. The obtained pressure correction equation has the hyperbolic nature and is effective for Mach numbers ranging from the incompressible limit to supersonic flow regimes. The present code adopts a nonstaggered grid arrangement; thus, the velocity components and other dependent variables are collocated at the same grid. A sequence of benchmark-quality problems, including incompressible, subsonic, transonic, supersonic, gas-droplet two-phase flows, as well as spray-combustion problems, were performed to demonstrate the robustness and accuracy of the present code.

Chen, C. P.↗

Vision-based range estimation using helicopter flight data

Pilot aiding during low-altitude flight depends on the ability to detect and locate obstacles near the helicopter's intended flightpath. Computer-vision-based methods provide one general approach for obstacle detection and range estimation. Several algorithms have been developed for this purpose, but have not been tested with actual flight data. This paper presents results obtained using helicopter flight data with a feature-based range estimation algorithm. A method for recursively estimating range using a Kalman filter with a monocular sequence of images and knowledge of the camera's motion is described. The helicopter flight experiment and four resulting datasets are discussed. Finally the performance of the range estimation algorithm is explored in detail based on comparison of the range estimates with true range measurements collected during the flight experiment.

Smith, Philip N.↗

A comparison of force control algorithms for robots in contact with flexible environments

In order to perform useful tasks, the robot end-effector must come into contact with its environment. For such tasks, force feedback is frequently used to control the interaction forces. Control of these forces is complicated by the fact that the flexibility of the environment affects the stability of the force control algorithm. Because of the wide variety of different materials present in everyday environments, it is necessary to gain an understanding of how environmental flexibility affects the stability of force control algorithms. This report presents the theory and experimental results of two force control algorithms: Position Accommodation Control and Direct Force Servoing. The implementation of each of these algorithms on a two-arm robotic test bed located in the Center for Intelligent Robotic Systems for Space Exploration (CIRSSE) is discussed in detail. The behavior of each algorithm when contacting materials of different flexibility is experimentally determined. In addition, several robustness improvements to the Direct Force Servoing algorithm are suggested and experimentally verified. Finally, a qualitative comparison of the force control algorithms is provided, along with a description of a general tuning process for each control method.

Wilfinger, Lee S.↗

Vision-based range estimation using helicopter flight data

Pilot aiding during low-altitude flight depends on the ability to detect and locate obstacles near the helicopter's intended flightpath. Computer-vision-based methods provide one general approach for obstacle detection and range estimation. Several algorithms have been developed for this purpose, but have not been tested with actual flight data. This paper presents results obtained using helicopter flight data with a feature-based range estimation algorithm. A method for recursively estimating range using a Kalman filter with a monocular sequence of images and knowledge of the camera's motion is described. The helicopter flight experiment and one of four resulting datasets is briefly discussed. Finally the performance of the range estimation algorithm is explored based on comparison of the range estimates with true range measurements collected during the flight experiment.

Smith, Phillip N.↗

Vision-based range estimation using helicopter flight data

Pilot aiding during low-altitude flight depends on the ability to detect and locate obstacles near the helicopter's intended flightpath. Computer-vision-based methods provide one general approach for obstacle detection and range estimation. Several algorithms have been developed for this purpose, but have not been tested with actual flight data. This paper presents results obtained using helicopter flight data with a feature-based range estimation algorithm. A method for recursively estimating range using a Kalman filter with a monocular sequence of images and knowledge of the camera's motion is described. The helicopter flight experiment and four resulting datasets are discussed. Finally the performance of the range estimation algorithm is explored in detail based on comparison of the range estimates with true range measurements collected during the flight experiment.

Smith, Phillip N.↗

Binary tree eigen solver in finite element analysis

This paper presents a transputer-based binary tree eigensolver for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on the method of recursive doubling, which parallel implementation of a number of associative operations on an arbitrary set having N elements is of the order of o(log2N), compared to (N-1) steps if implemented sequentially. The hardware used in the implementation of the binary tree consists of 32 transputers. The algorithm is written in OCCAM which is a high-level language developed with the transputers to address parallel programming constructs and to provide the communications between processors. The algorithm can be replicated to match the size of the binary tree transputer network. Parallel and sequential finite element analysis programs have been developed to solve for the set of the least-order eigenpairs using the modified subspace method. The speed-up obtained for a typical analysis problem indicates close agreement with the theoretical prediction given by the method of recursive doubling.

Akl, F. A.↗

The application of the reduced order model Kalman filter to motion estimation of degraded image sequences

Motion estimation is a field of great interest because of its many applications in areas such as robotics and image coding. The optic flow method is one such scheme which, although fairly accurate, is prone to error in the presence of noise. This thesis describes the use of the reduced order model Kalman filter (ROMKF) in reducing errors in displacement estimation due to degradation of the sequence. The implementation of filtering and motion estimation algorithms on the SUN workstation is also discussed. Results from preliminary testing were used to determine the degrees of freedom available for the ROMKF in the SUN software. The tests indicated that increasing the state to the left leads to slight improvement over the minimum state case. Therefore, the software uses the minimum model, with the option of adding states to the left only. The ROMKF was then used in conjunction with a hierarchical pel recursive motion estimation algorithm. Applying the ROMKF to the degraded displacements themselves generally yielded slight improvements in cases with noise degradation and noise plus blur. Filtering the images of the degraded sequence prior to motion estimation was less effective in these cases. Both methods performed badly in the case of blur alone, resulting in increased displacement errors. This is thought to be due in part to filter artifacts. Some improvements were obtained by varying the filter parameters when filtering the displacements directly. This result suggests that further study in varying filter parameters may lead to better results. The results of this thesis indicate that the ROMKF can play a part in reducing motion estimation errors from degraded sequences. However, more work needs to be done before the use of the ROMKF can be a practical solution.

Simpson, Elizabeth C.↗

Sand transport on Mars: Preliminary results from models

Most studies of active aeolian processes on Mars have focused on dust, i.e., particles approximately 1 micron in diameter that are transported in suspension by wind. The presence of sand dunes on Mars indicates that larger grains (approximately greater than 60 microns, transported primarily in saltation) are also present. Although indirect evidence suggests that some dunes may be active, definitive evidence is lacking. Nonetheless, numerous studies demonstrate that sand is substantially easier to transport by wind than dust, and it is reasonable to infer that sand transportation in saltation occurs under present Martian conditions. In order to assess potential source regions, transportation pathways, and sites of deposition for sand on Mars, an iterative sand transport algorithm was developed that is based on the Mars General Circulation Model of Pollack et al. The results of the dust transport model are then compared with observed surface features, such as dune field locations observed on images, and surficial deposits as inferred from Viking IRTM observations. Preliminary results suggest that the north polar dune fields in the vicinity of 270 degrees W, 70 degrees N originated from weathered polar layered plains centered at 280 degrees W, 85 degrees N, and that Thaumasia Fossae, southern Hellas Planitia, and the area west of Hellespontus Montes are sand depositional sites. Examples of transportation 'corridors' include a westward pathway in the latitudinal band 35 degrees N to 45 degrees N, and a pathway southward from Solis Planum to Thaumasia Fossae, among others.

Greeley, R.↗

Mapping the mineralogy and lithology of Canyonlands, Utah with imaging spectrometer data and the multiple spectral feature mapping algorithm

The sedimentary sections exposed in the Canyonlands and Arches National Parks region of Utah (generally referred to as 'Canyonlands') consist of sandstones, shales, limestones, and conglomerates. Reflectance spectra of weathered surfaces of rocks from these areas show two components: (1) variations in spectrally detectable mineralogy, and (2) variations in the relative ratios of the absorption bands between minerals. Both types of information can be used together to map each major lithology and the Clark spectral features mapping algorithm is applied to do the job.

Clark, Roger N.↗

A proposed research program in information processing

The goal of the Formalized Software Development (FSD) project was to demonstrate improvements productivity of software development and maintenance through the use of a new software lifecycle paradigm. The paradigm calls for the mechanical, but human-guided, derivation of software implementations from formal specifications of the desired software behavior. It relies on altering a system's specification and rederiving its implementation as the standard technology for software maintenance. A system definition for this paradigm is composed of a behavioral specification together with a body of annotations that control the derivation of executable code from the specification. Annotations generally achieve the selection of certain data representations and/or algorithms that are consistent with, but not mandated by, the behavioral specification. In doing this, they may yield systems which exhibit only certain behaviors among multiple alternatives permitted by the behavioral specification. The FSD project proposed to construct a testbed in which to explore the realization of this new paradigm. The testbed was to provide operational support environment for software design, implementation, and maintenance. The testbed was proposed to provide highly automated support for individual programmers ('programming in the small'), but not to address the additional needs of programming teams ('programming in the large'). The testbed proposed to focus on supporting rapid construction and evolution of useful prototypes of software systems, as opposed to focusing on the problems of achieving production quality performance of systems.

Schorr, Herbert↗

Towards a generalized computational fluid dynamics technique for all Mach numbers

Currently there exists no single unified approach for efficiently and accurately solving computational fluid dynamics (CFD) problems across the Mach number regime, from truly low speed incompressible flows to hypersonic speeds. There are several CFD codes that have evolved into sophisticated prediction tools with a wide variety of features including multiblock capabilities, generalized chemistry and thermodynamics models among other features. However, as these codes evolve, the demand placed on the end user also increases simply because of the myriad of features that are incorporated into these codes. In order for a user to be able to solve a wide range of problems, several codes may be needed requiring the user to be familiar with the intricacies of each code and their rather complicated input files. Moreover, the cost of training users and maintaining several codes becomes prohibitive. The objective of the current work is to extend the compressible, characteristic-based, thermochemical nonequilibrium Navier-Stokes code GASP to very low speed flows and simultaneously improve convergence at all speeds. Before this work began, the practical speed range of GASP was Mach numbers on the order of 0.1 and higher. In addition, a number of new techniques have been developed for more accurate physical and numerical modeling. The primary focus has been on the development of optimal preconditioning techniques for the Euler and the Navier-Stokes equations with general finite-rate chemistry models and both equilibrium and nonequilibrium thermodynamics models. We began with the work of Van Leer, Lee, and Roe for inviscid, one-dimensional perfect gases and extended their approach to include three-dimensional reacting flows. The basic steps required to accomplish this task were a transformation to stream-aligned coordinates, the formulation of the preconditioning matrix, incorporation into both explicit and implicit temporal integration schemes, and modification of the numerical flux formulae. In addition, we improved the convergence rate of the implicit time integration schemes in GASP through the use of inner iteration strategies and the use of the GMRES (General Minimized Resisual) which belongs to the class of algorithms referred to as Krylov subspace iteration. Finally, we significantly improved the practical utility of GASP through the addition of mesh sequencing, a technique in which computations begin on a coarse grid and get interpolated onto successively finer grids. The fluid dynamic problems of interest to the propulsion community involve complex flow physics spanning different velocity regimes and possibly involving chemical reactions. This class of problems results in widely disparate time scales causing numerical stiffness. Even in the absence of chemical reactions, eigenvalue stiffness manifests itself at transonic and very low speed flows which can be quantified by the large condition number of the system and evidenced by slow convergence rates. This results in the need for thorough numerical analysis and subsequent implementation of sophisticated numerical techniques for these difficult yet practical problems. As a result of this work, we have been able to extend the range of applicability of compressible codes to very low speed inviscid flows (M = .001) and reacting flows.

Walters, R. W.↗

Bringing the cross-correlation method up to date

The cross-correlation (XC) method of Tonry & Davis (1979, AJ, 84, 1511) is generalized to arbitrary parametrized line profiles. In the new algorithm the correlation function itself, rather than the observed galaxy spectrum, is fitted by the model line profile: this removes much of the complication in the error analysis caused by template mismatch. Like the Fourier correlation quotient (FCQ) method of Bender (1990, A&A, 229, 441), the inferred line profiles are, up to a normalization constant, independent of template mismatch as long as there are no blended lines. The standard reduced chi(exp 2) is a good measure of the fit of the inferred velocity distribution, largely decoupled from the fit of the spectral template. The updated XC method performs as well as other recently developed methods, with the added virtue of conceptual simplicity.

Statler, Thomas↗