Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematical foundation”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Using kernel-based statistical distance to study the dynamics of charged particle beams in particle-based simulation codes

Measures of discrepancy between probability distributions (statistical distance) are widely used in the fields of artificial intelligence and machine learning. We describe how certain measures of statistical distance can be implemented as numerical diagnostics for simulations involving charged-particle beams. Related measures of statistical dependence are also described. The resulting diagnostics provide sensitive measures of dynamical processes important for beams in nonlinear or high-intensity systems, which are otherwise difficult to characterize. Here, the focus is on kernel-based methods such as maximum mean discrepancy, which have a well-developed mathematical foundation and reasonable computational complexity. Several benchmark problems and examples involving intense beams are discussed. While the focus is on charged-particle beams, these methods may also be applied to other many-body systems such as plasmas or gravitational systems.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Robust PID Control Against Nonlinear Uncertainties in Modern Power Systems with Microgrids

This paper investigates the problem of robust PID control for nonlinear power systems with uncertainties. In this paper, we analyze the challenges posed by nonlinearities and uncertainties in power systems, as well as the limitations of traditional linearization methods. On this basis, a PID control design method is proposed, which utilizes only the Lipschitz constant information of the nonlinear uncertainties to achieve global stability control for the power systems. The paper provides a rigorous mathematical foundation to demonstrate the effectiveness and robustness of the controller. Finally, simulation studies are conducted to validate and evaluate the performance of the proposed model, algorithm, and controller design.

Yuan, Shuo↗
DOE OSTI2026

The ABCs of phase retrieval: Connecting the acronyms of scanning transmission electron microscopy

High-resolution scanning transmission electron microscopy (S/TEM) is an indispensable tool for characterizing the structure and properties of materials down to the atomic scale. Conventional S/TEM imaging, however, is limited by the phase problem, whereby the phase of the electron exit wave is lost upon detection. Recent advances in diffractive imaging and 4D-STEM have enabled a range of phase-retrieval techniques that computationally reconstruct the missing information encoded in the phase of the transmission function. These approaches offer improved dose efficiency and enhanced sensitivity to weakly scattering signals, extending quantitative imaging to beam-sensitive materials composed of light elements. In this work, we introduce the phase problem in electron microscopy and survey the diverse landscape of phase-retrieval techniques used in the field. Despite their many acronyms and algorithmic variations, these techniques share a common physical and mathematical foundation. We present a unified framework that connects these seemingly distinct methods, from parallax imaging and tilt-corrected bright-field (tcBF-STEM), to aberration-corrected bright-field (acBF-STEM), optimum bright-field (OBF-STEM) and single-sideband (SSB) ptychography, as well as first-moment integrated center of mass techniques (iCOM) and iterative ptychographic algorithms. Based on these insights, we discuss the opportunities and practical limitations of applying these methods across different materials systems, detector designs, and microscope configurations.Graphical abstractRepresentative electron microscopy configurations used for phase retrieval and diffractive imaging in S/TEM: (a) Zernike phase-contrast transmission electron microscopy (TEM), (b) small-convergence-angle four-dimensional scanning transmission electron microscopy (4D-STEM) for nanobeam-based phase reconstruction methods, and (c) large-convergence-angle 4D-STEM for ptychographic and related diffractive imaging techniques reviewed in this work.

36 MATERIALS SCIENCE↗
DOE OSTI2024

A retrospective review of von Neumann’s analysis of hidden variables in quantum mechanics

This article reviews the history of J. von Neumann’s analysis of hidden variables in quantum mechanics and the subsequent analysis by others. In his book The Mathematical Foundations of Quantum Mechanics , published in 1932, von Neumann performed an analysis of the consequences of introducing hidden parameters (hidden variables) into quantum mechanics. He arrived at two principal conclusions: first, hidden variables cannot be incorporated into the existing theory of quantum mechanics without major modifications, and second, if they did exist, the theory would have already failed in situations where it has been successfully applied. This analysis has been taken as an “incorrect proof” against the existence of hidden variables, possibly due to a mistranslation of the German word prufen . von Neumann’s so-called proof isn’t even wrong as such a proof does not exist, but it is an examination of the limitations imposed by internal consistency of the Hilbert space formulation of the theory. One of the earliest attempts to eliminate uncertainty, by D. Bohm, requires a major modification of quantum mechanics (observables are not represented by Hermitian operators), which supports von Neumann’s first principal conclusion. However, testing the Bohm theory requires constructing a physically impossible initial state. As such, the theory has no experimental consequences, so W. Pauli referred to it as an “uncashable check”. As there are no observable consequences, the Bohm theory is possibly a counterexample to von Neumann’s second conclusion that hidden variables in particular would have already led to a failure of the theory.

