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 523 records · Page 29

On the distribution of computation for sequential decoding using the stack algorithm

A method is developed for estimating the computational distribution for the stack algorithm for sequential decoding, that is, the probability that the computation required to decode the first branch of the tree is greater than or equal to N, for small N. The analysis relies heavily on the theory of multitype branching processes. A step in the analysis is the determination of the distribution of the minimum of the cumulative metrics along the transmitted path in the code tree. This is used to obtain the distribution of the number of computations made by the decoder in order to decode the first branch in the tree, and this random variable serves as an approximation of the average number of computations per decoded branch. At information rates below the cutoff rate, the calculated computational performance is virtually identical to that obtained by time-consuming simulations.

Johannesson, R.↗

IOS and ECS line coupling calculation for the CO-He system - Influence on the vibration-rotation band shapes

Line coupling coefficients resulting from rotational excitation of CO perturbed by He are computed within the infinite order sudden approximation (IOSA) and within the energy corrected sudden approximation (ECSA). The influence of this line coupling on the 1-0 CO-He vibration-rotation band shape is then computed for the case of weakly overlapping lines in the 292-78 K temperature range. The IOS and ECS results differ only at 78 K by a weak amount at high frequencies. Comparison with an additive superposition of Lorentzian lines shows strong modifications in the troughs between the lines. These calculated modifications are in excellent quantitative agreement with recent experimental data for all the temperatures considered. The applicability of previous approaches to CO-He system, based on either the strong collision model or exponential energy gap law, is also discussed.

Boissoles, J.↗

On Time Delay Margin Estimation for Adaptive Control and Optimal Control Modification

This paper presents methods for estimating time delay margin for adaptive control of input delay systems with almost linear structured uncertainty. The bounded linear stability analysis method seeks to represent an adaptive law by a locally bounded linear approximation within a small time window. The time delay margin of this input delay system represents a local stability measure and is computed analytically by three methods: Pade approximation, Lyapunov-Krasovskii method, and the matrix measure method. These methods are applied to the standard model-reference adaptive control, s-modification adaptive law, and optimal control modification adaptive law. The windowing analysis results in non-unique estimates of the time delay margin since it is dependent on the length of a time window and parameters which vary from one time window to the next. The optimal control modification adaptive law overcomes this limitation in that, as the adaptive gain tends to infinity and if the matched uncertainty is linear, then the closed-loop input delay system tends to a LTI system. A lower bound of the time delay margin of this system can then be estimated uniquely without the need for the windowing analysis. Simulation results demonstrates the feasibility of the bounded linear stability method for time delay margin estimation.

Nguyen, Nhan T.↗

The treatment of convected vortices in compressible potential flow

A method is described for incorporating line vortices into the three dimensional compressible potential flow equation. A modified Biot-Savart law is used to compute a vortical velocity field, which is added to the gradient of the potential to form a total velocity. A rapidly converging approximate factorization (AFZ) scheme is then used to compute a potential such that the modified potential flow equation as well as the appropriate boundary conditions, based on total velocity, are satisfied. As part of a coupled iteration procedure, the positions of the line vortices are computed so that they convect with the total flow. The method is used to compute the field due to a single line vortex convecting past a wing. This represents an approximation of the effect of a canard or other lifting surface ahead of the wing, which sheds a tip vortex. It is seen that the flow field is substantially modified by the passage of the vortex. Unlike Euler equation schemes, which are also used to compute these flows, the solutions exhibit no numerical diffusion: The convected vortices retain their initial upstream width. Euler solutions, on the other hand, involve a vorticity which is numerically convected in an Eulerian frame and, unless extensive adaptive grid refinement is used they result in vortices with spread as they convect. Also, the potential flow method requires approximately two orders of magnitude less computing time and much less computer storage than the Euler methods.

Steinhoff, J.↗

The Problem of Torsion in Prismatic Members of Circular Segmental Cross Section

The problem is solved by approximation, by setting up a function complying with the differential equation of the stress function, and determining the coefficients appearing in it in such a way that the boundary condition is fulfilled as nearly as possible. For the semicircle, for which the solution is known, the method yields very accurate values; the approximated stress distribution is in good agreement with the accurately computed distribution. Stress and strain measurements indicate that the approximate solution is in sufficiently exact agreement with reality for segmental cross sections.

Weigand, A.↗

Monte Carlo turbulence simulation using rational approximations to von Karman spectra

Turbulence simulation is computationally much simpler using rational spectra, but turbulence falls off as f exp -5/3 in frequency ranges of interest to aircraft response and as predicted by von Karman's model. Rational approximations to von Karman spectra should satisfy three requirements: (1) the rational spectra should provide a good approximation to the von Karman spectra in the frequency range of interest; (2) for stability, the resulting rational transfer function should have all its poles in the left half-plane; and (3) at high frequencies, the rational spectra must fall off as an integer power of frequency, and since the -2 power is closest to the -5/3 power, the rational approximation should roll off as the -2 power at high frequencies. Rational approximations to von Karman spectra that satisfy these three criteria are presented, along with spectra from simulated turbulence. Agreement between the spectra of the simulated turbulence and von Karman spectra is excellent.

