Search NASA⌕ Search

SEARCH · Search NASA

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.

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

At least 217 records · Page 12

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↗

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↗

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↗

Symmetric rotating-wave approximation for the generalized single-mode spin-boson system

The single-mode spin-boson model exhibits behavior not included in the rotating-wave approximation (RWA) in the ultra and deep-strong coupling regimes, where counter-rotating contributions become important. We introduce a symmetric rotating-wave approximation that treats rotating and counter-rotating terms equally, preserves the invariances of the Hamiltonian with respect to its parameters, and reproduces several qualitative features of the spin-boson spectrum not present in the original rotating-wave approximation both off-resonance and at deep-strong coupling. The symmetric rotating-wave approximation allows for the treatment of certain ultra- and deep-strong coupling regimes with similar accuracy and mathematical simplicity as does the RWA in the weak-coupling regime. Additionally, we symmetrize the generalized form of the rotating-wave approximation to obtain the same qualitative correspondence with the addition of improved quantitative agreement with the exact numerical results. The method is readily extended to higher accuracy if needed. Finally, we introduce the two-photon parity operator for the two-photon Rabi Hamiltonian and obtain its generalized symmetric rotating-wave approximation. The existence of this operator reveals a parity symmetry similar to that in the Rabi Hamiltonian as well as another symmetry that is unique to the two-photon case, providing insight into the mathematical structure of the two-photon spectrum, significantly simplifying the numerics, and revealing some interesting dynamical properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

We present an adaptive grid matrix-free operator approximation scheme based on a "product-convolution" interpolation of convolution operators. This scheme is appropriate for operators that are locally translation-invariant, even if these operators are high rank or full rank. Such operators arise in Schur complement methods for solving partial differential equations (PDEs), as Hessians in PDE-constrained optimization and inverse problems, as integral operators, as covariance operators, and as Dirichlet-to-Neumann maps. Constructing the approximation requires computing the impulse responses of the operator to point sources centered on nodes in an adaptively refined grid of sample points. A randomized a posteriori error estimator drives the adaptivity. Once constructed, the approximation can be efficiently applied to vectors using the fast Fourier transform. The approximation can be efficiently converted to hierarchical matrix (H-matrix) format, then inverted or factorized using scalable H-matrix arithmetic. The quality of the approximation degrades gracefully as fewer sample points are used, allowing cheap lower quality approximations to be used as preconditioners. Furthermore, this yields an automated method to construct preconditioners for locally translation-invariant Schur complements. We directly address issues related to boundaries and prove that our scheme eliminates boundary artifacts. We test the scheme on a spatially varying blurring kernel, on the nonlocal component of an interface Schur complement for the Poisson operator, and on the data misfit Hessian for an advection dominated advection-diffusion inverse problem. Numerical results show that the scheme outperforms existing methods.

97 MATHEMATICS AND COMPUTING↗

Development of iteration strategies for a practical implementation of a higher order transverse leakage approximation

Transverse integrated nodal diffusion methods currently represent the standard in full core neutronic simulation. The primary shortcoming in this approach is the utilization of the quadratic transverse leakage approximation. This approach, although proven to work well for typical LWR problems, is not consistent with the formulation of nodal methods and can cause accuracy and convergence problems. In previous work, an improved, consistent quadratic leakage approximation was formulated, which derived from the class of higher order nodal methods developed some years ago. In this paper a number of iteration schemes are developed around this consistent quadratic leakage approximation which yield accurate node average results in much improved calculational times. The developed consistent leakage approximation is extended in this work via a number of numerical schemes, the most promising of which results from utilizing the consistent leakage approximation as a correction method to the standard quadratic leakage approximation. Numerical results are demonstrated on a set of benchmark problems, such as the 3D IAEA LWR and MOX C5 problems. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

An efficient implementation of the Chebyshev Rational Approximation Method (CRAM) for solving the burnup equations

