Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Massive Computation”

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A Segregated Approach for Modeling the Electrochemistry in the 3-D Microstructure of Li-Ion Batteries and Its Acceleration Using Block Preconditioners

Abstract Battery performance is strongly correlated with electrode microstructure. Electrode materials for lithium-ion batteries have complex microstructure geometries that require millions of degrees of freedom to solve the electrochemical system at the microstructure scale. A fast-iterative solver with an appropriate preconditioner is then required to simulate large representative volume in a reasonable time. In this work, a finite element electrochemical model is developed to resolve the concentration and potential within the electrode active materials and the electrolyte domains at the microstructure scale, with an emphasis on numerical stability and scaling performances. The block Gauss-Seidel (BGS) numerical method is implemented because the system of equations within the electrodes is coupled only through the nonlinear Butler–Volmer equation, which governs the electrochemical reaction at the interface between the domains. The best solution strategy found in this work consists of splitting the system into two blocks—one for the concentration and one for the potential field—and then performing block generalized minimal residual preconditioned with algebraic multigrid, using the FEniCS and the Portable, Extensible Toolkit for Scientific Computation libraries. Significant improvements in terms of time to solution (six times faster) and memory usage (halving) are achieved compared with the MUltifrontal Massively Parallel sparse direct Solver. Additionally, BGS experiences decent strong parallel scaling within the electrode domains. Last, the system of equations is modified to specifically address numerical instability induced by electrolyte depletion, which is particularly valuable for simulating fast-charge scenarios relevant for automotive application.

25 ENERGY STORAGE↗
DOE OSTI2022

Editorial: Themed issue on data-intensive water systems management and operation

The water sector increasingly looks at intensified instrumentation, data collection and automation as tools for daily use. Still, a massive opportunity remains to fully embrace emerging methods and technologies, such as artificial intelligence, data analytics, low-cost sensor hardware, and cloud computing. Indeed, sensing and automation technology has already infiltrated many facets of society. As such, the time is ripe to evaluate the role of novel technologies for systems monitoring, diagnostics, and automation of aquatic processes and large-scale water systems. When leveraged, the water sector will do more with less.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Fate of supernova progenitors in massive binary systems

ABSTRACT How massive stars end their lives depends on the core mass, core angular momentum, and hydrogen envelopes at death. However, these key physical facets of stellar evolution can be severely affected by binary interactions. In turn, the effectiveness of binary interactions itself varies greatly depending on the initial conditions of the binaries, making the situation much more complex. We investigate systematically how binary interactions influence core–collapse progenitors and their fates. Binary evolution simulations are performed to survey the parameter space of supernova progenitors in solar metallicity binary systems and to delineate major evolutionary paths. We first study fixed binary mass ratios ($q=M_2/M_1$ = 0.5, 0.7, and 0.9) to elucidate the impacts of initial mass and initial separation on the outcomes, treating separately Type Ibc supernova, Type II supernova, accretion-induced collapse (AIC), rapidly rotating supernova (Ibc-R), black hole formation, and long gamma ray burst (long GRB). We then conduct 12 binary population synthesis model calculations, varying the initial condition distributions and binary evolution parameters, to estimate various supernova fractions. We obtain a Milky Way supernova rate $R_{\rm SN} = (1.78$–$2.47) \times 10^{-2} \, {\rm yr}^{-1}$ which is consistent with observations. We find the rates of AIC, Ibc-R, and long GRB to be $\sim 1/100$ the rate of regular supernovae. Our estimated long GRB rates are higher than the observed long GRB rate and close to the low luminosity GRB rate, although care must be taken considering our models are computed with solar metallicity. Furthering binary modelling and improving the inputs one by one will enable more detailed studies of these and other transients associated with massive stars.

Astronomy & Astrophysics↗
DOE OSTI2021

The Effect of Warm Dark Matter on Early Star Formation Histories of Massive Galaxies: Predictions from the CROC Simulations

