Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximation methods”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Fast Fourier Transform for multivariate aggregate claims

The Fast Fourier Transform provides an alternative approximate method to evaluate the distribution of aggregate losses in insurance and finance. The efficiency of this method has already been proved for univariate and bivariate insurance models; therefore, in this paper, we extend it to a multivariate setting by considering its application to a particular model that includes losses of different types and dependency between them. Since the Fourier transform method works with truncated claims distributions, it can generate aliasing errors by wrapping around the probability mass that lies at the truncation point below this point. To eliminate this problem, we also discuss a suitable change of measure called exponential tilting that forces the tail of the distribution to decrease at exponential rate. Other possible errors are also discussed. We also illustrate the method on several numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

From inclusive to semi-inclusive one-nucleon knockout in neutrino event generators

In neutrino event generators, for models for neutrino and electron scattering only inclusive cross sections are implemented. When these models are used to describe a semi-inclusive cross section, the event generator attaches the hadron variables based on some assumptions. In this work we compare the nucleon kinematics given by the method used in the GENIE event generator, e.g. in the implementation of the SuSAv2 model, to a fully unfactorized calculation using the relativistic distorted wave impulse approximation (RDWIA). We focus on kinematics relevant to the $e4\nu$ analysis and show that observables obtained with RDWIA differ significantly from those of the approximate method used in GENIE, the latter should be considered unrealistic.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2017

A post-processing method to simulate the generalized RF sheath boundary condition

For applications of ICRF power in fusion devices, control of RF sheath interactions is of great importance. A sheath boundary condition (SBC) was previously developed to provide an effective surface impedance for the interaction of the RF sheath with the waves. The SBC enables the surface power flux and rectified potential energy available for sputtering to be calculated. For legacy codes which cannot easily implement the SBC, or to speed convergence in codes which do implement it, we consider here an approximate method to simulate SBCs by post-processing results obtained using other, e.g. conducting wall, boundary conditions. The basic approximation is that the modifications resulting from the generalized SBC are driven by a fixed incoming wave which could be either a fast wave or a slow wave. Finally, the method is illustrated in slab geometry and compared with exact numerical solutions; it is shown to work very well.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Comparison of multiobjective optimization methods for the $\mathrm{LCLS-II}$ photoinjector

Particle accelerators are among some of the largest science experiments in the world and can consist of thousands of components with a wide variety of input ranges. These systems can easily become unwieldy optimization problems during design and operations studies. Starting in the early 2000s, searching for better beam dynamics configurations became synonymous with heuristic optimization methods in the accelerator physics community. Genetic algorithms and particle swarm optimization are currently the most widely used. These algorithms can take thousands of simulation evaluations to find optimal solutions for one machine prototype. For large facilities such as the Linac Coherent Light Source (LCLS) and others, this equates to a limited exploration of many possible design configurations. In this paper, the LCLS-II photoinjector is optimized with three optimization algorithms. All optimizations were started from both a uniform random and Latin hypercube sample. In all cases, the optimizations started from Latin hypercube samples outperformed optimizations started from uniform samples. All three algorithms were able to optimize the photoinjector, with the model-based methods approximating the Pareto front in fewer simulation evaluations. This work, in combination with previous optimization observations, indicates objective penalties have a strong impact on the efficiency of such methods. In general, we recommend heuristic methods for initial optimizations and model-based methods when information about the objective space is available.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Theoretical methods to design and test quantum simulators for the compact Abelian Higgs model

The lattice compact Abelian Higgs model is a nonperturbative regularized formulation of low-energy scalar quantum electrodynamics. In 1+1 dimensions, this model can be quantum simulated using a ladder-shaped optical lattice with Rydberg-dressed atoms. In this setup, one spatial dimension is used to carry the angular momentum of the quantum rotors. One can use truncations corresponding to spin-2 and spin-1 to build local Hilbert spaces associated with the links of the lattice. We argue that ladder-shaped configurable arrays of Rydberg atoms can be used for the same purpose. We make concrete proposals involving two and three Rydberg atoms to build one local spin-1 space (a qutrit). We show that the building blocks of the Hamiltonian calculations are models with one and two spins. We compare target and simulators using perturbative and numerical methods. The two-atom setup provides an easily controllable simulator of the one-spin model while the three-atom setup involves solving nonlinear equations. We discuss approximate methods to couple two spin-1 spaces. The article provides analytical and numerical tools necessary to design and build the proposed simulators with current technology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Orbital relaxation effects on Kohn–Sham frontier orbital energies in density functional theory