The Chebyshev Rational Approximation Method (CRAM) has been recently introduced by the authors for solving the burnup equations with excellent results. This method has been shown to be capable of simultaneously solving an entire burnup system with thousands of nuclides both accurately and efficiently. The method was prompted by an analysis of the spectral properties of burnup matrices and it can be characterized as the best rational approximation on the negative real axis. The coefficients of the rational approximation are fixed and have been reported for various approximation orders. In addition to these coefficients, implementing the method only requires a linear solver. This paper describes an efficient method for solving the linear systems associated with the CRAM approximation. The introduced direct method is based on sparse Gaussian elimination where the sparsity pattern of the resulting upper triangular matrix is determined before the numerical elimination phase. The stability of the proposed Gaussian elimination method is discussed based on considering the numerical properties of burnup matrices. Suitable algorithms are presented for computing the symbolic factorization and numerical elimination in order to facilitate the implementation of CRAM and its adoption into routine use. The accuracy and efficiency of the described technique are demonstrated by computing the CRAM approximations for a large test case with over 1600 nuclides. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Quantum Calisthenics: Gaussians, The Path Integral and Guided Numerical Approximations

It is apparent to anyone who thinks about it that, to a large degree, the basic concepts of Newtonian physics are quite intuitive, but quantum mechanics is not. My purpose in this talk is to introduce you to a new, much more intuitive way to understand how quantum mechanics works. I begin with an incredibly easy way to derive the time evolution of a Gaussian wave-packet for the case free and harmonic motion without any need to know the eigenstates of the Hamiltonian. This discussion is completely analytic and I will later use it to relate the solution for the behavior of the Gaussian packet to the Feynman path-integral and stationary phase approximation. It will be clear that using the information about the evolution of the Gaussian in this way goes far beyond what the stationary phase approximation tells us. Next, I introduce the concept of the bucket brigade approach to dealing with problems that cannot be handled totally analytically. This approach combines the intuition obtained in the initial discussion, as well as the intuition obtained from the path-integral, with simple numerical tools. My goal is to show that, for any specific process, there is a simple Hilbert space interpretation of the stationary phase approximation. I will then argue that, from the point of view of numerical approximations, the trajectory obtained from my generalization of the stationary phase approximation specifies that subspace of the full Hilbert space that is needed to compute the time evolution of the particular state under the full Hamiltonian. The prescription I will give is totally non-perturbative and we will see, by the grace of Maple animations computed for the case of the anharmonic oscillator Hamiltonian, that this approach allows surprisingly accurate computations to be performed with very little work. I think of this approach to the path-integral as defining what I call a guided numerical approximation scheme. After the discussion of the anharmonic oscillator I will turn to tunneling problems and show that the instanton can also be though of in the same way. I will do this for the classic problem of a double well potential in the extreme limit when the splitting between the two lowest levels is extremely small and the tunneling rate from one well to another is also very small.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems

We propose optimal dimensionality reduction techniques for the solution of goal-oriented linear-Gaussian inverse problems, where the quantity of interest (QoI) is a function of the inversion parameters. These approximations are suitable for large-scale applications. In particular, we study the approximation of the posterior covariance of the QoI as a low-rank negative update of its prior covariance and prove optimality of this update with respect to the natural geodesic distance on the manifold of symmetric positive definite matrices. Assuming exact knowledge of the posterior mean of the QoI, the optimality results extend to optimality in distribution with respect to the Kullback--Leibler divergence and the Hellinger distance between the associated distributions. We also propose the approximation of the posterior mean of the QoI as a low-rank linear function of the data and prove optimality of this approximation with respect to a weighted Bayes risk. Both of these optimal approximations avoid the explicit computation of the full posterior distribution of the parameters and instead focus on directions that are well informed by the data and relevant to the QoI. These directions stem from a balance among all the components of the goal-oriented inverse problem: prior information, forward model, measurement noise, and ultimate goals. We illustrate the theory using a high-dimensional inverse problem in heat transfer.

97 MATHEMATICS AND COMPUTING↗

Numerically approximating centrality for graph ranking guarantees

