Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximate computing”

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,225 records · Page 68

Computational fluid dynamics at NASA Ames and the numerical aerodynamic simulation program

Computers are playing an increasingly important role in the field of aerodynamics such as that they now serve as a major complement to wind tunnels in aerospace research and development. Factors pacing advances in computational aerodynamics are identified, including the amount of computational power required to take the next major step in the discipline. The four main areas of computational aerodynamics research at NASA Ames Research Center which are directed toward extending the state of the art are identified and discussed. Example results obtained from approximate forms of the governing equations are presented and discussed, both in the context of levels of computer power required and the degree to which they either further the frontiers of research or apply to programs of practical importance. Finally, the Numerical Aerodynamic Simulation Program--with its 1988 target of achieving a sustained computational rate of 1 billion floating-point operations per second--is discussed in terms of its goals, status, and its projected effect on the future of computational aerodynamics.

Peterson, V. L.↗

Methods for local gravity field approximation

The most widely known modern method for estimating gravity field values from observed data is least-squares collocation. Its advantages are that it can make estimates at arbitrary locations based on irregularly spaced observations, and that it makes use of statistical information about errors in the input data while providing corresponding information about the quality of the output estimates. Disadvantages of collocation include the necessity of inverting square matrices of dimension equal to the number of data values and the need to assume covariance models for the gravity field and the data errors. Fourier methods are an important alternative to collocation; having the advantage of greater computational efficiency, but requiring data estimates to be on a regular grid and not using or providing statistical accuracy information. The GEOFAST algorithm is an implementation of collocation that achieves high computational efficiency by transforming the estimation equations into the frequency domain where an accurate approximation may be made to reduce the workload. The forward and inverse Fast Fourier Transforms (FFTs) are utilized. The accuracy and computational efficiency of the GEOFAST algorithm is demonstrated using two sets of synthetic gravity data: marine gravity for an ocean trench region including wavelengths longer than 200 km; and local land gravity containing wavelengths as short as 5 km. These results are discussed along with issues such as the advantages of first removing reference field models before carrying out the estimation algorithm.

Sailor, R. V.↗

The Definition and Computation of a Metric on Plane Curves. The Meaning of a Face on a Geometric Model

Two topics in topology, the comparison of plane curves and faces on geometric models, are discussed. With regard to the first problem, a curve is defined to be a locus of points without any underlying parameterization. A metric on a class of plane curves is defined, a finite computation of this metric is given for the case of piecewise linear curves, and it is shown how to approximate curves that have bounded curvature by piecewise linear curves. In this way a bound on the distance between two curves can be computed. With regard to the second problem, the questions to be discussed are under what circumstances do geometrical faces make sense; how can they be explicity defined; and when are these geometrical faces homeomorphic to the realization of the abstract (topological) face.

Emery, J. D.↗

Approach for Uncertainty Propagation and Robust Design in CFD Using Sensitivity Derivatives

This paper presents an implementation of the approximate statistical moment method for uncertainty propagation and robust optimization for a quasi 1-D Euler CFD (computational fluid dynamics) code. Given uncertainties in statistically independent, random, normally distributed input variables, a first- and second-order statistical moment matching procedure is performed to approximate the uncertainty in the CFD output. Efficient calculation of both first- and second-order sensitivity derivatives is required. In order to assess the validity of the approximations, the moments are compared with statistical moments generated through Monte Carlo simulations. The uncertainties in the CFD input variables are also incorporated into a robust optimization procedure. For this optimization, statistical moments involving first-order sensitivity derivatives appear in the objective function and system constraints. Second-order sensitivity derivatives are used in a gradient-based search to successfully execute a robust optimization. The approximate methods used throughout the analyses are found to be valid when considering robustness about input parameter mean values.

Putko, Michele M.↗

Control methods for aiding a pilot during STOL engine failure transients

Candidate autopilot control laws that control the engine failure transient sink rates by demonstrating the engineering application of modern state variable control theory were defined. The results of approximate modal analysis were compared to those derived from full state analyses provided from computer design solutions. The aircraft was described, and a state variable model of its longitudinal dynamic motion due to engine and control variations was defined. The classical fast and slow modes were assumed to be sufficiently different to define reduced order approximations of the aircraft motion amendable to hand analysis control definition methods. The original state equations of motion were also applied to a large scale state variable control design program, in particular OPTSYS. The resulting control laws were compared with respect to their relative responses, ease of application, and meeting the desired performance objectives.

Nelson, E. R.↗

Computer-Controlled Cylindrical Polishing Process for Large X-Ray Mirror Mandrels

