Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 91 records · Page 5

The MP{sub N} method: a new angular discretization method based on piecewise polynomial interfaces fluxes

In transport calculations, it is well known how S{sub N} method is extremely inefficient in problems where the particle physics is dominated by streaming. The ray-effect eventually produced by the insufficient angular discretization, appears to be extremely persistent with respect to the refinement of the angular quadrature. The MP{sub N} method, that relies on continuous angular representation, offers a robust remedy to such an issue. MP{sub N} is based on the decomposition of the unit sphere into solid angles and on a piecewise continuous definition of interface fluxes, which are expanded in polynomials in each solid angle. This allows propagating more than one angular degree of freedom simultaneously while maintaining unaltered the block-diagonal pattern of the displacement plus removal operator. The method is therefore well suited for the flux resolution by means of a conventional sweep algorithm. Furthermore, unlike the S{sub N} method, MP{sub N} does not rely on discrete directions and, thus, on an angular quadrature formula, but rather constructs a set of linear equations solving for the angular moments of the flux for all discrete solid angles within the sweep. MP{sub N} shows an error convergence rate higher than S{sub N} at the expense of an increased size of the coefficient matrices, so of the computational cost. Although MP{sub N} is not free from ray-effect, the latter is effectively mitigated and less persistent with respect to the increase of the angular refinement order. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Global Optimization of Chemical Cluster Structures: Methods, Applications, and Challenges

Chemical clusters are relevant to many applications in catalysis, separations, materials, and energy sciences. Experimentally, the structure of clusters is difficult to determine, but it is very important in understanding their chemistry and properties. Computational methods can be used to examine cluster structure, however finding the most stable structure is not simple, particularly as the cluster size increases. Global optimization techniques have long been used to tackle the problem of the most stable structure, but such approaches would have to look for a global minimum, while sampling local minima over the whole potential energy surface as well. In this review, the state-of-the-art theory of global optimization theory is summarized. First, the definition, significance, relation to experiments, and a brief history of global optimization is presented. We then discuss, in more detail, three versatile global optimization methods: the basin hopping, the artificial bee colony algorithm, and the genetic algorithm. We close with some representative application examples of global optimization of clusters since 2016 and the challenges, open questions and opportunities in this field.

Global optimization, Chemical clusters, Artificial↗

Machine Learning Methods for Connection RTT and Loss Rate Estimation Using MPI Measurements Under Random Losses

Scientific computations are expected to be increasingly distributed across wide-area networks, and Message Passing Interface (MPI) has been shown to scale to support their communications over long distances. Application-level measurements of MPI operations reflect the connection Round-Trip Time (RTT) and loss rate, and machine learning methods have been previously developed to estimate them under deterministic periodic losses. In this paper, we consider more complex, random losses with unform, Poisson and Gaussian distributions. We study five disparate machine leaning methods, with linear and non-linear, and smooth and non-smooth properties, to estimate RTT and loss rate over 10Gbps connections with 0-366ms RTT. The diversity and complexity of these estimators combined with the randomness of losses and TCP’s non-linear response together rule out the selection of a single best among them; instead, we fuse them to retain their design diversity. Overall, the results show that accurate estimates can be generated at low loss rates but become inaccurate at loss rates 10% and higher, thereby illustrating both their strengths and limitations.

Generalization Bounds↗

Approximate Green’s Function Coupled Cluster A Method Employing Effective Dimension Reduction

The Green’s function coupled cluster (GFCC) method, originally proposed in the early 1990s, is a powerful many-body tool for computing and analyzing the electronic structures of molecular structures and periodic systems, especially when electrons are strongly correlated. However, in order for the GFCC method to become an approach that can be routinely used in the electronic structure calculations, more robust linear algebraic techniques and approximations need to be employed to reduce its extremely high computational overhead. In our recent studies, we showed that the GFCC equation can be numerically solved by seeking solutions of multiple linear systems in the frequency regime of interest, which can be easily distributed in a massively parallel environment, and broaden the avenue for more state-of-the-art numerical linear algebraic tools associated with multiple linear systems to be kicked in to this field. In the present pursuit of this practice, we show a successful application of model order reduction (MOR) techniques in the GFCC framework. Briefly speaking, for a frequency regime of interest that requires a high resolution of spectral function, instead of solving GFCC linear equation in the original dimension for every single frequency point, an easily-solvable linear system model with reduced dimension can be built upon projecting the original GFCC linear system into a subspace, from which the interpolation and extrapolation can give a reasonable approximation to the results of the original GFCC linear equations. Here, we show that the subspace can be properly constructed in an iterative manner from the auxiliary vectors of the GFCC linear equations at some select frequencies inside the frequency regime. During the iterations, the quality of the subspace, as well as the linear system model, can be systematically improved. The approach is tested in this work in terms of the efficiency and accuracy of computing spectral functions for some typical molecular systems including carbon monoxide, 1,3-butadiene, benzene, and adenine molecules. As a byproduct, the high quality linear system model is also found to be able to provide high quality initial guess for the existing linear solver to improve the convergence performance.

Peng, Bo↗

Monte Carlo Second- and Third-Order Many-Body Green’s Function Methods with Frequency-Dependent, Nondiagonal Self-Energy

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.

Algorithms↗

IMPROVING THE ACCURACY OF COMPOSITE METHODS: A G4MP2 METHOD WITH G4-LIKE ACCURACY AND IMPLICATIONS FOR MACHINE LEARNING

