Engineering PapersSearch

SEARCH · Engineering Papers

Results for “approximation”

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 55 records · Page 3

Complex angular momentum approximation to hard-core scattering

The complex angular momentum (CAM) approximation for nonrelativistic quantum scattering by a hard sphere - a union of the recently developed CAM uniform approximation with a semiclassical WKB-like approximation valid at large angles - is shown to be remarkably accurate over the complete range of scattering angles and down to size parameters (circumference to de Broglie wavelength ratios) of order unity. The best approximations previously derivable (Fock-type) cannot reach large scattering angles where semiclassical approximations are useful; even at angles where Fock-type approximations are valid, they are typically two or more orders of magnitude less accurate than CAM. The crucial new feature responsible for the high accuracy of the CAM approximation is the treatment of large-angle diffraction associated with (1) tunneling near the edge of the scatterer, and (2) anomalous reflection.

Nussenzveig, H. M.

Testing approximations for non-linear gravitational clustering

The accuracy of various analytic approximations for following the evolution of cosmological density fluctuations into the nonlinear regime is investigated. The Zel'dovich approximation is found to be consistently the best approximation scheme. It is extremely accurate for power spectra characterized by n = -1 or less; when the approximation is 'enhanced' by truncating highly nonlinear Fourier modes the approximation is excellent even for n = +1. The performance of linear theory is less spectrum-dependent, but this approximation is less accurate than the Zel'dovich one for all cases because of the failure to treat dynamics. The lognormal approximation generally provides a very poor fit to the spatial pattern.

Coles, Peter

On the dynamics of approximating schemes for dissipative nonlinear equations

