Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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 1,333 records · Page 74

A generalized memory test algorithm

A general algorithm for testing digital computer memory is presented. The test checks that (1) every bit can be cleared and set in each memory work, and (2) bits are not erroneously cleared and/or set elsewhere in memory at the same time. The algorithm can be applied to any size memory block and any size memory word. It is concise and efficient, requiring the very few cycles through memory. For example, a test of 16-bit-word-size memory requries only 384 cycles through memory. Approximately 15 seconds were required to test a 32K block of such memory, using a microcomputer having a cycle time of 133 nanoseconds.

Milner, E. J.↗

A multigrid and upwind viscous flow solver on 3-D embedded and overlapped grids

A numerically efficient method is presented for solving the three-dimensional governing equations of the viscous compressible flow about complex configurations with topologically different components. The physical domain is decomposed into regions for which the grid generation is relatively simple and virtually with no significant restrictions. The Navier-Stokes equations are solved by an implicit, approximately factored, upwind, finite-volume scheme. The block inversions and the diagonalized scalar inversions of the coefficient matrices are modified to allow the holes created in the computational domain by the embedded and overlapped grids. The convergence is accelerated by a multigrid algorithm despite the existence of such holes. The solution for s supersonic flow past a blunt-nose-cylinder at high angle-of-attack is obtained using a C-O grid embedded in a global Cartesian grid.

Baysal, Oktay↗

Probabilistic Structural Analysis Methods (PSAM) for select space propulsion system components

The fourth year of technical developments on the Numerical Evaluation of Stochastic Structures Under Stress (NESSUS) system for Probabilistic Structural Analysis Methods is summarized. The effort focused on the continued expansion of the Probabilistic Finite Element Method (PFEM) code, the implementation of the Probabilistic Boundary Element Method (PBEM), and the implementation of the Probabilistic Approximate Methods (PAppM) code. The principal focus for the PFEM code is the addition of a multilevel structural dynamics capability. The strategy includes probabilistic loads, treatment of material, geometry uncertainty, and full probabilistic variables. Enhancements are included for the Fast Probability Integration (FPI) algorithms and the addition of Monte Carlo simulation as an alternate. Work on the expert system and boundary element developments continues. The enhanced capability in the computer codes is validated by applications to a turbine blade and to an oxidizer duct.

Source record↗

Exploring the fine structure at the limb in coronal holes

The fine structure of the solar limb in coronal holes is explored at temperatures ranging from 10(exp 4) to 10(exp 6) K. An image enhancement algorithm orignally developed for solar eclipse observations is applied to a number of simultaneous multiwavelength observations made with the Harvard Extreme Ultraviolet Spectrometer experiment on Skylab. The enhanced images reveal the presence of filamentary structures above the limb with a characteristic separation of approximately 10 to 15 sec . Some of the structures extend from the solar limb into the corona to at least 4 min above the solar limb. The brightness of these structures changes as a function of height above the limb. The brightest emission is associated with spiculelike structures in the proximity of the limb. The emission characteristic of high-temperature plasma is not cospatial with the emission at lower temperatures, indicating the presence of different temperature plasmas in the field of view.

Karovska, Magarita↗

Rapid Numerical Simulation of Viscous Axisymmetric Flow Fields

A two-dimensional Navier-Stokes code has been developed for rapid numerical simulation of axisymmetric flow fields, including flow fields with an azimuthal velocity component. The azimuthal-invariant Navier-Stokes equations in a cylindrical coordinate system are mapped to a general body-fitted coordinate system, with the streamwise viscous terms then neglected by applying the thin-layer approximation. Turbulence effects are modeled using an algebraic model, typically the Baldwin-Lomax turbulence model, although a modified Cebeci-Smith model can also be used. The equations are discretized using central finite differences and solved using a multistage Runge-Kutta algorithm with a spatially varying time step and implicit residual smoothing. Results are presented for calculations of supersonic flow over a waisted body-of-revolution, transonic flow through a normal shock wave in a straight circular duct of constant cross sectional area, swirling supersonic (inviscid) flow through a strong shock in a straight radial duct, and swirling subsonic flow in an annular-to-circular diffuser duct. Comparisons between computed and experimental results are in fair to good agreement, demonstrating that the viscous code can be a useful tool for practical engineering design and analysis work.

