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,135 records · Page 63

Thermophysics Characterization of Multiply Ionized Air Plasma Absorption of Laser Radiation

The impact of multiple ionization of air plasma on the inverse Bremsstrahlung absorption of laser radiation is investigated for air breathing laser propulsion. Thermochemical properties of multiply ionized air plasma species are computed for temperatures up to 200,000 deg K, using hydrogenic approximation of the electronic partition function; And those for neutral air molecules are also updated for temperatures up to 50,000 deg K, using available literature data. Three formulas for absorption are calculated and a general formula is recommended for multiple ionization absorption calculation. The plasma composition required for absorption calculation is obtained by increasing the degree of ionization sequentially, up to quadruple ionization, with a series of thermal equilibrium computations. The calculated second ionization absorption coefficient agrees reasonably well with that of available data. The importance of multiple ionization modeling is demonstrated with the finding that area under the quadruple ionization curve of absorption is found to be twice that of single ionization. The effort of this work is beneficial to the computational plasma aerodynamics modeling of laser lightcraft performance.

Wang, Ten-See↗

Calculation of the binomial survivor function

A method is presented for calculating the binomial SF (cumulative binomial distribution), binfc(k;p,n), especially for a large n, beyond the range of existing tables, where conventional computer programs fail because of underflow and overflow, and Gaussian or Poisson approximations yield insufficient accuracy for the purpose at hand. This method is used to calculate and sum the individual binomial terms while using multiplication factors to avoid underflow; the factors are then divided out of the partial sum whenever it has the potential to overflow. A computer program uses this technique to calculate the binomial SF for arbitrary inputs of k, p, and n. Two other algorithms are presented to determine the value of p needed to yield a specified SF for given values of k and n and calculate the value where p = SF for a given k and n. Reliability applications of each algorithm/program are given, e.g., the value of p needed to achieve a stated k-out-of-n:G system reliability and the value of p for which k-out-of-n:G system reliability equals p.

Bowerman, Paul N.↗

Implicit method for the computation of unsteady flows on unstructured grids

An implicit method for the computation of unsteady flows on unstructured grids is presented. Following a finite difference approximation for the time derivative, the resulting nonlinear system of equations is solved at each time step by using an agglomeration multigrid procedure. The method allows for arbitrarily large time steps and is efficient in terms of computational effort and storage. Inviscid and viscous unsteady flows are computed to validate the procedure. The issue of the mass matrix which arises with vertex-centered finite volume schemes is addressed. The present formulation allows the mass matrix to be inverted indirectly. A mesh point movement and reconnection procedure is described that allows the grids to evolve with the motion of bodies. As an example of flow over bodies in relative motion, flow over a multi-element airfoil system undergoing deployment is computed.

Venkatakrishnan, V.↗

Exploiting symmetries in the modeling and analysis of tires

A computational procedure is presented for reducing the size of the analysis models of tires having unsymmetric material, geometry and/or loading. The two key elements of the procedure when applied to anisotropic tires are: (1) decomposition of the stiffness matrix into the sum of an orthotropic and nonorthotropic parts; and (2) successive application of the finite-element method and the classical Rayleigh-Ritz technique. The finite-element method is first used to generate few global approximation vectors (or modes). Then the amplitudes of these modes are computed by using the Rayleigh-Ritz technique. The proposed technique has high potential for handling practical tire problems with anisotropic materials, unsymmetric imperfections and asymmetric loading. It is also particularly useful for use with three-dimensional finite-element models of tires.

Noor, Ahmed K.↗

Numerical simulation of unsteady flow in a hypersonic shock tunnel facility

This paper describes the computational work performed on the simulation of a 16-in shock-tunnel facility. The numerical problems encountered during the computation of these flows are discussed along with the validity of some approximations used, notably concerning the reduction of the problem into problems of smaller dimensionality. Quasi-1D simulations can be used to help design experiments, or to better understanding the characteristics of the facility. An application to the design of a nonintrusive diagnostic is shown. The multidimensional flow transients computed include the shock reflection at the end of the driven tube, the shock propagation down the nozzle, and the breaking of the main diaphragm.

Cambier, Jean-Luc↗

Design optimization of transonic airfoils

Numerical optimization procedures were considered for the design of airfoils in transonic flow based on the transonic small disturbance (TSD) and Euler equations. A sequential approximation optimization technique was implemented with an accurate approximation of the wave drag based on the Nixon's coordinate straining approach. A modification of the Euler surface boundary conditions was implemented in order to efficiently compute design sensitivities without remeshing the grid. Two effective design procedures producing converged designs in approximately 10 global iterations were developed: interchanging the role of the objective function and constraint and the direct lift maximization with move limits which were fixed absolute values of the design variables.

Joh, C.-Y.↗

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.↗

Implementing direct, spatially isolated problems on transputer networks

Parametric studies were performed on transputer networks of up to 40 processors to determine how to implement and maximize the performance of the solution of problems where no processor-to-processor data transfer is required for the problem solution (spatially isolated). Two types of problems are investigated a computationally intensive problem where the solution required the transmission of 160 bytes of data through the parallel network, and a communication intensive example that required the transmission of 3 Mbytes of data through the network. This data consists of solutions being sent back to the host processor and not intermediate results for another processor to work on. Studies were performed on both integer and floating-point transputers. The latter features an on-chip floating-point math unit and offers approximately an order of magnitude performance increase over the integer transputer on real valued computations. The results indicate that a minimum amount of work is required on each node per communication to achieve high network speedups (efficiencies). The floating-point processor requires approximately an order of magnitude more work per communication than the integer processor because of the floating-point unit's increased computing capacity.

Ellis, Graham K.↗

