Search NASA⌕ Search

SEARCH · Search NASA

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 109 records · Page 6

Approximate symmetries of guiding-centre motion

In a strong, inhomogeneous magnetic field, charged particle dynamics may be studied in the guiding-centre approximation, which is known to be Hamiltonian. When the magnetic field is quasisymmetric, the first-order guiding-centre (FGC) Hamiltonian structure admits a continuous symmetry, and therefore a conserved quantity in addition to the energy. Since the FGC system is only an approximation, it is also interesting to consider approximate symmetries of the guiding-centre Hamiltonian structure. We find that any approximate spatial symmetry coincides with quasisymmetry to leading order. For approximate phase-space symmetries, we derive weaker conditions than quasisymmetry. The latter include 'weak quasisymmetry' as a subcase, recently proposed by Rodríguez et al. Our results, however, show that weak quasisymmetry is necessarily non-spatial at first order. Finally, we demonstrate that if the magnetic field is constrained to satisfy magnetohydrostatic force balance then an approximate symmetry must agree with quasisymmetry to leading order.

97 MATHEMATICS AND COMPUTING↗

Cross sections for neutron-induced reactions from surrogate data: Reexamining the Weisskopf-Ewing approximation for ( n , n ' ) and ( n , 2 n ) reactions

Background: Modeling nuclear reaction networks for nuclear science applications and for simulations of astrophysical environments relies on cross section data for a vast number of reactions, many of which have never been measured. Cross sections for neutron-induced reactions on unstable nuclei are particularly scarce, since they are the most difficult to measure. Consequently, we must rely on theoretical predictions or indirect measurements to obtain the requisite reaction data. For compound nuclear reactions, the surrogate reaction method can be used to determine many cross sections of interest. Purpose: Earlier work has demonstrated that cross sections for neutron-induced fission and radiative neutron capture can be determined from a combination of surrogate reaction data and theory. For the fission case, it was shown that the Weisskopf-Ewing approximation, which significantly simplifies the implementation of the surrogate method, can be employed. Capture cross sections cannot be obtained, and require a detailed description of the surrogate reaction process. Here, we examine the validity of the Weisskopf-Ewing approximation for determining unknown (n, n') and (n, 2n) cross sections from surrogate data. Methods: Using statistical reaction calculations with realistic parametrizations, we investigate first whether the assumptions underlying the Weisskopf-Ewing approximation are valid for (n, n') and (n, 2n) reactions on representative target nuclei. We then produce simulated surrogate reaction data and assess the impact of applying the Weisskopf-Ewing approximation when extracting (n, n') and (n, 2n) cross sections in situations where the approximation is not strictly justified. Results: We find that peak cross sections can be estimated using the Weisskopf-Ewing approximation, but the shape of the (n, n') and (n, 2n) cross sections, especially for low neutron energies, cannot be reliably determined without accounting for the angular-momentum differences between the neutron-induced and surrogate reaction. Conclusions: To obtain reliable (n, n') and (n, 2n) cross sections from surrogate reaction data, a detailed description of the surrogate reaction mechanisms is required. To do so for the compound-nucleus energies and decay channels relevant to these reactions, it becomes necessary to extend current modeling capabilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Improved approximations of non-Gaussian probability, force, and energy of a single polymer chain

The mechanical behavior of polymers such as their probability density function (PDF), strain energy, and entropic force, has long been described by the non-Gaussian statistical model. Non-Gaussian models are often approximated by the Kuhn-Grün (KG) distribution function, which is derived from the first-order approximation of the complex Rayleigh's exact Fourier integral distribution. Furthermore, the KG function is widely accepted in polymer physics, where the non-Gaussian theory is often used to describe energy of the chains with various flexibility ratios. However, the KG function is shown to be relevant only for long chains and becomes extremely inaccurate for chains with fewer than 40 segments. In comparison to the KG model, other approximations of the non-Gaussian statistical model are often less accurate, and those with higher accuracy are usually too complex to be implemented in large-scale simulations. Here a new accurate approximation of the non-Gaussian PDF, entropic force, and strain energy of a single chain subsequently is developed to describe the mechanics of a polymer chain. With a similar level of complexity, the presented approximations of non-Gaussian PDF, strain energy, and entropic force are at least 10 times more accurate than KG approximations and thus are an excellent alternative option to be used in micromechanical constitutive models.

42 ENGINEERING↗

Opening band gaps of low-dimensional materials at the meta-GGA level of density functional approximations

The quasiparticle band structure can be properly described by Hedin's GW approximation (GW), at a high computational cost. For band gaps, semilocal density functionals up to the generalized gradient approximation (GGA) level cannot compete with the accuracy of hybrid-based approximations or GW. Meta-GGA density functionals with a strong dependence on the kinetic energy density ingredient can potentially give wider band gaps compared with GGAs. The recent TASK meta-GGA density functional from Aschebrock and Kümmel [ Phys. Rev. Research 1 , 033082 (2019) ], is constructed with an enhanced nonlocality in the generalized Kohn-Sham scheme and therefore harbors great opportunities for band gap prediction. Although this approximation was found to yield excellent band gaps of bulk solids, this accuracy cannot be straightforwardly transferred to low-dimensional materials. Additionally, the reduced screening of these materials results in larger band gaps compared with their bulk counterparts, as an additional barrier to overcome. In this paper we demonstrate how the alteration of this functional affects the band gaps of monolayers and nanoribbons and present accurate band gaps competing with the revised Heyd-Scuseria-Ernzerhof (HSE06) approximation. In order to achieve this goal, we have modified the TASK functional (a) by changing the tight upper bound for one- or two-electron systems ( h X 0 ) from 1.174 to 1.29 and (b) by changing the limit of the interpolation function f X ( α → ∞ ) of the TASK functional that interpolates the exchange enhancement factor F X ( s , α ) from α = 0 to 1. The resulting modified TASK (mTASK) was tested for various materials from three dimensions to two dimensions to one dimension (nanoribbons) and was compared with the results of the higher-level hybrid functional HSE06 or with the G 0 W 0 approximation within many-body perturbation theory. We find that mTASK systematically improves the band gaps and band structures of two-dimensional (2D) and 1D systems, without significantly affecting the accuracy of the original TASK for the bulk 3D materials, when compared with the Perdew-Burke-Ernzerhof (PBE) GGA and the strongly constrained and appropriately normed (SCAN) meta-GGA. We further demonstrate the applicability of mTASK by assessing the band structures of transition metal dichalcogenide nanoribbons with respect to various bending curvatures.

36 MATERIALS SCIENCE↗

Quapprox: A Framework for Benchmarking the Approximability of Variational Quantum Circuit

Most of the existing quantum neural network models, such as variational quantum circuits (VQCs), are limited in their ability to explore the non-linear relationships in input data. This gradually becomes the main obstacle for it to tackle realistic applications, such as natural language processing, medical image processing, and wireless communications. Recently, there have emerged research efforts that enable VQCs to perform non-linear operations. However, it is still unclear on the approximability of a given VQC (i.e., the order of non-linearity that can be handled by a specified design). In response to this issue, we developed an automated tool designed to benchmark the approximation of a given VQC. The proposed tool will generate a set of synthetic datasets with different orders of non-linearity and train the given VQC on these datasets to estimate their approximability. Our experiments benchmark VQCs with different designs, where we know their theoretic approximability. We then show that the proposed tool can precisely estimate the approximability, which is consistent with the theoretic value, indicating that the proposed tool can be used for benchmarking the approximability of a given quantum circuit for learning tasks.

artificial intelligence↗

An Investigation into the Approximations Used in Wave Packet Molecular Dynamics for the Study of Warm Dense Matter

Wave packet molecular dynamics (WPMD) has recently received a lot of attention as a computationally fast tool with which to study dynamical processes in warm dense matter beyond the Born–Oppenheimer approximation. These techniques, typically, employ many approximations to achieve computational efficiency while implementing semi-empirical scaling parameters to retain accuracy. We investigated three of the main approximations ubiquitous to WPMD: a restricted basis set, approximations to exchange, and the lack of correlation. We examined each of these approximations in regard to atomic and molecular hydrogen in addition to a dense hydrogen plasma. We found that the biggest improvement to WPMD comes from combining a two-Gaussian basis with a semi-empirical correction based on the valence-bond wave function. A single parameter scales this correction to match experimental pressures of dense hydrogen. Ultimately, we found that semi-empirical scaling parameters are necessary to correct for the main approximations in WPMD. However, reducing the scaling parameters for more ab-initio terms gives more accurate results and displays the underlying physics more readily.

Angermeier, William A. (ORCID:0000000177161564)↗

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

On the Applicability of High-frequency Approximations to Lilley's Equation

Three forms of the high-frequency asymptotic Green's function for Lilley's equation are reviewed and compared to the exact solution over wide range of Strouhal numbers. The asymmetric approximation, which applies to sources away form the jet axis, and the quasi-symmetric approximation, which is arrived at by making a near-axis source assumption, are both obtained for parallel round jets from a formal Fourier-transform solution. The ray-theory solution, which is the only high-frequency approximation that can be applied to more general mean flows, follows from a WKB ansatz and is shown to be closely related to the asymmetric approximation. The comparisons show that the best overall prediction of the exact Green's function is given by the asymmetric approximation which remains accurate down to a Strouhal number of 1/2. The close relationship between the asymmetric and ray-theory approximations suggests that the high-frequency asymptotic Green's function for more general mean flows would be similarly successful.

Wundrow, David W.↗

Surface Segregation Energies of BCC Binaries from Ab Initio and Quantum Approximate Calculations

We compare dilute-limit segregation energies for selected BCC transition metal binaries computed using ab initio and quantum approximate energy method. Ab initio calculations are carried out using the CASTEP plane-wave pseudopotential computer code, while quantum approximate results are computed using the Bozzolo-Ferrante-Smith (BFS) method with the most recent parameterization. Quantum approximate segregation energies are computed with and without atomistic relaxation. The ab initio calculations are performed without relaxation for the most part, but predicted relaxations from quantum approximate calculations are used in selected cases to compute approximate relaxed ab initio segregation energies. Results are discussed within the context of segregation models driven by strain and bond-breaking effects. We compare our results with other quantum approximate and ab initio theoretical work, and available experimental results.

Good, Brian S.↗

Subsonic Aircraft With Regression and Neural-Network Approximators Designed

At the NASA Glenn Research Center, NASA Langley Research Center's Flight Optimization System (FLOPS) and the design optimization testbed COMETBOARDS with regression and neural-network-analysis approximators have been coupled to obtain a preliminary aircraft design methodology. For a subsonic aircraft, the optimal design, that is the airframe-engine combination, is obtained by the simulation. The aircraft is powered by two high-bypass-ratio engines with a nominal thrust of about 35,000 lbf. It is to carry 150 passengers at a cruise speed of Mach 0.8 over a range of 3000 n mi and to operate on a 6000-ft runway. The aircraft design utilized a neural network and a regression-approximations-based analysis tool, along with a multioptimizer cascade algorithm that uses sequential linear programming, sequential quadratic programming, the method of feasible directions, and then sequential quadratic programming again. Optimal aircraft weight versus the number of design iterations is shown. The central processing unit (CPU) time to solution is given. It is shown that the regression-method-based analyzer exhibited a smoother convergence pattern than the FLOPS code. The optimum weight obtained by the approximation technique and the FLOPS code differed by 1.3 percent. Prediction by the approximation technique exhibited no error for the aircraft wing area and turbine entry temperature, whereas it was within 2 percent for most other parameters. Cascade strategy was required by FLOPS as well as the approximators. The regression method had a tendency to hug the data points, whereas the neural network exhibited a propensity to follow a mean path. The performance of the neural network and regression methods was considered adequate. It was at about the same level for small, standard, and large models with redundancy ratios (defined as the number of input-output pairs to the number of unknown coefficients) of 14, 28, and 57, respectively. In an SGI octane workstation (Silicon Graphics, Inc., Mountainview, CA), the regression training required a fraction of a CPU second, whereas neural network training was between 1 and 9 min, as given. For a single analysis cycle, the 3-sec CPU time required by the FLOPS code was reduced to milliseconds by the approximators. For design calculations, the time with the FLOPS code was 34 min. It was reduced to 2 sec with the regression method and to 4 min by the neural network technique. The performance of the regression and neural network methods was found to be satisfactory for the analysis and design optimization of the subsonic aircraft.

Patnaik, Surya N.↗