Tweedt, Daniel L.↗

Registration assisted mosaic generation

This paper presents a general strategy for assembling mosaics from numerous individual images where uncertainty exists in the position and orientation of those images. Both of the presented applications relate to remotely operated camera platforms, the first being the Galileo solid state imaging (SSI) camera presently in orbit around Jupiter, and the second being the Imager for Mars Pathfinder (IMP) stereo camera on Mars. A basic strategy in both applications is to determine the correct relative camera pointing followed by direct map projection of the images. It is assumed that approximate camera pointing exists sufficient to locate adjacent images and to place initial tiepoints within reach of the correlator. Spatial correlation is used to fix tiepoints whose initial locations are predicted by the camera pointing. We use either an fast fourier transform (fft) algorithm or a variant of Gruen's scheme permitting limited image rotation and skew. The Gruen correlator has three hierarchical modes: 1) A classical spatial least squares correlation on integral pixel boundaries used when rotation is small. 2) An annealing non-deterministic search used when rotations are unknown. A simplex deterministic search used for the end game. The correlation operation can be performed either interactively or autonomously. The final camera pointing solution relies upon a simplex downhill search in 2n or 3n dimensions where n is the number of images comprising the mosaic and the objective function to be minimized is the disagreement between tiepoint locations predicted from the camera pointing with those observed by the correlator. For Galileo the 3n unknowns are euler angles defining camera pointing in planet coordinates, and for Mars Pathfinder they are 2n unknowns representing commanded azimuth and elevation in the Lander coordinate system.

Lorre, Jean J.↗

A Comparative Study of Interferometric Regridding Algorithms

THe paper discusses regridding options: (1) The problem of interpolating data that is not sampled on a uniform grid, that is noisy, and contains gaps is a difficult problem. (2) Several interpolation algorithms have been implemented: (a) Nearest neighbor - Fast and easy but shows some artifacts in shaded relief images. (b) Simplical interpolator - uses plane going through three points containing point where interpolation is required. Reasonably fast and accurate. (c) Convolutional - uses a windowed Gaussian approximating the optimal prolate spheroidal weighting function for a specified bandwidth. (d) First or second order surface fitting - Uses the height data centered in a box about a given point and does a weighted least squares surface fit.

Hensley, Scott↗

Cloud Spatial Structure and 3D Radiative Transfer

Cloud radiative properties are sensitive to drop size and other parameters of cloud micro-structure, but also to cloud shape, spacing, and other parameters of cloud macro-structure, including internal fractal structure. New information on cloud structure is being derived from a variety of cloud radars and lidars. Ongoing field programs such as DoE/ARM are improving the measurement and modelling of physical and radiative properties of clouds. A parallel effort is underway to improve cloud remote sensing, especially from the new suite of EOS (Earth Observing System) instruments which are beginning to provide higher spectral, spatial resolution, and/or angular resolution. Key parameters for improving pixel-scale retrievals are cloud thickness and photon mean-free-path, which together determine the scale of "radiative smoothing" of cloud fluxes and radiances. This scale has been observed as a change in the spatial spectrum of Landsat cloud radiances, and was also recently found with the Goddard micropulse lidar, by searching for returns from directions nonparallel to the incident beam. "Offbeam" Lidar returns are now being used to estimate the cloud "radiative Green's function", (G). G depends on cloud thickness and may be used to retrieve that important quantity. G is also being applied to improving simple estimates of cloud radiative properties that are based on the "Independent Pixel Approximation" or IPA. This and other measurements of 3D transfer in clouds, coupled with Monte Carlo and other 3D transfer methods, are beginning to provide a better understanding of the dependence of radiation on cloud inhomogeneity, and to suggest new retrieval and parameterization algorithms which take account of cloud inhomogeneity. An international "Intercomparison of 3D Radiation Codes" or I3RC, program is underway to coordinate and evaluate the variety of 3D radiative transfer methods now available, and to make them more widely available. Information is on the Web at: http://climate.gsfc.nasa.gov/I3RC. Input consists of selected cloud fields derived from data sources such as radar, microwave and satellite, and from models involved in the GEWEX Cloud Systems Studies. Output is selected radiative quantities that characterize the large-scale properties of the fields of radiative fluxes and heating. Several example cloud fields will be used to illustrate the effects of cloud inhomogeneity and 3D radiation.