We explore effects of orbital relaxation on Kohn–Sham frontier orbital energies in density functional theory by using a nonempirical scaling correction approach developed in Zheng et al. [J. Chem. Phys. 138, 174105 (2013)]. Relaxation of Kohn–Sham orbitals upon addition/removal of a fractional number of electrons to/from a finite system is determined by a systematic perturbative treatment. The information of orbital relaxation is then used to improve the accuracy of predicted Kohn–Sham frontier orbital energies by Hartree–Fock, local density approximation, and generalized gradient approximation methods. The results clearly highlight the significance of capturing the orbital relaxation effects. Moreover, the proposed scaling correction approach provides a useful way of computing derivative gaps and Fukui quantities of N-electron finite systems (N is an integer), without the need to perform self-consistent-field calculations for (N ± 1)-electron systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

COLA with scale-dependent growth: applications to screened modified gravity models

We present a general parallelized and easy-to-use code to perform numerical simulations of structure formation using the COLA (COmoving Lagrangian Acceleration) method for cosmological models that exhibit scale-dependent growth at the level of first and second order Lagrangian perturbation theory. For modified gravity theories we also include screening using a fast approximate method that covers all the main examples of screening mechanisms in the literature. We test the code by comparing it to full simulations of two popular modified gravity models, namely f ( R ) gravity and nDGP, and find good agreement in the modified gravity boost-factors relative to ΛCDM even when using a fairly small number of COLA time steps.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Accelerating full-waveform inversion using source stacking: synthetic experiments at the global scale in a realistic 3-D earth model

SUMMARY The spectral element method is currently the method of choice for computing accurate synthetic seismic wavefields in realistic 3-D earth models at the global scale. However, it requires significantly more computational time, compared to normal mode-based approximate methods. Source stacking, whereby multiple earthquake sources are aligned on their origin time and simultaneously triggered, can reduce the computational costs by several orders of magnitude. We present the results of synthetic tests performed on a realistic radially anisotropic 3-D model, slightly modified from model SEMUCB-WM1 with three component synthetic waveform ‘data’ for a duration of 10 000 s, and filtered at periods longer than 60 s, for a set of 273 events and 515 stations. We consider two definitions of the misfit function, one based on the stacked records at individual stations and another based on station-pair cross-correlations of the stacked records. The inverse step is performed using a Gauss–Newton approach where the gradient and Hessian are computed using normal mode perturbation theory. We investigate the retrieval of radially anisotropic long wavelength structure in the upper mantle in the depth range 100–800 km, after fixing the crust and uppermost mantle structure constrained by fundamental mode Love and Rayleigh wave dispersion data. The results show good performance using both definitions of the misfit function, even in the presence of realistic noise, with degraded amplitudes of lateral variations in the anisotropic parameter ξ. Interestingly, we show that we can retrieve the long wavelength structure in the upper mantle, when considering one or the other of three portions of the cross-correlation time series, corresponding to where we expect the energy from surface wave overtone, fundamental mode or a mixture of the two to be dominant, respectively. We also considered the issue of missing data, by randomly removing a successively larger proportion of the available synthetic data. We replace the missing data by synthetics computed in the current 3-D model using normal mode perturbation theory. The inversion results degrade with the proportion of missing data, especially for ξ, and we find that a data availability of 45 per cent or more leads to acceptable results. We also present a strategy for grouping events and stations to minimize the number of missing data in each group. This leads to an increased number of computations but can be significantly more efficient than conventional single-event-at-a-time inversion. We apply the grouping strategy to a real picking scenario, and show promising resolution capability despite the use of fewer waveforms and uneven ray path distribution. Source stacking approach can be used to rapidly obtain a starting 3-D model for more conventional full-waveform inversion at higher resolution, and to investigate assumptions made in the inversion, such as trade-offs between isotropic, anisotropic or anelastic structure, different model parametrizations or how crustal structure is accounted for.

Geochemistry & Geophysics↗
DOE OSTI2022

Optimal Power Dispatch of DGs in Radial and Mesh AC Grids: A Hybrid Solution Methodology between the Salps Swarm Algorithm and Successive Approximation Power Flow Method

