SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
We comment the fractional space–time reaction–convection–diffusion defined by Grünwald–Letnikov, Riesz and Riesz–Feller fractional derivatives. We find the explicit travelling wave solution, using the similarity reduction. We plot its graphics to illustrate the anomalous behavior and investigate its properties associated with memory and distance effects.
We study the existence and the uniqueness of the solution of an integro-differential nonlinear Volterra equation with a weakly singular kernel, then using a product integration method with piecewise projection we approximate the solution of this equation.
Here, we present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions for variable resolution Delaunay triangular and tetrahedral meshes in two and three-dimensions, respectively. nMAPS consists of two principal stages. In the first stage, an initial point distribution is produced using a cell-based rejection algorithm. In the second stage, holes in the sample are detected using an efficient background grid and filled in to obtain a near-maximal covering. Extensive testing shows that nMAPS generates a variable resolution mesh in linear run time with the number of accepted points. We demonstrate nMAPS capabilities by meshing three-dimensional discrete fracture networks (DFN) and the surrounding volume. The discretized boundaries of the fractures, which are represented as planar polygons, are used as the seed of 2D-nMAPS to produce a conforming Delaunay triangulation. The combined mesh of the DFN is used as the seed for 3D-nMAPS, which produces conforming Delaunay tetrahedra surrounding the network. Under a set of conditions that naturally arise in maximal Poisson-disk samples and are satisfied by nMAPS, the two-dimensional Delaunay triangulations are guaranteed to only have well-behaved triangular faces. While nMAPS does not provide triangulation quality bounds in more than two dimensions, we found that low-quality tetrahedra in 3D are infrequent, can be readily detected and removed, and a high-quality balanced mesh is produced.
Operator inference learns low-dimensional dynamical-system models with polynomial nonlinear terms from trajectories of high-dimensional physical systems (non-intrusive model reduction). Here, this work focuses on the large class of physical systems that can be well described by models with quadratic and cubic nonlinear terms and proposes a regularizer for operator inference that induces a stability bias onto learned models. The proposed regularizer is physics informed in the sense that it penalizes higher-order terms with large norms and so explicitly leverages the polynomial model form that is given by the underlying physics. This means that the proposed approach judiciously learns from data and physical insights combined, rather than from either data or physics alone. Additionally, a formulation of operator inference is proposed that enforces model constraints for preserving structure such as symmetry and definiteness in linear terms. Numerical results demonstrate that models learned with operator inference and the proposed regularizer and structure preservation are accurate and stable even in cases where using no regularization and Tikhonov regularization leads to models that are unstable.
During the past decade, Prognostics and Health Management (PHM) has become an important set of tools in various areas of industry and academic reliability engineering. PHM consists of a variety of mathematical and computational methods used to support data-driven decision-making to increase the safety, availability, and reliability of complex engineering systems. In particular, PHM can provide crucial insight into reliability and safety design improvements for developing technologies where historical performance and failure data are limited. This is the case of hydrogen fueling and storage technologies. This work presents a high-level approach for designing data-driven PHM applications for bulk liquid hydrogen (LH 2 ) storage systems for hydrogen fueling stations. This paper addresses core aspects of the design, development, and implementation of data-driven PHM applications that can improve the reliability assessment of hydrogen components. The analysis focuses on the relationship between data availability and diagnostic/prognostic capabilities; potential challenges; and integration schemes for current risk mitigation measures. We identify potential condition-monitoring data sources for key components in an LH 2 storage system, including storage tanks, piping, and pumps. Further, we determine that the short-term goals for the implementation of data-driven models in PHM frameworks in hydrogen systems should focus on developing adequate data collection and analysis strategies, as well as exploring the effect on reliability, safety, and regulations for hydrogen systems.
Not Available
This paper presents the theoretical development and numerical demonstration of a moment-preserving Monte Carlo electron transport method. Foremost, a full implementation of the moment-preserving (MP) method within the Geant4 particle simulation toolkit is demonstrated. Beyond implementation details, it is shown that the MP method is a viable alternative to the condensed history (CH) method for inclusion in current and future generation transport codes through demonstration of the key features of the method including: systematically controllable accuracy, computational efficiency, mathematical robustness, and versatility. A wide variety of results common to electron transport are presented illustrating the key features of the MP method. In particular, it is possible to achieve accuracy that is statistically indistinguishable from analog Monte Carlo, while remaining up to three orders of magnitude more efficient than analog Monte Carlo simulations. Lastly, it is shown that the MP method can be generalized to any applicable analog scattering DCS model by extending previous work on the MP method beyond analytical DCSs to the partial-wave (PW) elastic tabulated DCS data.
Abstract Not Provided
Abstract Not Provided
Abstract Not Provided
Atomic structure prediction and associated property calculations are the bedrock of chemical physics. Since high-fidelity ab initio modeling techniques for computing the structure and properties can be prohibitively expensive, this motivates the development of machine-learning (ML) models that make these predictions more efficiently. Training graph neural networks over large atomistic databases introduces unique computational challenges such as the need to process millions of small graphs with variable size and support communication patterns that are distinct from learning over large graphs such as social networks. We demonstrate a novel hardware-software co-design approach to scale up the training of atomistic graph neural networks (GNN) for structure and property prediction. First, to eliminate redundant computation and memory associated with alternative padding techniques and to improve throughput via minimizing communication, we formulate the effective coalescing of the batches of variable-size atomistic graphs as the bin packing problem and introduce a hardware-agnostic algorithm to pack these batches. In addition, we propose hardware-specific optimizations including a planner and vectorization for the gather-scatter operations targeted for Graphcore’s Intelligence Processing Unit (IPU), as well as model-specific optimizations such as merged communication collectives and optimized softplus. Putting these all together, we demonstrate the effectiveness of the proposed co-design approach by providing an implementation of a well-established atomistic GNN on the Graphcore IPUs. We evaluate the training performance on multiple atomistic graph databases with varying degrees of graph counts, sizes and sparsity. Here, we demonstrate that such a co-design approach can reduce the training time of atomistic GNNs and can improve the performance by up to 1.5× compared to the baseline implementation of the model on the IPUs. Additionally, we compare our IPU implementation with a Nvidia GPU-based implementation and show that our atomistic GNN implementation on the IPUs can run 1.8× faster on average compared to the execution time on the GPUs.
Not Available
Abstract Accurate estimates of the vertical profile of cloud condensation nuclei (CCN) concentration are crucial to better quantify aerosol‐cloud interactions. We assessed the correlation between the vertical CCN concentrations obtained from extinction‐, satellite‐, and model‐based retrieval methods and airborne CCN concentrations collected at 0.24% supersaturation within the 3, 9, 27, and 81 km regions centered over the U.S. Department of Energy's Atmospheric Radiation Measurement User Facility Southern Great Plains (SGP) site during the spring and summer of 2016. The extinction profiles at a wavelength 355 nm were provided by the ground‐based Raman lidar. Our analysis showed moderate correlation between dry‐corrected extinction and airborne CCN data. We found the retrieved number concentration of CCN (RNCCN) method showed regression best‐fit slopes close to unity and consistent prediction errors for the majority of the data. The Lenhardt et al. (2023, https://doi.org/10.5194/amt‐16‐2037‐2023 ) method showed similar conclusions but only during spring, whereas the Mamouri and Ansmann (2016, https://doi.org/10.5194/acp‐16‐5905‐2016 ) method showed poor correlation. The Shinozuka et al. (2015, https://doi.org/10.5194/acp‐15‐7585‐2015 ) satellite‐based method exhibited reasonable agreement during summer but poor correlation during periods where both high (∼1,400 #/cm 3 ) and low (∼50 #/cm 3 ) airborne CCN concentrations were observed. The Copernicus Atmosphere Monitoring Service reanalysis modeled 3‐D CCN data set showed a moderate to weak positive correlation but performed poorly at high airborne CCN concentrations. Our analysis suggests the extinction‐based RNCCN method performed better than other methods across most observation periods under the diverse meteorological conditions observed at the SGP site.
There is a consensus that mass vaccination against SARS-CoV-2 will ultimately end the COVID-19 pandemic. However, it is not clear when and which control measures can be relaxed during the rollout of vaccination programmes. We investigate relaxation scenarios using an age-structured transmission model that has been fitted to age-specific seroprevalence data, hospital admissions, and projected vaccination coverage for Portugal. Our analyses suggest that the pressing need to restart socioeconomic activities could lead to new pandemic waves, and that substantial control efforts prove necessary throughout 2021. Using knowledge on control measures introduced in 2020, we anticipate that relaxing measures completely or to the extent as in autumn 2020 could launch a wave starting in April 2021. Additional waves could be prevented altogether if measures are relaxed as in summer 2020 or in a step-wise manner throughout 2021. We discuss at which point the control of COVID-19 would be achieved for each scenario.
Abstract We show analytically that training a neural network by conditioned stochastic mutation or neuroevolution of its weights is equivalent, in the limit of small mutations, to gradient descent on the loss function in the presence of Gaussian white noise. Averaged over independent realizations of the learning process, neuroevolution is equivalent to gradient descent on the loss function. We use numerical simulation to show that this correspondence can be observed for finite mutations, for shallow and deep neural networks. Our results provide a connection between two families of neural-network training methods that are usually considered to be fundamentally different.
Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms except in cases of weak electron correlation or one-dimensional spatial geometry. We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases, enabling the characterization of strongly correlated ground states with arbitrary spatial geometry. The energy is converged via a gradient-free generalized sweep algorithm based on quantum subspace diagonalization, with a potentially exponential speedup in the off-diagonal matrix element contractions upon translation into compact quantum circuits of linear depth in the number of qubits. Chemical accuracy is attained in numerical experiments for both a stretched water molecule and an octahedral arrangement of hydrogen atoms, achieving substantially better correlation energies compared to a unitary coupled-cluster benchmark, with orders of magnitude reductions in quantum resource estimates and a surprisingly high tolerance to shot noise. This proof-of-concept study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.