Cahalan, Robert F.↗

Softc: An Operational Software Correlator

Softc has been used operationally for spacecraft navigation at JPL for over 2 years and will be JPL's Mark 5 correlator next year. Softc was written to be as close to an ideal correlator as possible, making approximations only below 10(exp -13) seconds. The program can correlate real USB, real LSB, or complex I/Q data sampled with 1, 2, 4. or 8-bit resolution, and was developed with strong debugging tools that made final debugging relatively quick. Softc's algorithms and program structure are fully documented. Timing tests on a recent Intel CPU show Softc processes 8 lags of 1-bit sampled data at 10 MSamples/sec, independent of sample rate.

Lowe, Stephen T.↗

A Galactic Binary Detection Pipeline

The Galaxy is suspected to contain hundreds of millions of binary white dwarf systems, a large fraction of which will have sufficiently small orbital period to emit gravitational radiation in band for space-based gravitational wave detectors such as the Laser Interferometer Space Antenna (LISA). LISA's main science goal is the detection of cosmological events (supermassive black hole mergers, etc.) however the gravitational signal from the galaxy will be the dominant contribution to the data - including instrumental noise over approximately two decades in frequency. The catalogue of detectable binary systems will serve as an unparalleled means of studying the Galaxy. Furthermore, to maximize the scientific return from the mission, the data must be "cleansed" of the galactic foreground. We will present an algorithm that can accurately resolve and subtract 2:: 10000 of these sources from simulated data supplied by the Mock LISA Data Challenge Task Force. Using the time evolution of the gravitational wave frequency, we will reconstruct the position of the recovered binaries and show how LISA will sample the entire compact binary population in the Galaxy.

Littenberg, Tyson B.↗

A Detection Pipeline for Galactic Binaries in LISA Data

The Galaxy is suspected to contain hundreds of millions of binary white dwarf systems, a large fraction of which will have sufficiently small orbital period to emit gravitational radiation in band for space-based gravitational wave detectors such as the Laser Interferometer Space Antenna (LISA). LISA's main science goal is the detection of cosmological events (supermassive black hole mergers) etc.) however the gravitational signal from the galaxy will be the dominant contribution to the data - including instrumental noise - over approximately two decades in frequency. The catalogue of detectable binary systems will serve as an unparalleled means of studying the Galaxy. Furthermore, to maximize the scientific return from the mission, the data must be "cleansed" of the galactic foreground. We will present an algorithm that can accurately resolve and subtract greater than or equal to 10000 of these sources from simulated data supplied by the Mock LISA Data Challenge Task Force. Using the time evolution of the gravitational wave frequency, we will reconstruct the position of the recovered binaries and show how LISA will sample the entire compact binary population in the Galaxy.

Littenberg, Tyson B.↗

Efficiency Improvements to the Displacement Based Multilevel Structural Optimization Algorithm

