Engineering PapersSearch

SEARCH · Engineering Papers

Results for “MATHEMATICAL STATISTICS”

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 37 records · Page 2

Data-driven particle dynamics: Structure-preserving coarse-graining for emergent behavior in non-equilibrium systems

Multiscale systems are ubiquitous in science and technology, but are notoriously challenging to simulate as short spatiotemporal scales must be appropriately linked to emergent bulk physics. When expensive high-dimensional dynamical systems are coarse-grained into low-dimensional models, the entropic loss of information leads to emergent physics which are dissipative, history-dependent, and stochastic. To machine learn coarse-grained dynamics from time-series observations of particle trajectories, we propose a framework using the metriplectic bracket formalism that preserves these properties by construction; most notably, the framework guarantees discrete notions of the first and second laws of thermodynamics, conservation of momentum, and a discrete fluctuation-dissipation balance crucial for capturing non-equilibrium statistics. We introduce the mathematical framework abstractly before specializing to a particle discretization. As labels are generally unavailable for entropic state variables, we introduce a novel self-supervised learning strategy to identify emergent structural variables. We validate the method on benchmark systems and demonstrate its utility on two challenging examples: (1) coarse-graining star polymers at challenging levels of coarse-graining while preserving non-equilibrium statistics, and (2) learning models from high-speed video of colloidal suspensions that capture coupling between local rearrangement events and emergent stochastic dynamics. We provide open-source implementations in both PyTorch and LAMMPS, enabling large-scale inference and extensibility to diverse particle-based systems.