Several massive (M * > 108 M ⊙ ), high-redshift (z = 8–10) galaxies have recently been discovered to contain stars with ages of several hundred million years, pushing the onset of star formation in these galaxies back to z ~ 15. The very existence of stars formed so early may serve as a test for cosmological models with suppressed small-scale power (and, hence, late formation of cosmic structure). We explore the ages of the oldest stars in numerical simulations from the Cosmic Reionization On Computers project with cold dark matter (CDM) and two warm dark matter (WDM) cosmologies with 3 and 6 keV particles. There are statistically significant differences of ~5 Myr between average stellar ages of massive galaxies in CDM and 3 keV WDM, while CDM and 6 keV WDM are statistically indistinguishable. Even this 5 Myr difference, however, is much less than current observational uncertainties on the stellar population properties of high-redshift galaxies. The age distributions of all galaxies in all cosmologies fail to produce a substantial Balmer break, although uncertainties in dust attenuation are a potentially significant factor. Finally, we assess the convergence of our simulation predictions and find that the systematic uncertainties on individual galaxy properties are comparable to the differences between cosmologies, suggesting these differences may not be numerically robust.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

GPR_calculator: An on-the-fly surrogate model to accelerate massive nudged elastic band calculations

We present GPR_calculator, a package based on Python and C++ programming languages to build an on-the-fly surrogate model using Gaussian Process Regression (GPR) to approximate computationally expensive electronic structure calculations. The key idea is to dynamically train a GPR model during the simulation that can accurately predict energies and forces with uncertainty quantification. When the uncertainty is high, the costly electronic structure calculation is performed to obtain the ground truth data, which is then used to update the GPR model. To illustrate the effectiveness of GPR_calculator, we demonstrate its application in Nudged Elastic Band (NEB) simulations of surface diffusion and reactions, achieving 3-10 times acceleration compared to pure ab initio calculations. The source code is available at https://github.com/MaterSim/GPR_calculator.

Gaussian process regression↗
DOE OSTI2020

Low synchronization Gram–Schmidt and generalized minimal residual algorithms

The Gram–Schmidt process uses orthogonal projection to construct the A = QR factorization of a matrix. When Q has linearly independent columns, the operator P = I - Q(QTQ)-1QT defines an orthogonal projection onto Q⊥. In finite precision, Q loses orthogonality as the factorization progresses. A family of approximate projections is derived with the form P = I - QTQT, with correction matrix T. When T = (QTQ)-1, and T is triangular, it is postulated that the best achievable orthogonality is $\mathcal{O}(ε)\mathcal{K}(A)$. We present new variants of modified (MGS) and classical Gram–Schmidt algorithms that require one global reduction step. An interesting form of the projector leads to a compact WY representation for MGS. In particular, the inverse compact WY MGS algorithm is equivalent to a lower triangular solve. Our main contribution is to introduce a backward normalization lag into the compact WY representation, resulting in a $\mathcal{O}(ε)\mathcal{K}[r_0, AV_m])$ stable Generalized Minimal Residual Method (GMRES) algorithm that requires only one global reduce per iteration. Finally, further improvements in performance are achieved by accelerating GMRES on GPUs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

DART-PFLOTRAN: An ensemble-based data assimilation system for estimating subsurface flow and transport model parameters