Multilevel Structural Optimization (MSO) continues to be an area of research interest in engineering optimization. In the present project, the weight optimization of beams and trusses using Displacement based Multilevel Structural Optimization (DMSO), a member of the MSO set of methodologies, is investigated. In the DMSO approach, the optimization task is subdivided into a single system and multiple subsystems level optimizations. The system level optimization minimizes the load unbalance resulting from the use of displacement functions to approximate the structural displacements. The function coefficients are then the design variables. Alternately, the system level optimization can be solved using the displacements themselves as design variables, as was shown in previous research. Both approaches ensure that the calculated loads match the applied loads. In the subsystems level, the weight of the structure is minimized using the element dimensions as design variables. The approach is expected to be very efficient for large structures, since parallel computing can be utilized in the different levels of the problem. In this paper, the method is applied to a one-dimensional beam and a large three-dimensional truss. The beam was tested to study possible simplifications to the system level optimization. In previous research, polynomials were used to approximate the global nodal displacements. The number of coefficients of the polynomials equally matched the number of degrees of freedom of the problem. Here it was desired to see if it is possible to only match a subset of the degrees of freedom in the system level. This would lead to a simplification of the system level, with a resulting increase in overall efficiency. However, the methods tested for this type of system level simplification did not yield positive results. The large truss was utilized to test further improvements in the efficiency of DMSO. In previous work, parallel processing was applied to the subsystems level, where the derivative verification feature of the optimizer NPSOL had been utilized in the optimizations. This resulted in large runtimes. In this paper, the optimizations were repeated without using the derivative verification, and the results are compared to those from the previous work. Also, the optimizations were run on both, a network of SUN workstations using the MPICH implementation of the Message Passing Interface (MPI) and on the faster Beowulf cluster at ICASE, NASA Langley Research Center, using the LAM implementation of UP]. The results on both systems were consistent and showed that it is not necessary to verify the derivatives and that this gives a large increase in efficiency of the DMSO algorithm.

Plunkett, C. L.↗

A bimodal search strategy for SETI

A SETI plan has been developed jointly by the NASA Ames Research Center and the Jet Propulsion Laboratory with the objective of both observing all potential sites to some limiting equivalent isotropic radiated power and surveying with greater sensitivity a set of especially promising sites. The bimodal search strategy assumes that existing radio telescopes with state-of-the-art receivers and data processing devices will have the sensitivity to explore the vicinity of nearby stars for similar transmitters and the entire galaxy for more powerful signals. The discrete source observational mode is designed to observe 773 F, G and K-type stars within 25 pc of the sun at frequencies from 1.2 to 3 GHz and spot bands between 3 and 25 GHz with sensitivities from 10 to the -25th to 10 to the -27th W/sq m. The sky survey is intended to search the entire celestial sphere between 1.2 and 10 GHz and spot bands between 10 and 25 GHz at a sensitivity limit of approximately 10 to the -23rd times the square root of the frequency. Instrumentation for the surveys includes a large multichannel spectrum analyzer. Immediate goals of the program are the investigation of the RF background at high resolution and the development of signal detection algorithms, with operation to begin in 1984.

Gulkis, S.↗

Model error estimation for large flexible spacecraft

The basic model obtained for spacecraft control system design applications is used to develop the control and estimation algorithms which constitute integral elements of the control system. The performance of this system is limited on account of modeling errors. The presence of such errors is inevitable in connection with truncated dynamics, parameter uncertainties, neglected nonlinearities, and external disturbances. In many cases, an approximate knowledge of the model errors can only be established by means of an estimation procedure. The present investigation has the objective to outline an approach to estimate errors inherent in a reduced-order model and to illustrate its application to modeling problems arising in spacecraft control system design. The considered procedure makes use of the principle of least-squares. In the discussed application this principle is employed to minimize a quadratic functional of the model errors.

Rodriguez, G.↗

A mesh re-zoning technique for finite element simulations of metal forming processes

Based on some fundamental properties of finite element approximations, a mesh re-zoning scheme is proposed for finite element simulations of metal forming problems. It is demonstrated that this technique is indispensable in analyzing many difficult forming processes, especially when there exist corners or very irregular shapes on the boundaries. The algorithm is tested by a backward extrusion process and direct extrusion through a square die.

