Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “MATHEMATICS - MATRICES”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

On optimal control of hybrid dynamical systems using complementarity constraints

Optimal control for switch-based dynamical systems is a challenging problem in the process control literature. In this study, we model these systems as hybrid dynamical systems with finite number of unknown switching points and reformulate them using non-smooth and non-convex complementarity constraints as a mathematical program with complementarity constraints (MPCC). We utilize a moving finite element based strategy to discretize the differential equation system to accurately locate the unknown switching points at the finite element boundary and achieve high-order accuracy at intermediate non-collocation points. We propose a globalization approach to solve the discretized MPCC problem using a mixed NLP/MILP-based strategy to converge to a non-spurious first-order optimal solution. The method is tested on three dynamic optimization examples, including a gas–liquid tank model and an optimal control problem with a sliding mode solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Steam generator model design parameter sensitivity study for small modular reactor system

Here, this study focuses on design parameter sensitivity studies pertaining to several Once-Through Steam Generator (OTSG) model cases both with and without a riser using python and advanced risk assessment and optimization tool, i.e. Risk Analysis Virtual Environment (RAVEN) developed at Idaho National Laboratory (INL), to support a Small Modular Reactor (SMR) system. The presented Steam Generator (SG) python-based model is a mathematical representation of a steam-generating unit for a Pressurized Water Reactor (PWR)-type SMR system, including fluid flow and heat transfer equations, models, and correlations. Design studies involve changing the model’s input design parameters (e.g., temperature, pressure, mass flow rate) to observe the resulting effects on the output of the system, such as the Heat Transfer Coefficient (HTC), Reynolds number, Nusselt number, and heat transfer performance. Sensitivity studies analyze the degree to which system output and/or desired parameters (e.g., HTC or heat transfer performance) are sensitive to changes in the input parameters. By using RAVEN, detailed design parametric sensitivity studies. Six input parameters—namely, the pressure, temperature, and mass flow rate for the inlet of the primary-side (hot fluid) and secondary-side (cold fluid) of the SG—were randomly perturbed via RAVEN’s Monte Carlo Sampler module, using uniform distributions (i.e., ±1%, ±5% and ±10 % relative changes) for 600 samples. The analysis results give valuable insights into SG system performance, and provide justification for further research and development such as optimized sensor placement, design verification, validation, and optimization.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2025

Scalability analysis of heavy-duty gas turbines using data-driven machine learning

With the increasing integration of variable renewable energy sources into power systems, the role of flexible power generation technologies like gas turbines (GT) in rapid grid balancing remains crucial. This sustained importance underscores the need for scaled and precise modeling of GT to ensure effective integration within evolving energy frameworks. While physics-driven GT models integrate thermodynamics, fluid dynamics, and combustion principles, they often rely on approximate mathematical representations to accommodate scaling that may not capture the actual complex dynamics for GTs and inertial effects associated to GTs with different ratings. In this study, a data-driven model is proposed using machine learning (ML) techniques to conduct GT scalability analysis and performance evaluation with high accuracy. The ML model, trained on data from various operating conditions and performance parameters, aims to uncover intricate relationships and patterns, resembling GT characteristics at different scales (ratings). The model is developed to capture complex system interaction and to adapt to changing operational scenarios at different capacities, providing valuable insights of power system dynamics. In this study, the real-time digital simulator platform was employed to generate training data for the ML model and assess its dynamic characteristics. The ultimate objective was to develop a detailed modeling framework based on governing equations and data-driven ML capable of predicting key performance indicators, in thermal systems such as GTs, including power output, speed, fuel consumption, and exhaust temperature under diverse operating conditions at different scales. The developed ML framework demonstrated high accuracy, with mean relative errors for GT power prediction, reference speed, exhaust temperature, and compressor pressure ratio (CPR) parameters consistently below 0.1% across typical load fluctuation scenarios. Maximum deviations were limited to approximately 0.5 K for exhaust temperature and 0.009 for CPR, underscoring the model’s ability to replicating dynamic GT behavior with high precision. The adaptability of the ML model enables its application across diverse operational conditions and its extension to other thermal systems. By leveraging advanced ML techniques, this study presents a robust and scalable modeling framework that enhances GT simulation precision, facilitating improved integration into evolving power systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Dynamics of McMillan mappings I. McMillan multipoles

