Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 649 records · Page 36

Transport properties of N2 gas at cryogenic temperatures

The viscosity and thermal conductivity of nitrogen gas for the temperature range 5 K - 135 K have been computed from the second Chapman-Enskog approximation. Quantum effects, which become appreciable at the lower temperatures, are included by utilizing collision integrals based on quantum theory. A Lennard-Jones (12-6) potential was assumed. The computations yield viscosities about 20 percent lower than those predicted for the high end of this temperature range by the method of corresponding states, but the agreement is excellent when the computed values are compared with existing experimental data.

Pearson, W. E.↗

Analysis of a parallelized nonlinear elliptic boundary value problem solver with application to reacting flows

A parallelized finite difference code based on the Newton method for systems of nonlinear elliptic boundary value problems in two dimensions is analyzed in terms of computational complexity and parallel efficiency. An approximate cost function depending on 15 dimensionless parameters is derived for algorithms based on stripwise and boxwise decompositions of the domain and a one-to-one assignment of the strip or box subdomains to processors. The sensitivity of the cost functions to the parameters is explored in regions of parameter space corresponding to model small-order systems with inexpensive function evaluations and also a coupled system of nineteen equations with very expensive function evaluations. The algorithm was implemented on the Intel Hypercube, and some experimental results for the model problems with stripwise decompositions are presented and compared with the theory. In the context of computational combustion problems, multiprocessors of either message-passing or shared-memory type may be employed with stripwise decompositions to realize speedup of O(n), where n is mesh resolution in one direction, for reasonable n.

Keyes, David E.↗

Thermodynamic equilibrium-air correlations for flowfield applications

Equilibrium-air thermodynamic correlations have been developed for flowfield calculation procedures. A comparison between the postshock results computed by the correlation equations and detailed chemistry calculations is very good. The thermodynamic correlations are incorporated in an approximate inviscid flowfield code with a convective heating capability for the purpose of defining the thermodynamic environment through the shock layer. Comparisons of heating rates computed by the approximate code and a viscous-shock-layer method are good. In addition to presenting the thermodynamic correlations, the impact of several viscosity models on the convective heat transfer is demonstrated.

Zoby, E. V.↗

Quadratic Programming for Allocating Control Effort

A computer program calculates an optimal allocation of control effort in a system that includes redundant control actuators. The program implements an iterative (but otherwise single-stage) algorithm of the quadratic-programming type. In general, in the quadratic-programming problem, one seeks the values of a set of variables that minimize a quadratic cost function, subject to a set of linear equality and inequality constraints. In this program, the cost function combines control effort (typically quantified in terms of energy or fuel consumed) and control residuals (differences between commanded and sensed values of variables to be controlled). In comparison with prior control-allocation software, this program offers approximately equal accuracy but much greater computational efficiency. In addition, this program offers flexibility, robustness to actuation failures, and a capability for selective enforcement of control requirements. The computational efficiency of this program makes it suitable for such complex, real-time applications as controlling redundant aircraft actuators or redundant spacecraft thrusters. The program is written in the C language for execution in a UNIX operating system.

Singh, Gurkirpal↗

Earth horizon modeling and application to static Earth sensors on TRMM spacecraft