density matrix↗
DOE OSTI2023

Mathematical nuances of Gaussian process-driven autonomous experimentation

Abstract The fields of machine learning (ML) and artificial intelligence (AI) have transformed almost every aspect of science and engineering. The excitement for AI/ML methods is in large part due to their perceived novelty, as compared to traditional methods of statistics, computation, and applied mathematics. But clearly, all methods in ML have their foundations in mathematical theories, such as function approximation, uncertainty quantification, and function optimization. Autonomous experimentation is no exception; it is often formulated as a chain of off-the-shelf tools, organized in a closed loop, without emphasis on the intricacies of each algorithm involved. The uncomfortable truth is that the success of any ML endeavor, and this includes autonomous experimentation, strongly depends on the sophistication of the underlying mathematical methods and software that have to allow for enough flexibility to consider functions that are in agreement with particular physical theories. We have observed that standard off-the-shelf tools, used by many in the applied ML community, often hide the underlying complexities and therefore perform poorly. In this paper, we want to give a perspective on the intricate connections between mathematics and ML, with a focus on Gaussian process-driven autonomous experimentation. Although the Gaussian process is a powerful mathematical concept, it has to be implemented and customized correctly for optimal performance. We present several simple toy problems to explore these nuances and highlight the importance of mathematical and statistical rigor in autonomous experimentation and ML. One key takeaway is that ML is not, as many had hoped, a set of agnostic plug-and-play solvers for everyday scientific problems, but instead needs expertise and mastery to be applied successfully. Graphical abstract

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

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↗
DOE OSTI2021

Quasi-periodic travelling gravity–capillary waves

We present a numerical study of spatially quasi-periodic travelling waves on the surface of an ideal fluid of infinite depth. This is a generalization of the classic Wilton ripple problem to the case when the ratio of wavenumbers satisfying the dispersion relation is irrational. We propose a conformal mapping formulation of the water wave equations that employs a quasi-periodic variant of the Hilbert transform to compute the normal velocity of the fluid from its velocity potential on the free surface. We develop a Fourier pseudo-spectral discretization of the travelling water wave equations in which one-dimensional quasi-periodic functions are represented by two-dimensional periodic functions on the torus. This leads to an overdetermined nonlinear least-squares problem that we solve using a variant of the Levenberg–Marquardt method. We investigate various properties of quasi-periodic travelling waves, including Fourier resonances, time evolution in conformal space on the torus, asymmetric wave crests, capillary wave patterns that change from one gravity wave trough to the next without repeating and the dependence of wave speed and surface tension on the amplitude parameters that describe a two-parameter family of waves.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Nonlinear causality and strong hyperbolicity of baryon-rich Israel-Stewart hydrodynamics

We present the first set of fully-nonlinear, necessary and sufficient conditions guaranteeing causal evolution of the initial data for the Israel-Stewart hydrodynamic equations with shear and bulk viscosity coupled to a nonzero baryon current. These constraints not only provide nonlinear causality: they also (a) guarantee the existence of a locally well-posed evolution of the initial data (they enforce strong hyperbolicity) when excluding the endpoints of the bounds, (b) arise from purely algebraic constraints that make no underlying symmetry assumptions on the degrees of freedom and (c) propagate the relevant symmetries of the degrees of freedom over the entire evolution of the problem. Our work enforces a mathematically rigorous foundation for future studies of viscous relativistic hydrodynamics with baryon-rich matter including neutron star mergers and heavy-ion collisions.