Many real-world datasets can be represented as graphs. Using iterative solvers to approximate graph centrality measures allows us to obtain a ranking vector on the nodes of the graph, consisting of a number for each vertex in the graph identifying its relative importance. In this study the centrality measures we use are Katz Centrality and PageRank. Given an approximate solution, we use the residual to accurately estimate how much of the ranking matches the ranking given by the exact solution. Using probabilistic matrix norms, we obtain bounds on the accuracy of the approximation compared to the exact solution with respect to the highly ranked nodes and apply numerical analysis to the computation of centrality with iterative methods. This relates the numerical accuracy of the linear solver to the data analysis accuracy of finding the correct ranking. In particular, we answer the question of which pairwise rankings are reliable given an approximate solution to the linear system. Experiments on many real-world undirected and directed networks up to several million vertices and several hundred million edges validate our theory and show that we are able to accurately estimate large portions of the approximation. We also analyze the difference between global centrality scores and personalized scores (w.r.t. specific seed vertices). By analyzing convergence error, we develop confidence in the ranking schemes of data mining. We show we are able to accurately guarantee ranking of vertices with an approximation to centrality metrics faster than current methods.

97 MATHEMATICS AND COMPUTING↗

Extension of the weak-line approximation and application to correlated-k methods

Global climate models require accurate and rapid computation of the radiative transfer through the atmosphere. Correlated-k methods are often used. One of the approximations used in correlated-k models is the weakline approximation. We introduce an approximation T/sub g/ which reduces to the weak-line limit when optical depths are small, and captures the deviation from the weak-line limit as the extinction deviates from the weak-line limit. This approximation is constructed to match the first two moments of the gamma distribution to the k-distribution of the transmission. We compare the errors of the weak-line approximation with T/sub g/ in the context of a water vapor spectrum. The extension T/sub g/ is more accurate and converges more rapidly than the weak-line approximation.

54 ENVIRONMENTAL SCIENCES↗

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↗

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↗

Applicability of the thin-film approximation in terahertz photoconductivity measurements

Thin mesoporous photoconductive layers are critically important for efficient water-spitting solar cells. A detailed understanding of photoconductivity in these materials can be achieved via terahertz transient absorption measurements. Such measurements are commonly interpreted using the thin-film approximation. We compare this approximation with a numerical solution of the transfer function without approximations using experimental results for thin-film mesoporous tin oxide (SnO 2 ) samples which range in thickness from 3.3 to 12.6 µm. These samples were sensitized with either a ruthenium polypyridyl complex or a porphyrin dye. The two sensitizers have markedly different absorption coefficients, resulting in penetration depths of 15 µm and 1 µm, respectively. The thin-film approximation results are in good agreement with the numerical work-up for the short penetration length dye. For the longer penetration length samples, the thin-film formula fails even for thicknesses of only 3 µm ≈ λ/100. The imaginary part of the conductivity calculated using the thin-film formula was significantly larger in magnitude than the value without approximations. This discrepancy between the commonly used thin-film approximation and the numerical solution demonstrates the need for a careful analysis of the thin-film formula.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations

We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolis–Hastings kernel, borrowing ideas from deterministic approximation theory, optimization, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the sampler’s exactness or efficiency; our work seeks to address these limitations by exploiting useful convergence characteristics of local approximations. We prove the ergodicity of our approximate Markov chain, showing that it samples asymptotically from the exact posterior distribution of interest. We describe variations of the algorithm that employ either local polynomial approximations or local Gaussian process regressors. Our theoretical results reinforce the key observation underlying this article: when the likelihood has some local regularity, the number of model evaluations per Markov chain Monte Carlo (MCMC) step can be greatly reduced without biasing the Monte Carlo average. Numerical experiments demonstrate multiple order-of-magnitude reductions in the number of forward model evaluations used in representative ordinary differential equation (ODE) and partial differential equation (PDE) inference problems, with both synthetic and real data. Supplementary materials for this article are available online.

97 MATHEMATICS AND COMPUTING↗

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↗