Scalable uncertainty quantification for deep operator networks using randomized priors
Not provided.
Engineering↗
SEARCH · Engineering Papers
Results for “Library”
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.
Finite elements for Matérn-type random fields: Uncertainty in computational mechanics and design optimization
This work highlights an approach for incorporating realistic uncertainties into scientific computing workflows based on finite elements, focusing on prevalent applications in computational mechanics and design optimization. We leverage Matérn-type Gaussian random fields (GRFs) generated using the SPDE method to model aleatoric uncertainties, including environmental influences, variating material properties, and geometric ambiguities. Our focus lies on delivering practical GRF realizations that accurately capture imperfections and variations and understanding how they impact the predictions of computational models as well as the shape and topology of optimized designs. Here we describe a numerical algorithm based on solving a generalized SPDE to sample GRFs on arbitrary meshed domains. The algorithm leverages established techniques and integrates seamlessly with the open-source finite element library MFEM and associated scientific computing workflows, like those found in industrial and national laboratory settings. Our solver scales efficiently for large-scale problems and supports various domain types, including surfaces and embedded manifolds. We showcase its versatility through biomechanics and topology optimization applications, emphasizing the potential to influence these domains. The flexibility and efficiency of SPDE-based GRF generation empowers us to run large-scale optimization problems on 2D and 3D domains, including finding optimized designs on embedded surfaces, and to generate design features and topologies beyond the reach of conventional techniques. Moreover, these capabilities allow us to model and quantify geometric uncertainties on reconstructed submanifolds, such as the interpolated surfaces of cerebral aneurysms provided by postprocessing CT scans. In addition to offering benefits in these specific domains, the proposed techniques transcend specific applications and generalize to arbitrary forward and backward problems in uncertainty quantification involving finite elements.
97 MATHEMATICS AND COMPUTING↗
Production of graphene-derivatives using organic molecules for supercapacitors and beyond
Graphene is rapidly expanding for applications ranging from nanoelectronics to space exploration. A material with such enormous potential requires a variety of synthesis methods. Here, we report a library of relatively sustainable redox-active organic molecules for the reduction of graphene oxide (GO) namely N,N,N',N'-tetramethyl-p-phenylenediamine (TMPD), 7,7,8,8-tetracyanoquinodimethane (TCNQ), ferrocene (Ferro), and decamethylferrocene (DFerro). Among them, the reduction of GO using TMPD starts even with simple hand-shaking for just a few minutes. By controlling the sonication time under ambient conditions, one can control the electronic properties of the reduced graphene oxide (rGO). The resulting free-standing films delivered a capacitance of 185 F/g when tested them as supercapacitor electrodes. We also demonstrated that TMPD can exfoliate graphite into few-layer graphene sheets with simple sonication. Here, we further show that under mild heating, these molecules can serve as dopants during the reduction process to produce nitrogen-doped graphene. Our results may guide researchers to explore sustainable organic molecules for the large-scale production of graphene-based materials for diverse applications.
36 MATERIALS SCIENCE↗
Automatically generated model for light alkene combustion
Light alkenes are common combustion intermediates for a variety of fuels. Therefore, understanding their oxidation and pyrolysis chemistry is key to building detailed mechanisms for heavier fuels. This work was focused on the development and evaluation of a detailed kinetic mechanism suitable for the combustion of light alkenes up to C 4 without the use of tuned parameters, instead, the parameter values come from first principles or direct measurements. The generated mechanism accurately estimates the laminar burning velocity (S u ) and ignition delay time (IDT) of light alkenes available in the literature, which represent fundamental combustion properties at a wide range of conditions. Because each parameter is thought to have a physically realistic value, not tuned to these measurements, the new model could be used as a sub-mechanism in models for other applications. The reaction network was generated with the open-source Reaction Mechanism Generator (RMG) software. Sensitivity analyses were performed under wide ranges of temperatures and pressures, allowing for the identification of the most impactful species and reactions. Based on these, a comprehensive thermochemistry database, including calculations on 550 molecules performed in this work at the CBS-QB3 level of theory, and a kinetic library, including theoretically-derived reaction rates retrieved from the literature, were built and used in the mechanism generation. The developed mechanism was compared against several existing detailed kinetic mechanisms for ethene, propene, 1-butene, 2-butene, and isobutene. Here, the newly generated model is the most accurate among the ones analyzed, in terms of fractional bias and normalized mean square error. Hence, this new model was used to analyze the chemistry of alkene combustion. Key rate coefficients were compared, to identify the cause of deviations between the models and possible areas for further improvements.
09 BIOMASS FUELS↗
Rapid generation of optimal generalized Monkhorst-Pack grids
In this report computational modeling of the properties of crystalline materials has become an increasingly important aspect of materials research, consuming hundreds of millions of CPU-hours at scientific computing centers around the world each year, if not more. A routine operation in such calculations is the evaluation of integrals over the Brillouin zone. We have previously demonstrated that performing such integrals using generalized Monkhorst-Pack k-point grids can roughly double the speed of these calculations relative to the widely-used traditional Monkhorst-Pack grids. However the generation of optimal generalized Monkhorst-Pack grids is not implemented in most software packages due to the computational cost and difficulty of identifying the best grids. To address this problem, we present new algorithms that allow rapid generation of optimal generalized Monkhorst-Pack grids on the fly. We demonstrate that the grids generated by these algorithms are on average significantly more efficient than those generated using existing algorithms across a range of grid densities. For grids that correspond to a real-space supercell with at least 50 Å between lattice points, which is sufficient to converge density functional theory calculations within 1 meV/atom for nearly all materials, our algorithm finds optimized grids in an average of 0.19 s on a single processing core. To facilitate the widespread adoption of this approach, we present new open-source tools including a library designed for integration with third-party software packages.
36 MATERIALS SCIENCE↗
Machine learning enabled discovery of superhard and ultrahard carbon polymorphs
The demand for multifunctional materials has motivated the move from near-equilibrium materials to metastable i.e. out-of-equilibrium phases that can meet several desired target properties. The search for such metastable phases with exotic properties is non-trivial and often serendipitous. Inverse design approaches based on evolutionary search have been powerful tools, but such traditional searches have focused on identifying primarily stable and metastable materials with the lowest enthalpy. The inverse design of materials, with a focus on a desired property such as, for example, hardness is a challenging task because of the expensive computational cost involved in sampling multiple structures. The recent advances in machine learning have brought new powerful AI techniques to the forefront which can potentially revolutionize the inverse design and discovery of materials, especially metastable phases capable of meeting multifunctionality. Here, in this work, we develop and apply an automated reinforcement learning workflow for inverse design that integrates first principles physics and atomistic simulations with machine learning (ML), and high-performance computing to allow rapid exploration of the superhard and ultrahard metastable phases of Carbon. We demonstrate an automatic machine learning based inverse design workflow to map new undiscovered metastable states ranging from near equilibrium to those far-from-equilibrium that satisfy multiple property objectives, specifically bulk moduli, shear moduli and hardness. We create a comprehensive library of carbon stable and metastable phases with varying hardness and subsequently shortlist 10 top performing candidate carbon structures, including two newly reported phases, based on their hardness and characterize their temperature dependent mechanical properties. A neural network model is built using featurization of allotropes of carbon to predict the quasi-harmonic Gibbs free energies. The Gibbs free energies of the top performing phases are analyzed to get an estimate of the experimental synthesizability of these superhard and ultrahard carbon phases. In general, we show using machine learning based inverse design approaches how hitherto inaccessible metastable states can be identified and potentially synthesized to meet the demand for multifunctional materials.
Balasubramanian, Karthik [Univ. of Illinois, Chica↗
Toucan: A performance portable, scalable implementation of the DECA algorithm
In the field of additive manufacturing (AM), cellular automata (CA) is extensively used to simulate microstructural evolution during solidification. However, while traditional CA approaches are relatively fast, they still require a substantial number of time steps, are limited to moderate volumes, and are relatively difficult to improve through parallelism due to the highly localized nature of the solidification front. Here, to address these issues of time to solution and load balancing, we introduce Toucan, a parallel, performance-portable, and scalable code written in C++ with the Kokkos library that leverages the discrete event inspired cellular automata (DECA) algorithm to perform parallel-in-time (PinT) grain growth simulations. Toucan effectively mitigates load balancing issues by distributing the computational workload more evenly across processors, enhancing scalability and efficiency. We conduct both strong and weak scaling studies on up to 64 GPUs on the Frontier supercomputer, demonstrating that Toucan significantly outperforms the current state-of-the-art, time-stepped CA code, ExaCA, on both single and multi-GPU simulations. Even in AM-specific weak scaling scenarios, Toucan maintains near-ideal scaling, in contrast to the linear increase observed with ExaCA due to the moving laser raster pattern. This study highlights Toucan’s potential to transform microstructural simulations in AM by radically improving both efficiency and scalability over existing methods.
36 MATERIALS SCIENCE↗
Massively parallel phase-field simulations targeting exascale
The interface thickness in the phase-field (PF) method limits its simulation scales. Consequently, large-scale PF simulations become prohibitively expensive for resolving the extremely fine microstructures that typically form during rapid solidification processing. This challenge is significant in predicting microstructure evolution in metal additive manufacturing and has been identified by the United States Department of Energy’s Exascale Computing Project. Here, to address this, we develop a multi-GPU and MPI-based massively parallel simulation code, utilizing state-of-the-art algorithms, software, and libraries, for large-scale three-dimensional (3D) PF simulations. We report the first GPU-parallel PF simulations on Frontier (currently the second TOP500 exascale cluster) and Summit machines, taking dendritic growth as an example problem. We evaluate the parallel performance of our implementation using scaling studies with more than 24 000 GPUs (among the largest known computations to date) and the acceleration performance using large-scale simulations of dendritic growth in 3D. Finally, massively parallel GPUs in these supercomputers enabled the first coupled multiscale simulations of laser melting and subsequent dendritic solidification on the scale of a full melt-pool, demonstrating the feasibility of performing PF simulations with a point total over 2 billion grid points within an acceptable time.
Exascale↗
Optimization strategies for produced water networks with integrated desalination facilities
Optimal management and desalination of produced water is a major challenge for U.S. oil and gas development. Integrating rigorous desalination models into multi-period produced water network optimization problems presents several hurdles, which need to be tackled using advanced optimization strategies. Here, in this work, a novel multi-period produced water network formulation with separate solid and liquid flows is introduced to avoid singularities at zero flows. Rigorous steady state desalination models based on mechanical vapor recompression are embedded at the desalination sites in the network model. An integrated optimization formulation is developed to co-optimize the design of desalination units along with the operation of the network. Furthermore, a more robust approach based on the trust region filter method is developed to efficiently integrate complex desalination models into the multi-period planning problem. Both optimization approaches are demonstrated on a produced water network from the PARETO library (Drouven et al., 2022) using thermal desalination units. Our results show that while the TRF and integrated approaches have comparable solve times, the TRF approach has better performance reliability in terms of solver convergence. Furthermore, the optimal solution obtained by embedding rigorous models into the network is significantly different than when desalination costs are approximated using simple cost models, which motivates further research in this field.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Multirate partitioned Runge–Kutta methods for coupled Navier–Stokes equations
Earth system models are complex integrated models of atmosphere, ocean, sea ice, and land surface. Coupling the components can be a significant challenge due to the difference in physics, temporal, and spatial scales. Further, this study explores multirate partitioned Runge-Kutta methods for the fluid-fluid interaction problem and demonstrates its parallel performance by using the PETSc library. We consider compressible Navier-Stokes equations with gravity coupled through a rigid-lid interface. Our large-scale numerical experiments reveal that multirate partitioned Runge-Kutta coupling schemes (1) can conserve total mass; (2) have second-order accuracy in time; and (3) provide favorable strong- and weak-scaling performance on modern computing architectures. We also show that the speedup factors of multirate partitioned Runge-Kutta methods match theoretical expectations over their base (single-rate) method.
54 ENVIRONMENTAL SCIENCES↗
A cross-sectional aeroelastic analysis and structural optimization tool for slender composite structures
A fully open-source available framework for the parametric cross-sectional analysis and design optimization of slender composite structures, such as helicopter or wind turbine blades, is presented. The framework—Structural Optimization and Aeroelastic Analysis (SONATA)—incorporates two structural solvers, the commercial tool VABS, and the novel open-source code ANBA4. SONATA also parameterizes the design inputs, postprocesses and visualizes the results, and generates the structural inputs to a variety of aeroelastic analysis tools. It is linked to the optimization library OpenMDAO. This work presents the methodology and explains the fundamental approaches of SONATA. Structural characteristics were successfully verified for both VABS and ANBA4 using box beam examples from literature, thereby verifying the parametric approach to generating the topology and mesh in a cross section as well as the solver integration. The framework was furthermore exercised by analyzing and evaluating a fully resolved highly flexible wind turbine blade. Computed structural characteristics correlated between VABS and ANBA4, including off-diagonal terms. Stresses, strains, and deformations were recovered from loads derived through coupling with aeroelastic analysis. The framework, therefore, proves effective in accurately analyzing and optimizing slender composite structures on a high-fidelity level that is close to a three-dimensional finite element model.
42 ENGINEERING↗
High-Throughput Functional Genomics for Energy Production
Functional genomics remains a foundational field for establishing genotype-phenotype relationships that enable strain engineering. High-throughput (HTP) methods accelerate the Design-Build-Test-Learn cycle that currently drives synthetic biology towards a forward engineering future. Trackable mutagenesis techniques including transposon insertion sequencing and CRISPR-Cas-mediated genome editing allow for rapid fitness profiling of a collection, or library, of mutants to discover beneficial mutations. Due to the relative speed of these experiments compared to adaptive evolution experiments, iterative rounds of mutagenesis can be implemented for next-generation metabolic engineering efforts to design complex production and tolerance phenotypes. Further, the expansion of these mutagenesis techniques to novel bacteria are opening up industrial microbes that show promise for establishing a bio-based economy.
59 BASIC BIOLOGICAL SCIENCES↗
ELSI — An open infrastructure for electronic structure solvers
Routine applications of electronic structure theory to molecules and periodic systems need to compute the electron density from given Hamiltonian and, in case of non-orthogonal basis sets, overlap matrices. System sizes can range from few to thousands or, in some examples, millions of atoms. Different discretization schemes (basis sets) and different system geometries (finite non-periodic vs. infinite periodic boundary conditions) yield matrices with different structures. The ELectronic Structure Infrastructure (ELSI) project provides an open-source software interface to facilitate the implementation and optimal use of high-performance solver libraries covering cubic scaling eigensolvers, linear scaling density-matrix-based algorithms, and other reduced scaling methods in between. In this paper, we present recent improvements and developments inside ELSI, mainly covering (1) new solvers connected to the interface, (2) matrix layout and communication adapted for parallel calculations of periodic and/or spin-polarized systems, (3) routines for density matrix extrapolation in geometry optimization and molecular dynamics calculations, and (4) general utilities such as parallel matrix I/O and JSON output. The ELSI interface has been integrated into four electronic structure code projects (DFTB+, DGDFT, FHI-aims, SIESTA), allowing us to rigorously benchmark the performance of the solvers on an equal footing. Based on results of a systematic set of large-scale benchmarks performed with Kohn–Sham density-functional theory and density-functional tight-binding theory, we identify factors that strongly affect the efficiency of the solvers, and propose a decision layer that assists with the solver selection process. As a result, we describe a reverse communication interface encoding matrix-free iterative solver strategies that are amenable, e.g., for use with planewave basis sets.
97 MATHEMATICS AND COMPUTING↗
Efficient Fourier transforms for transverse momentum dependent distributions
Hadron production at low transverse momenta in semi-inclusive deep inelastic scattering can be described by transverse momentum dependent (TMD) factorization. This formalism has also been widely used to study the Drell-Yan process and back-to-back hadron pair production in $e^+e^-$ collisions. These processes are the main ones for extractions of TMD parton distribution functions and TMD fragmentation functions, which encode important information about nucleon structure and hadronization. One of the most widely used TMD factorization formalism in phenomenology formulates TMD observables in coordinate $b_\perp$-space, the conjugate space of the transverse momentum. The Fourier transform from $b_\perp$-space back into transverse momentum space is sufficiently complicated due to oscillatory integrands that it requires a careful and computationally intensive numerical treatment in order to avoid potentially large numerical errors. Within the TMD formalism, the azimuthal angular dependence is analytically integrated and the two-dimensional $b_\perp$ integration reduces to a one-dimensional integration over the magnitude $b_\perp$. In this paper we develop a fast numerical Hankel transform algorithm for such a $b_\perp$-integration that improves the numerical accuracy of TMD calculations in all standard processes. Libraries for this algorithm are implemented in Python 2.7 and 3, C++, as well as FORTRAN77. All packages are made available open source.
97 MATHEMATICS AND COMPUTING↗
Jas4pp — A data-analysis framework for physics and detector studies
This paper describes the Jas4pp framework for exploring physics cases and for detector-performance studies of future particle collision experiments. Jas4pp is a multi-platform Java program for numeric calculations, scientific visualization in 2D and 3D, storing data in various file formats and displaying collision events and detector geometries. It also includes complex data-analysis algorithms for function minimization, regression analysis, event reconstruction (such as jet reconstruction), limit settings and other libraries widely used in particle physics. The framework can be used with several scripting languages, such as Python/Jython, Groovy and JShell. Several benchmark tests discussed in the paper illustrate significant improvements in the performance of the Groovy and JShell scripting languages compared to the standard Python implementation in C. Furthermore, the improvements for numeric computations in Java are attributed to recent enhancements in the Java Virtual Machine.
97 MATHEMATICS AND COMPUTING↗
LeptonInjector and LeptonWeighter: A neutrino event generator and weighter for neutrino observatories
In this work, we present a high-energy neutrino event generator, called LeptonInjector, alongside an event weighter, called LeptonWeighter. Both are designed for large-volume Cherenkov neutrino telescopes such as IceCube. The neutrino event generator allows for quick and flexible simulation of neutrino events within and around the detector volume, and implements the leading Standard Model neutrino interaction processes relevant for neutrino observatories: neutrino-nucleon deep-inelastic scattering and neutrino-electron annihilation. In this paper, we discuss the event generation algorithm, the weighting algorithm, and the main functions of the publicly available code, with examples. Program summary: Program Titles: LeptonInjector and LeptonWeighter CPC Library link to program files: https://doi.org/10.17632/662gkpjfd9.1 Developer's repository links: https://github.com/icecube/LeptonInjector and https://github.com/icecube/LeptonWeighter Licensing provisions: GNU Lesser General Public License, version 3. Programming Language: C++11 External Routines: • Boost • HDF5 • nuflux (https://github.com/icecube/nuflux) • nuSQuIDS (https://github.com/arguelles/nuSQuIDS) • Photospline (https://github.com/icecube/photospline) • SuiteSparse (https://github.com/DrTimothyAldenDavis/SuiteSparse) Nature of problem: LeptonInjector: Generate neutrino interaction events of all possible topologies and energies throughout and around a detector volume. LeptonWeighter: Reweight Monte Carlo events, generated by a set of LeptonInjector Generators, to any desired physical neutrino flux or cross section. Solution method: LeptonInjector: Projected ranges of generated leptons and the extent of the detector, in terms of column depth, are used to inject events in and around the detector volume. Event kinematics follow distributions provided in cross section files. LeptonWeighter: Event generation probabilities are calculated for each Generator, which are then combined into a generation weight and used to calculate an overall event weight.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Fission fragment decay simulations with the CGMF code
The CGMF code implements the Hauser-Feshbach statistical nuclear reaction model to follow the de-excitation of fission fragments by successive emissions of prompt neutrons and γ rays. The Monte Carlo technique is used to facilitate the analysis of complex distributions and correlations among the prompt fission observables. Starting from initial configurations for the fission fragments in mass, charge, kinetic energy, excitation energy, spin, and parity, Y(A,Z,KE,U,J,π), CGMF samples neutron and γ-ray probability distributions at each stage of the decay process, conserving energy, spin and parity. Nuclear structure and reaction input data from the RIPL3 library are used to describe fission fragment properties and decay probabilities. Characteristics of prompt fission neutrons, prompt fission γ rays, and independent fission yields can be studied consistently. Correlations in energy, angle and multiplicity among the emitted neutrons and γ rays can be easily analyzed as a function of the emitting fragments. Finally, in its current version, CGMF is limited to certain spontaneous fission reactions on Pu and Cf isotopes, as well as neutron-induced fission reactions up to 20 MeV on U, Np, and Pu isotopes.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Q-POP-Thermo: A general-purpose thermodynamics solver for ferroelectric materials
We report that Q-POP-Thermo is a program designed to compute thermodynamic monodomain equilibrium states and their properties for ferroelectric single crystals and thin films based on the Landau-Ginzburg-Devonshire (LGD) Theory. Utilizing symbolic manipulation with the SymPy Library, the governing equations along with appropriate boundary conditions are solved for speedy minimization of the free energy of a crystal. Utilizing the popular Differential Evolution algorithm, with appropriate hybridization, multiple phase diagrams, such as the pressure-temperature phase diagram for bulk single crystals and the common strain-temperature phase diagram for monodomain thin-film systems can be readily generated. Furthermore, a variety of material properties of stable ferroelectric phases, including dielectric, piezoelectric, and electrocaloric properties, can simultaneously be calculated. Validation studies are presented for both thin-film and single crystal systems to test the effectiveness and capability of the open-source program.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