Campbell, C. W.↗

Structural design utilizing updated, approximate sensitivity derivatives

A method to improve the computational efficiency of structural optimization algorithms is investigated. In this method, the calculations of 'exact' sensitivity derivatives of constraint functions are performed only at selected iterations during the optimization process. The sensitivity derivatives utilized within other iterations are approximate derivatives which are calculated using an inexpensive derivative update formula. Optimization results are presented for an analytic optimization problem (i.e., one having simple polynomial expressions for the objective and constraint functions) and for two structural optimization problems. The structural optimization results indicate that up to a factor of three improvement in computation time is possible when using the updated sensitivity derivatives.

Scotti, Stephen J.↗

Solar heating in the Mars dusty atmosphere

The complex refractive index in the solar spectral region is estimated. With this index and the size distribution estimated from the UVS data Mie theory is used to compute the radiative parameters required for including radiative scattering in simplified radiative transfer approximations. These approximations then enable the wavelength-integrated solar heating to be computed for various dust-laden Martian atmospheres. The calculations presented in the main body of the paper were computer using the delta-Eddington approximation.

Zurek, R. W.↗

Matrix Analysis of Longitudinal and Torsional Vibrations in Nonuniform Multibranch Beams

Since longitudinal modes and frequencies provide basic data for dynamic analyses of arbitrary beam-like structures and since closed-form solutions for the modes are generally not feasible to obtain, an approximate method is developed for computing the natural frequencies and the corresponding mode shapes for a variable-section, unconstrained multibranch beam. A lumped mass analogy employing influence coefficients is used to represent the beam. The simultaneous equations of motion for the lumped mass system are derived in matrix form and algebraically manipulated to yield a classical eigenvalue equation solvable by standard procedures. The orthogonality relationship of the natural modes is derived and used to form the basis of an orthogonal sweeping process for determination of modes above the fundamental. Numerical examples including an application to a solid-fuel launch system are presented. Also, a detailed discussion is devoted to the theoretical verifications of the approximate modes and frequencies.

Wingate, Robert T.↗

A simple formulation of the delta-four-stream approximation for radiative transfer parameterizations

A systematic development of the delta-four-stream approximation for calculations of radiative fluxes in planetary atmosphere is presented. It is shown that an analytic solution for this approximation can be derived explicitly, with minimum computational effort for flux calculations. Relative accuracy checks for reflection, transmission, and absorption for numerous asymmetry factors, single-scattering albedos, optical depths, and solar zenith angles have been performed with respect to the 'exact' results computed from the adding method for radiative transfer. Overall, results from the delta-four-stream approximation yield relative accuracies within about 5 percent. This approximation is well suited to radiative transfer parameterizations involving flux and heating calculations in aerosol and cloudy atmospheres.

Liou, Kuo-Nan↗

Density measurements in an expanding flow using holographic interferometry

A nonequilibrium expansion of nitrogen through a 2-dimensional nozzle of a reflected shock tunnel is investigated with laser holography, time resolved pressure measurements and emission spectroscopy to characterize the flow field for vibrational relaxation measurements. A 2D computation is used to simulate the nozzle flow field. Synthetic holograms are generated using the computed density profiles and are compared with the experimental holograms. Also, using a quasi 1-D approximation, populations for each vibrational level are computed by (1) solving the master equations and (2) using the Landau-Teller formulation. Computational accuracy of both models is assessed against the experimental data.

Sharma, Surendra P.↗

A Simple Physical Optics Algorithm Perfect for Parallel Computing Architecture

A reflector antenna computer program based upon a simple discreet approximation of the radiation integral has proven to be extremely easy to adapt to the parallel computing architecture of the modest number of large-gain computing elements such as are used in the Intel iPSC and Touchstone Delta parallel machines.

reflector antenna Intel iPSC Touchstone Delta↗

Approximations for Quantitative Feedback Theory Designs

The computational requirements for obtaining the results summarized in the preceding section were very modest and were easily accomplished using computer-aided control system design software. Of special significance is the ability of the PDT to indicate a loop closure sequence for MIMO QFT designs that employ sequential loop closure. Although discussed as part of a 2 x 2 design, the PDT is obviously applicable to designs with a greater number of inputs and system responses.

Henderson, D. K.↗

Structural Reliability Analysis and Optimization: Use of Approximations