Ensemble-based Data Assimilation (EDA), based on the Monte Carlo approach, has been effectively applied to estimate model parameters through inverse modeling in subsurface flow and transport problems. However, implementation of EDA approach involves a complicated workflow that include setting up and executing ensemble forward model simulations, processing observations and model simulation results for parameter updates, and repeat for sequential or iterative EDA. To facilitate the management of such workflow and lower the barriers for adopting EDA-based parameter estimation in subsurface science, we develop a generic software frame-work linking the Data Assimilation Research Testbed (DART) with a massively parallel subsurface FLOw and TRANsport code PFLOTRAN. The new DART-PFLOTRAN leverages both the core data assimilation engines in DART and the computational power afforded by PFLOTRAN. In addition to the standard smoother and filtering options, DART-PFLOTRAN enables an iterative EDA workflow based on the Ensemble Smoother for Multiple Data Assimilation method (ES-MDA) to improve estimation accuracy for nonlinear forward problems. Here, we verify the implementation of ES-MDA in DART-PFLOTRAN using two synthetic cases designed to estimate static permeability and dynamic exchange fluxes across the riverbed, respectively, from continuous temperature measurements made across a depth profile. One-dimensional hydro-thermal simulations are performed in both cases to relate temperature responses with the parameters of interest. In the case of estimating dynamic parameters, we demonstrate the flexibility of DART-PFLOTRAN in automating sequential ES-MDA workflow, which will significantly reduce the time researchers spend on managing complex workflows in similar applications. Both studies yield accurate estimations of the parameters compared to their synthetic truth, while ES-MDA leads to more accurate estimation when a high level of nonlinearity exist between observed responses and unknown parameters. With a code base in Python and Fortran, DART-PFLOTRAN paves the way for applications in large-scale subsurface inverse modeling by automating the complex workflow of sequential ES-MDA that can be executed on various computing platforms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Fracture Dynamics in Silicon Anode Solid-State Batteries

Solid-state batteries (SSBs) with silicon anodes could enable improved safety and energy density compared to lithium-ion batteries. However, degradation arising from the massive volumetric changes of silicon anodes during cycling is not well understood in solid-state systems. Here, we use operando X-ray computed microtomography to reveal micro- to macro-scale chemo-mechanical degradation processes of silicon anodes in SSBs. Mud-type channel cracks driven by biaxial tensile stress form across the electrode during delithiation. We also find detrimental cracks at the silicon/ solid electrolyte interface that form due to local reaction competition between neighboring domains of different sizes. Continuum phase-field damage modeling quantifies stress-driven channel cracking and shows that the lithiated silicon stress state is critical for determining the extent of interfacial fracture. This work reveals the mechanisms that govern SSBs compared to conventional lithium-ion batteries and provides guidelines for engineering chemomechanically resilient electrodes for high-energy batteries.

25 ENERGY STORAGE↗
DOE OSTI2023

noncompact_u1 (qed_m) v1.0.5

This software generates QED fields in which the photon has a finite mass, and also the 0-mode subtracted scheme. They are intended to be used with lattice QCD calculations to understand the QED corrections to nuclear physics processes that are being computed with lattice QCD. To the best of my knowledge, this will be the only publicly available software that generates background QED configurations with massive photons.

Walker-Loud, Andre Walker-Loud↗
DOE OSTI2024

Accelerating Thermochemical Equilibrium Calculations for Nuclear Reactor Applications

