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

Approximate DFT-based methods for generating diabatic states and calculating electronic couplings: models of two and more states

Four types of density functional theory (DFT)-based approaches are assessed in this work for the approximate construction of diabatic states and the evaluation of electronic couplings between these states. These approaches include the constrained DFT (CDFT) method, the constrained noninteracting electron (CNE) model to post-process Kohn–Sham operators, the approximate block-diagonalization (BD) of the Kohn–Sham operators, and the generalized Mulliken–Hush method. It is shown that the first three approaches provide a good description for long-distance intermolecular electron transfer (ET) reactions. On the other hand, inconsistent results were found when applying these approaches to intramolecular ET in strongly coupled, mixed-valence systems. Model analysis shows that this discrepancy is caused by the inappropriate use of the two-state model rather than the defects of the approaches themselves. The situation is much improved when more states are included in the model electronic Hamiltonian. The CNE and BD approaches can thus serve as efficient and robust alternatives for building ET models based on DFT calculations.

Yang, Chou-Hsun↗
DOE OSTI2022

Evaluating Grid Strength under Uncertain Renewable Generation

The increasing displacement of synchronous generators with renewable resources such as wind and solar via power electronic interfaces causes a reduction in short-circuit strength and weak grid issues. The variation and uncertainty of renewable energy increase challenges for identifying weak grid conditions. This paper proposes an efficient method to analyze the impact of uncertain renewable energy on grid strength. The proposed method uses the probabilistic collocation method (PCM) to approximate the results of grid strength assessment under uncertain renewable generation, in order to reduce computational burden without compromising result accuracy when compared with traditional Monte Carlo simulation (MCS). To improve the accuracy of the approximation results, the proposed method integrates the K-means clustering technique with PCM to select the approximation samples of input variables. The efficacy of the proposed method is demonstrated by comparison with MCS on the modified IEEE 9-bus system and modified IEEE 39-bus system with multiple renewable generators.

grid strength↗
DOE OSTI2016

Wave function continuity and the diagonal Born-Oppenheimer correction at conical intersections

We demonstrate that though exact in principle, the expansion of the total molecular wave function as a sum over adiabatic Born-Oppenheimer (BO) vibronic states makes inclusion of the second-derivative nonadiabatic energy term near conical intersections practically problematic. In order to construct a well-behaved molecular wave function that has density at a conical intersection, the individual BO vibronic states in the summation must be discontinuous. When the second-derivative nonadiabatic terms are added to the Hamiltonian, singularities in the diagonal BO corrections (DBOCs) of the individual BO states arise from these discontinuities. In contrast to the well-known singularities in the first-derivative couplings at conical intersections, these singularities are non-integrable, resulting in undefined DBOC matrix elements. Though these singularities suggest that the exact molecular wave function may not have density at the conical intersection point, there is no physical basis for this constraint. Instead, the singularities are artifacts of the chosen basis of discontinuous functions. We also demonstrate that continuity of the total molecular wave function does not require continuity of the individual adiabatic nuclear wave functions. We classify nonadiabatic molecular dynamics methods according to the constraints placed on wave function continuity and analyze their formal properties. Based on our analysis, it is recommended that the DBOC be neglected when employing mixed quantum-classical methods and certain approximate quantum dynamical methods in the adiabatic representation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Localized harmonic characteristic basis functions for multiscale finite element methods

