SEARCH · Engineering Papers
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.
NLOX is a computer program for calculations in high-energy particle physics. It provides fully renormalized scattering matrix elements in the Standard Model of particle physics, up to one-loop accuracy for all possible coupling-power combinations in the strong and electroweak couplings, and for processes with up to six external particles.
Pilgrim is a program written in Python and designed to use direct dynamics in the calculation of thermal rate constants of chemical reactions by the variational transition state theory (VTST), based on electronic structure calculations for the potential energy surface. Pilgrim can also simulate reaction mechanisms using kinetic Monte Carlo (KMC). For reaction processes with many elementary steps, the rate constant of each of these steps can be calculated by means of conventional transition state theory (TST) or by using VTST. In the current version, Pilgrim can evaluate thermal rates using the canonical version of reaction-path VTST, which requires the calculation of the minimum energy path (MEP) associated with each elementary step or transition structure. Multi-dimensional quantum effects can be incorporated through the small-curvature tunneling (SCT) approximation. These methodologies are available both for reactions involving a single structure of the reactants and the transition state and also for reactions involving flexible molecules with multiple conformations of the reactant and/or of the transition state. For systems with many conformers, the program can evaluate each of the elementary reaction rate constants by multipath canonical VTST or multi-structural VTST. Moreover, the reactant can be unimolecular or bimolecular. Torsional anharmonicity can be incorporated through either the MSTor or the Q2DTor programs. Dual-level calculations are also available in Pilgrim: automatic high-level single-point energies can be used to correct the energy of reactants, transition states, products, and MEP points using the interpolated single-point energies (ISPE) algorithm. When the rate constants of all the chemical processes of interest are known, by means of their calculation using Pilgrim or alternatively through analytical fits to the rate constants as functions of temperature, it is possible to simulate a multistep mechanism under specified laboratory conditions using KMC. Finally, this algorithm allows performing a kinetic simulation to monitor the evolution of each chemical species with time and obtain the product yields.
Accurate RF (Radio Frequency) simulations of fusion systems like ITER require the definition of high-fidelity analysis geometries that include detailed antenna, reactor wall, and physics regions. Here, this paper will describe a workflow for the execution of adaptive high-performance simulations of RF fusion systems. In this workflow, the simulation input consists of a CAD model attributed with the needed analysis attributes. The analysis mesh is automatically generated and the analysis steps are executed using the time-harmonic Maxwell's equations solved using high-order Nédélec finite elements. A patch recovery-based error estimator is used to drive a conforming mesh adaptation procedure.
We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses a localized Tucker tensor basis computed from an additive separable approximation to the Kohn-Sham Hamiltonian. The discrete Kohn-Sham problem is solved using Chebyshev filtered subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. In conclusion, the computational performance of the TTDFT code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms.
We introduce DeePKS-kit, an open-source software package for developing machine learning based energy and density functional models. DeePKS-kit is interfaced with PyTorch, an open-source machine learning library, and PySCF, an ab initio computational chemistry program that provides simple and customized tools for developing quantum chemistry codes. It supports the DeePHF and DeePKS methods. In addition to explaining the details in the methodology and the software, we also provide an example of developing a chemically accurate model for water clusters.
Not Available
Reconstructing hadron spectral functions through Euclidean correlation functions are of the important missions in lattice QCD calculations. However, in a Källen–Lehmann (KL) spectral representation, the reconstruction is observed to be ill-posed in practice. It is usually ascribed to the fewer observation points compared to the number of points in the spectral function. In this paper, by solving the eigenvalue problem of continuous KL convolution, we show analytically that the ill-posedness of the inversion is fundamental and it exists even for continuous correlation functions. We discussed how to introduce regulators to alleviate the predicament, in which include the Artificial Neural Networks (ANNs) representations recently proposed by the Authors in another study. The uniqueness of solutions using ANNs representations is manifested analytically and validated numerically. Reconstructed spectral functions using different regularization schemes are also demonstrated, together with their eigen-mode decomposition. We observe that components with large eigenvalues can be reliably reconstructed by all methods, whereas those with low eigenvalues need to be constrained by regulators.
Not Available
FITEVT is a FORTRAN program designed to analyze recorded arrival times of nuclear-decay events affected by dead-time. Here, the primary goal of the program is precise and accurate determination of half-lives. Its method involves imposition of a known sufficiently long extending dead-time to the recorded event sequence, so that the original dead-time effects are completely obliterated and the remaining live-times of the survived events are known exactly. Upon completion of the analysis, the arrival-time spectrum and the live-time spectrum are predicted and compared to those constructed from the survived events.
The thickness uniformity of chemical vapor deposited (CVD) diamond coatings on non-planar, non-stationary substrates depends on both the intrinsic instantaneous coating thickness distribution (ICTD) of the coating conditions used and, if applicable, on the frequency of substrate reorientation. While important for many CVD diamond applications, the relative impact of the ICTD and substrate reorientation on the coating thickness uniformity has not been studied. In this work, we systematically investigate the effect of these factors for microwave-plasma chemical vapor deposition (MPCVD) of diamond (referred to as high density carbon (HDC) in the inertial confinement fusion (ICF) community) coatings on spherical, rolling substrates. This coating technique is used to fabricate capsules for ICF experiments, which require extreme coating uniformity with <0.3 % thickness variation (so-called Mode 1 or M1) to ensure symmetric compression of imploding targets. To extract the otherwise unobservable reorientation timescale (Δt), Monte Carlo simulations were performed using experimental ICTD data as input. This combined approach confirms scaling relationships between the substrate reorientation timescale as well as coating thickness and coating uniformity, as expected from a 3D random walk. Simulations confirm that M1 is Rayleigh-distributed and scales as (Δt) 1/2 , consistent with the randomization of two angles that determine orientation of a sphere. We also demonstrate that, under the conditions studied, Δt is the dominant factor in determining thickness uniformity while the intrinsic ICTD has minimal impact. Finally, experiments show that Δt can be affected by total batch size under constant agitation conditions due to space constraints that limit the capsule reorientation kinetics. In conclusion, this study highlights the utility of a combined experiment-simulation approach as a general methodology for understanding and improving coating uniformity on non-planar, non-stationary substrates.
Not Available
Scientific workflows provide an opportunity for declarative computational experiment design in an intuitive and efficient way. A distributed workflow is typically executed on a variety of resources, and it uses a variety of computational algorithms or tools to achieve the desired outcomes. Such a variety imposes additional complexity in scheduling these workflows on large scale computers. As computation becomes more distributed, insights into expected workload that a workflow presents become critical for effective resource allocation. In this paper, we present a modular framework that leverages Machine Learning for creating precise performance predictions of a workflow. The central idea is to partition a workflow in such a way that makes the task of forecasting each atomic unit manageable and gives us a way to combine the individual predictions efficiently. We recognize a combination of an executable and a specific physical resource as a single module. This gives us a handle to characterize workload and machine power as a single unit of prediction. Overall, our modular technique of creating atomic modules and deployment of longest-path approach to estimate workflow performance, allows the framework to adapt to highly complex nested directed acyclic workflows and scale to new scenarios, since it does not make assumptions of underlying workflow structure. We present performance estimation results of independent workflow modules executed on the XSEDE SDSC Comet cluster using various Machine Learning algorithms. The results provide insights into the behavior and effectiveness of different algorithms in the context of scientific workflow performance prediction.
Existing electrical generating stations must operate with greater flexibility due to increasing renewable energy penetration on the electrical grid, and many coal-fired power stations have transitioned away from baseload operation to load-following operation to aid in grid stability. In cases where multiple independently controlled cooling tower cells are used in parallel for the cooling purposes of such stations, there is an opportunity to increase plant efficiency through data-driven optimization across their full load ranges. This work presents a novel application of real-time optimization using machine learning and particle swarm optimization on a multi-cell induced-draft cooling tower servicing a coal-fired power station under variable load. This is the first work to demonstrate simultaneous optimization of a multi-cell cooling tower, in addition to using machine learning for closed-loop control on a cooling tower. A novel control configuration is presented that ensures original control logic is not adversely affected and that the overall plant process is not disrupted using only existing hardware and operational data. To verify this methodology, the 12 independent cooling tower cells are simulated in parallel using historic operating data to demonstrate the effectiveness of real-time optimization compared to current practice. An artificial neural network is trained to predict overall cooling tower power consumption using only operational data and ambient conditions with an R2 value of greater than 0.96. The real-time optimization using particle swarm yields 6.7% annual energy usage savings compared to current practices, although the extent of the real-time savings varies greatly with both plant load and environmental conditions. This is particularly significant for a variable load situation because frequent ramping typically results in reduced overall efficiency. Furthermore, this proposed AI-based solution presents an opportunity to improve the overall heat rate of a load-following coal-fired power plant without the need to perform extensive first-principles modeling or add additional hardware to the cooling tower, resulting in more resources conserved and less overall emissions per unit of electricity generated.
We design and implement a novel algorithm for computing a multilevel Monte Carlo (MLMC) estimator of the joint cumulative distribution function (CDF) of a vector-valued quantity of interest in problems with random input parameters and initial conditions. Our approach combines MLMC with stratified sampling of the input sample space by replacing standard Monte Carlo at each level with stratified Monte Carlo initialized with proportionally allocated samples. We show that the resulting stratified MLMC (sMLMC) algorithm is more efficient than its standard MLMC counterpart due to the additional variance reduction provided by the stratification of the random parameter's domain, especially at the coarsest levels. Additional computational cost savings are obtained by smoothing the indicator function with a Gaussian kernel, which proves to be an efficient and robust alternative to recently developed polynomial-based techniques.
We report a novel methodology for accurate treatment of viscous terms in evaporation problems. The proposed scheme is an extension of the sharp viscous treatment of Kang et al. (2000) [7] to 3D phase change problems. To ensure accuracy and grid converging solutions, a new implicit approach to computing viscous fluxes across the phase interfaces is proposed, which was previously unavailable in fixed grid numerical schemes. Analytical relations were derived for the jump in velocity gradients across the 2D and 3D phase interfaces, an important constituent of the proposed scheme. The relations show a non-vanishing jump in the tangential gradients across the phase interface that are associated with evaporative flux and interfacial curvature. The proposed methodology demonstrated first order accuracy in canonical test cases. It is general and applicable to arbitrarily oriented interfaces, and can be readily implemented in existing evaporation flow solvers.
A framework is introduced that leverages known physics to reduce overfitting in machine learning for scientific applications. The partial differential equation (PDE) that expresses the physics is augmented with a neural network that uses available data to learn a description of the corresponding unknown or unrepresented physics. Training within this combined system corrects for missing, unknown, or erroneously represented physics, including discretization errors associated with the PDE's numerical solution. For optimization of the network within the PDE, an adjoint PDE is solved to provide high-dimensional gradients, and a stochastic adjoint method (SAM) further accelerates training. Additionally, the approach is demonstrated for large-eddy simulation (LES) of turbulence. High-fidelity direct numerical simulations (DNS) of decaying isotropic turbulence provide the training data used to learn sub-filter-scale closures for the filtered Navier–Stokes equations. Out-of-sample comparisons show that the deep learning PDE method outperforms widely-used models, even for filter sizes so large that they become qualitatively incorrect. It also significantly outperforms the same neural network when a priori trained based on simple data mismatch, not accounting for the full PDE. Measures of discretization errors, which are well-known to be consequential in LES, point to the importance of the unified training formulation's design, which without modification corrects for them. For comparable accuracy, simulation runtime is significantly reduced. A relaxation of the typical discrete enforcement of the divergence-free constraint in the solver is also successful, instead allowing the DPM to approximately enforce incompressibility physics. Since the training loss function is not restricted to correspond directly to the closure to be learned, training can incorporate diverse data, including experimental data.
The immersed boundary method (IBM) with direct forcing is very popular in the simulation of rigid particulate flows. In the IBM, an interaction force is introduced at the interface between fluid and particle in order to approximate the no-slip boundary condition. The interaction force is calculated through dividing the velocity difference (or error) between fluid and particle at the interface by the time step. Here, a dynamic equation for the velocity difference is derived. Additionally, analyses on the dynamic equation provide a few new findings: (i) The interaction force is the solution of a least-squares error problem, with the direct implication that the Lagrangian marker distribution has no effect on the large scale flow structure once the distribution of Lagrangian markers become saturated along the interface (i.e., each marker remains properly correlated with all its neighbors); (ii) The Lagrangian volume-weight is a relaxation factor to control how fast the velocity error decays to the ideal value of zero; (iii) The optimal choice of the Lagrangian volume-weight is the largest value permissible by a stability condition. A comprehensive convergence analysis with regard to the spatial and temporal resolution is presented for the velocity error and also for the shear-stress and surface pressure. In three simple canonical problems, it is analytically and numerically shown that the IBM results converge to the theoretical solutions obtained with precise imposition of no-slip and no-penetration boundary conditions. It is observed that it is not necessary to match the Lagrangian marker volume-weight to that of the local Eulerian cell volume and in fact this matching leads to lower than optimal computational efficiency. However, it is found that extremely high Eulerian grid resolution and small time step have to be used to obtain high precision simulation results. Especially, the time step should be inversely proportional to the particle Reynolds number for low Reynolds number flows. For high frequency oscillation problems, the grid size needs to be reduced by a factor of the square root of the frequency, and the time step to be reduced by a factor of the frequency. The theoretical findings here can be used to alleviate the technical difficulties in simulating non-spherical particles by not requiring the Lagrangian marker distribution to match the Eulerian grids and also in the implementation of IBM on non-uniform Eulerian grids. The present work also provides simple practical guidance on the choice of temporal and spatial resolution so as to control the simulation error a priori.