Data from Earth sensor assemblies (ESA's) often are used in the attitude determination (AD) for both spinning and Earth-pointing spacecraft. The ESA's on previous such spacecraft for which the ground-based AD operation was performed by the Flight Dynamics Division (FDD) used the Earth scanning method. AD on such spacecraft requires a model of the shape of the Earth disk as seen from the spacecraft. AD accuracy requirements often are too severe to permit Earth oblateness to be ignored when modeling disk shape. Section 2 of this paper reexamines and extends the methods for Earth disk shape modeling employed in AD work at FDD for the past decade. A new formulation, based on a more convenient Earth flatness parameter, is introduced, and the geometric concepts are examined in detail. It is shown that the Earth disk can be approximated as an ellipse in AD computations. Algorithms for introducing Earth oblateness into the AD process for spacecraft carrying scanning ESA's have been developed at FDD and implemented into the support systems. The Tropical Rainfall Measurement Mission (TRMM) will be the first spacecraft with AD operation performed at FDD that uses a different type of ESA - namely, a static one - containing four fixed detectors D(sub i) (i = 1 to 4). Section 3 of this paper considers the effect of Earth oblateness on AD accuracy for TRMM. This effect ideally will not induce AD errors on TRMM when data from all four D(sub i) are present. When data from only two or three D(sub i) are available, however, a spherical Earth approximation can introduce errors of 0.05 to 0.30 deg on TRMM. These oblateness-induced errors are eliminated by a new algorithm that uses the results of Section 2 to model the Earth disk as an ellipse.

Keat, J.↗

Efficient solution of parabolic equations by Krylov approximation methods

Numerical techniques for solving parabolic equations by the method of lines is addressed. The main motivation for the proposed approach is the possibility of exploiting a high degree of parallelism in a simple manner. The basic idea of the method is to approximate the action of the evolution operator on a given state vector by means of a projection process onto a Krylov subspace. Thus, the resulting approximation consists of applying an evolution operator of a very small dimension to a known vector which is, in turn, computed accurately by exploiting well-known rational approximations to the exponential. Because the rational approximation is only applied to a small matrix, the only operations required with the original large matrix are matrix-by-vector multiplications, and as a result the algorithm can easily be parallelized and vectorized. Some relevant approximation and stability issues are discussed. We present some numerical experiments with the method and compare its performance with a few explicit and implicit algorithms.

Gallopoulos, E.↗

Empirical mode constants for calculating frequencies of axial-flow compressor blades

The vibration characteristics of a group of axial-flow compressor blades of similar geometry were investigated. Empirical-mode constants were determined for the first three bending and torsional modes. A comparison of experimentally determined frequencies of a second group of blades with frequencies computed using these mode constants showed that the computed values were correct within 10 percent. The approximate limiting ratios of depth to chord and length to chord below which these constants could not be used to compute the natural frequencies were also found experimentally.

COMPRESSORS - STRESS AND VIBRATION↗

V803 Aquilae: A newborn W Ursae Majoris Siamese twin?

A complete photometric analysis of BVRI photometry of the physically compact, eclipsing binary V803 Aquilae is presented. Six mean epochs of minimum light were determined from observations covering three primary and three secondary eclipses. A period study covering 54 years of observation or nearly 77,000 orbital revolutions reveals three distinct eras of constant period with two major period jumps of +0.1 s and -0.3 s. The light curves shows that the primary and secondary eclipse depths are identical in V, and are nearly identical in B, R, and I, indicating that the components have nearly the same temperatures. Standard magnitudes were determined and a reddening estimate was made. A simultaneous solution of the four light curves was computed using the Wilson-Devinney synthetic light-curve code. The solution indicates that the system consists of twin approximately K4 stars in shallow contact with a fill-out of approximately 8%. A mass ratio of 1.000 was computed with a negligible temperature difference of only 6 K. Thus, based on our purely photometric solution, V803 Aql is made up of 'Siamese' (contact) twin components. Theory would indicate that the twins have just recently come into contact, and the lack of other equal-mass W Ursae Majoris systems would indicate that it is in a very transient or unusual state.

Samec, Ronald G.↗

Stochastic Reduced Order Models with Python (SROMPy)

Stochastic Reduced Order Models with Python (SROMPy) is a software package developed to enable user-friendly utilization of the stochastic reduced order model (SROM) approach for uncertainty quantification. A SROM is a low dimensional, discrete approximation to a random quantity that enables efficient and non-intrusive stochastic computations. With SROMPy, a user can easily generate a SROM to approximate a random variable or vector described by several different types of probability distributions using the Python programming language. Once a SROM is constructed, the software can be used to propagate uncertainty through a user-defined computational model to estimate statistics of a given quantity of interest. This report is meant to introduce the SROMPy module and brie y demonstrate its capabilities. A simple example of a spring-mass system with a random input is included to illustrate the practicality of the SROM approach to uncertainty quantification and relative ease of applying it with SROMPy. The example includes a comparison with a solution obtained using classical Monte Carlo simulation, demonstrating the similarities and advantages of using the SROM approach.

Warner, James E.↗

Computational modelling of Er(3+): Garnet laser materials

The Er(3+) ion has attracted a lot of interest for four reasons: (1) Its (4)I(sub 13/2) yields (4)I(sub 15/2) transition lases in the eyesafe region near 1.5 micron; (2) the (4)I(sub 13/2) transition lases near 2.8 micron, an important wavelength for surgical purposes; (3) it displays surprisingly efficient upconversion with lasing observed at 1.7, 1.2, 0.85, 0.56, 0.55, and 0.47 micron following 1.5 micron pumping; and (4) it has absorption bands at 0.96 and 0.81 micron and thus can be diode pumped. However, properties desirable for upconversion reduce the efficiency of 1.5 and 3 micron laser operation and vice versa. Since all of the processes are influenced by the host via the crystal field induced stark splittings in the Er levels, this project undertook modelling of the host influence on the Er lasinng behavior. While growth and measurement of all ten Er(3+) doped garnets is the surest way of identifying hosts which maximize upconversion (or conversly, 1.5 and 3 micron performance), it is also expensive - costing approximately $10,000/material or approximately $100,000 for the materials computationally investigated here. The calculations were performed using a quantum mechanical point charge model developed by Clyde Morrison at Harry Diamond Laboratories. The programs were used to fit the Er:YAG experimental energy levels so that the crystal field parameters, B(sub nm) could be extracted. From these radial factors, rho (sub n) were determined for Er(3+) in garnets. These, in combination with crystal field components, Anm, available from X-ray data, were used to predict energy levels for Er in the other nine garnet hosts. The levels in Er:YAG were fit with an rms error of 12.2/cm over a 22,000/cm range. Predicted levels for two other garnets for which literature values were available had rms errors of less than 17/cm , showing the calculations to be reliable. Based on resonances between pairs of calculated stark levels, the model predicts GSGG as the best host for 1.5 micron laser operation, GSGG or YSAG as the best host for a 2.8 micron operation, and LuGG as the best host for an upconversion material.

Spangler, Lee H.↗

Sonic-box method employing local Mach number for oscillating wings with thickness

A computer program was developed to account approximately for the effects of finite wing thickness in the transonic potential flow over an oscillating wing of finite span. The program is based on the original sonic-box program for planar wing which was previously extended to include the effects of the swept trailing edge and the thickness of the wing. Account for the nonuniform flow caused by finite thickness is made by application of the local linearization concept. The thickness effect, expressed in terms of the local Mach number, is included in the basic solution to replace the coordinate transformation method used in the earlier work. Calculations were made for a delta wing and a rectangular wing performing plunge and pitch oscillations, and the results were compared with those obtained from other methods. An input quide and a complete listing of the computer code are presented.

Ruo, S. Y.↗

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST- CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O ̃(n1/4) rounds of communication and O ̃(n9/4) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms, as well as related classical algorithms, revealing that advances are needed to render both practical.

quantum computing↗

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees​

We present two algorithms in the Quantum CONGEST- CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O ̃(n 1/4 ) rounds of communication and O ̃(n 9/4 ) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms, as well as related classical algorithms, revealing that advances are needed to render both practical.

quantum computing↗

Monte-Carlo methods make Dempster-Shafer formalism feasible

One of the main obstacles to the applications of Dempster-Shafer formalism is its computational complexity. If we combine m different pieces of knowledge, then in general case we have to perform up to 2(sup m) computational steps, which for large m is infeasible. For several important cases algorithms with smaller running time were proposed. We prove, however, that if we want to compute the belief bel(Q) in any given query Q, then exponential time is inevitable. It is still inevitable, if we want to compute bel(Q) with given precision epsilon. This restriction corresponds to the natural idea that since initial masses are known only approximately, there is no sense in trying to compute bel(Q) precisely. A further idea is that there is always some doubt in the whole knowledge, so there is always a probability p(sub o) that the expert's knowledge is wrong. In view of that it is sufficient to have an algorithm that gives a correct answer a probability greater than 1-p(sub o). If we use the original Dempster's combination rule, this possibility diminishes the running time, but still leaves the problem infeasible in the general case. We show that for the alternative combination rules proposed by Smets and Yager feasible methods exist. We also show how these methods can be parallelized, and what parallelization model fits this problem best.

Kreinovich, Vladik YA.↗

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact spanning arborescence of minimum weight, the analog of a Minimum Spanning Tree in a directed graph, each of which uses O~(n^(1/4)) rounds of communication and O~(n^(9/4)) messages, achieving a lower round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. The CONGEST distributed computational model allows limited-sized messages to be transmitted within a network described by a communication graph of size n in a series of rounds to address a computational problem. The size limitation for such messages isO(log(n)) bits at each edge of the communication graph per round. The communication graph in the CONGEST-CLIQUE model is fully connected. In the Quantum CONGEST-CLIQUE model, at most O(log(n)) classical and quantum bits (qubits) can be communicated across each edge of the communication graph per round. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. These speedups further contribute to understanding what problems can be solved more efficiently when we allow quantum communication in this CONGEST-CLIQUE model of distributed computation.

quantum distributed algorithms↗

On the accuracy of the 'decoupled l-dominant' approximation for atom-molecule scattering

Cross sections for rotational excitation and spectral pressure broadening of HD, HCl, CO, and HCN due to collisions with low energy He atoms have been computed within the 'decoupled l-dominant' (DLD) approximation and are compared with accurate close coupling results and also with two similar approximations, the effective potential of Rabitz and the coupled states of McGuire and Kouri. DLD predictions of state-to-state cross sections are rather good, being only slightly less accurate than coupled states results. DLD is far superior to either the coupled states or effective potential methods for pressure broadening calculations, although it may not be uniformly of the quantitative accuracy desirable for obtaining intermolecular potentials from experimental data.

Green, S.↗

A computer program for calculating the perfect gas inviscid flow field about blunt axisymmetric bodies at an angle of attack of 0 deg

A method for the rapid calculation of the inviscid shock layer about blunt axisymmetric bodies at an angle of attack of 0 deg has been developed. The procedure is of an inverse nature, that is, a shock wave is assumed and calculations proceed along rays normal to the shock. The solution is iterated until the given body is computed. The flow field solution procedure is programed at the Langley Research Center for the Control Data 6600 computer. The geometries specified in the program are sphores, ellipsoids, paraboloids, and hyperboloids which may conical afterbodies. The normal momentum equation is replaced with an approximate algebraic expression. This simplification significantly reduces machine computation time. Comparisons of the present results with shock shapes and surface pressure distributions obtained by the more exact methods indicate that the program provides reasonably accurate results for smooth bodies in axisymmetric flow. However, further research is required to establish the proper approximate form of the normal momentum equation for the two-dimensional case.

Zoby, E. V.↗

Laser-heated thruster

The development of computer codes for the thrust chamber of a rocket of which the propellant gas is heated by a CW laser beam was investigated. The following results are presented: (1) simplified models of laser heated thrusters for approximate parametric studies and performance mapping; (3) computer programs for thrust chamber design; and (3) shock tube experiment to measure absorption coefficients. Two thrust chamber design programs are outlined: (1) for seeded hydrogen, with both low temperature and high temperature seeds, which absorbs the laser radiation continuously, starting at the inlet gas temperature; and (2) for hydrogen seeded with cesium, in which a laser supported combustion wave stands near the gas inlet, and heats the gas up to a temperature at which the gas can absorb the laser energy.

Kemp, N. H.↗