In this paper, we address the problem of the optimal power dispatch of Distributed Generators (DGs) in Alternating Current (AC) networks, better known as the Optimal Power Flow (OPF) problem. We used, as the objective function, the minimization of power losses (P loss ) associated with energy transport, which are subject to the set of constraints that compose AC networks in an environment of distributed generation. To validate the effectiveness of the proposed methodology in solving the OPF problem in any network topology, we employed one 10-node mesh test system and three radial text systems: 10, 33, and 69 nodes. In each test system, DGs were allowed to inject 20%, 40%, and 60% of the power supplied by the slack generator in the base case. To solve the OPF problem, we used a master–slave methodology that integrates the optimization method Salps Swarm Algorithm (SSA) and the load flow technique based on the Successive Approximation (SA) method. Moreover, for comparison purposes, we employed some of the algorithms reported in the specialized literature to solve the OPF problem (the continuous genetic algorithm, the particle swarm optimization algorithm, the black hole algorithm, the antlion optimization algorithm, and the Multi-Verse Optimizer algorithm), which were selected because of their excellent results in solving such problems. The results obtained by the proposed solution methodology demonstrate its superiority and convergence capacity in terms of minimization of P loss in both radial and mesh systems. It provided the best reduction in minimum P loss in short processing times and showed excellent repeatability in each test system and scenario under analysis.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2026

Score-based deterministic density sampling

We propose a deterministic sampling framework using Score-Based Transport Modeling for sampling an unnormalized target density π given only its score ∇ log π. Our method approximates the Wasserstein gradient flow on KL($f_t$∥π) by learning the time-varying score ∇ log $f_t$ on the fly using score matching. While having the same marginal distribution as Langevin dynamics, our method produces smooth deterministic trajectories, resulting in monotone noise-free convergence. We prove that our method dissipates relative entropy at the same rate as the exact gradient flow, provided sufficient training. Numerical experiments validate our theoretical findings: our method converges at the optimal rate, has smooth trajectories, and is often more sample efficient than its stochastic counterpart. Experiments on high-dimensional image data show that our method produces high-quality generations in as few as 15 steps and exhibits natural exploratory behavior. The memory and runtime scale linearly in the sample size.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Non-orthogonal spin-adaptation of coupled cluster methods: A new implementation of methods including quadruple excitations

The theory of non-orthogonal spin-adaptation for closed-shell molecular systems is applied to coupled cluster methods with quadruple excitations (CCSDTQ). Calculations at this level of detail are of critical importance in describing the properties of molecular systems to an accuracy which can meet or exceed modern experimental techniques. Such calculations are of significant (and growing) importance in such fields as thermodynamics, kinetics, and atomic and molecular spectroscopies. With respect to the implementation of CCSDTQ and related methods, we show that there are significant advantages to non-orthogonal spin-adaption with respect to simplification and factorization of the working equations and to creating an efficient implementation. The resulting algorithm is implemented in the CFOUR program suite for CCSDT, CCSDTQ, and various approximate methods (CCSD(T), CC3, CCSDT-n, and CCSDT(Q))

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

An efficient approach for solving Klein–Gordon equation arising in quantum field theory using wavelets

A new approach for the solution of Klein–Gordon equation using Legendre wavelet-based approximation method is presented. The properties of Legendre wavelets are used to reduce the problem to the solution of system of algebraic equations. Usually 2{sup (k−1)}M{sup 2} connection coefficients are required to solve the Klein–Gordon equation by Legendre wavelets method as mentioned in the literature. But, our proposed method based on Legendre wavelets and algebraic polynomials require only 2{sup (k−1)}M connection coefficients instead of 2{sup (k−1)}M{sup 2} . Also the convergence analysis and error estimation for the proposed function approximation through the truncated series have been discussed and approved with the exact solution. Illustrative examples are discussed to demonstrate the validity and applicability of the technique with lesser computational effort.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Numerical modelling of emission of a two-level atom near a metal nanoparticle with account for tunnelling of an electron from an atom into a particle

We report the results of numerical modelling of emission of a two-level atom near a metal nanoparticle under resonant interaction of light with plasmon modes of the particle. Calculations have been performed for different polarisations of light by a dipole approximation method and a complex multipole method. Depending on the distance between a particle and an atom, the contribution of the nonradiative process of electron tunnelling from a two-level atom into a particle, which is calculated using the quasi-classical approximation, has been taken into account and assessed. We have studied spherical gold and silver particles of different diameters (10 – 100 nm). The rates of electron tunnelling and of spontaneous decay of the excited atomic state are found. The results can be used to develop nanoscale plasmonic emitters, lasers and photodetectors. (nanooptics)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Wide ranging equation of state with Tartarus: A hybrid Green’s function/orbital based average atom code