Cheng, J.-C.↗

Accuracy of least-squares methods for the Navier-Stokes equations

Recently there has been substantial interest in least-squares finite element methods for velocity-vorticity-pressure formulations of the incompressible Navier-Stokes equations. The main cause for this interest is the fact that algorithms for the resulting discrete equations can be devised which require the solution of only symmetric, positive definite systems of algebraic equations. On the other hand, it is well-documented that methods using the vorticity as a primary variable often yield very poor approximations. Thus, here we study the accuracy of these methods through a series of computational experiments, and also comment on theoretical error estimates. It is found, despite the failure of standard methods for deriving error estimates, that computational evidence suggests that these methods are, at the least, nearly optimally accurate. Thus, in addition to the desirable matrix properties yielded by least-squares methods, one also obtains accurate approximations.

Bochev, Pavel B.↗

Accuracy of least-squares methods for the Navier-Stokes equations

Recently there has been substantial interest in least-squares finite element methods for velocity-vorticity-pressure formulations of the incompressible Navier-Stokes equations. The main cause for this interest is the fact that algorithms for the resulting discrete equations can be devised which require the solution of only symmetric, positive definite systems of algebraic equations. On the other hand, it is well-documented that methods using the vorticity as a primary variable often yield very poor approximations. Thus, here we study the accuracy of these methods through a series of computational experiments, and also comment on theoretical error estimates. It is found, despite the failure of standard methods for deriving error estimates, that computational evidence suggests that these methods are, at the least, nearly optimally accurate. Thus, in addition to the desirable matrix properties yielded by least-squares methods, one also obtains accurate approximations.

Bochev, Pavel B.↗

Comparison of the seasonal and interannual variability of phytoplankton pigment concentrations in the Peru and California Current systems

Monthly composite images from the global coastal zone color scanner (CZCS) data set are used to provide an initial illustration and comparison of seasonal and interannual variability of phytoplankton pigment concentration along the western coasts of South and North America in the Peru Current system (PCS) and California Current system (CCS). The analysis utilizes the entire time series of available data (November 1978 to June 1986) to form a mean annual cycle and an index of interannual variability for a series of both latitudinal and cross-shelf regions within each current system. Within 100 km of the coast, the strongest seasonal cycles in the CCS are in two regions, one between 34 deg and 45 deg N and the second between 24 deg and 29 deg N, each with maximum concentrations (greater than 3.0 mg m(exp-3)) in May-June. Weaker seasonal variability is present north of 45 deg N and in the Southern California Bight region (32 deg N). Within the PCS, in the same 100-km-wide coastal region, highest (greater than 45 deg S) and lowest (less than 20 deg S) latitude regions have a similar seasonal cycle with maximum concentrations (greater than 1.5 mg m(exp -3)) during the austral spring, summer, and fall, matching that evident throughout the CCS. Between these regions, off northern and central Chile, the seasonal maximum occurs during July-August (austral winter), contrary to the influence of upwelling favorable winds. Within the CCS, the dominant feature of interannual variability in the 8-year time series is a strong negative concentration anomaly in 1983, an El Nino year. The relative value of this negative anomaly is strongest off central California and is followed by an even stronger negative anomaly is strongest off central California and is followed by an even stronger negative anomaly in 1984 off Baja, California. In the PCS, strong negative anomalies during the 1982-1983 El Nino period are evident only off the Peruvian coast and are evident there only in the regions 100 km or more from the coast. Although negative anomalies associated with the El Nino were not present at higher latitudes (more than approximately 20 deg S) in the PCS, the extremely sparse sampling weakens our confidence in the results of the interannual analysis in this region. An upper estimate of the systematic winter bias remaining in the global CZCS data after reprocessing with the multiple scattering algorithm is given in the appendix.

Thomas, A. C.↗