Cordeiro, Ian [University of Illinois Urbana-Champ↗
DOE OSTI2025

Basic Research Needs for Inverse Methods for Complex Systems under Uncertainty

Inverse problems, which aim to infer unknown properties of a system using experimental and observational data, are central to addressing many of the U.S. Department of Energy’s (DOE) most critical scientific and engineering challenges. Accurate, computationally efficient, and data-efficient solutions to inverse problems are essential for advancing DOE mission-critical science drivers, including analyzing data from large-scale experimental facilities, optimizing fusion reactor performance, accelerating materials discovery, enhancing geophysical imaging, improving wildfire predictions, and enabling autonomous systems and digital twins. However, these problems are becoming increasingly complex, often involving nonlinear, highdimensional, and interconnected systems and models that span multiple physics and scales, while relying on data with varying quantity, quality, and information content. Compounding these challenges is the uncertainty inherent in DOE-relevant systems, where errors in inputs, noise in data, incompleteness of data, and discrepancies between models and reality constrain the accuracy and precision of solutions. At the same time, the convergence of recent scientific computing trends—scientific machine learning, artificial intelligence, and computing advances such as exascale computing—is creating unprecedented opportunities for tackling these challenges. The cross-cutting nature of inverse problems, combined with their growing complexity and rapidly evolving data and algorithmic demands, strongly motivates the formulation of a prioritized research agenda to maximize their capabilities and impact. In response to this need, DOE’s Advanced Scientific Computing Research (ASCR) program in the Office of Science convened the Workshop on Basic Research Needs for Inverse Problems for Complex Systems Under Uncertainty in June 2025. This workshop brought together experts across disciplines to identify grand challenges and major opportunities in the field. Through collaborative discussions, the workshop defined transformative research directions aimed at addressing the mathematical, statistical, and computational challenges posed by inverse problems under uncertainty. As a result of these efforts, four priority research directions (PRDs) were identified to guide future research and development in this area. These PRDs, summarized below, represent a roadmap for advancing the foundational science and mathematics of inverse problems, enabling robust, scalable, and uncertainty-aware solutions that are critical for DOE applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Parameterization and Explicit Modeling of Cloud Microphysics: Approaches, Challenges, and Future Directions

Cloud microphysical processes occur at the smallest end of scales among cloud-related processes and thus must be parameterized not only in large-scale global circulation models (GCMs) but also in various higher-resolution limited-area models such as cloud-resolving models (CRMs) and large-eddy simulation (LES) models. Instead of giving a comprehensive review of existing microphysical parameterizations that have been developed over the years, this study concentrates purposely on several topics that we believe are understudied but hold great potential for further advancing bulk microphysics parameterizations: multi-moment bulk microphysics parameterizations and the role of the spectral shape of hydrometeor size distributions; discrete vs “continuous” representation of hydrometeor types; turbulence-microphysics interactions including turbulent entrainment-mixing processes and stochastic condensation; theoretical foundations for the mathematical expressions used to describe hydrometeor size distributions and hydrometeor morphology; and approaches for developing bulk microphysics parameterizations. Also presented are the spectral bin scheme and particle-based scheme (especially, super-droplet method) for representing explicit microphysics. Their advantages and disadvantages are elucidated for constructing cloud models with detailed microphysics that are essential to developing processes understanding and bulk microphysics parameterizations. Particle-resolved direct numerical simulation (DNS) models are described as an emerging technique to investigate turbulence-microphysics interactions at the most fundamental level by tracking individual particles and resolving the smallest turbulent eddies in turbulent clouds. Outstanding challenges and future research directions are explored as well.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

buhito

buhito is a Python library for graph analysis and machine learning. Graphs can represent networks with objects as nodes and their relationships as edges. buhito focuses on graphlet methods that study graphs through enumerating their component subgraphs to enable interpretable and fast models of complex systems. The package provides tools for different algorithmic designs for computing, analyzing, and applying graphlets to research problems such as machine learning, data compression, and anomaly detection in graph-structured data. A central feature is performing decomposition data analysis on graphs for machine learning models. Implemented in Python and built upon open-source scientific libraries such as NetworkX, NumPy, and SciPy, buhito provides high-performance methods for researchers exploring the mathematical and computational foundations of graphlet analysis applicable to systems of different sizes.

Pimonova, Yulia↗
DOE OSTI2024

Classifying photonic topology using the spectral localizer and numerical K -theory

Recently, the spectral localizer framework has emerged as an efficient approach for classifying topology in photonic systems featuring local nonlinearities and radiative environments. In nonlinear systems, this framework provides rigorous definitions for concepts such as topological solitons and topological dynamics, where a system’s occupation induces a local change in its topology due to nonlinearity. For systems embedded in radiative environments that do not possess a shared bulk spectral gap, this framework enables the identification of local topology and shows that local topological protection is preserved despite the lack of a common gap. However, as the spectral localizer framework is rooted in the mathematics of C*-algebras, and not vector bundles, understanding and using this framework requires developing intuition for a somewhat different set of underlying concepts than those that appear in traditional approaches for classifying material topology. In this tutorial, we introduce the spectral localizer framework from a ground-up perspective and provide physically motivated arguments for understanding its local topological markers and associated local measure of topological protection. In doing so, we provide numerous examples of the framework’s application to a variety of topological classes, including crystalline and higher-order topology. We then show how Maxwell’s equations can be reformulated to be compatible with the spectral localizer framework, including the possibility of radiative boundary conditions. To aid in this introduction, we also provide a physics-oriented introduction to multi-operator pseudospectral methods and numerical K-theory, two mathematical concepts that form the foundation for the spectral localizer framework. Finally, we provide some mathematically oriented comments on the C*-algebraic origins of this framework, including a discussion of real C*-algebras and graded C*-algebras that are necessary for incorporating physical symmetries. Looking forward, we hope that this tutorial will serve as an approachable starting point for learning the foundations of the spectral localizer framework.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Mathematics Integrated with Computer Science through Scratch: Curricular Modules for the Middle Grades

A project funded by the National Science Foundation, Computer Science Integrated with Mathematics in Middle Schools (CSIMMS) (DRL-1640039), brought middle-school mathematics teachers together with university computer science (CS) faculty and STEM education faculty to design, develop, and test curriculum modules in which CS is integrated into instruction for middle-school general-mathematics courses. The project developed integrated math/CS curriculum modules (for grades 6, 7, and 8), complete with student tasks and teacher materials to guide classroom implementation. Across the project, sixteen teachers from four middle schools representing different school contexts (both urban and suburban, serving students from a range of demographic and socioeconomic backgrounds) participated as members of the design team and trial testers of the math/CS modules. All modules underwent multiple years of testing and refinement, with extensive input from the teachers who co-designed and implemented them. Approximately 50-100 middle-school students participated in the classes of those who taught each year. The modules in this volume feature a range of models for integrating mathematics and computer science at the 6th and 7th grade levels. All modules foreground the teaching of grade-level mathematics content, with computer science functioning to motivate and/or reinforce these ideas.

Andrews larson, Christine↗
DOE OSTI2024

Foundation Models for the Electric Power Grid

Foundation models (FMs) currently dominate news headlines. They employ advanced deep learning architectures to extract structural information autonomously from vast datasets through self-supervision. The resulting rich representations of complex systems and dynamics can be applied to many downstream applications. Therefore, advances in FMs can find uses in electric power grids, challenged by the energy transition and climate change. This paper calls for the development of FMs for electric grids. We highlight their strengths and weaknesses amidst the challenges of a changing grid. It is argued that FMs learning from diverse grid data and topologies, which we call grid foundation models (GridFMs), could unlock transformative capabilities, pioneering a new approach to leveraging AI to redefine how we manage complexity and uncertainty in the electric grid. Finally, we discuss a practical implementation pathway and road map of a GridFM-v0, a first GridFM for power flow applications based on graph neural networks, and explore how various downstream use cases will benefit from this model and future GridFMs.

AI-based power flow simulation↗
DOE OSTI2021

A probabilistic graphical model foundation for enabling predictive digital twins at scale

A unifying mathematical formulation is needed to move from one-off digital twins built through custom implementations to robust digital twin implementations at scale. This work proposes a probabilistic graphical model as a formal mathematical representation of a digital twin and its associated physical asset. We create an abstraction of the asset–twin system as a set of coupled dynamical systems, evolving over time through their respective state spaces and interacting via observed data and control inputs. The formal definition of this coupled system as a probabilistic graphical model enables us to draw upon well-established theory and methods from Bayesian statistics, dynamical systems and control theory. The declarative and general nature of the proposed digital twin model make it rigorous yet flexible, enabling its application at scale in a diverse range of application areas. Here, we demonstrate how the model is instantiated to enable a structural digital twin of an unmanned aerial vehicle (UAV). The digital twin is calibrated using experimental data from a physical UAV asset. Its use in dynamic decision-making is then illustrated in a synthetic example where the UAV undergoes an in-flight damage event and the digital twin is dynamically updated using sensor data. The graphical model foundation ensures that the digital twin calibration and updating process is principled, unified and able to scale to an entire fleet of digital twins.

42 ENGINEERING↗
DOE OSTI2022

Dynamics and growth rate implications of ribosomes and mRNAs interaction in E. coli

Understanding how cells grow and adapt under various nutrient conditions is pivotal in the study of biological stoichiometry. Recent studies provide empirical evidence that cells use multiple strategies to maintain an optimal protein production rate under different nutrient conditions. Mathematical models can provide a solid theoretical foundation that can explain experimental observations and generate testable hypotheses to further our understanding of the growth process. In this study, we generalize a modeling framework that centers on the translation process and study its asymptotic behaviors to validate algebraic manipulations involving the steady states. Using experimental results on the growth of E. coli under C-, N-, and P-limited environments, we simulate the expected quantitative measurements to show the feasibility of using the model to explain empirical evidence. Our results support the findings that cells employ multiple strategies to maintain a similar protein production rate across different nutrient limitations. Moreover, we find that the previous study underestimates the significance of certain biological rates, such as the binding rate of ribosomes to mRNA and the transition rate between different ribosomal stages. Furthermore, our simulation shows that the strategies used by cells under C- and P-limitations result in a faster overall growth dynamics than under N-limitation. In conclusion, the general modeling framework provides a valuable platform to study cell growth under different nutrient supply conditions, which also allows straightforward extensions to the coupling of transcription, translation, and energetics to deepen our understanding of the growth process.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Practical Understanding of Cancer Model Identifiability in Clinical Applications

Mathematical models are a core component in the foundation of cancer theory and have been developed as clinical tools in precision medicine. Modeling studies for clinical applications often assume an individual’s characteristics can be represented as parameters in a model and are used to explain, predict, and optimize treatment outcomes. However, this approach relies on the identifiability of the underlying mathematical models. In this study, we build on the framework of an observing-system simulation experiment to study the identifiability of several models of cancer growth, focusing on the prognostic parameters of each model. Our results demonstrate that the frequency of data collection, the types of data, such as cancer proxy, and the accuracy of measurements all play crucial roles in determining the identifiability of the model. We also found that highly accurate data can allow for reasonably accurate estimates of some parameters, which may be the key to achieving model identifiability in practice. As more complex models required more data for identification, our results support the idea of using models with a clear mechanism that tracks disease progression in clinical settings. For such a model, the subset of model parameters associated with disease progression naturally minimizes the required data for model identifiability.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Evaluation of pre-training large language models on leadership-class supercomputers

Large language models (LLMs) have arisen rapidly to the center stage of artificial intelligence as the foundation models applicable to many downstream learning tasks. However, how to effectively build, train, and serve such models for many high-stake and first-principle-based scientific use cases are both of great interests and of great challenges. Moreover, pre-training LLMs with billions or even trillions of parameters can be prohibitively expensive not just for academic institutions, but also for well-funded industrial and government labs. Furthermore, the energy cost and the environmental impact of developing LLMs must be kept in mind. Here, in this work, we conduct a first-of-its-kind performance analysis to understand the time and energy cost of pre-training LLMs on the Department of Energy (DOE)’s leadership-class supercomputers. Employing state-of-the-art distributed training techniques, we evaluate the computational performance of various parallelization approaches at scale for a range of model sizes, and establish a projection model for the cost of full training. Our findings provide baseline results, best practices, and heuristics for pre-training such large models that should be valuable to HPC community at large. We also offer insights and optimization strategies for using the first exascale computing system, Frontier, to train models of the size of GPT-3 and beyond.

97 MATHEMATICS AND COMPUTING↗