G4MP2 theory has proven to be a reliable and accurate quantum chemical composite method for the calculation of molecular energies using an approximation based on second-order perturbation theory to lower computational costs compared to G4 theory. However, it has been found to have significantly increased errors when applied to larger organic molecules with 10 or more nonhydrogen atoms. We report here on an investigation of the cause of the failure of G4MP2 theory for such larger molecules. One source of error is found to be the "higher-level correction (HLC)", which is meant to correct for deficiencies in correlation contributions to the calculated energies. This is because the HLC assumes that the contribution is independent of the element and the type of bonding involved, both of which become more important with larger molecules. We address this problem by adding an atom-specific correction, dependent on atom type but not bond type, to the higher-level correction. We find that a G4MP2 method that incorporates this modification of the higher-level correction, referred to as G4MP2A, becomes as accurate as G4 theory (for computing enthalpies of formation) for a test set of molecules with less than 10 nonhydrogen atoms as well as a set with 10-14 such atoms, the set of molecules considered here, with a much lower computational cost. The G4MP2A method is also found to significantly improve ionization potentials and electron affinities. Finally, we implemented the G4MP2A energies in a machine learning method to predict molecular energies.

Dandu, Naveen↗

Advanced Modeling and Simulation Methods for Evaluation of Thermal Neutron Scattering Materials

With the rise of interest in thermal neutron scattering data for advanced reactor, criticality safety, and shielding applications, new experimental data are required for evaluation of new materials or for re-evaluation (or validations) of previously evaluated materials. New experimental data are evaluated in a three-step process: (1) computing the phonon characteristics, (2) computing the dynamic structure factor (DSF) from the data, and (3) using the experimental setup to simulate the experimental data. All three steps have challenges, ranging from the need for a sufficiently general material simulation code—a processing code that can compute the corresponding DSF—to having a detailed layout of the instrument/beamline/facility where the data were measured. Whereas phonon characteristics of materials can be computed using various methods (molecular dynamics, density functional theory, etc.), a high-fidelity computation of the DSF and the simulation of the experiment based on the DSF is vital to the accuracy of the evaluation. The latter two steps can be achieved by using the two corresponding code systems developed by instrument scientists at the Spallation Neutron Source (SNS) at Oak Ridge National Laboratory: (1) OCLIMAX, a program that calculates the dynamic structure factor from DFT and MD simulation results, and (2) MCViNE, a Monte Carlo neutron ray-tracing program designed to simulate neutron scattering experiments. Recently, polyethylene and yttrium hydride were measured at the Wide Angular-Range Chopper (ARCS) and SEQUOIA instrument stations of the SNS. These experiments are simulated using the density functional theory code, the Cambridge Serial Total Energy Package (CASTEP), to compute its phonon characteristics (eigenvalues/vectors and PDOS), which is then processed using OCLIMAX to yield the DSF, and finally the data at each instrument station are simulated by the MCViNE for comparison to the measured data for evaluation. For comparison to conventional evaluation methods, the scattering data processed from OCLIMAX are compared against those processed from the LEAPR module of NJOY, and the results from MCViNE simulations are compared against previously used simplified beamline models implemented in the Monte Carlo N-Particle (MCNP) code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Solar-assisted Voltage Optimization Method for Transmission Solar Network Power System

This paper proposes a new formulation and solution algorithm that uses transmission level solar inverters to address the security-constrained optimal power flow (SCOPF) problem. The goal is to stabilize voltage fluctuations in transmission networks in base case and contingency scenarios, by using bulk solar power plant with a minimal number of post-contingency corrections. To achieve this goal, a two-stage volt/var optimization method is proposed to first correct all voltage violations with the volt-var alternating current optimal power flow (ACOPF) algorithm for a base case. Then a linearized SCOPF volt-var control algorithm is proposed to identify the corrective actions for all potential voltage violations in all contingency scenarios. The proposed method was tested and validated on a modified IEEE 118-bus system with solar photovoltaic (PV) data.

Photovoltaic, Volt/Var Control↗

Determination of Series Resistance in CdSeTe/CdTe Solar Cells by the Jsc–Voc Method

While commonly used in Si solar cell characterization, the Suns–Voc method of determining series resistance (Rs) is rarely used for CdTe and its alloys. However, it is advantageous relative to the slope method—commonly used in the CdTe community—because it measures series resistance at the maximum power point, at which a solar cell operates. Using the self-consistent predecessor to Suns–Voc, Jsc –Voc, , we determine Rs of two different CdSeTe/CdTe solar cell structures to be 0.96 and 2.72 Ωcm2, with repeated measurements showing little deviation

13 HYDRO ENERGY↗

Parameter Reduction of Composite Load Model Using Active Subspace Method

Over the past decades, the increasing penetration of distributed energy resources (DERs) has dramatically changed the power load composition in the distribution networks. The traditional static and dynamic load models can hardly capture the dynamic behavior of modern loads especially for fault-induced delayed voltage recovery (FIDVR) events. Thus, a more comprehensive composite load model with combination of static load, different types of induction motors, single-phase A/C motor, electronic load and DERs has been proposed by Western Electricity Coordinating Council (WECC). However, due to the large number of parameters and model complexity, the WECC composite load model (WECC CMLD) raises new challenges to power system studies. To overcome these challenges, in this paper, a cutting-edge parameter reduction (PR) approach for WECC CMLD based on active subspace method (ASM) is proposed. Firstly, the WECC CMLD is parameterized in a discrete-time manner for the application of the proposed method. Then, parameter sensitivities are calculated by discovering the active subspace, which is a lower-dimensional linear subspace of the parameter space of WECC CMLD in which the dynamic response is most sensitive. The interdependency among parameters can be taken into consideration by our approach. Finally, the numerical experiments validate the effectiveness and advantages of the proposed approach for WECC CMLD model.

active subspace↗