This report is intended for the demonstration of function approximation concepts and their applicability in reliability analysis and design. Particularly, approximations in the calculation of the safety index, failure probability and structural optimization (modification of design variables) are developed. With this scope in mind, extensive details on probability theory are avoided. Definitions relevant to the stated objectives have been taken from standard text books. The idea of function approximations is to minimize the repetitive use of computationally intensive calculations by replacing them with simpler closed-form equations, which could be nonlinear. Typically, the approximations provide good accuracy around the points where they are constructed, and they need to be periodically updated to extend their utility. There are approximations in calculating the failure probability of a limit state function. The first one, which is most commonly discussed, is how the limit state is approximated at the design point. Most of the time this could be a first-order Taylor series expansion, also known as the First Order Reliability Method (FORM), or a second-order Taylor series expansion (paraboloid), also known as the Second Order Reliability Method (SORM). From the computational procedure point of view, this step comes after the design point identification; however, the order of approximation for the probability of failure calculation is discussed first, and it is denoted by either FORM or SORM. The other approximation of interest is how the design point, or the most probable failure point (MPP), is identified. For iteratively finding this point, again the limit state is approximated. The accuracy and efficiency of the approximations make the search process quite practical for analysis intensive approaches such as the finite element methods; therefore, the crux of this research is to develop excellent approximations for MPP identification and also different approximations including the higher-order reliability methods (HORM) for representing the failure surface. This report is divided into several parts to emphasize different segments of the structural reliability analysis and design. Broadly, it consists of mathematical foundations, methods and applications. Chapter I discusses the fundamental definitions of the probability theory, which are mostly available in standard text books. Probability density function descriptions relevant to this work are addressed. In Chapter 2, the concept and utility of function approximation are discussed for a general application in engineering analysis. Various forms of function representations and the latest developments in nonlinear adaptive approximations are presented with comparison studies. Research work accomplished in reliability analysis is presented in Chapter 3. First, the definition of safety index and most probable point of failure are introduced. Efficient ways of computing the safety index with a fewer number of iterations is emphasized. In chapter 4, the probability of failure prediction is presented using first-order, second-order and higher-order methods. System reliability methods are discussed in chapter 5. Chapter 6 presents optimization techniques for the modification and redistribution of structural sizes for improving the structural reliability. The report also contains several appendices on probability parameters.

Grandhi, Ramana V.↗

Improved sonic-box computer program for calculating transonic aerodynamic loads on oscillating wings with thickness

A computer program was developed to account approximately for the effects of finite wing thickness in transonic potential flow over an oscillation wing of finite span. The program is based on the original sonic box computer program for planar wing which was extended to account for the effect of wing thickness. Computational efficiency and accuracy were improved and swept trailing edges were accounted for. Account for the nonuniform flow caused by finite thickness was made by application of the local linearization concept with appropriate coordinate transformation. A brief description of each computer routine and the applications of cubic spline and spline surface data fitting techniques used in the program are given, and the method of input was shown in detail. Sample calculations as well as a complete listing of the computer program listing are presented.

Ruo, S. Y.↗

Estimation of time- and state-dependent delays and other parameters in functional differential equations

A parameter estimation algorithm is developed which can be used to estimate unknown time- or state-dependent delays and other parameters (e.g., initial condition) appearing within a nonlinear nonautonomous functional differential equation. The original infinite dimensional differential equation is approximated using linear splines, which are allowed to move with the variable delay. The variable delays are approximated using linear splines as well. The approximation scheme produces a system of ordinary differential equations with nice computational properties. The unknown parameters are estimated within the approximating systems by minimizing a least-squares fit-to-data criterion. Convergence theorems are proved for time-dependent delays and state-dependent delays within two classes, which say essentially that fitting the data by using approximations will, in the limit, provide a fit to the data using the original system. Numerical test examples are presented which illustrate the method for all types of delay.

Murphy, K. A.↗

Estimation of time- and state-dependent delays and other parameters in functional differential equations

A parameter estimation algorithm is developed which can be used to estimate unknown time- or state-dependent delays and other parameters (e.g., initial condition) appearing within a nonlinear nonautonomous functional differential equation. The original infinite dimensional differential equation is approximated using linear splines, which are allowed to move with the variable delay. The variable delays are approximated using linear splines as well. The approximation scheme produces a system of ordinary differential equations with nice computational properties. The unknown parameters are estimated within the approximating systems by minimizing a least-squares fit-to-data criterion. Convergence theorems are proved for time-dependent delays and state-dependent delays within two classes, which say essentially that fitting the data by using approximations will, in the limit, provide a fit to the data using the original system. Numerical test examples are presented which illustrate the method for all types of delay.

Murphy, K. A.↗

Partitioning of unstructured problems for parallel processing

Many large-scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. The question of how to distribute such unstructured computational domains over a large number of processors in a MIMD machine with distributed memory is addressed. A graph theoretical framework for these problems is established. Based on this framework three decomposition algorithms are introduced. In particular a new decomposition algorithm is discussed, which is based on the computation of an eigenvector of the Laplacian matrix associated with the graph. Numerical comparisons on large-scale two- and three-dimensional problems demonstrate the superiority of the new spectral bisection algorithm.

Simon, H. D.↗