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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1978

An approximate inviscid radiating flow field analysis for outer planet entry probes

An approximate computational technique has been developed for predicting inviscid, radiating flows about blunt probes entering atmospheres consisting of hydrogen and helium. The technique is rapid and versatile and is well suited for performing parametric trade studies for outer planet entries. Details of the computational technique, the thermodynamic correlations, the 58-step absorption coefficient model and the analytic shock shape equations are discussed. Good comparisons of the radiative heating computed by the approximate method and by detailed calculations are obtained.

Zoby, E. V.↗
NASA NTRS1979

Accuracy of RGD approximation for computing light scattering properties of diffusing and motile bacteria

The study tests the accuracy of the Rayleigh-Gans-Debye (RGD) approximation against a rigorous scattering theory calculation for a simplified model of E. coli (about 1 micron in size) - a solid spheroid. A general procedure is formulated whereby the scattered field amplitude correlation function, for both polarized and depolarized contributions, can be computed for a collection of particles. An explicit formula is presented for the scattered intensity, both polarized and depolarized, for a collection of randomly diffusing or moving particles. Two specific cases for the intermediate scattering functions are considered: diffusing particles and freely moving particles with a Maxwellian speed distribution. The formalism is applied to microorganisms suspended in a liquid medium. Sensitivity studies revealed that for values of the relative index of refraction greater than 1.03, RGD could be in serious error in computing the intensity as well as correlation functions.

Kottarchyk, M.↗
NASA NTRS1993

Analysis, approximation, and computation of a coupled solid/fluid temperature control problem

An optimization problem is formulated motivated by the desire to remove temperature peaks, i.e., 'hot spots', along the bounding surfaces of containers of fluid flows. The heat equation of the solid container is coupled to the energy equations for the fluid. Heat sources can be located in the solid body, the fluid, or both. Control is effected by adjustments to the temperature of the fluid at the inflow boundary. Both mathematical analyses and computational experiments are given.

Gunzburger, Max D.↗
NASA NTRS1981

An approximate solution to improve computational efficiency of impedance-type payload load prediction

The computational efficiency of the impedance type loads prediction method was studied. Three goals were addressed: devise a method to make the impedance method operate more efficiently in the computer; assess the accuracy and convenience of the method for determining the effect of design changes; and investigate the use of the method to identify design changes for reduction of payload loads. The method is suitable for calculation of dynamic response in either the frequency or time domain. It is concluded that: the choice of an orthogonal coordinate system will allow the impedance method to operate more efficiently in the computer; the approximate mode impedance technique is adequate for determining the effect of design changes, and is applicable for both statically determinate and statically indeterminate payload attachments; and beneficial design changes to reduce payload loads can be identified by the combined application of impedance techniques and energy distribution review techniques.

White, C. W.↗
NASA NTRS1974

A computational procedure to analyze metal matrix laminates with nonlinear lamination residual strains

An approximate computational procedure is described for the analysis of angleplied laminates with residual nonlinear strains. The procedure consists of a combination of linear composite mechanics and incremental linear laminate theory. The procedure accounts for initial nonlinear strains, unloading, and in-situ matrix orthotropic nonlinear behavior. The results obtained in applying the procedure to boron/aluminum angleplied laminates show that this is a convenient means to accurately predict the initial tangent properties of angleplied laminates in which the matrix has been strained nonlinearly by the lamination residual stresses. The procedure predicted initial tangent properties results which were in good agreement with measured data obtained from boron/aluminum angleplied laminates.

Chamis, C. C.↗
NASA NTRS1974

A computational procedure to analyze metal matrix laminates with nonlinear lamination residual strains

An approximate computational procedure is described for the analysis of angleplied laminates with residual nonlinear strains. The procedure consists of a combination of linear composite mechanics and incremental linear laminate theory. The procedure accounts for initial nonlinear strains, unloading, and in-situ matrix orthrotropic nonlinear behavior. The results obtained in applying the procedure to boron/aluminum angleplied laminates show that this is a convenient means to accurately predict the initial tangent properties of angleplied laminates in which the matrix has been strained nonlinearly by the lamination residual stresses. The procedure predicted initial tangent properties results which were in good agreement with measured data obtained from boron/aluminum angleplied laminates.

Chamis, C. C.↗
NASA NTRS1978

On least squares approximations to indefinite problems of the mixed type

A least squares method is presented for computing approximate solutions of indefinite partial differential equations of the mixed type such as those that arise in connection with transonic flutter analysis. The method retains the advantages of finite difference schemes namely simplicity and sparsity of the resulting matrix system. However, it offers some great advantages over finite difference schemes. First, the method is insensitive to the value of the forcing frequency, i.e., the resulting matrix system is always symmetric and positive definite. As a result, iterative methods may be successfully employed to solve the matrix system, thus taking full advantage of the sparsity. Furthermore, the method is insensitive to the type of the partial differential equation, i.e., the computational algorithm is the same in elliptic and hyperbolic regions. In this work the method is formulated and numerical results for model problems are presented. Some theoretical aspects of least squares approximations are also discussed.