We are developing high-energy grazing incidence shell optics for hard-x-ray telescopes. The resolution of a mirror shells depends on the quality of cylindrical mandrel from which they are being replicated. Mid-spatial-frequency axial figure error is a dominant contributor in the error budget of the mandrel. This paper presents our efforts to develop a deterministic cylindrical polishing process in order to keep the mid-spatial-frequency axial figure errors to a minimum. Simulation software is developed to model the residual surface figure errors of a mandrel due to the polishing process parameters and the tools used, as well as to compute the optical performance of the optics. The study carried out using the developed software was focused on establishing a relationship between the polishing process parameters and the mid-spatial-frequency error generation. The process parameters modeled are the speeds of the lap and the mandrel, the tool s influence function, the contour path (dwell) of the tools, their shape and the distribution of the tools on the polishing lap. Using the inputs from the mathematical model, a mandrel having conical approximated Wolter-1 geometry, has been polished on a newly developed computer-controlled cylindrical polishing machine. The preliminary results of a series of polishing experiments demonstrate a qualitative agreement with the developed model. We report our first experimental results and discuss plans for further improvements in the polishing process. The ability to simulate the polishing process is critical to optimize the polishing process, improve the mandrel quality and significantly reduce the cost of mandrel production

Khan, Gufran S.↗

Comparison of interference-free numerical results with sample experimental data for the AEDC wall-interference model at transonic and subsonic flow conditions

Numerical results obtained from two computer programs recently developed with NASA support and now available for use by others are compared with some sample experimental data taken on a rectangular-wing configuration in the AEDC 16-Foot Transonic Tunnel at transonic and subsonic flow conditions. This data was used in an AEDC investigation as reference data to deduce the tunnel-wall interference effects for corresponding data taken in a smaller tunnel. The comparisons were originally intended to see how well a current state-of-the-art transonic flow calculation for a simple 3-D wing agreed with data which was felt by experimentalists to be relatively interference-free. As a result of the discrepancies between the experimental data and computational results at the quoted angle of attack, it was then deduced from an approximate stress analysis that the sting had deflected appreciably. Thus, the comparisons themselves are not so meaningful, since the calculations must be repeated at the proper angle of attack. Of more importance, however, is a demonstration of the utility of currently available computational tools in the analysis and correlation of transonic experimental data.

Newman, P. A.↗

An approximate calculation of the strong interaction on a transonic airfoil

This paper describes an interactive computational scheme that calculates the transonic flow field over an airfoil. The inviscid flow, the turbulent boundary layer in the weak interaction region, and the elliptic flow in the strong interaction region are computed separately, and the solutions are matched iteratively in a direct, second-order interaction scheme. The pressure distribution, obtained from a transonic, small-perturbation solution, is prescribed on the boundary layer and the Navier-Stokes equations and the ensuing displacement thicknesses are used to modify the inviscid flow. The best overall results are obtained by using a turbulence model that eliminates the eddy viscosity in the strong interaction region. Computed pressure distributions are compared with experimental data and with Navier-Stokes solutions. In weak interactions, the agreement with experimental data is very good, as it is also in strong interactions except for the pressures in the separated-flow region. There the agreement is qualitative only, and the pressure recovery is too high. The results in both cases are superior or equal to those of the Navier-Stokes solutions, and the present method is significantly faster.

Seginer, A.↗

Exploiting symmetries in the modeling and analysis of tires

A simple and efficient computational strategy for reducing both the size of a tire model and the cost of the analysis of tires in the presence of symmetry-breaking conditions (unsymmetry in the tire material, geometry, or loading) is presented. The strategy is based on approximating the unsymmetric response of the tire with a linear combination of symmetric and antisymmetric global approximation vectors (or modes). Details are presented for the three main elements of the computational strategy, which include: use of special three-field mixed finite-element models, use of operator splitting, and substantial reduction in the number of degrees of freedom. The proposed computational stategy is applied to three quasi-symmetric problems of tires: linear analysis of anisotropic tires, through use of semianalytic finite elements, nonlinear analysis of anisotropic tires through use of two-dimensional shell finite elements, and nonlinear analysis of orthotropic tires subjected to unsymmetric loading. Three basic types of symmetry (and their combinations) exhibited by the tire response are identified.

Noor, Ahmed K.↗

Implicit solution methods in computational fluid dynamics

A class of implicit finite difference schemes of the Beam and Warming approximate factorization type will be addressed. The development and analysis of various aspects of this class of schemes will be given along with the motivations behind many of the choices. Various acceleration and efficiency modifications such as matrix reduction, diagonalization and flux split schemes will be presented. The methods are demonstrated in fully vectorized codes for a CRAY type architecture. The emphasis will be on the Euler equations in generalized coordinates.

Pulliam, Thomas H.↗

The computation of standard solar models