We solve elliptic systems of equations posed on highly heterogeneous materials. Examples of this class of problems are composite structures and geological processes. We focus on a model problem which is a second-order elliptic equation with discontinuous coefficients. These coefficients represent the conductivity of a composite material. We assume a background with a low conductivity that contains inclusions with different thermal properties. Under this scenario, we design a multiscale finite element method to efficiently approximate solutions. The method is based on an asymptotic expansion of the solution in terms of the ratio between the conductivities. The resulting method constructs (locally) finite element basis functions (one for each inclusion). These bases generate the multiscale finite element space where the approximation of the solution is computed. Numerical experiments show the good performance of the proposed methodology.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Lower bounds on circuit depth of the quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demonstrating quantum advantage is the relationship between a problem instance and the circuit depth required to implement the QAOA method. As errors in noisy intermediate-scale quantum (NISQ) devices increase exponentially with circuit depth, identifying lower bounds on circuit depth can provide insights into when quantum advantage could be feasible. In this work, we identify how the structure of problem instances can be used to identify lower bounds for circuit depth for each iteration of QAOA and examine the relationship between problem structure and the circuit depth for a variety of combinatorial optimization problems including MaxCut and MaxIndSet. Specifically, we show how to derive a graph, G, that describes a general combinatorial optimization problem and show that the depth of circuit is at least the chromatic index of G. By looking at the scaling of circuit depth, we argue that MaxCut, MaxIndSet, and some instances of vertex covering and Boolean satisfiability problems are suitable for QAOA approaches while knapsack and traveling salesperson problems are not.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

AN OPEN-SOURCE NEUTRINO RADIATION HYDRODYNAMICS CODE FOR CORE-COLLAPSE SUPERNOVAE

We present an open-source update to the spherically symmetric, general-relativistic hydrodynamics, core-collapse supernova (CCSN) code GR1D. The source code is available at http://www.GR1Dcode.org. We extend its capabilities to include a general-relativistic treatment of neutrino transport based on the moment formalisms of Shibata et al. and Cardall et al. We pay special attention to implementing and testing numerical methods and approximations that lessen the computational demand of the transport scheme by removing the need to invert large matrices. This is especially important for the implementation and development of moment-like transport methods in two and three dimensions. A critical component of neutrino transport calculations is the neutrino–matter interaction coefficients that describe the production, absorption, scattering, and annihilation of neutrinos. In this article we also describe our open-source neutrino interaction library NuLib (available at http://www.nulib.org). We believe that an open-source approach to describing these interactions is one of the major steps needed to progress toward robust models of CCSNe and robust predictions of the neutrino signal. We show, via comparisons to full Boltzmann neutrino-transport simulations of CCSNe, that our neutrino transport code performs remarkably well. Furthermore, we show that the methods and approximations we employ to increase efficiency do not decrease the fidelity of our results. We also test the ability of our general-relativistic transport code to model failed CCSNe by evolving a 40-solar-mass progenitor to the onset of collapse to a black hole.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Bayesian reduced-order deep learning surrogate model for dynamic systems described by partial differential equations

We propose a reduced-order deep-learning surrogate model for dynamic systems described by time-dependent partial differential equations. This method employs space–time Karhunen–Loève expansions (KLEs) of the state variables and space-dependent KLEs of space-varying parameters to identify the reduced (latent) dimensions. Subsequently, a deep neural network (DNN) is used to map the parameter latent space to the state variable latent space. An approximate Bayesian method is developed for uncertainty quantification (UQ) in the proposed KL-DNN surrogate model. The KL-DNN method is tested for the linear advection–diffusion and nonlinear diffusion equations, and the Bayesian approach for UQ is compared with the deep ensembling (DE) approach, commonly used for quantifying uncertainty in DNN models. It was found that the approximate Bayesian method provides a more informative distribution of the PDE solutions in terms of the coverage of the reference PDE solutions (the percentage of nodes where the reference solution is within the confidence interval predicted by the UQ methods) and log predictive probability. The DE method is found to underestimate uncertainty and introduce bias. For the nonlinear diffusion equation, we compare the KL-DNN method with the Fourier Neural Operator (FNO) method and find that KL-DNN is 10% more accurate and needs less training time than the FNO method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Adaptive rotating-wave approximation for driven open quantum systems