In this article, we consider two dynamical systems: the McMillan sextupole and octupole integrable mappings, originally proposed by Edwin McMillan. Both represent the simplest symmetric McMillan maps, characterized by a single intrinsic parameter. While these systems find numerous applications across various domains of mathematics and physics, some of their dynamical properties remain unexplored. We aim to bridge this gap by providing a comprehensive description of all stable trajectories, including the parametrization of invariant curves, Poincaré rotation numbers, and canonical action–angle variables. In the second part, we establish connections between these maps and general chaotic maps in standard form. Our investigation reveals that the McMillan sextupole and octupole serve as first-order approximations of the dynamics around the fixed point, akin to the linear map and quadratic invariant (known as the Courant–Snyder invariant in accelerator physics), which represents zeroth-order approximations (referred to as linearization). Furthermore, we propose a novel formalism for nonlinear Twiss parameters, which accounts for the dependence of rotation number on amplitude. This stands in contrast to conventional betatron phase advance used in accelerator physics, which remains independent of amplitude. Notably, in the context of accelerator physics, this new formalism demonstrates its capability in predicting dynamical aperture around low-order resonances for flat beams, a critical aspect in beam injection/extraction scenarios.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Dynamic probabilistic risk assessment and game theory for cyber security risk analysis in nuclear power plants

Nuclear Power Plants and energy systems have become more prone to cyber-attacks with their digitalization and the increased use of smart equipment. Hence, it is important to quantify the risk associated with cyber-attacks in such systems. Dynamic Probabilistic Risk Assessment which involves studying the evolution of a system due to random events and operator and attacker actions during a cyber-attack by employing a physics-based model of the system is a suitable framework to quantify cybersecurity risk in nuclear power plants. In addition to the plant dynamics, it is also important to model the strategies of the attackers and plant operators for an effective cybersecurity risk assessment. Game theory provides a set of necessary tools to model such strategic interactions. In this research, a framework that integrates dynamic probabilistic risk assessment with game theory for cybersecurity risk analysis in nuclear power plants is presented. The mathematical formulation is derived based on the theory of continuous event trees. We propose a game theory based action model, that utilizes physics-based rewards to define the strategies of attackers and operators at every decision epoch. As a case study, the risk associated with cyber-attacks on the digital components in the secondary side of a pressurized water reactor is studied using a reduced order model. A set of attacker actions and a set of operator actions are defined for the system. The operator and attacker interactions were modelled using simultaneous game, their action policies were computed using the concept of mixed strategy Nash equilibrium and the evolution of the system was studied.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Learning Physically Interpretable Atmospheric Models From Data With WSINDy

The multiscale and turbulent nature of Earth's atmosphere has historically rendered accurate weather modeling a hard problem. Recently, there has been an explosion of interest surrounding data-driven approaches to weather modeling, which in many cases show improved forecasting accuracy and computational efficiency when compared to traditional methods. However, many of the current data-driven approaches employ highly parameterized neural networks, often resulting in uninterpretable models and limited gains in scientific understanding. In this work, we address the interpretability problem by explicitly discovering partial differential equations governing atmospheric phenomena, identifying symbolic mathematical models with direct physical interpretations. The purpose of this paper is to demonstrate that, in particular, the weak-form sparse identification of nonlinear dynamics (WSINDy) algorithm can learn effective atmospheric models from both simulated and assimilated data. Our approach adapts the standard WSINDy algorithm to work with high-dimensional fluid data of arbitrary spatial dimension.

58 GEOSCIENCES↗
DOE OSTI2026

Regularization via f -Divergence: An Application to Multi-Oxide Spectroscopic Analysis