Improved curve fits for the thermodynamic properties of equilibrium air suitable for numerical computation using time-dependent or shock-capturing methods, part 1

Simplified curve fits for the thermodynamic properties of equilibrium air were devised for use in either the time-dependent or shock-capturing computational methods. For the time-dependent method, curve fits were developed for p = p(e, rho), a = a(e, rho), and T = T(e, rho). For the shock-capturing method, curve fits were developed for h = h(p, rho) and T = T(p, rho). The ranges of validity for these curves fits were for temperatures up to 25,000 K and densities from 10 to the minus 7th power to 10 to the 3d power amagats. These approximate curve fits are considered particularly useful when employed on advanced computers such as the Burroughs ILLIAC 4 or the CDC STAR.

Tannehill, J. C.↗

A computer program for estimation from incomplete multinomial data

Coding is given for maximum likelihood and Bayesian estimation of the vector p of multinomial cell probabilities from incomplete data. Also included is coding to calculate and approximate elements of the posterior mean and covariance matrices. The program is written in FORTRAN 4 language for the Control Data CYBER 170 series digital computer system with network operating system (NOS) 1.1. The program requires approximately 44000 octal locations of core storage. A typical case requires from 72 seconds to 92 seconds on CYBER 175 depending on the value of the prior parameter.

Credeur, K. R.↗

Accurate computation and continuation of homoclinic and heteroclinic orbits for singular perturbation problems

In earlier papers, Doedel and the authors have developed a numerical method and derived error estimates for the computation of branches of heteroclinic orbits for a system of autonomous ordinary differential equations in R(exp n). The idea of the method is to reduce a boundary value problem on the real line to a boundary value problem on a finite interval by using a local (linear or higher order) approximation of the stable and unstable manifolds. A practical limitation for the computation of homoclinic and heteroclinic orbits has been the difficulty in obtaining starting orbits. Typically these were obtained from a closed form solution or via a homotopy from a known solution. Here we consider extensions of our algorithm which allow us to obtain starting orbits on the continuation branch in a more systematic way as well as make the continuation algorithm more flexible. In applications, we use the continuation software package AUTO in combination with some initial value software. The examples considered include computation of homoclinic orbits in a singular perturbation problem and in a turbulent fluid boundary layer in the wall region problem.

Vaughan, William W.↗

Computing Bandwidths Of PCM/PSK/PM Signals

Analysis of spectral properties of class of pulse-code-modulated, phase-shift-keyed (PSK) radio signals shows one can obtain approximate, simple, closed-form equations for widths of frequency bands occupied by such signals. These equations reduce amount of computation and time needed to determine allocations of frequency and power among competing radio-communication systems or to determine whether two different radio-communication systems compatible.

Nguyen, Tien M.↗

Heats of Segregation of BCC Metals Using Ab Initio and Quantum Approximate Methods

Many multicomponent alloys exhibit surface segregation, in which the composition at or near a surface may be substantially different from that of the bulk. A number of phenomenological explanations for this tendency have been suggested, involving, among other things, differences among the components' surface energies, molar volumes, and heats of solution. From a theoretical standpoint, the complexity of the problem has precluded a simple, unified explanation, thus preventing the development of computational tools that would enable the identification of the driving mechanisms for segregation. In that context, we investigate the problem of surface segregation in a variety of bcc metal alloys by computing dilute-limit heats of segregation using both the quantum-approximate energy method of Bozzolo, Ferrante and Smith (BFS), and all-electron density functional theory. In addition, the composition dependence of the heats of segregation is investigated using a BFS-based Monte Carlo procedure, and, for selected cases of interest, density functional calculations. Results are discussed in the context of a simple picture that describes segregation behavior as the result of a competition between size mismatch and alloying effects

Good, Brian↗

Nonlinear Local Bending Response and Bulging Factors for Longitudinal Cracks in Pressurized Cylindrical Shells

Results of a geometrically nonlinear finite element parametric study to determine curvature correction factors or "bulging factors" that account for increased stresses due to curvature for longitudinal cracks in unstiffened pressurized cylindrical shells are presented. Geometric parameters varied in the study include the shell radius, the shell wall thickness, and the crack length. The major results are presented in graphs of the bulging factor as a function of the applied load and as a function of geometric parameters that include the shell radius, the shell thickness and the crack length. The computed bulging factors are compared with solutions based on linear shallow shell theory, and with semi-empirical solutions that approximately account for the nonlinear deformation in the vicinity of the crack. The effect of biaxial loads on the computed bulging factors is also discussed.

Rose, Cheryl A.↗

Accelerated Training for Large Feedforward Neural Networks

In this paper we introduce a new training algorithm, the scaled variable metric (SVM) method. Our approach attempts to increase the convergence rate of the modified variable metric method. It is also combined with the RBackprop algorithm, which computes the product of the matrix of second derivatives (Hessian) with an arbitrary vector. The RBackprop method allows us to avoid computationally expensive, direct line searches. In addition, it can be utilized in the new, 'predictive' updating technique of the inverse Hessian approximation. We have used directional slope testing to adjust the step size and found that this strategy works exceptionally well in conjunction with the Rbackprop algorithm. Some supplementary, but nevertheless important enhancements to the basic training scheme such as improved setting of a scaling factor for the variable metric update and computationally more efficient procedure for updating the inverse Hessian approximation are presented as well. We summarize by comparing the SVM method with four first- and second- order optimization algorithms including a very effective implementation of the Levenberg-Marquardt method. Our tests indicate promising computational speed gains of the new training technique, particularly for large feedforward networks, i.e., for problems where the training process may be the most laborious.

Stepniewski, Slawomir W.↗

Computation research

Least squares method used in linearizing roots of polynomial and to derive approximations

APPROXIMATION METHOD↗