Thermochemical properties play a key role in modeling and simulation of several key phenomena in nuclear reactors. There has been an increasing interest in incorporating CALPHAD-based formulations in multiphysics simulations including for Molten Salt Reactors where knowledge of phase evolution of the salt and the chemical potentials of various elements are of utmost importance in source term analyses and redox control. However, the size of such simulations is often limited by the high computational cost of full thermodynamic equilibrium calculations. This work discusses the current efforts aimed at accelerating thermochemical equilibrium calculations for multiphysics simulations performed using the open-source finite element / finite volume code Multiphysics Object Oriented Simulation Environment (MOOSE) [1]. While several methods have been proposed for accelerating phase equilibrium calculations [2], most focus on relatively small systems and often rely on a- priori knowledge of the state-space of the system. Nuclear materials, however, are often multi-component systems owing to the evolution of composition under irradiation and an approach based on a-priori mapping of phase diagram is often not enough. This work is aimed at demonstrating an on-the-fly surrogate modeling framework that uses active learning to reduce the number of full equilibrium calculations that must be performed. By combining with efficient coupling approaches, the surrogate framework helps in reducing the computational cost of thermodynamic equilibrium informed multiphysics simulations of nuclear materials. The performance is benchmarked against full coupling with the thermochemistry library Thermochimica [3]. This work uses a machine learning based approach for constructing surrogate models to predict the stable phases in a multicomponent system. The surrogates were constructed using neural networks and Gaussian process classification. In this work, we compare the relative performance of the two methods. We also demonstrate the use of caching previous calculations by interpolating the values from nearest neighbors. References [1] Lindsay, A.D., et al. "2.0 – MOOSE: Enabling massively parallel multiphysics simulation", SoftwareX, 20 (2022): 101202. [2] Roos, W.A. and Zietsman J.H. "Accelerating complex chemical equilibrium calculations – A Review", Calphad, 77 (2022): 102380. [3] Piro, M.H.A., et al. "The thermochemistry library Thermochimica", Computational Materials Science, 67 (2013): 266-272.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Towards reverse mode automatic differentiation of Kokkos-based codes

Derivative computation is a key component of optimization, sensitivity analysis, uncertainty quantification, and the solving of nonlinear problems. Automatic differentiation (AD) is a powerful technique for evaluating such derivatives, and in recent years, has been integrated into programming environments such as Jax, PyTorch, and TensorFlow to support derivative computations needed for training of machine learning models, facilitating wide-spread use of these technologies. The C++ language has become the de facto standard for scientific computing due to numerous factors, yet language complexity has made the wide-spread adoption of AD technologies for C++ difficult, hampering the incorporation of powerful differentiable programming approaches into C++ scientific simulations. This is exacerbated by the increasing emergence of architectures, such as GPUs, with limited memory capabilities and requiring massive thread-level concurrency. C++ AD tools must effectively use these environments to bring novel scientific simulations to next-generation DOE experimental and observational facilities. In this project, we investigated source transformation-based automatic differentiation using LLVM compiler infrastructure to automatically generate portable and efficient gradient computations of Kokkos-based code. We have demonstrated that our proposed strategy is feasible by investigating the usage of a prototype LLVM-based source transformation tool to generate gradients of simple functions made of sequences of simple Kokkos parallel regions. Speedups of up to 500x compared to Sacado were observed on NVIDIA V100 GPU.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Reaching new peaks for the future of the CMS HTCondor Global Pool

The CMS experiment at CERN employs a distributed computing infrastructure to satisfy its data processing and simulation needs. The CMS Submission Infrastructure team manages a dynamic HTCondor pool, aggregating mainly Grid clusters worldwide, but also HPC, Cloud and opportunistic resources. This CMS Global Pool, which currently involves over 70 computing sites worldwide and peaks at 350k CPU cores, is employed to successfully manage the simultaneous execution of up to 150k tasks. While the present infrastructure is sufficient to harness the current computing power scales, CMS latest estimates predict a noticeable expansion in the amount of CPU that will be required in order to cope with the massive data increase of the High-Luminosity LHC (HL-LHC) era, planned to start in 2027. This contribution presents the latest results of the CMS Submission Infrastructure team in exploring and expanding the scalability reach of our Global Pool, in order to preventively detect and overcome any barriers in relation to the HL-LHC goals, while maintaining high effciency in our workload scheduling and resource utilization.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Clustering at Massive Scale

ClaMS provides hierarchical clustering technology for use on massive, high-dimensional datasets that require distributed memory for processing. The algorithm employed is inspired by the popular HDBSCAN algorithm but makes use of computational kernels better suited for distributed computing. ClaMS is built on scalable nearest neighbor graph construction, metric forest completion, and approximate minimum spanning tree techniques.