In this paper, we explore the application of convolutional neural networks (CNNs) for predicting the chemical composition of complex geologic samples in a simulated Martian atmospheric environment. Specifically, we aim to characterize oxide weight percentages (wt.%) of rock samples analyzed by remote Laser-Induced Breakdown Spectroscopy (LIBS), framing the problem as a multi-target regression task . Neural networks trained on LIBS spectra are prone to overfitting due to high spectral complexity, limited labeled data, and measurement noise. While regularization is critical for improving generalization, common methods (e.g., ℓ 2 regularization) impose constraints not directly tied to data distribution properties. We propose a novel regularization method based on a specific ƒ-divergence induced by a graph-based estimator, designed to constrain the distributional discrepancy between predictions and targets. This regularizer serves a dual purpose: (a) mitigating overfitting by enforcing a constraint on the distributional difference between predictions and noisy targets, and (b) acting as an auxiliary loss that penalizes large divergences. To enable backpropagation, we develop a differentiable approximation of this particular ƒ-divergence, making the method feasible for neural networks. Experiments on ChemCam and SuperCam LIBS calibration spectra show that mathematical equation-divergence regularization outperforms or matches standard regularization methods (ℓ 1 , ℓ 2 , dropout) and the classical baseline, partial least squares (PLS). Combining ƒ-divergence regularization with standard regularization yields further performance gains, indicating that distributional regularization is useful in this context giving a promising direction for robust model training in planetary science applications. Source code is publicly available at Klein and Li (2025), https://doi.org/10.11578/dc.20250530.7.

58 GEOSCIENCES↗
DOE OSTI2026

A unifying equation for fermentation sustainability across the titer-rate-yield landscape

Industrial fermentation is central to the sustainable production of fuels and chemicals, yet commercial viability of emerging technologies hinges on improving fermentation titer, rate, and yield (TRY). How these metrics shape system cost remains difficult to generalize due to complex interactions among feedstocks, fermentation, separations, catalytic upgrading, waste management, and facility design. Here, we systematically map theoretical fermentation performance spaces (formed by all potential TRY combinations) for 32 representative biomanufacturing facilities—spanning distinct choices for feedstocks, fermentation regimes and products, separations, and catalytic upgrading—by simulating and evaluating them (via techno-economic analysis, TEA) under uncertainty (600,000 Monte Carlo simulations) and across TRY combinations (7500 TRY combinations for each of 32 configurations). Across this wide design and thermodynamic simulation space, we find the relationship between fermentation TRY and system cost is captured by a simple, generalizable mathematical equation (R 2 of 0.992 − 1.000 across our simulations; 0.954 − 1.000 when validated against prior studies that used different tools). We use this equation to elucidate key drivers that shape cost sensitivity to fermentation performance, generating widely applicable insights. By demonstrating a unifying relationship governs the impact of fermentation on biomanufacturing economics, this work establishes a foundation for agile, holistically predictive, resource-efficient strategies to prioritize fermentation research and development needs and accelerate commercialization of emerging biomanufacturing technologies.

applied mathematics↗
DOE OSTI2024

A multiscale model of immune surveillance in micrometastases gives insights on cancer patient digital twins

Abstract Metastasis is the leading cause of death in patients with cancer, driving considerable scientific and clinical interest in immunosurveillance of micrometastases. We investigated this process by creating a multiscale mathematical model to study the interactions between the immune system and the progression of micrometastases in general epithelial tissue. We analyzed the parameter space of the model using high-throughput computing resources to generate over 100,000 virtual patient trajectories. We demonstrated that the model could recapitulate a wide variety of virtual patient trajectories, including uncontrolled growth, partial response, and complete immune response to tumor growth. We classified the virtual patients and identified key patient parameters with the greatest effect on the simulated immunosurveillance. We highlight the lessons derived from this analysis and their impact on the nascent field of cancer patient digital twins (CPDTs). While CPDTs could enable clinicians to systematically dissect the complexity of cancer in each individual patient and inform treatment choices, our work shows that key challenges remain before we can reach this vision. In particular, we show that there remain considerable uncertainties in immune responses, unreliable patient stratification, and unpredictable personalized treatment. Nonetheless, we also show that in spite of these challenges, patient-specific models suggest strategies to increase control of clinically undetectable micrometastases even without complete parameter certainty.

Mathematical & Computational Biology↗
DOE OSTI2024

Identifying Bayesian optimal experiments for uncertain biochemical pathway models