Computational Engineering, Finance, and Science (c

Changes in the Regional Water Cycle and Their Impact on Societies

ABSTRACT Changes in “blue water”, which is the total supply of fresh water available for human extraction over land, are quite closely related to changes in runoff or equivalently precipitation minus evaporation, . This article examines how climate change‐driven recent past and future changes in the regional water cycle relate to blue water availability and changes in human blue water demand. Although at the largest scales theoretical and numerical model predictions are in broad agreement with observations, at continental scales and below models predict large ranges of possible future and runoff especially at the scale of individual river catchments and for shorter timescale subseasonal floods and droughts. Nevertheless, it is expected that the occurrence and severity of floods will increase and that of droughts may increase, possibly compounded by human‐driven non‐climatic changes such as changes in land use, dam water impoundment, irrigation and extraction of groundwater. Contemporary assessments predict that increases in 21st century human water extraction in many highly‐populated regions are unlikely to be sustainable given projections of future . To reduce uncertainty in future predictions, there is an urgent need to improve modeling of atmospheric, land surface and human processes and how these components are coupled. This should be supported by maintaining the observing network and expanding it to improve measurements of land surface, oceanic and atmospheric variables. This includes the development of satellite observations stable over multiple decades and suitable for building reanalysis datasets appropriate for model evaluation.

54 ENVIRONMENTAL SCIENCES

Higher‐Order Gravity Waves and Traveling Ionospheric Disturbances From the Polar Vortex Jet on 11–15 January 2016: Modeling With HIAMCM‐SAMI3 and Comparison With Observations in the Thermosphere and Ionosphere

Abstract In Vadas et al. (2024, https://doi.org/10.1029/2024ja032521 ), we modeled the atmospheric gravity waves (GWs) during 11–14 January 2016 using the HIAMCM, and found that the polar vortex jet generates medium to large‐scale, higher‐order GWs in the thermosphere. In this paper, we model the traveling ionospheric disturbances (TIDs) generated by these GWs using the HIAMCM‐SAMI3 and compare with ionospheric observations from ground‐based Global Navigation Satellite System (GNSS) receivers, Incoherent Scatter Radars (ISR) and the Super Dual Auroral Radar Network (SuperDARN). We find that medium to large‐scale TIDs are generated worldwide by the higher‐order GWs from this event. Many of the TIDs over Europe and Asia have concentric ring/arc‐like structure, and most of those over North/South America have planar wave structure and occur during the daytime. Those over North/South America propagate southward and are generated by higher‐order GWs from Europe/Asia which propagate over the Arctic. These latter TIDs can be misidentified as arising from geomagnetic forcing. We find that the higher‐order GWs that propagate to Africa and Brazil from Europe may aid in the formation of equatorial plasma bubbles (EPBs) there. We find that the simulated GWs, TIDs and EPBs agree with EISCAT, PFISR, GNSS, and SuperDARN measurements. We find that the higher‐order GWs are concentrated at N at 200 km, in agreement with GOCE and CHAMP data. Thus the polar vortex jet is important for generating TIDs in the northern winter ionosphere via multi‐step vertical coupling through GWs.

Vadas, Sharon L. [Northwest Research Associates Bo

Robust error calibration for serial crystallography

Serial crystallography is an important technique with unique abilities to resolve enzymatic transition states, minimize radiation damage to sensitive metalloenzymes and perform de novo structure determination from micrometre-sized crystals. This technique requires the merging of data from thousands of crystals, making manual identification of errant crystals unfeasible. cctbx.xfel.merge uses filtering to remove problematic data. However, this process is imperfect, and data reduction must be robust to outliers. We add robustness to cctbx.xfel.merge at the step of uncertainty determination for reflection intensities. This step is a critical point for robustness because it is the first step where the data sets are considered as a whole, as opposed to individual lattices. Robustness is conferred by reformulating the error-calibration procedure to have fewer and less stringent statistical assumptions and incorporating the ability to down-weight low-quality lattices. We then apply this method to five macromolecular XFEL data sets and observe the improvements to each. The appropriateness of the intensity uncertainties is demonstrated through internal consistency. This is performed through theoretical CC 1/2 and I /σ relationships and by weighted second moments, which use Wilson's prior to connect intensity uncertainties with their expected distribution. This work presents new mathematical tools to analyze intensity statistics and demonstrates their effectiveness through the often underappreciated process of uncertainty analysis.

Mittan-Moreau, David W.

Mapping Incidence and Prevalence Peak Data for SIR Modeling Applications

Infectious disease modeling and forecasting have played a key role in helping assess and respond to epidemics and pandemics. Recent work has leveraged data on disease peak infection and peak hospital incidence to fit compartmental models for the purpose of forecasting and describing the dynamics of a disease outbreak. Incorporating these data can greatly stabilize a compartmental model fit on early observations, where slight perturbations in the data may lead to model fits that forecast wildly unrealistic peak infection. We introduce a new method for incorporating historic data on the value and time of peak incidence of hospitalization into the fit for a Susceptible-Infectious-Recovered (SIR) model by formulating the relationship between an SIR model’s starting parameters and peak incidence as a system of two equations that can be solved computationally. We demonstrate how to calculate SIR parameter estimates – which describe disease dynamics such as transmission and recovery rates – using this method, and determine that there is a noticeable loss in accuracy whenever prevalence data is misspecified as incidence data. To exhibit the modeling potential, we update the Dirichlet-Beta State Space modeling framework to use hospital incidence data, as this framework was previously formulated to incorporate only data on total infections. This approach is assessed for practicality in terms of accuracy and speed of computation via simulation.

97 MATHEMATICS AND COMPUTING

Data-driven prediction of scaling and ignition of inertial confinement fusion experiments

Recent advances in inertial confinement fusion (ICF) at the National Ignition Facility (NIF), including ignition and energy gain, are enabled by a close coupling between experiments and high-fidelity simulations. Neither simulations nor experiments can fully constrain the behavior of ICF implosions on their own, meaning pre- and postshot simulation studies must incorporate experimental data to be reliable. Linking past data with simulations to make predictions for upcoming designs and quantifying the uncertainty in those predictions has been an ongoing challenge in ICF research. We have developed a data-driven approach to prediction and uncertainty quantification that combines large ensembles of simulations with Bayesian inference and deep learning. The approach builds a predictive model for the statistical distribution of key performance parameters, which is jointly informed by past experiments and physics simulations. The prediction distribution captures the impact of experimental uncertainty, expert priors, design changes, and shot-to-shot variations. We have used this new capability to predict a 10× increase in ignition probability between Hybrid-E shots driven with 2.05 MJ compared to 1.9 MJ, and validated our predictions against subsequent experiments. We describe our new Bayesian postshot and prediction capabilities, discuss their application to NIF ignition and validate the results, and finally investigate the impact of data sparsity on our prediction results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY

Bayesian Adaptive Polynomial Chaos Expansions

Polynomial chaos expansions (PCEs) are widely used for uncertainty quantification (UQ) tasks, particularly in the applied mathematics community. However, PCE has received comparatively less attention in the statistics literature, and fully Bayesian formulations remain rare—especially with implementations in R. Motivated by the success of adaptive Bayesian machine learning models such as BART, BASS and BPPR, we develop a new fully Bayesian adaptive PCE method with an efficient and accessible R implementation: khaos. Our approach includes a novel proposal distribution that enables data-driven interaction selection and supports a modified g-prior tailored to PCE structure. Through simulation studies and real-world UQ applications, we demonstrate that the Bayesian adaptive PCE provides competitive performance for surrogate modeling, global sensitivity analysis and ordinal regression tasks.

97 MATHEMATICS AND COMPUTING

Quantum mechanical closure of partial differential equations with symmetries

We develop a statistical framework for the dynamical closure of spatiotemporal dynamics governed by partial differential equations. Employing the mathematical framework of quantum mechanics to embed the original classical dynamics into a quantum mechanical representation, we use the space of quantum density operators to model the unresolved degrees of freedom of the original dynamics in a statistical sense, and the framework of quantum measurement to predict their contributions to the resolved dynamics. The embedded dynamics is discretized by a positivity preserving process, leading to a compressed representation that is invariant under the dynamical symmetries of the resolved dynamics. We present a data based formulation of the closure scheme and apply it to a closure problem for the shallow water equations. The numerical results demonstrate that our closure model can accurately predict the main features of the true dynamics, including for out of sample initial conditions.

Delay embedding

Simultaneous inference of equation of state parameters and unknown data errors with uncertainty quantification via hierarchical Bayesian posterior maximization

Equations of state (EOSs) are a key component in running hydrodynamic simulations as they relate the thermodynamic states for the material. The Davis reactants EOS is commonly used for modeling high explosives (HEs), and the EOS model parameters are calibrated using material specific data. The calibrations are often performed with uncertainty quantification via Bayesian inference to account for uncertainty in the data and generate ensembles of likely parameters. However, there are relatively few HE data sets to use for calibration and many are historical and lack error information. In this work, we simultaneously calibrate the Davis reactants EOS model parameters and unknown data error terms for the high explosive PBX 9501. To quantify the uncertainty in the models and the data, we use a Bayesian framework for the calibration and compute the hierarchical Bayesian posterior distribution with both a posteriori maximization approach and Markov Chain Monte Carlo. In general, we find that, given our assumptions, the two approaches result in similar calibrated parameters, posterior covariance matrices, and insights about the parameters but that the posterior maximization requires far less computational resources.

97 MATHEMATICS AND COMPUTING

Modern chemical graph theory

Abstract Graph theory has a long history in chemistry. Yet as the breadth and variety of chemical data is rapidly changing, so too do graph encoding methods and analyses that yield qualitative and quantitative insights. Using illustrative cases within a basic mathematical framework, we showcase modern chemical graph theory's utility in Chemists' analysis and model development toolkit. The encoding of both experimental and simulation data is discussed at various levels of granularity of information. This is followed by a discussion of the two major classes of graph theoretical analyses: identifying connectivity patterns and partitioning methods. Measures, metrics, descriptors, and topological indices are then introduced with an emphasis upon enhancing interpretability and incorporation into physical models. Challenging data cases are described that include strategies for studying time dependence. Throughout, we incorporate recent advancements in computer science and applied mathematics that are propelling chemical graph theory into new domains of chemical study. This article is categorized under: Molecular and Statistical Mechanics > Molecular Dynamics and Monte‐Carlo Methods Structure and Mechanism > Computational Materials Science Structure and Mechanism > Molecular Structures

Leite, Leonardo S. G.

Data-driven Mori–Zwanzig modeling of Lagrangian particle dynamics in turbulent flows

The dynamics of Lagrangian particles in turbulence play a crucial role in mixing, transport, and dispersion in complex flows. Their trajectories exhibit highly nontrivial statistical behavior, motivating the development of surrogate models that can reproduce these trajectories without incurring the high computational cost of direct numerical simulations of the full Eulerian field. This task is particularly challenging because reduced-order models typically lack access to the full set of interactions with the underlying turbulent field. Novel data-driven machine learning techniques can be powerful in capturing and reproducing complex statistics of the reduced-order/surrogate dynamics. In this work, we show how one can learn a surrogate dynamical system that is able to evolve a turbulent Lagrangian trajectory in a way that is point-wise accurate for short-time predictions (with respect to Kolmogorov time) and stable and statistically accurate at long times. This approach is based on the Mori–Zwanzig formalism, which prescribes a mathematical decomposition of the full dynamical system into resolved dynamics that depend on the current state and the past history of a reduced set of observables, and the unresolved orthogonal dynamics due to unresolved degrees of freedom of the initial state. We show how by training this reduced order model on a point-wise error metric on short time-prediction, we are able to correctly learn the dynamics of Lagrangian turbulence, such that also the long-time statistical behavior is stably recovered at test time. This opens up a range of applications, for example, for the control of active Lagrangian agents in turbulence.

97 MATHEMATICS AND COMPUTING

Elliptically-Contoured Tensor-variate Distributions with Application to Image Learning

Statistical analysis of tensor-valued data has largely used the tensor-variate normal (TVN) distribution that may be inadequate for data arising from distributions with heavier or lighter tails. We study a general family of elliptically contoured (EC) TV distributions and derive its characterizations, moments, marginal, and conditional distributions. We describe procedures for maximum likelihood estimation from data that are (1) uncorrelated draws from an EC distribution, (2) from a scale mixture of the TVN distribution, and (3) from an underlying but unknown EC distribution, for which we extend Tyler’s robust estimator. A detailed simulation study highlights the benefits of choosing an EC distribution over the TVN for heavier-tailed data. We develop TV classification rules using discriminant analysis and EC errors and show that they better predict cats and dogs from images in the Animal Faces-HQ dataset than the TVN-based rules. A novel tensor-on-tensor regression and TV analysis of variance (TANOVA) framework under EC errors is also demonstrated to better characterize gender, age, and ethnic origin than the usual TVN-based TANOVA in the celebrated labeled faces of the wild dataset.

97 MATHEMATICS AND COMPUTING

Using data-science approaches to unravel insights for enhanced transport of lithium ions in single-ion conducting polymer electrolyte

Solid polymer electrolytes have yet to achieve the an ionic conductivity > 1 mS/cm at room temperature for realistic applications. This target implies the need to reduce the effective energy barriers of ion transport in polymer electrolytes to around 20 kJ/mol. In this work, we combine information extracted from existing experimental results with theoretical calculations to provide insights into ion transport in single-ion conductors (SICs) with a focus on lithium ion SICs. Through the analysis of temperature-dependent ionic conductivity data obtained from the literature, we evaluate different methods of extracting energy barriers for lithium transport. The traditional Arrhenius fit to the temperature-dependent ionic conductivity data indicates that the Meyer-Neldel rule holds for SICs. However, the values of the fitting parameters remain unphysical. Our modified approach based on recent work (Macromolecules, 56, 15, 6051(2023)), which incorporates a fixed pre-exponential factor, reveals that the energy barriers exhibit temperature dependence over a wide range of temperatures. Using this approach, we identify a series of anions leading to the energy barriers less than 30 kJ/mol, which include trifluoromethane sulfonimide (TFSI), fluoromethane sulfonimide (FSI), and boron-based organic anions. In our efforts to design the next generation of anions, which can exhibit the energy barriers less than 20 kJ/mol, we focused on boron-containing SICs, and performed density functional theory (DFT) based calculations to connect the chemical structures via the binding energy of cation (lithium)-anion pairs with the experimentally derived effective energy barriers for ion transport. Not only have we identified a correlation between the binding energy and the energy barriers, but we also propose a strategy to design new boron-based anions by using the correlation. This combined approach involving experiments and theoretical calculations is capable of facilitating the identification of promising new anions, which can exhibit ionic conductivity $> 1$ mS/cm near room temperature, thereby expediting the development of novel superionic single-ion conducting polymer electrolytes. The published datasets include all the temperature-dependent ionic conductivity collected from the literature with literature DOIs, DFT calculated binding energies, and python scripts to analyze data, construct statistical models, and generate plots.

36 MATERIALS SCIENCE

Neural units with time-dependent functionality

We show that the time-resolved dynamics of an underdamped harmonic oscillator can be used to do multifunctional computation, performing distinct computations at distinct times within a single dynamical trajectory. We consider the amplitude of an oscillator whose inputs influence its frequency. The activity of the oscillator at fixed times is a nonmonotonic function of its inputs, so it can solve problems such as XOR that are not linearly separable. The activity of the oscillator at fixed input is a nonmonotonic function of time, so it is multifunctional in a temporal sense, and able to carry out distinct nonlinear computations at distinct times within the same dynamical trajectory. We show that a single oscillator, observed at different times, can act as all of the elementary logic gates and perform binary addition, the latter usually implemented in hardware using five logic gates. We show that a set of n oscillators, observed at different times, can perform an arbitrary number of analog-to-n-bit digital conversions. We also show that oscillators can be trained by gradient descent to perform distinct classification tasks at distinct times. Computing with time-dependent functionality can be done in or out of equilibrium, and suggests a way of reducing the number of parameters or devices required to do nonlinear computations.

97 MATHEMATICS AND COMPUTING

Precision Computations in Strongly Coupled Conformal Field Theories (Final Technical Report)

Conformal Field Theories (CFTs) are quantum field theories that are invariant under the conformal symmetry group (which includes translations and rotations, but also local rescalings of spacetime). They are building blocks of general quantum field theories, and appear in many areas of physics, including statistical physics, condensed matter physics, particle physics, and quantum gravity. Because of their extra symmetries, the mathematical structure of CFTs is tightly constrained, and this leads to the idea of the ``conformal bootstrap," which is to use these mathematical structures to constrain, and in some cases determine, CFT observables. A new numerical implementation of the conformal bootstrap idea appeared in 2008 with the work of Rattazzi, Rychkov, Tonni, and Vichi. Their observation was that certain bootstrap constraints (conformal symmetry and unitarity) could be combined to yield a convex optimization problem that constraints CFT data. By solving this convex optimization problem on a computer, one could obtain bounds on observables like critical exponents and operator product expansion (OPE) coefficients. Over the course of this award, the PI has improved numerical bootstrap techniques by optimizing known algorithms and finding new ones for performing the required convex optimization computations. The PI has applied these techniques to compute high-precision observables in several important strongly-coupled systems. The PI has also explored both analytical and numerical bootstrap methods for constraining the space of low energy effective field theories of quantum gravity, and developed new analytical techniques for CFT and QFT more broadly.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

A bi-level spatiotemporal clustering approach and its application to drought extraction

We present a novel flexible bi-level spatiotemporal clustering algorithm to extract events based on their intensity and spatiotemporal structures. Our algorithm consists of using (i) a novel space-time k-means clustering to obtain spatiotemporally coherent intensity clusters, and (ii) a density-based spatial clustering of applications with noise (DBSCAN) to spatiotemporally section the intensity clusters into individual events. We discuss the development of the algorithm, the selection, tuning and meaning of the parameters within each step, as well as its validation. Finally, we apply the algorithm to a spatiotemporal drought index, standardized vapor pressure deficit drought index (SVDI), over the continental United States (US) from 1980–2021 and show that it captures historical drought events over the continental United States and their spatiotemporal extents.

17 WIND ENERGY

Yet Another Discriminant Analysis (YADA): A Probabilistic Model for Machine Learning Applications

This paper presents a probabilistic model for various machine learning (ML) applications. While deep learning (DL) has produced state-of-the-art results in many domains, DL models are complex and over-parameterized, which leads to high uncertainty about what the model has learned, as well as its decision process. Further, DL models are not probabilistic, making reasoning about their output challenging. In contrast, the proposed model, referred to as Yet Another Discriminate Analysis(YADA), is less complex than other methods, is based on a mathematically rigorous foundation, and can be utilized for a wide variety of ML tasks including classification, explainability, and uncertainty quantification. YADA is thus competitive in most cases with many state-of-the-art DL models. Ideally, a probabilistic model would represent the full joint probability distribution of its features, but doing so is often computationally expensive and intractable. Hence, many probabilistic models assume that the features are either normally distributed, mutually independent, or both, which can severely limit their performance. YADA is an intermediate model that (1) captures the marginal distributions of each variable and the pairwise correlations between variables and (2) explicitly maps features to the space of multivariate Gaussian variables. Numerous mathematical properties of the YADA model can be derived, thereby improving the theoretic underpinnings of ML. Validation of the model can be statistically verified on new or held-out data using native properties of YADA. However, there are some engineering and practical challenges that we enumerate to make YADA more useful.

97 MATHEMATICS AND COMPUTING