SEARCH · Search NASA
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.
NWHypergraph is a C++ hypergraph processing framework for shared-memory architecture. NWHypergraph provides efficient algorithms to construct s-line graphs, a lower-order approximation of a given hypergraph, and computes different graph metrics of a s-line graph such as s-connected components, s-betweenness centrality, s-closeness centrality, etc. It also provides Python APIs for s-line graph computation. The Python APIs are provided using Pybind11
We discuss our recent progress on improving the theoretical description of the pp \to t\bar{t}W^\pm p p → t t ‾ W ± process with particular focus on fiducial signatures that include top-quark decays. We employ a wide range of techniques from parton shower matching, narrow width approximation to full off-shell computations to assess the importance of the different modeling approaches.
In the recent years, there has been a tremendous interest to numerical methods that approximate partial differential equations (PDEs) on computational meshes with arbitrarily-shaped polygonal/polyhedral (polytopal, for short) elements. A nonexhaustive list of such methods include the Mimetic Finite Difference method [4, 9, 21, 24, 28, 33, 35, 62, 64–67], the Polygonal Finite Element Method [68, 73, 74], the polygonal Discontinuous Galerkin Finite Element Methods [5, 7, 8, 10, 13–15, 18, 36, 38, 39, 41, 50], the Hybridizable Discontinuous Galerkin and Hybrid High-Order Methods [46–48, 51], the Gradient Discretization method [49, 53, 54], the Finite Volume Method [52], and the BEM-based FEM [71]. An alternative approach that also proved to be very successful is provided by the Virtual Element method (VEM), which was originally proposed in [19] for the numerical treatment of second-order elliptic problems [43, 44], and readily extended to linear and nonlinear elasticity [22, 25, 56], plate bending problems [37], Cahn-Hilliard equation [3], Stokes equations [2], Laplace-Beltrami equation [55], Darcy-Brinkam equation [76], discrete topology optimization problems [6], fracture networks problems [29], eigenvalue problems [59, 75]. The mixed virtual element formulation was proposed in [20, 34]; the nonconforming Virtual element formulations was proposed for second-order elliptic problems in [16], and later extended to general advection-reaction-diffusion problems, Stokes equation, the biharmonic problems, the iegenvalue problem, and the Schrodinger equation in [11, 30, 42, 45, 58, 80]. The p- and hp-version of the VEM were developed in [26, 27] and efficient multigrid methods for the resulting linear system of equations in [12]. A posteriori error estimates can be found in [40].
We describe using the Newton Krylov method to solve the coupled cluster equation. The method uses a Krylov iterative method to compute the Newton correction to the approximate coupled cluster amplitude. The multiplication of the Jacobian with a vector, which is required in each step of a Krylov iterative method such as the Generalized Minimum Residual (GMRES) method, is carried out through a finite difference approximation, and requires an additional residual evaluation. The overall cost of the method is determined by the sum of the inner Krylov and outer Newton iterations. We discuss the termination criterion used for the inner iteration and show how to apply pre-conditioners to accelerate convergence. We will also examine the use of regularization technique to improve the stability of convergence and compare the method with the widely used direct inversion of iterative subspace (DIIS) methods through numerical examples.
A method for efficient image registration between two images in the presence of inlier-poor domains includes receiving a set of candidate correspondences between the two images. An approximate homography between the two images is generated based upon a first correspondence in the correspondences. The set of candidate correspondences is filtered to identify inlier correspondences based upon the approximate homography. A candidate homography is computed based upon the inlier correspondences. The candidate homography can be selected as a final homography between the two images based upon a support of the candidate homography against the set of candidate correspondences. An image registration is performed between the two images based upon the candidate homography being selected as the final homography.
We present a novel Bayesian learning approach to outdoor radio heatmap construction utilizing deep Gaussian process (GP). The proposed approach employs a two-layer hierarchy which consists of two cascaded Gaussian processes that are capable of modeling more complex input-output relations than standard single-layer Gaussian processes. Since deriving the exact model likelihood is challenging, a lower bound is optimized instead so that gradient descent-based methods can be performed to find out the optimal model parameters. Typically, inducing points are used in GPs to facilitate low-rank approximation of covariance (kernel) matrices for computation speedup. However, the inaccuracy induced by inducing points can accumulate when stacking multiple layers of GP which may hinder the performance of deep GP. Moreover, since inducing points need to be learned, having them at all layers of deep GP also incurs computational burden. To overcome the above challenges, in contrast to the canonical deep GP model, we use a modified architecture where a full standard GP resides in the first layer and inducing points are only introduced for the second layer. This modified architecture strikes a balance between model accuracy and training complexity. In the proposed model, the noise parameter of the first GP layer is also eliminated to improve the training efficiency as the noise parameter at the output of the second layer suffices to model the uncertainty in the output. The proposed approach is evaluated on real-world datasets, in the form of location-Received Signal Strength (RSS) pairs, collected from the Platform for Open Wireless Data-driven Experimental Research (POWDER) located at the campus of the University of Utah. Experiment results show that the proposed approach can achieve smaller prediction errors on various training and testing data configurations than DNN-based and GP-based methods.
We report that machine learning techniques typically rely on large datasets to create accurate classifiers. However, there are situations when data is scarce and expensive to acquire. This is the case of studies that rely on state-of-the-art computational models which typically take days to run, thus hindering the potential of machine learning tools. In this work, we present a novel classifier that takes advantage of lower fidelity models and inexpensive approximations to predict the binary output of expensive computer simulations. We postulate an autoregressive model between the different levels of fidelity with Gaussian process priors. We adopt a fully Bayesian treatment for the hyper-parameters and use Markov Chain Monte Carlo samplers. We take advantage of the probabilistic nature of the classifier to implement active learning strategies. We also introduce a sparse approximation to enhance the ability of the multi-fidelity classifier to handle a large amount of low fidelity samples. We test these multi-fidelity classifiers against their single-fidelity counterpart with synthetic data, showing a median computational cost reduction of 23% for a target accuracy of 90%. In an application to cardiac electrophysiology, the multi-fidelity classifier achieves an F1 score, the harmonic mean of precision and recall, of 99.6% compared to 74.1% of a single-fidelity classifier when both are trained with 50 samples. In general, our results show that the multi-fidelity classifiers outperform their single-fidelity counterpart in terms of accuracy in all cases. Finally, we envision that this new tool will enable researchers to study classification problems that would otherwise be prohibitively expensive. Source code is available at https://github.com/fsahli/MFclass.
The Fast All-sky Radiation Model for Solar applications (FARMS) is used to compute cloudy irradiance. Radiative transfer (RT) models simulating broadband solar radiation have been widely used by atmospheric scientists to model solar resources for various energy applications such as operational forecasting. Due to the complexity of solving the RT equation, the computation under cloudy conditions can be extremely time consuming though many approximations (e.g. two-stream approach and delta-M truncation scheme) have been utilized. Thus, a more efficient RT model is crucial for model developers as a new option for approximating solar radiation at the land surface with minimal loss of accuracy. We have developed a fast all-sky radiation model for solar applications (FARMS) using the simplified clear-sky RT model, REST2, and simulated cloud transmittances and reflectances from the Rapid Radiation Transfer Model (RRTM) with a sixteen-stream Discrete Ordinates Radiative Transfer (DISORT). Simulated lookup tables (LUTs) of cloud transmittances and reflectances were created by varying cloud optical thicknesses, cloud particle sizes, and solar zenith angles. Equations with optimized parameters were fitted to the cloud transmittances and reflectances to develop the model. Using this model the all-sky solar irradiance at the land surface can be computed rapidly by combining REST2 with the cloud transmittances and reflectances. This new RT model is more than 1000 times faster than those currently utilized in solar resource assessment and forecasting since it does not explicitly solve the RT equation for each individual cloud condition. Our results indicate the accuracy of the fast radiative transfer model is comparable to or better than two-stream approximation in term of computing cloud transmittance and solar radiation.
The Fast All-sky Radiation Model for Solar applications (FARMS) is used to compute cloudy irradiance. Radiative transfer (RT) models simulating broadband solar radiation have been widely used by atmospheric scientists to model solar resources for various energy applications such as operational forecasting. Due to the complexity of solving the RT equation, the computation under cloudy conditions can be extremely time consuming though many approximations (e.g. two-stream approach and delta-M truncation scheme) have been utilized. Thus, a more efficient RT model is crucial for model developers as a new option for approximating solar radiation at the land surface with minimal loss of accuracy. We have developed a fast all-sky radiation model for solar applications (FARMS) using the simplified clear-sky RT model, REST2, and simulated cloud transmittances and reflectances from the Rapid Radiation Transfer Model (RRTM) with a sixteen-stream Discrete Ordinates Radiative Transfer (DISORT). Simulated lookup tables (LUTs) of cloud transmittances and reflectances were created by varying cloud optical thicknesses, cloud particle sizes, and solar zenith angles. Equations with optimized parameters were fitted to the cloud transmittances and reflectances to develop the model. Using this model the all-sky solar irradiance at the land surface can be computed rapidly by combining REST2 with the cloud transmittances and reflectances. This new RT model is more than 1000 times faster than those currently utilized in solar resource assessment and forecasting since it does not explicitly solve the RT equation for each individual cloud condition. Our results indicate the accuracy of the fast radiative transfer model is comparable to or better than two-stream approximation in term of computing cloud transmittance and solar radiation.
The main challenge of large-scale numerical simulation of radiation transport is the high memory and computation time requirements of discretization methods for kinetic equations. In this work, we derive and investigate a neural network-based approximation to the entropy-based closure method to accurately compute the solution of the multi-dimensional moment system with a low memory footprint and competitive computational time. We extend methods developed for the standard entropy-based closure to the regularized entropy-based closures. The main idea is to interpret structure-preserving neural network approximations of the regularized entropy-based closure as a two-stage approximation to the original entropy-based closure. We conduct a numerical analysis of this approximation and investigate optimal parameter choices. Our numerical experiments demonstrate that the method has a much lower memory footprint than traditional methods with competitive computation times and simulation accuracy. The code and all trained networks are provided on GitHub.
Due to its balance of accuracy and computational cost, density functional theory has become the method of choice for computing the electronic structure and related properties of materials. However, present-day semi-local approximations to the exchange-correlation energy of density functional theory break down for materials containing d and f electrons. In this report we summarize the results of our research efforts within the LDRD 200202 titled "Making density functional theory work for all materials" in addressing this issue. Our efforts are grouped into two research thrusts. In the first thrust, we develop an exchange-correlation functional (BSC functional) within the subsystem functional formalism. It enables us to capture bulk, surface, and confinement physics with a single, semi-local exchange-correlation functional in density functional theory calculations. We present the analytical properties of the BSC functional and demonstrate that the BSC functional is able to capture confinement physics more accurately than standard semi-local exchange-correlation functionals. The second research thrust focusses on developing a database for transition metal binary compounds. The database consists of materials properties (formation energies, ground-state energies, lattice constants, and elastic constants) of 26 transition metal elements and 89 transition metal alloys. It serves as a reference for benchmarking computational models (such as lower-level modeling methods and exchange-correlation functionals). We expect that our database will significantly impact the materials science community. We conclude with a brief discussion on the future research directions and impact of our results.
We fully develop the Monte Carlo many-body Green’s function (MC-GF) method with the following enhancements: (1) The truncation order of the perturbation expansion of the Dyson self-energy is raised from the second order (MC-GF2) to the third order (MC-GF3) with the aid of a computerized procedure to enumerate and transform all 84 third-order Goldstone diagrams into Monte Carlo integrable expressions and then into central processing unit (CPU)/graphical processing unit (GPU)-parallel computer codes. (2) An efficient algorithm is proposed that computes all off-diagonal and diagonal elements of the MC-GF2 and MC-GF3 self-energy matrices by common subexpression elimination. (3) The frequency-independent approximation is lifted by introducing a method that computes frequency derivatives of the MC-GF2 and MC-GF3 self-energies up to any arbitrarily high order at nearly no additional computational cost. (4) The imaginary-time integration in the Laplace-transformed expressions of the self-energy is carried out stochastically (instead of using a quadrature in the previous implementations), resulting in a 50- to 200-fold speedup. (5) The efficiency of the redundant-walker convergence acceleration scheme is analyzed numerically, and the guidelines are established to select an optimal number of walkers for maximal efficiency. When such an optimal number is used, the cost per sample is constant of molecular size on either many CPUs or many GPUs. (6) The computational cost to obtain a binding energy within a given statistical uncertainty is observed to increase as (tentatively) O(n 4 ) and O(n 5 ) of molecular size (n is the number of electrons) with and without the diagonal approximation, respectively, as opposed to O(n 5 ) and O(n 6 ) of the corresponding deterministic algorithms. With this method applied to the electron binding energies of C 60 , we show that the third-order corrections to the self-energies are much greater in electron binding energies than in ground-state energies. As a result, they display a sign of oscillatory convergence toward experimental results, not necessarily improving the agreement with increasing perturbation order, justifying MC-GF3 and motivating even higher-order methods.
In this study, a new computational approach is presented to solve the generalized pantograph-delay differential equations (PDDEs). The solutions obtained by our scheme represent by a linear combination of a special kind of basis functions, and can be deduced in a straightforward manner. Firstly, using the least squares approximation method and the Lagrange-multiplier method, the given PDDE is converted to a linear system of algebraic equations, and those unknown coefficients of the solution of the problem are determined by solving this linear system. Secondly, a PDDE related to the error function of the approximate solution is constructed based on the residual error function technique, and error estimation is presented for the suggested method. The convergence of the approximate solution is proved. Several numerical examples are given to demonstrate the accuracy and efficiency. Comparisons are made between the proposed method and other existing methods.
We compare phenomenological results from (3+1)-dimensional quasiparticle anisotropic hydrodynamics (aHydroQP) with experimental data collected in RHIC 200 GeV Au-Au collisions. We present comparisons of identified particle spectra in different centrality clases, charged particle multiplicity versus pseudorapidity, identified particle multiplicity versus centrality across a wide range of particle species, identified particle elliptic flow versus transverse momentum, and charged particle elliptic flow as a function of transverse momentum and rapidity. We use the same aHydroQP and hadronic production/feed down codes that were used previously to describe LHC 2.76 TeV data. The aHydroQP hydrodynamic model includes the effects of both shear and bulk viscosities in addition to an infinite number of transport coefficients computed self-consistently in the relaxation time approximation. To convert to the final state hadrons, we use anisotropic Cooper-Frye freeze-out performed on a fixed-energy-density hypersurface and compute the production/feed down using a customized version of Therminator 2. Here, we find good agreement with many heavy-ion collision observables using only smooth Glauber initial conditions parametrized by an initial central temperature of T 0 = 455 MeV, a constant shear-viscosity-to-entropy-density ratio η/s = 0.179, and a switching (freeze-out) temperature of T FO = 130 MeV.
Gaussian process regression is a classical kernel method for function estimation and data interpolation. In large data applications, computational costs can be reduced using low-rank or sparse approximations of the kernel. This paper investigates the effect of such kernel approximations on the interpolation error. We introduce a unified framework to analyze Gaussian process regression under important classes of computational misspecification: Karhunen-Loève expansions that result in low-rank kernel approximations, multiscale wavelet expansions that induce sparsity in the covariance matrix, and finite element representations that induce sparsity in the precision matrix. Furthermore, our theory also accounts for epistemic misspecification in the choice of kernel parameters.
ll phonons in a single crystal of NaBr are measured by inelastic neutron scattering at temperatures of 10, 300, and 700 K. Even at 300 K, the phonons, especially the longitudinal-optical phonons, show large shifts in frequencies and show large broadenings in energy owing to anharmonicity. Ab initio computations are first performed with the quasiharmonic approximation (QHA) in which the phonon frequencies depend only on V and on T only insofar as it alters V by thermal expansion. This QHA is an unqualified failure for predicting the temperature dependence of phonon frequencies, even 300 K, and the thermal expansion is in error by a factor of 4. Ab initio computations that include both anharmonicity and quasiharmonicity successfully predict both the temperature dependence of phonons and the large thermal expansion of NaBr. The frequencies of longitudinal-optical phonon modes decrease significantly with temperature owing to the real part of the phonon self-energy from explicit anharmonicity originating from the cubic anharmonicity of nearest-neighbor NaBr bonds. Anharmonicity is not a correction to the QHA predictions of thermal expansion and thermal phonon shifts but dominates the behavior.
In this work, we propose a high-order adaptive numerical solver for the semilinear elliptic boundary value problem modeling magnetic plasma equilibrium in axisymmetric confinement devices. In the fixed boundary case, the equation is posed on curved domains with piecewise smooth curved boundaries that may present corners. The solution method we present is based on the hybridizable discontinuous Galerkin method and sidesteps the need for geometry-conforming triangulations thanks to a transfer technique that allows to approximate the solution using only a polygonal subset as computational domain. Moreover, the solver features automatic mesh refinement driven by a residual-based a posteriori error estimator. As the mesh is locally refined, the computational domain is automatically updated in order to always maintain the distance between the actual boundary and the computational boundary of the order of the local mesh diameter. Numerical evidence is presented of the suitability of the estimator as an approximate error measure for physically relevant equilibria with pressure pedestals, internal transport barriers, and current holes on realistic geometries.
We apply two ab initio many-body methods based on Gutzwiller wave functions, i.e., correlation matrix renormalization theory (CMRT) and Gutzwiller conjugate gradient minimization (GCGM), to the study of crystalline phases of atomic hydrogen. Both methods avoid empirical Hubbard U parameters and are free from double-counting issues. CMRT employs a Gutzwiller-type approximation that enables efficient calculations, while GCGM goes beyond this approximation to achieve higher accuracy at higher computational cost. By benchmarking against available quantum Monte Carlo (QMC) results, we demonstrate that while both methods are more accurate than the widely used density-functional theory, GCGM systematically captures additional correlation energy missing in CMRT, leading to significantly improved total energy predictions. We also show that by including the correlation energy Ec from local density approximation in the CMRT calculation, CMRT + E c produces energy in better agreement with the QMC results in these hydrogen lattice systems.