Abstract Pharmacodynamic (PD) models are mathematical models of cellular reaction networks that include drug mechanisms of action. These models are useful for studying predictive therapeutic outcomes of novel drug therapies in silico. However, PD models are known to possess significant uncertainty with respect to constituent parameter data, leading to uncertainty in the model predictions. Furthermore, experimental data to calibrate these models is often limited or unavailable for novel pathways. In this study, we present a Bayesian optimal experimental design approach for improving PD model prediction accuracy. We then apply our method using simulated experimental data to account for uncertainty in hypothetical laboratory measurements. This leads to a probabilistic prediction of drug performance and a quantitative measure of which prospective laboratory experiment will optimally reduce prediction uncertainty in the PD model. The methods proposed here provide a way forward for uncertainty quantification and guided experimental design for models of novel biological pathways.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Solving sparse finite element problems on neuromorphic hardware

The finite element method (FEM) is one of the most important and ubiquitous numerical methods for solving partial differential equations (PDEs) on computers for scientific and engineering discovery. Applying the FEM to larger and more detailed scientific models has driven advances in high-performance computing for decades. Here we demonstrate that scalable spiking neuromorphic hardware can directly implement the FEM by constructing a spiking neural network that solves the large, sparse, linear systems of equations at the core of the FEM. We show that for the Poisson equation, a fundamental PDE in science and engineering, our neural circuit achieves meaningful levels of numerical accuracy and close to ideal scaling on modern, inherently parallel and energy-efficient neuromorphic hardware, specifically Intel’s Loihi 2 neuromorphic platform. We illustrate extensions to irregular mesh geometries in both two and three dimensions as well as other PDEs such as linear elasticity. Our spiking neural network is constructed from a recurrent network model of the brain’s motor cortex and, in contrast to black-box deep artificial neural network-based methods for PDEs, directly translates the well-understood and trusted mathematics of the FEM to a natively spiking neuromorphic algorithm.

Applied mathematics↗
DOE OSTI2024

Computational multiphysics modeling of radioactive aerosol deposition in diverse human respiratory tract geometries

The evaluation of aerosol exposure relies on generic mathematical models that assume uniform particle deposition profiles over the human respiratory tract and do not account for subject-specific characteristics. Here we introduce a hybrid-automated computational workflow that generates personalized particle deposition profiles in 3D reconstructed human airways from computed tomography scans using Computational Fluid and Particle Dynamics simulations. This is the first large-scale study to consider realistic airways variability, where 380 lower and 40 upper human respiratory tract 3D geometries are reconstructed and parameterized. The data is clustered into nine groups using random forest regression. Computational fluid and particle dynamics simulations are conducted on these representative geometries using a realistic heavy-breathing respiratory cycle and radioactive iodine-131 as a source term. Monte Carlo radiation transport simulations are performed to obtain detailed energy deposition maps. Our findings emphasize the importance of personalized studies, as minor respiratory tract variations notably influence deposition patterns rather than global parameters of the lower airways, observing more than 30% variance in the mass deposition fraction.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2024

Identifiability and characterization of transmon qutrits through Bayesian experimental design

Robust control of a quantum system is essential to utilize the current noisy quantum hardware to its full potential, such as quantum algorithms. To achieve such a goal, a systematic search for an optimal control for any given experiment is essential. The design of optimal control pulses requires accurate numerical models and, therefore, accurate characterization of the system parameters. We present an online Bayesian approach for quantum characterization of qutrit systems, which automatically and systematically identifies optimal experiments that provide maximum information on the system parameters, thereby greatly reducing the number of experiments that need to be performed on the quantum testbed. Unlike most characterization protocols that provide point-estimates of the parameters, the proposed approach is able to estimate their probability distribution. The applicability of the Bayesian experimental design technique was demonstrated on test problems, where each experiment was defined by a parameterized control pulse. In addition to this, we also present an approach for iterative pulse extension, which is robust under uncertainties in transition frequencies and coherence times, and shot noise, despite being initialized with wide uninformative priors. Furthermore, we provide a mathematical proof of the theoretical identifiability of the model parameters and present conditions on the quantum state under which the parameters are identifiable. The proof and conditions for identifiability are presented for both closed and open quantum systems using the Schrödinger equation and the Lindblad master equation, respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Toward digital design at the exascale: An overview of project ICECap