Since one can rarely write down the analytical solutions to nonlinear dissipative partial differential equations (PDE's), it is important to understand whether, and in what sense, the behavior of approximating schemes to these equations reflects the true dynamics of the original equations. Further, because standard error estimates between approximations of the true solutions coming from spectral methods - finite difference or finite element schemes, for example - and the exact solutions grow exponentially in time, this analysis provides little value in understanding the infinite time behavior of a given approximating scheme. The notion of the global attractor has been useful in quantifying the infinite time behavior of dissipative PDEs, such as the Navier-Stokes equations. Loosely speaking, the global attractor is all that remains of a sufficiently large bounded set in phase space mapped infinitely forward in time under the evolution of the PDE. Though the attractor has been shown to have some nice properties - it is compact, connected, and finite dimensional, for example - it is in general quite complicated. Nevertheless, the global attractor gives a way to understand how the infinite time behavior of approximating schemes such as the ones coming from a finite difference, finite element, or spectral method relates to that of the original PDE. Indeed, one can often show that such approximations also have a global attractor. We therefore only need to understand how the structure of the attractor for the PDE behaves under approximation. This is by no means a trivial task. Several interesting results have been obtained in this direction. However, we will not go into the details. We mention here that approximations generally lose information about the system no matter how accurate they are. There are examples that show certain parts of the attractor may be lost by arbitrary small perturbations of the original equations.

Jones, Donald A.

A test of the adhesion approximation for gravitational clustering

We quantitatively compare a particle implementation of the adhesion approximation to fully non-linear, numerical 'N-body' simulations. Our primary tool, cross-correlation of N-body simulations with the adhesion approximation, indicates good agreement, better than that found by the same test performed with the Zel-dovich approximation (hereafter ZA). However, the cross-correlation is not as good as that of the truncated Zel-dovich approximation (TZA), obtained by applying the Zel'dovich approximation after smoothing the initial density field with a Gaussian filter. We confirm that the adhesion approximation produces an excessively filamentary distribution. Relative to the N-body results, we also find that: (a) the power spectrum obtained from the adhesion approximation is more accurate than that from ZA or TZA, (b) the error in the phase angle of Fourier components is worse than that from TZA, and (c) the mass distribution function is more accurate than that from ZA or TZA. It appears that adhesion performs well statistically, but that TZA is more accurate dynamically, in the sense of moving mass to the right place.

Melott, Adrian L.

HST images of very compact blue galaxies at z approximately 0.2

We present the results of Hubble Space Telescope (HST) Wide-Field Camera (WFC) imaging of seven very compact, very blue galaxies with B less than or equal to 21 and redshifts z approximately 0.1 to 0.35. Based on deconvolved images, we estimate typical half-light diameters of approximately 0.65 sec, corresponding to approximately 1.4 h(exp -1) kpc at redshifts z approximately 0.2. The average rest frame surface brightness within this diameter is mu(sub v) approximately 20.5 mag arcsec(exp -2), approximately 1 mag brighter than that of typical late-type blue galaxies. Ground-based spectra show strong, narrow emission lines indicating high ionization; their very blue colors suggest recent bursts of star-formation; their typical luminosities are approximately 4 times fainter than that of field galaxies. These characteristics suggest H II galaxies as likely local counterparts of our sample, though our most luminous targets appear to be unusually compact for their luminosities.

Koo, David C.

The Theta-z relation for HST bulges and disks out to z approximately equal 0.8

We present Hubble Space Telescope (HST) scale lengths and ground-based redshifts for 63 faint field galaxies down to I less than or approximately 21.5 mag from the Medium-Deep Survey. These have measured redshifts z less than or approximately 0.8 and half-light radii 0.1 sec less than or approximately r(sub e), r(sub s) less than or approximately 5 sec. We present the Theta-z relation for r(exp 1/4)-bulges and exponential disks separately for world models with q(sub 0) = 0.0-1.0. We show that selection against low surface brightness galaxies in the HST images and ground-based spectra is comparable to that in local surveys. We compare our HST disk-dominated galaxies to a magnitude-limited subsample of the European Southern Observatory (ESO)-Uppsala local spirals. Extrapolating the best-fit local exponential disk scale length (r(sub s) = 3.5 kpc for H(sub 0) = 75) out to z = 0.8, we find a rather symmetrical distribution of HST disks around this value. This implies that galaxy disks have been stable since z is approximately equal to 0.8. We compare our HST bulge-dominated galaxies with r(exp 1/4)-profiles to a magnitude-limited subsample of local Seven Samurai ellipticals. The latter have a local best fit r(sub e) = 5.7 kpc. Our HST bulge sample shows a similar distribution for z less than or approximately 0.8. Elliptical galaxy scale lengths have thus also remained rather constant since z less than or approximately 0.8. We set limits to their possible evolution.

Mutz, Steven B.

A test of the adhesion approximation for gravitational clustering

We quantitatively compare a particle implementation of the adhesion approximation to fully nonlinear, numerical 'N-body' simulations. Our primary tool, cross-correlation of N-body simulations with the adhesion approximation, indicates good agreement, better than that found by the same test performed with the Zel'dovich approximation (hereafter ZA). However, the cross-correlation is not as good as that of the truncated Zel'dovich approximation (TZA), obtained by applying the Zel'dovich approximation after smoothing the initial density field with a Gaussian filter. We confirm that the adhesion approximation produces an excessively filamentary distribution. Relative to the N-body results, we also find that: (a) the power spectrum obtained from the adhesion approximation is more accurate that that from ZA to TZA, (b) the error in the phase angle of Fourier components is worse that that from TZA, and (c) the mass distribution function is more accurate than that from ZA or TZA. It appears that adhesion performs well statistically, but that TZA is more accurate dynamically, in the sense of moving mass to the right place.

Melott, Adrian L.

Neural Network and Regression Approximations in High Speed Civil Transport Aircraft Design Optimization

Nonlinear mathematical-programming-based design optimization can be an elegant method. However, the calculations required to generate the merit function, constraints, and their gradients, which are frequently required, can make the process computational intensive. The computational burden can be greatly reduced by using approximating analyzers derived from an original analyzer utilizing neural networks and linear regression methods. The experience gained from using both of these approximation methods in the design optimization of a high speed civil transport aircraft is the subject of this paper. The Langley Research Center's Flight Optimization System was selected for the aircraft analysis. This software was exercised to generate a set of training data with which a neural network and a regression method were trained, thereby producing the two approximating analyzers. The derived analyzers were coupled to the Lewis Research Center's CometBoards test bed to provide the optimization capability. With the combined software, both approximation methods were examined for use in aircraft design optimization, and both performed satisfactorily. The CPU time for solution of the problem, which had been measured in hours, was reduced to minutes with the neural network approximation and to seconds with the regression method. Instability encountered in the aircraft analysis software at certain design points was also eliminated. On the other hand, there were costs and difficulties associated with training the approximating analyzers. The CPU time required to generate the input-output pairs and to train the approximating analyzers was seven times that required for solution of the problem.

Patniak, Surya N.

Comparison of the Radiative Two-Flux and Diffusion Approximations

Approximate solutions are sometimes used to determine the heat transfer and temperatures in a semitransparent material in which conduction and thermal radiation are acting. A comparison of the Milne-Eddington two-flux approximation and the diffusion approximation for combined conduction and radiation heat transfer in a ceramic material was preformed to determine the accuracy of the diffusion solution. A plane gray semitransparent layer without a substrate and a non-gray semitransparent plane layer on an opaque substrate were considered. For the plane gray layer the material is semitransparent for all wavelengths and the scattering and absorption coefficients do not vary with wavelength. For the non-gray plane layer the material is semitransparent with constant absorption and scattering coefficients up to a specified wavelength. At higher wavelengths the non-gray plane layer is assumed to be opaque. The layers are heated on one side and cooled on the other by diffuse radiation and convection. The scattering and absorption coefficients were varied. The error in the diffusion approximation compared to the Milne-Eddington two flux approximation was obtained as a function of scattering coefficient and absorption coefficient. The percent difference in interface temperatures and heat flux through the layer obtained using the Milne-Eddington two-flux and diffusion approximations are presented as a function of scattering coefficient and absorption coefficient. The largest errors occur for high scattering and low absorption except for the back surface temperature of the plane gray layer where the error is also larger at low scattering and low absorption. It is shown that the accuracy of the diffusion approximation can be improved for some scattering and absorption conditions if a reflectance obtained from a Kubelka-Munk type two flux theory is used instead of a reflection obtained from the Fresnel equation. The Kubelka-Munk reflectance accounts for surface reflection and radiation scattered back by internal scattering sites while the Fresnel reflection only accounts for surface reflections.

Spuckler, Charles M.

Evaluation of one-dimensional approximations for radiative transport in blunt body shock layers

One-dimensional approximations for the nongray radiative flux and flux divergence in radiating shock layers about a blunt entry body are compared with an exact three-dimensional treatment. A coupled radiative-gasdynamic analysis of the shock layer flow about the entire body provided the thermodynamic field used in these comparisons. In terms of calculating the total energy lost by the shock layer, the one-dimensional approximations to the radiative flux divergence are accurate to within a few percent. In terms of calculating the surface flux, the one-dimensional approximations introduce the largest errors of approximately 15 percent near the stagnation point. The source of these errors is the slab-like geometric representation of the shock layer inherent in all one-dimensional models. Finally, for both the radiative flux and its divergence, the tangent slab approximation provides more accurate results than differential approximation methods.

Wilson, K. H.

The selection of approximating functions for tabulated numerical data

A computer program was developed that selects, from a list of candidate functions, the approximating functions and associated coefficients which result in the best curve fit of a given set of numerical data. The advantages of the approach used here are: (1) Multivariable approximations can be performed. (2) Flexibility with respect to the type of approximations used is available. (3) The program is designed to choose the best terms to be used in the approximation from an arbitrary list of possible terms so that little knowledge of the proper approximating form is required. (4) Recursion relations are used in determining the coefficients of the approximating functions, which reduces the computer execution time of the program.

Ingram, H. L.

Comparison of some approximations for isotropic turbulence.

Study of several related turbulence approximations with regard to dynamical properties and agreement of numerical predictions with laboratory and computer experiments. The approximations considered include the direct-interaction equations (Kraichnan, 1964), Herring's (1966) self-consistent-field theory, a generalization of Edwards' (1964) theory, the abridged Lagrangian-history, direct-interaction approximation (Kraichnan, 1966), the test-field model (Kraichnan, 1971), and an approximation, not previously described, in which one velocity field passively suffers convection by another. Most of the cited approximations are representable by stochastic model equations for the velocity amplitude. Explicit constructions are given for the stochastic models, in a form that can be approximated on a digital computer. These constructions are used to discuss the physical and mathematical differences between the model dynamics and actual Navier-Stokes dynamics.-

Herring, J. R.

The delta-Eddington approximation for radiative flux transfer

Simple approximations, like the Eddington, are often incapable of coping with the highly asymmetric phase functions typical of particulate scattering. A simple yet accurate method called the delta-Eddington approximation is proposed for determining monochromatic radiative fluxes in an absorbing-scattering atmosphere. In this method, the governing phase function is approximated by a Dirac delta function forward scatter peak and a two-term expansion of the phase function. The fraction of scattering into the truncated forward peak is taken proportional to the square of the phase function asymmetry factor, which distinguishes the delta-Eddington approximation from others of similar nature. The transmission, reflection, and absorption predicted by the delta-Eddington approximation are compared with doubling method calculations for realistic ranges of optical depth, single-scattering albedo, surface albedo, sun angle and asymmetry factor. The approximation is shown to provide an accurate and analytically simple parameterization of radiation to replace the empirism currently encountered in many general circulation and climate models.

Joseph, J. H.

Polynomial approximation of functions of matrices and its application to the solution of a general system of linear equations

During the process of solving a mathematical model numerically, there is often a need to operate on a vector v by an operator which can be expressed as f(A) while A is NxN matrix (ex: exp(A), sin(A), A sup -1). Except for very simple matrices, it is impractical to construct the matrix f(A) explicitly. Usually an approximation to it is used. In the present research, an algorithm is developed which uses a polynomial approximation to f(A). It is reduced to a problem of approximating f(z) by a polynomial in z while z belongs to the domain D in the complex plane which includes all the eigenvalues of A. This problem of approximation is approached by interpolating the function f(z) in a certain set of points which is known to have some maximal properties. The approximation thus achieved is almost best. Implementing the algorithm to some practical problem is described. Since a solution to a linear system Ax = b is x= A sup -1 b, an iterative solution to it can be regarded as a polynomial approximation to f(A) = A sup -1. Implementing the algorithm in this case is also described.

Tal-Ezer, Hillel

Approximations to eigenvalues of modified general matrices

The reanalysis of non-self-adjoint dynamic models is computationally very expensive in design optimization applications. This paper describes several approximations that can be applied to eigenvalues of non-hermitian matrices to reduce that computational cost. Approximations based on eigenvalue derivatives, generalized Rayleigh quotient and the trace theorem are presented and their accuracy and computational cost are estimated. The accuracy and cost estimates are verified by applying the approximations to random matrices and matrices arising in flutter analysis of compressor blades. Recommendations are made for selection of the best approximation when the derivatives are available and when they are not. In particular, it is concluded that the quadratic approximation for eigenvalues should never be used as higher order approximations are always more accurate as well as more efficient.

Murthy, Durbha V.

Approximate spatial reasoning

Much of human reasoning is approximate in nature. Formal models of reasoning traditionally try to be precise and reject the fuzziness of concepts in natural use and replace them with non-fuzzy scientific explicata by a process of precisiation. As an alternate to this approach, it has been suggested that rather than regard human reasoning processes as themselves approximating to some more refined and exact logical process that can be carried out with mathematical precision, the essence and power of human reasoning is in its capability to grasp and use inexact concepts directly. This view is supported by the widespread fuzziness of simple everyday terms (e.g., near tall) and the complexity of ordinary tasks (e.g., cleaning a room). Spatial reasoning is an area where humans consistently reason approximately with demonstrably good results. Consider the case of crossing a traffic intersection. We have only an approximate idea of the locations and speeds of various obstacles (e.g., persons and vehicles), but we nevertheless manage to cross such traffic intersections without any harm. The details of our mental processes which enable us to carry out such intricate tasks in such apparently simple manner are not well understood. However, it is that we try to incorporate such approximate reasoning techniques in our computer systems. Approximate spatial reasoning is very important for intelligent mobile agents (e.g., robots), specially for those operating in uncertain or unknown or dynamic domains.

Dutta, Soumitra

Optimizing the Zeldovich approximation

We have recently learned that the Zeldovich approximation can be successfully used for a far wider range of gravitational instability scenarios than formerly proposed; we study here how to extend this range. In previous work (Coles, Melott and Shandarin 1993, hereafter CMS) we studied the accuracy of several analytic approximations to gravitational clustering in the mildly nonlinear regime. We found that what we called the 'truncated Zeldovich approximation' (TZA) was better than any other (except in one case the ordinary Zeldovich approximation) over a wide range from linear to mildly nonlinear (sigma approximately 3) regimes. TZA was specified by setting Fourier amplitudes equal to zero for all wavenumbers greater than k(sub nl), where k(sub nl) marks the transition to the nonlinear regime. Here, we study the cross correlation of generalized TZA with a group of n-body simulations for three shapes of window function: sharp k-truncation (as in CMS), a tophat in coordinate space, or a Gaussian. We also study the variation in the crosscorrelation as a function of initial truncation scale within each type. We find that k-truncation, which was so much better than other things tried in CMS, is the worst of these three window shapes. We find that a Gaussian window e(exp(-k(exp 2)/2k(exp 2, sub G))) applied to the initial Fourier amplitudes is the best choice. It produces a greatly improved crosscorrelation in those cases which most needed improvement, e.g. those with more small-scale power in the initial conditions. The optimum choice of kG for the Gaussian window is (a somewhat spectrum-dependent) 1 to 1.5 times k(sub nl). Although all three windows produce similar power spectra and density distribution functions after application of the Zeldovich approximation, the agreement of the phases of the Fourier components with the n-body simulation is better for the Gaussian window. We therefore ascribe the success of the best-choice Gaussian window to its superior treatment of phases in the nonlinear regime. We also report on the accuracy of particle positions and velocities produced by TZA.

Melott, Adrian L.

Exponential Approximations Using Fourier Series Partial Sums

The problem of accurately reconstructing a piece-wise smooth, 2(pi)-periodic function f and its first few derivatives, given only a truncated Fourier series representation of f, is studied and solved. The reconstruction process is divided into two steps. In the first step, the first 2N + 1 Fourier coefficients of f are used to approximate the locations and magnitudes of the discontinuities in f and its first M derivatives. This is accomplished by first finding initial estimates of these quantities based on certain properties of Gibbs phenomenon, and then refining these estimates by fitting the asymptotic form of the Fourier coefficients to the given coefficients using a least-squares approach. It is conjectured that the locations of the singularities are approximated to within O(N(sup -M-2), and the associated jump of the k(sup th) derivative of f is approximated to within O(N(sup -M-l+k), as N approaches infinity, and the method is robust. These estimates are then used with a class of singular basis functions, which have certain 'built-in' singularities, to construct a new sequence of approximations to f. Each of these new approximations is the sum of a piecewise smooth function and a new Fourier series partial sum. When N is proportional to M, it is shown that these new approximations, and their derivatives, converge exponentially in the maximum norm to f, and its corresponding derivatives, except in the union of a finite number of small open intervals containing the points of singularity of f. The total measure of these intervals decreases exponentially to zero as M approaches infinity. The technique is illustrated with several examples.

Banerjee, Nana S.