Procedures for calculating standard solar models with the usual simplifying approximations of spherical symmetry, no mixing except in the surface convection zone, no mass loss or gain during the solar lifetime, and no separation of elements by diffusion are described. The standard network of nuclear reactions among the light elements is discussed including rates, energy production and abundance changes. Several of the equation of state and opacity formulations required for the basic equations of mass, momentum and energy conservation are presented. The usual mixing-length convection theory is used for these results. Numerical procedures for calculating the solar evolution, and current evolution and oscillation frequency results for the present sun by some recent authors are given.

Ulrich, Roger K.↗

Radiative Transfer and Satellite Remote Sensing of Cirrus Clouds Using FIRE-2-IFO Data

Under the support of the NASA grant, we have developed a new geometric-optics model (GOM2) for the calculation of the single-scattering and polarization properties for arbitrarily oriented hexagonal ice crystals. From comparisons with the results computed by the finite difference time domain (FDTD) method, we show that the novel geometric-optics can be applied to the computation of the extinction cross section and single-scattering albedo for ice crystals with size parameters along the minimum dimension as small as approximately 6. We demonstrate that the present model converges to the conventional ray tracing method for large size parameters and produces single-scattering results close to those computed by the FDTD method for size parameters along the minimum dimension smaller than approximately 20. We demonstrate that neither the conventional geometric optics method nor the Lorenz-Mie theory can be used to approximate the scattering, absorption, and polarization features for hexagonal ice crystals with size parameters from approximately 5 to 20. On the satellite remote sensing algorithm development and validation, we have developed a numerical scheme to identify multilayer cirrus cloud systems using AVHRR data. We have applied this scheme to the satellite data collected over the FIRE-2-IFO area during nine overpasses within seven observation dates. Determination of the threshold values used in the detection scheme are based on statistical analyses of these satellite data.

Source record↗

Highly Scalable Matching Pursuit Signal Decomposition Algorithm

Matching Pursuit Decomposition (MPD) is a powerful iterative algorithm for signal decomposition and feature extraction. MPD decomposes any signal into linear combinations of its dictionary elements or atoms . A best fit atom from an arbitrarily defined dictionary is determined through cross-correlation. The selected atom is subtracted from the signal and this procedure is repeated on the residual in the subsequent iterations until a stopping criterion is met. The reconstructed signal reveals the waveform structure of the original signal. However, a sufficiently large dictionary is required for an accurate reconstruction; this in return increases the computational burden of the algorithm, thus limiting its applicability and level of adoption. The purpose of this research is to improve the scalability and performance of the classical MPD algorithm. Correlation thresholds were defined to prune insignificant atoms from the dictionary. The Coarse-Fine Grids and Multiple Atom Extraction techniques were proposed to decrease the computational burden of the algorithm. The Coarse-Fine Grids method enabled the approximation and refinement of the parameters for the best fit atom. The ability to extract multiple atoms within a single iteration enhanced the effectiveness and efficiency of each iteration. These improvements were implemented to produce an improved Matching Pursuit Decomposition algorithm entitled MPD++. Disparate signal decomposition applications may require a particular emphasis of accuracy or computational efficiency. The prominence of the key signal features required for the proper signal classification dictates the level of accuracy necessary in the decomposition. The MPD++ algorithm may be easily adapted to accommodate the imposed requirements. Certain feature extraction applications may require rapid signal decomposition. The full potential of MPD++ may be utilized to produce incredible performance gains while extracting only slightly less energy than the standard algorithm. When the utmost accuracy must be achieved, the modified algorithm extracts atoms more conservatively but still exhibits computational gains over classical MPD. The MPD++ algorithm was demonstrated using an over-complete dictionary on real life data. Computational times were reduced by factors of 1.9 and 44 for the emphases of accuracy and performance, respectively. The modified algorithm extracted similar amounts of energy compared to classical MPD. The degree of the improvement in computational time depends on the complexity of the data, the initialization parameters, and the breadth of the dictionary. The results of the research confirm that the three modifications successfully improved the scalability and computational efficiency of the MPD algorithm. Correlation Thresholding decreased the time complexity by reducing the dictionary size. Multiple Atom Extraction also reduced the time complexity by decreasing the number of iterations required for a stopping criterion to be reached. The Course-Fine Grids technique enabled complicated atoms with numerous variable parameters to be effectively represented in the dictionary. Due to the nature of the three proposed modifications, they are capable of being stacked and have cumulative effects on the reduction of the time complexity.

Christensen, Daniel↗

Instrumentation and telemetry systems for free-flight drop model testing