We present a numerical method to approximate the long-time asymptotic solution $\rho_\infty(t)$ to the Lindblad master equation for an open quantum system under the influence of an external drive. The proposed scheme uses perturbation theory to rank individual drive terms according to their dynamical relevance, and adaptively determines an effective Hamiltonian. In the constructed rotating frame, $\rho_\infty$ is approximated by a time-independent, nonequilibrium steady-state. This steady-state can be computed with much better numerical efficiency than asymptotic long-time evolution of the system in the lab frame. We illustrate the use of this method by simulating recent transmission measurements of the heavy-fluxonium device, for which ordinary time-dependent simulations are severely challenging due to the presence of metastable states with lifetimes of the order of milliseconds.

36 MATERIALS SCIENCE↗
DOE OSTI2024

A windowed mean trajectory approximation for condensed phase dynamics

We propose a trajectory-based quasi-classical method for approximating dynamics in condensed phase systems. Building upon the previously developed optimized mean trajectory approximation that has been used to compute linear and nonlinear spectra, we borrow some ideas from filtering trajectory methods to obtain a novel semiclassical method for the dynamical propagation of density matrices. This new approximation is tested rigorously against standard multistate electronic models, spin-boson models, and models of the Fenna–Matthews–Olson complex. For dissipative systems, the current method is significantly better or as good as many other semiclassical methods available, especially at low temperatures and for off-diagonal density matrix elements, whereas for scattering models, the current method bears similar limitations as mean-field propagation schemes. All results are tested against the numerically exact hierarchical equations of motion method. In conclusion, the new method shows excellent agreement across various parameter regimes with numerically exact results, highlighting the robustness and accuracy of our approach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Uncertainty Quantification of Geophysical Inversion Using Stochastic Partial Differential Equations (LDRD #218329)

This report summarizes work completed under the Laboratory Directed Research and Development (LDRD) project "Uncertainty Quantification of Geophysical Inversion Using Stochastic Differential Equations." Geophysical inversions often require computationally expensive algorithms to find even one solution, let alone propagating uncertainties through to the solution domain. The primary purpose of this project was to find more computationally efficient means to approximate solution uncertainty in geophysical inversions. We found multiple computationally efficient methods of propagating Earth model uncertainty into uncertainties in solutions of full waveform seismic moment tensor inversions. However, the optimum method of approximating the uncertainty in these seismic source solutions was to use the Karhunen-Love theorem with data misfit residuals. This method was orders of magnitude more computationally efficient than traditional Monte Carlo methods and yielded estimates of uncertainty that closely approximated those of Monte Carlo. We will summarize the various methods we evaluated for estimating uncertainty in seismic source inversions as well as work toward this goal in the realm of 3-D seismic tomographic inversion uncertainty.

58 GEOSCIENCES↗
DOE OSTI2019

Conditioning multi-model ensembles for disease forecasting

In this study we investigate how an ensemble of disease models can be conditioned to observational data, in a bid to improve its predictive skill. We use the ensemble of influenza forecasting models gathered by the US Centers for Disease Control and Prevention (CDC) as the exemplar. This ensemble is used every year to forecast the annual influenza outbreak in the United States. The models constituting this ensemble draw on very different modeling assumptions and approximations and are a diverse collection of methods to approximate epidemiological dynamics. Currently, each models' predictions are accorded the same importance, or weight, when compiling the ensemble's forecast. We consider this equally-weighted ensemble as the baseline case which has to be improved upon. In this study, we explore whether an ensemble forecast can be improved by "conditioning" the ensemble to whatever observational data is available from the ongoing outbreak. "Conditioning" can imply according the ensemble's members different weights which evolve over time, or simply perform the forecast using the top k (equally-weighted) models. In the latter case, the composition of the "top-k-see of models evolves over time. This is called "model averaging" in statistics. We explore four methods to perform model-averaging, three of which are new. We find that the CDC ensemble responds best to the "top-k-models" approach to model-averaging. All the new MA methods perform better than the baseline equally-weighted ensemble. The four model-averaging methods treat the models as black-boxes and simply use their forecasts as inputs i.e., one does not need access to the models at all, but rather only their forecasts. The model-averaging approaches reviewed in this report thus form a general framework for model-averaging any model ensemble.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Statistical mechanical model for crack growth

Analytic relations that describe crack growth are vital for modeling experiments and building a theoretical understanding of fracture. Upon constructing an idealized model system for the crack and applying the principles of statistical thermodynamics, it is possible to formulate the rate of thermally activated crack growth as a function of load, but the result is analytically intractable. In this report an asymptotically correct theory is used to obtain analytic approximations of the crack growth rate from the fundamental theoretical formulation. These crack growth rate relations are compared to those that exist in the literature and are validated with respect to Monte Carlo calculations and experiments. The success of this approach is encouraging for future modeling endeavors that might consider more complicated fracture mechanisms, such as inhomogeneity or a reactive environment.

36 MATERIALS SCIENCE↗
DOE OSTI2015

FELIX-1.0: A finite element solver for the time dependent generator coordinate method with the Gaussian overlap approximation

In this study, we describe the software package FELIX that solves the equations of the time-dependent generator coordinate method (TDGCM) in NN-dimensions (N ≥ 1) under the Gaussian overlap approximation. The numerical resolution is based on the Galerkin finite element discretization of the collective space and the Crank–Nicolson scheme for time integration. The TDGCM solver is implemented entirely in C++. Several additional tools written in C++, Python or bash scripting language are also included for convenience. In this paper, the solver is tested with a series of benchmarks calculations. We also demonstrate the ability of our code to handle a realistic calculation of fission dynamics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Sparse Approximate Multifrontal Factorization with Composite Compression Methods

This article presents a fast and approximate multifrontal solver for large sparse linear systems. In a recent work by Liu et al., we showed the efficiency of a multifrontal solver leveraging the butterfly algorithm and its hierarchical matrix extension, HODBF (hierarchical off-diagonal butterfly) compression to compress large frontal matrices. The resulting multifrontal solver can attain quasi-linear computation and memory complexity when applied to sparse linear systems arising from spatial discretization of high-frequency wave equations. To further reduce the overall number of operations and especially the factorization memory usage to scale to larger problem sizes, in this article we develop a composite multifrontal solver that employs the HODBF format for large-sized fronts, a reduced-memory version of the nonhierarchical block low-rank format for medium-sized fronts, and a lossy compression format for small-sized fronts. This allows us to solve sparse linear systems of dimension up to 2.7 × larger than before and leads to a memory consumption that is reduced by 70% while ensuring the same execution time. The code is made publicly available in GitHub.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

A new approach to three-dimensional neutron transport solution based on the method of characteristics and linear axial approximation

A new approach based on the method of characteristics (MOC) is proposed to solve the neutron transport equation. A new three-dimensional (3D) spatial discretization is applied to avoid the instability issue of the transverse leakage iteration of the traditional 2D/1D approach. In this new approach, the axial and radial variables are discretized in two different ways: the linear expansion is performed in the axial direction, then, the 3D solution of the angular flux is transformed to be the planar solution of 2D angular expansion moments, which are solved by the planar MOC sweeping. Based on the boundary and interface continuity conditions, the 2D expansion moment solution is equivalently transformed to be the solution of the axially averaged angular flux. Using the piecewise averaged angular flux at the top and bottom surfaces of 3D meshes, the planes are coupled to give the 3D angular flux distribution. The 3D CMFD linear system is established from the surface net current of every 3D pin-mesh to accelerate the convergence of power iteration. The STREAM code is extended to be capable of handling 3D problems based on the new approach. Several benchmarks are tested to verify its feasibility and accuracy, including the 3D homogeneous benchmarks and heterogeneous benchmarks. The computational sensitivity is discussed. The results show good accuracy in all tests. With the CMFD acceleration, the convergence is stable. In addition, a pin-cell problem with void gap is calculated. This shows the advantage compared to the traditional 2D/1D MOC methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