Stanley, ThomasA [Lawrence Livermore National Labo↗
DOE OSTI2020

Enabling Highly Efficient Capsule Networks Processing Through A PIM-Based Architecture Design

In recent years, the CNNs have achieved great successes in the image processing tasks, e.g., image recognition and object detection. Unfortunately, traditional CNN's classication is found to be easily misled by increasingly complex image features due to the usage of pooling operations, hence unable to preserve accurate position and pose information of the objects. To address this challenge, a novel neural network structure called Capsule Network has been proposed, which introduces equivariance through capsules to signicantly enhance the learning ability for image segmentation and object detection. Due to its requirement of performing a high volume of matrix operations, CapsNets have been generally accelerated on modern GPU platforms that provide highly optimized software library for common deep learning tasks. However, based on our performance characterization on modern GPUs, CapsNets exhibit low effciency due to the special program and execution features of their routing procedure, including massive unshareable intermediate variables and intensive syn- chronizations, which are very dicult to optimize at software level. To address these challenges, we propose a hybrid computing architecture design named PIM-CapsNet. It preserves GPU's on-chip computing capability for accelerating CNN types of layers in CapsNet, while pipelining with an off-chip in-memory acceleration solution that effectively tackles routing procedure's ineffciency by leveraging the processing-in-memory capability of today's 3D stacked memory. Using routing procedure's inherent parallellization feature, our design enables hierarchical improvements on CapsNet inference effciency through minimizing data movement and maximizing parallel processing in memory. Evaluation results demonstrate that our proposed design can achieve substantial improvement on both performance and energy savings for CapsNet inference, with almost zero accuracy loss. The results also suggest good performance scalability in optimizing the routing procedure with increasing network size.

Zhang, Xingyao↗
DOE OSTI2022

Cabana: A Performance Portable Library for Particle-Based Simulations

Particle-based simulations are ubiquitous throughout many fields of computational science and engineering, spanning the atomistic level with molecular dynamics (MD), to mesoscale particle-in-cell (PIC) simulations for solid mechanics, device-scale modeling with PIC methods for plasma physics, and massive N-body cosmology simulations of galaxy structures, with many other methods in between (Hockney & Eastwood, 1989). While these methods use particles to represent significantly different entities with completely different physical models, many low-level details are shared including performant algorithms for short- and/or long-range particle interactions, multi-node particle communication patterns, and other data management tasks such as particle sorting and neighbor list construction. Cabana is a performance portable library for particle-based simulations, developed as part of the Co-Design Center for Particle Applications (CoPA) within the Exascale Computing Project (ECP) (Alexander et al., 2020). The CoPA project and its full development scope, including ECP partner applications, algorithm development, and similar software libraries for quantum MD, is described in (Mniszewski et al., 2021). Cabana uses the Kokkos library for on-node parallelism (Edwards et al., 2014; Trott et al., 2022), enabling simulation on multi-core CPU and GPU architectures, and MPI for GPU-aware, multi-node communication. Cabana provides particle simulation capabilities on almost all current Kokkos backends, including serial execution, OpenMP (including OpenMP-Target for GPUs), CUDA (NVIDIA GPUs), HIP (AMD GPUs), and SYCL (Intel GPUs), providing a clear path for the coming generation of accelerator-based exascale hardware. Cabana builds on Kokkos by providing new particle data structures and particle algorithms resulting in a similar execution policy-based, node-level programming model that is intended to be used in addition to the core Kokkos library within an application. Cabana is designed as an application and physics agnostic, but particle-specific toolkit which can either be used to generate a new application, or to be used as needed in existing applications at various levels of invasiveness including through interfaces that wrap user memory in existing data structures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Primordial black hole dark matter: A quantitative parameter sensitivity comparison across formation mechanisms and particle candidates

Primordial black holes (PBHs) in the asteroid-mass window ( 10 17 – 10 22 g ) can account for all of the dark matter without violating any observational constraint, yet are routinely dismissed as fine-tuned. I put that dismissal to the test by applying three complementary sensitivity measures uniformly across a broad landscape: three noninflationary PBH production mechanisms, six classes of inflationary PBH models, and seven particle dark matter benchmarks, all evaluated against the same observable target. Three distinct naturalness universality classes emerge, determined entirely by the analytic structure of the abundance map rather than by the nature of the dark matter candidate. Biased-domain-wall PBHs, in their least model-dependent (free- V b ) form, have the same low sensitivity, Δ = 4.5 , as off-resonance weakly interacting massive particles and freeze-in particles ( Δ = 2 ), a sensitivity that, because it is constant over the entire parameter space of the construction, also coincides trivially with its own Wilson-normalized average within that parameter space (Section Definition and conventions), an equivalence that concerns only the space over which Δ is computed and is not a naturalness statement about the construction as a whole; a further reduction to Δ = 2 is possible only under the additional, independently motivated but not required, assumption that the domain-wall bias is generated by Planck-suppressed operators; early matter-domination PBHs occupy an intermediate tier alongside coannihilating weakly interacting massive particles (WIMPs), unified by a structural identity in which the sensitivity measure equals the logarithm of the ratio of the formation scale to the matter–radiation equality scale; first-order phase transition PBHs, once the more accurate super-exponential collapse probability is used in place of the single-exponential approximation, instead belong to the same highly sensitive tier as resonant WIMP annihilation and single-field inflationary collapse, for a structurally distinct reason; single-field ultraslow-roll inflationary collapse is severely tuned for a distinct reason: a double exponential in which the power spectrum amplitude is itself exponentially sensitive to the inflaton potential coefficients, on top of the exponential collapse sensitivity of the abundance map. My main conclusion is that the claim that PBH dark matter is generically fine-tuned conflates the worst case with a landscape spanning every naturalness tier. The Barbieri-Giudice sensitivity computed here and the Wilson-normalized measure of Iovino and Riotto answer distinct and mutually consistent questions about the same construction, a distinction I clarify within the two-layer decomposition.

Profumo, Stefano [University of California, Santa ↗
DOE OSTI2025

A Portfolio Approach to Massively Parallel Bayesian Optimization

One way to reduce the time of conducting optimization studies is to evaluate designs in parallel rather than just one-at-a-time. For expensive-to-evaluate black-boxes, batch versions of Bayesian optimization have been proposed. They work by building a surrogate model of the black-box to simultaneously select multiple designs via an infill criterion. Still, despite the increased availability of computing resources that enable large-scale parallelism, the strategies that work for selecting a few tens of parallel designs for evaluations become limiting due to the complexity of selecting more designs. It is even more crucial when the black-box is noisy, necessitating more evaluations as well as repeating experiments. Here we propose a scalable strategy that can keep up with massive batching natively, focused on the exploration/exploitation trade-off and a portfolio allocation. We compare the approach with related methods on noisy functions, for mono and multi-objective optimization tasks. These experiments show orders of magnitude speed improvements over existing methods with similar or better performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Two-loop master integrals for leading-color $$ pp\to t\overline{t}H $$ amplitudes with a light-quark loop

Abstract We compute the two-loop master integrals for leading-color QCD scattering amplitudes including a closed light-quark loop in$$ t\overline{t}H $$ t t ¯ H production at hadron colliders. Exploiting numerical evaluations in modular arithmetic, we construct a basis of master integrals satisfying a system of differential equations inϵ-factorized form. We present the analytic form of the differential equations in terms of a minimal set of differential one-forms. We explore properties of the function space of analytic solutions to the differential equations in terms of iterative integrals which can be exploited for studying the analytic form of related scattering amplitudes. Finally, we solve the differential equations using generalized series expansions to numerically evaluate the master integrals in physical phase space. As the first computation of a set of two-loop seven-scale master integrals, our results provide valuable input for analytic studies of scattering amplitudes in processes involving massive particles and a large number of kinematic scales.

Physics↗