This paper presents instrumentation and telemetry system techniques used in free-flight research drop model testing at the NASA Langley Research Center. The free-flight drop model test technique is used to conduct flight dynamics research of high performance aircraft using dynamically scaled models. The free-flight drop model flight testing supplements research using computer analysis and wind tunnel testing. The drop models are scaled to approximately 20 percent of the size of the actual aircraft. This paper presents an introduction to the Free-Flight Drop Model Program which is followed by a description of the current instrumentation and telemetry systems used at the NASA Langley Research Center, Plum Tree Test Site. The paper describes three telemetry downlinks used to acquire the data, video, and radar tracking information from the model. Also described are two telemetry uplinks, one used to fly the model employing a ground-based flight control computer and a second to activate commands for visual tracking and parachute recovery of the model. The paper concludes with a discussion of free-flight drop model instrumentation and telemetry system development currently in progress for future drop model projects at the NASA Langley Research Center.

Hyde, Charles R.↗

Experimental Forward Flight Rotor Performance Testing from Terrestrial to Martian Atmospheric Densities

With the recent interest in Martian exploration using Unmanned Aerial Vehicles (UAV), an experimental study was conducted to investigate rotor performance at Martian atmospheric conditions. Both simulation and testing of rotors is vital for the evaluation of performance and behavior of rotor, especially for operations at Martian atmospheric densities and pressures. Testing and measuring rotor forward flight performance at Martian atmospheric conditions is a relatively unexplored area. Therefore, an experimental study was performed in a wind tunnel to investigate helicopter forward flight performance and to demonstrate successful rotor operation at Martian atmospheric densities. This work was a continuation of the first ever wind tunnel test of a simulated rotorcraft in forward flight at Martian atmospheric densities. A test was conducted in a facility, which could be evacuated to the atmospheric pressure and density of Mars. A 40-in diameter rotor, roughly approximating the scale of the proposed Mars Helicopter design by the NASA Jet Propulsion Laboratory (JPL), was tested in forward flight at Mars atmospheric pressure at the NASA Ames Planetary Aeolian Laboratory (PAL). In this forward flight testing, the drive system of the Martian Surface Wind Tunnel (MARSWIT) was never turned on. The goal of this experiment was to collect rotor thrust, rotational speed, power, torque, and wind speed measurements. Subsequently, these results can be used for correlation with simulated cases using a mid-fidelity Computational Fluid Dynamics (CFD) simulation. Rotor thrust and power seem to decrease approximately proportional to the decrease in density. However, the Reynolds number has an effect on rotor performance that might also be contributing to the change in thrust and power. This effect plays a vital role in rotor performance at reduced pressure that cannot be neglected in the simulation. Despite the challenges involved in testing at a large difference of atmospheric densities between Earth and Mars, repeatable data is obtained in all the measurements at Martian atmospheric conditions.

Martian↗

Generation and exploration of aggregation abstractions for scheduling and resource allocation

This paper presents research on the abstraction of computational theories for scheduling and resource allocation. The paper describes both theory and methods for the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. The interaction of aggregation abstraction generation with the more thoroughly investigated abstractions of weakening operator preconditions is briefly discussed. The purpose of generating abstract theories for aggregated demand and resources includes: answering queries about aggregate properties, such as gross feasibility; reducing computational costs by using the solution of aggregate problems to guide the solution of detailed problems; facilitating reformulating theories to approximate problems for which there are efficient problem-solving methods; and reducing computational costs of scheduling by providing more opportunities for variable and value-ordering heuristics to be effective. Experiments are being developed to characterize the properties of aggregations that make them cost effective. Both abstract and concrete theories are represented in a variant of first-order predicate calculus, which is a parameterized multi-sorted logic that facilitates specification of large problems. A particular problem is conceptually represented as a set of ground sentences that is consistent with a quantified theory.

Lowry, Michael R.↗

Applied Routh approximation

The Routh approximation technique for reducing the complexity of system models was applied in the frequency domain to a 16th order, state variable model of the F100 engine and to a 43d order, transfer function model of a launch vehicle boost pump pressure regulator. The results motivate extending the frequency domain formulation of the Routh method to the time domain in order to handle the state variable formulation directly. The time domain formulation was derived and a characterization that specifies all possible Routh similarity transformations was given. The characterization was computed by solving two eigenvalue-eigenvector problems. The application of the time domain Routh technique to the state variable engine model is described, and some results are given. Additional computational problems are discussed, including an optimization procedure that can improve the approximation accuracy by taking advantage of the transformation characterization.

Merrill, W. C.↗

A distributed vortex method for computing the vortex field of a missile

Vortex sheet development in the flow field of a missile was investigated by approximating the sheets in the cross-flow plane with short straight-line segments having distributed vorticity. In contrast with the method that represents the sheets as lines of discrete vortices, this distributed vortex method produced calculations with a high degree of computational stability.

Barger, R. L.↗