High performance computing has entered the Exascale Age. Capable of performing over 1018 floating point operations per second, exascale computers, such as El Capitan, the National Nuclear Security Administration's first, have the potential to revolutionize the detailed in-depth study of highly complex science and engineering systems. However, in addition to these kind of whole machine “hero” simulations, exascale systems could also enable new paradigms in digital design by making petascale hero runs routine. Currently, untenable problems in complex system design, optimization, model exploration, and scientific discovery could all become possible. Motivated by the challenge of uncovering the next generation of robust high-yield inertial confinement fusion (ICF) designs, project ICECap (Inertial Confinement on El Capitan) attempts to integrate multiple advances in machine learning (ML), scientific workflows, high performance computing, GPU-acceleration, and numerical optimization to prototype such a future. Built on a general framework, ICECap is exploring how these technologies could broadly accelerate scientific discovery on El Capitan. In addition to our requirements, system-level design, and challenges, we describe some of the key technologies in ICECap, including ML replacements for multiphysics packages, tools for human-machine teaming, and algorithms for multifidelity design optimization under uncertainty. As a test of our prototype pre-El Capitan system, we advance the state-of-the art for ICF hohlraum design by demonstrating the optimization of a 17-parameter National Ignition Facility experiment and show that our ML-assisted workflow makes design choices that are consistent with physics intuition, but in an automated, efficient, and mathematically rigorous fashion.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

An information-matching approach to optimal experimental design and active learning

The efficacy of mathematical models heavily depends on the quality of the training data, yet collecting sufficient data is often expensive and challenging. Many modeling applications require inferring parameters only as a means to predict other quantities of interest (QoI). Because models often contain many unidentifiable (sloppy) parameters, QoIs often depend on a relatively small number of parameter combinations. Therefore, we introduce an information-matching criterion based on the Fisher information matrix to select the most informative training data from a candidate pool. This method ensures that the selected data contain sufficient information to learn only those parameters that are needed to constrain downstream QoIs. It is formulated as a convex optimization problem, making it scalable to large models and datasets. Here, we demonstrate the effectiveness of this approach across various modeling problems in diverse scientific fields, including power systems and underwater acoustics. Finally, we use information-matching as a query function within an active learning (AL) loop for materials science applications. In all these applications, we find that a relatively small set of optimal training data can provide the necessary information for achieving precise predictions. These results are encouraging for diverse future applications, particularly AL in large machine-learning models.

Materials science↗
DOE OSTI2026

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

The development of Gibbs's dyadic and implications for the gradient of a vector field

In this paper, we review the history of the dyadic as developed by Gibbs. This mathematical construct appeared in the second part of Gibbs's pamphlet on vector analysis (published in 1884), and it represented the first known development of a Cartesian theory of tensors. Gibbs made extensive use of the dyadic to express his theory of linear vector functions, that is, functions that acted on vectors and mapped them to new vectors. The dyadic proved to be a capable vehicle in Gibbs's hands, and his theory for dyadics (which we would now call second-order Cartesian tensors) was relatively advanced. The theory detailed notions such as the decomposition of vectors and conditions under which a tensor would have an inverse. While Gibbs's theory for linear operators expressed by dyadics was robust, it did not seem to garner the attention that the more conventional vector analysis (published in the first half of his pamphlet in 1881) did. Perhaps in part because of the general unfamiliarity with the dyadic, two distinct and conflicting definitions of the gradient of a vector field have arisen in the literature. The details of these differences in notation, possible reasons for the difference, and a potential resolution are proposed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Galerkin formulation of path integrals in lattice field theory

We present a mathematical framework for Galerkin formulations of path integrals in lattice field theory. The framework is based on using the degrees of freedom (DOFs) associated to a Galerkin discretization as the fundamental lattice variables. We formulate standard concepts in lattice field theory, such as the partition function and correlation functions, in terms of the DOFs. For example, using continuous finite element spaces, we show that the two-point spatial correlation function can be defined between any two points on the domain (as opposed to at just lattice sites) and furthermore, this two-point function satisfies a weak propagator (or Green’s function) identity, in analogy to the continuum case, as well as a convergence estimate obtained from the standard finite element techniques. Furthermore, this framework leads naturally to higher-order formulations of lattice field theories by considering higher-order finite element spaces for the Galerkin discretization. We consider analytical and numerical examples of scalar field theory to investigate how increasing the order of piecewise polynomial finite element spaces affect the approximation of lattice observables. Finally, we sketch an outline of this Galerkin framework in the context of gauge field theories.

97 MATHEMATICS AND COMPUTING↗