SEARCH · Engineering Papers

Results for “APPROXIMATIONS”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Practical algorithms for multivariate rational approximation

We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models for high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process to efficiently and robustly compute the coefficients of the rational approximation. Our second approach is based on an optimization formulation that allows us to include structural constraints on the rational approximation (in particular, constraints demanding the absence of singularities), resulting in a semi-infinite optimization problem that we solve using an outer approximation approach. We present results for synthetic and real-life HEP data, and we compare the approximation quality of our approaches with that of traditional polynomial approximations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Extended Lagrangian Born–Oppenheimer molecular dynamics using a Krylov subspace approximation

It is shown how the electronic equations of motion in extended Lagrangian Born–Oppenheimer molecular dynamics simulations can be integrated using low-rank approximations of the inverse Jacobian kernel. This kernel determines the metric tensor in the harmonic oscillator extension of the Lagrangian that drives the evolution of the electronic degrees of freedom. The proposed kernel approximation is derived from a pseudoinverse of a low-rank estimate of the Jacobian, which is expressed in terms of a generalized set of directional derivatives with directions that are given from a Krylov subspace approximation. The approach allows a tunable and adaptive approximation that can take advantage of efficient preconditioning techniques. The proposed kernel approximation for the integration of the electronic equations of motion makes it possible to apply extended Lagrangian first-principles molecular dynamics simulations to a broader range of problems, including reactive chemical systems with numerically sensitive and unsteady charge solutions. This can be achieved without requiring exact full calculations of the inverse Jacobian kernel in each time step or relying on iterative non-linear self-consistent field optimization of the electronic ground state prior to the force evaluations as in regular direct Born–Oppenheimer molecular dynamics. We note the low-rank approximation of the Jacobian is directly related to Broyden’s class of quasi-Newton algorithms and Jacobian-free Newton–Krylov methods and provides a complementary formulation for the solution of nonlinear systems of equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Multi-angle quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the approximation improves with increasing ansatz depth but gate noise and circuit complexity undermine performance in practice. Here, we investigate a multi-angle ansatz for QAOA that reduces circuit depth and improves the approximation ratio by increasing the number of classical parameters. Even though the number of parameters increases, our results indicate that good parameters can be found in polynomial time for a test dataset we consider. This new ansatz gives a 33% increase in the approximation ratio for an infinite family of MaxCut instances over QAOA. The optimal performance is lower bounded by the conventional ansatz, and we present empirical results for graphs on eight vertices that one layer of the multi-angle anstaz is comparable to three layers of the traditional ansatz on MaxCut problems. Similarly, multi-angle QAOA yields a higher approximation ratio than QAOA at the same depth on a collection of MaxCut instances on fifty and one-hundred vertex graphs. Many of the optimized parameters are found to be zero, so their associated gates can be removed from the circuit, further decreasing the circuit depth. These results indicate that multi-angle QAOA requires shallower circuits to solve problems than QAOA, making it more viable for near-term intermediate-scale quantum devices.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Developing new and understanding old approximations in TDDFT

When a system has evolved far from a ground-state, the adiabatic approximations commonly used in time-dependent density functional theory calculations completely fail in some applications, while giving qualitatively good predictions in others, and sometimes even quantitative predictions. It is not clearly understood why this is so, and developing practical approximations going beyond the adiabatic approximation remains a challenge. This paper explores three different lines of investigation. First, an expression for the exact time-dependent exchange–correlation potential suggests that the accuracy of an adiabatic approximation is intimately related to the deviation between the natural orbital occupation numbers of the physical system and those of the Kohn–Sham system, and we explore this on some exactly-solvable model systems. The exact expression further suggests a path to go beyond the adiabatic approximations, and in the second part we discuss a newly proposed class of memory-dependent approximations developed in this way. Finally, we derive a new expression for the exact exchange–correlation potential from a coupling-constant path integration.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Exact relationships between the GW approximation and equation-of-motion coupled-cluster theories through the quasi-boson formalism

We describe the relationship between the GW approximation and various equation-of-motion (EOM) coupled-cluster (CC) theories. We demonstrate the exact equivalence of the G0W0 approximation and the propagator theory for an electron–boson problem in a particular excitation basis. From there, we establish equivalence within the quasi-boson picture to the IP+EA-EOM unitary CC propagator. We analyze the incomplete description of screening provided by the standard similarity-transformed IP+EA-EOM-CC and the recently introduced G0W0 Tamm–Dancoff approximation. We further consider the approximate decoupling of IP and EA sectors in EOM-CC treatments and devise the analogous particle–hole decoupling approach for the G0W0 approximation. Finally, we numerically demonstrate the exact relationships and magnitude of the approximations in the calculations of a set of molecular ionization potentials and electron affinities.

Chemistry↗

DOE OSTI2021

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↗

DOE OSTI2023

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↗

DOE OSTI2021

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↗

DOE OSTI2024

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↗

DOE OSTI2021

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

NASA NTRS1972

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

NASA NTRS1972

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

NASA NTRS1972

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

NASA NTRS1976

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

NASA NTRS1987

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↗

NASA NTRS1987

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

NASA NTRS1988

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↗