Fix, G. J.↗
NASA NTRS1986

Approximate Cartesian state transition matrix

Based on a Taylor series expansion, an easily-computed approximation to the Cartesian state transition matrix is presented for a general velocity-independent force field. Suitable for the short time intervals encountered in onboard navigation applications of the extended Kalman filter, it provides approximately five decimal digits of accuracy for earth orbiting spacecraft with update intervals of one minute, and better accuracy for shorter intervals.

Markley, F. L.↗
NASA NTRS1995

Assimilation of TOPEX Sea Level Measurements with a Reduced-Gravity, Shallow Water Model of the Tropical Pacific Ocean

Sea surface height variability measured by TOPEX is analyzed in the tropical Pacific Ocean by way of assimilation into a wind-driven, reduced-gravity, shallow water model using an approximate Kalman filter and smoother. The analysis results in an optimal fit of the dynamic model to the observations, providing it dynamically consistent interpolation of sea level and estimation of the circulation. Nearly 80% of the expected signal variance is accounted for by the model within 20 deg of the equator, and estimation uncertainty is substantially reduced by the voluminous observation. Notable features resolved by the analysis include seasonal changes associated with the North Equatorial Countercurrent and equatorial Kelvin and Rossby waves. Significant discrepancies are also found between the estimate and TOPEX measurements, especially near the eastern boundary. Improvements in the estimate made by the assimilation are validated by comparisons with independent tide gauge and current meter observations. The employed filter and smoother are based on approximately computed estimation error covariance matrices, utilizing a spatial transformation and an symptotic approximation. The analysis demonstrates the practical utility of a quasi-optimal filter and smoother.

Fukumori, Ichiro↗
NASA NTRS1981

Transport of infrared radiation in cuboidal clouds

The transport of infrared radiation in a single cuboidal cloud is modeled using a variable azimuth two-stream approximation. Computations are made at 10 microns for a Deirmendjian (1969) C-1 water cloud where the single scattering albedo is equal to 0.638 and the asymmetry parameter is 0.865. The results indicate that the emittance of the top face of the model cloud is always less than that for a plane parallel cloud of the same optical depth. The hemispheric flux escaping from the cloud top possesses a gradient from the center to the edges which are warmer when the cloud is over warmer ground. Cooling rate calculations in the 8-13.6 micron region demonstrate that there is cooling out of the sides of the cloud at all levels even when there is heating of the core from the ground below. The radiances exiting from model cuboidal clouds are computed by path integration over the source function obtained with the two-stream approximation. Results indicate that the brightness temperature measured from finite clouds will overestimate the cloud-top temperature.

Harshvardhan, MR.↗
NASA NTRS2010

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Mengshoel, Ole J.↗
NASA NTRS1993

Projection techniques for iterative solution of A(bar x) equals (bar b) with successive right-hand sides

Two projection techniques for computing approximate solutions to linear systems of the form A(bar x)(sup n) = (bar b)(sup n), for a sequence n = 1, 2, ..., e.g., such as arises from time discretization of a partial differential equation, are presented. The inexpensive approximate solutions can be used as initial guesses for iterative solution of the system, resulting in significantly reduced computational expense. Examples of two- and three-dimensional incompressible Navier-Stokes calculations are presented in which x represents the pressure, and A is a discrete Poisson operator. In flows containing significant dynamic activity, these projection techniques lead to as much as a two-fold reduction in solution time.

Fischer, Paul F.↗
NASA NTRS1978

Ball bearing heat analysis program (BABHAP)

The Ball Bearing Heat Analysis Program (BABHAP) is an attempt to assemble a series of equations, some of which are non-linear algebraic systems, in a logical order, which when solved, provide a complex analysis of load distribution among the balls, ball velocities, heat generation resulting from friction, applied load, and ball spinning, minimum lubricant film thickness, and many additional characteristics of ball bearing systems. Although initial design requirements for BABHAP were dictated by the core limitations of the PDP 11/45 computer, (approximately 8K of real words with limited number of instructions) the program dimensions can easily be expanded for large core computers such as the UNIVAC 1108. The PDP version of BABHAP is also operational on the UNIVAC system with the exception that the PDP uses 029 punch and the UNIVAC uses 026. A conversion program was written to allow transfer between machines.

Source record↗
NASA NTRS1998

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and weighted links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Weights are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.↗
NASA NTRS1996

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and directed links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Reliability values are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.↗