Average atom models are widely used to make equation of state tables and for calculating other properties of materials over a wide range of conditions, from zero temperature isolated atom to fully ionized free electron gases. The numerical challenge of making these density functional theory based models work for any temperature, density or nuclear species is formidable. Here we present in detail a hybrid Green’s function/orbital based approach that has proved to be stable and accurate for wide ranging conditions. Algorithmic strategies are discussed. In particular the decomposition of the electron density into numerically advantageous parts is presented and a robust and rapid self consistent field method based on a quasi-Newton algorithm is given. Example application to the equation of state of lutetium (Z = 71) is explored in detail, including the effect of relativity, finite temperature exchange and correlation, and a comparison to a less approximate method. Furthermore, the hybrid scheme is found to be numerically stable and accurate for lutetium over at least 6 orders of magnitude in density and 5 orders of magnitude in temperature.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2018

An improved target velocity sampling algorithm for free gas elastic scattering

We present an improved algorithm for sampling the target velocity when simulating elastic scattering in a Monte Carlo neutron transport code that correctly accounts for the energy dependence of the scattering cross section. The algorithm samples the relative velocity directly, thereby avoiding a potentially inefficient rejection step based on the ratio of cross sections. Here, we have shown that this algorithm requires only one rejection step, whereas other methods of similar accuracy require two rejection steps. The method was verified against stochastic and deterministic reference results for upscattering percentages in 238 U. Simulations of a light water reactor pin cell problem demonstrate that using this algorithm results in a 3% or less penalty in performance when compared with an approximate method that is used in most production Monte Carlo codes

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Efficient hybrid explicit-implicit learning for multiscale problems

Splitting method is a powerful method to handle application problems by splitting physics, scales, domain, and so on. Many splitting algorithms have been designed for efficient temporal discretization. Here, in this paper, our goal is to use temporal splitting concepts in designing machine learning algorithms and, at the same time, help splitting algorithms by incorporating data and speeding them up. We propose a machine learning assisted splitting scheme which improves the efficiency of the scheme meanwhile preserves the accuracy. We consider a recently introduced multiscale splitting algorithms, where the multiscale problem is solved on a coarse grid. To approximate the dynamics, only a few degrees of freedom are solved implicitly, while others explicitly. This splitting concept allows identifying degrees of freedom that need implicit treatment. In this paper, we use this splitting concept in machine learning and propose several strategies. First, the implicit part of the solution can be learned as it is more difficult to solve, while the explicit part can be computed. This provides a speed-up and data incorporation for splitting approaches. Secondly, one can design a hybrid neural network architecture because handling explicit parts requires much fewer communications among neurons and can be done efficiently. Thirdly, one can solve the coarse grid component via PDEs or other approximation methods and construct simpler neural networks for the explicit part of the solutions. We discuss these options and implement one of them by interpreting it as a machine translation task. This interpretation of the splitting scheme successfully enables us using the Transformer since it can perform model reduction for multiple time series and learn the connection between them. We also find that the splitting scheme is a great platform to predict the coarse solution with insufficient information of the target model: the target problem is partially given and we need to solve it through a known problem which approximates the target. Our machine learning model can incorporate and encode the given information from two different problems and then solve the target problems. We conduct four numerical examples and the results show that our method is stable and accurate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Exploring the sensitivity of charge-exchange ( p , n ) reactions to the neutron density distribution

The determination of the nuclear neutron properties suffers from uncontrolled uncertainties, which have attracted considerable attention recently, such as in the context of the PREX experiment. Our aim is to analyze the sensitivity of charge-exchange (p,n) reactions to the neutron density distribution ρ n and constrain the neutron characteristics in the nuclear structure models. Method: By combing the folding and the mean-field models, the nucleon-nucleus (N,A) potential can be obtained from the nuclear density distribution. Further, the (p,p) and (p,n) cross sections for 48 Ca and 208 Pb are calculated following the distorted-wave Born approximation method. As a result, compared with the (p,p) cross section, the effects of ρ n variation on the (p,n) cross section are significant, which is due to the impact of isovector properties. Based on the global folding model analyses of data, it is found that 48 Ca and 208 Pb have relatively large neutron skin thickness ΔR np . Results illustrate that the charge-exchange (p,n) reaction is a sensitive probe of ρ n . The results in this paper can offer useful guides for future experiments of neutron characteristics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