Search NASA⌕ Search

SEARCH · Search NASA

Results for “Applied Mathematics”

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

Application of physics-informed neural networks (PINNs) solution to coupled thermal and hydraulic processes in silty sands

Abstract The accurate modeling of water and heat transport in soils is crucial for both geo-environmental and geothermal engineering. Traditional modeling methods are problematic because they require well-defined boundaries and initial conditions. Recently, physics-informed neural networks (PINNs), which incorporate partial differential equations (PDEs) to solve forward and inverse problems, have attracted increasing attention in machine learning research. In this study, we applied PINNs to tackle hydraulic and thermal transport coupling forward problems in silty sands. A fully connected deep neural network was utilized for training. This neural network model leverages automatic differentiation to apply the governing equations as constraints, based on the mathematical approximations established by the neural network itself. We conducted forward problems and compared the solutions derived from PINNs with those from Finite Element Method (FEM) simulations. The forward problem results demonstrate the PINNs model’s capability in predicting hydraulic transport, heat transport, and thermal–hydraulic coupling in silty sands under various boundary conditions. The PINNs exhibited great performance in simulating the thermal–hydraulic coupling problem. The accuracy of the PINNs solutions shows its potential for simulation in geotechnical engineering.

Feng, Yuan↗
DOE OSTI2025

Prediction of cccDNA dynamics in hepatitis B patients by a combination of serum surrogate markers

Quantification of intrahepatic covalently closed circular DNA (cccDNA) is a key for evaluating an elimination of hepatitis B virus (HBV) in infected patients. However, quantifying cccDNA requires invasive methods such as a liver biopsy, which makes it impractical to access the dynamics of cccDNA in patients. Although HBV RNA and HBV core-related antigens (HBcrAg) have been proposed as surrogate markers for evaluating cccDNA activity, they do not necessarily estimate the amount of cccDNA. Here, we employed a recently developed multiscale mathematical model describing intra- and intercellular viral propagation and applied it in HBV-infected patients under treatment. We developed a model that can predict intracellular HBV dynamics by use of extracellular viral markers, including HBsAg, HBV DNA, and HBcrAg in peripheral blood. Importantly, the model prediction of the amount of cccDNA in patients over time was confirmed to be well correlated with the data for quantified cccDNA by paired liver biopsy. Thus, our method combining classic and emerging surrogate markers enables us to predict the decay dynamics of cccDNA in patients undergoing treatment.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Transforming the Bootstrap: Using Transformers to Compute Scattering Amplitudes in Planar N = 4 Super Yang-Mills Theory

We pursue the use of deep learning methods to improve state-of-the-art computations in theoretical high-energy physics. Planar N = 4 Super Yang-Mills theory is a close cousin to the theory that describes Higgs boson production at the Large Hadron Collider; its scattering amplitudes are large mathematical expressions containing integer coefficients. In this paper, we apply Transformers to predict these coefficients. The problem can be formulated in a language-like representation amenable to standard cross-entropy training objectives. We design two related experiments and show that the model achieves high accuracy (> 98%) on both tasks. Our work shows that Transformers can be applied successfully to problems in theoretical physics that require exact solutions.

Lance, Dixon↗
DOE OSTI2026

Towards modeling phage therapy

Patients infected with life-threatening multi-drug resistant (MDR) bacteria have been treated with cocktails of bacteriophages. This is a complicated form of personalized medicine as the phages given to a patient have to be selected beforehand on the basis of their lytic capacity of the infecting bacteria. Because bacteria rapidly become resistant, the evolution of resistance to a diverse cocktail of phages is a complicated dynamical process, during which competing bacterial strains replace one another by accumulating several resistance mechanisms, each of which may involve a fitness cost. As a consequence, it is typically not known why a particular phage therapy succeeded or failed, and how one can optimize the composition of the cocktails to maximize the rate of success. To improve upon this, we extend an existing in vivo -calibrated mouse model into a novel mathematical model for the human situation, and include multiple phages infecting multiple bacterial strains, differing in their resistance to each of the phages. We adjust several parameter estimates of the bacterial model to the human situation, and use the model to describe a successful case of phage therapy involving several cocktails, each containing several phages. In the model, treatment success crucially depended on pretreatment resistance levels, and on the diversity and the timing of the cocktails. Once an appropriate cocktail is found, it is less important to further optimize the infection rates of the phages. Resistant bacterial strains expand rapidly when sensitive strains decline, and the higher the infectivity of the phages, the faster resistant strains expand. Because resistance evolves rapidly, it is best to provide a diverse set of phages right from the start of therapy, i.e., to hit hard and early, and create a high genetic barrier to bacterial resistance.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Physics-constrained machine learning for electrodynamics without gauge ambiguity based on Fourier transformed Maxwell’s equations

We utilize a Fourier transformation-based representation of Maxwell’s equations to develop physics-constrained neural networks for electrodynamics without gauge ambiguity, which we label the Fourier–Helmholtz–Maxwell neural operator method. In this approach, both of Gauss’s laws and Faraday’s law are built in as hard constraints, as well as the longitudinal component of Ampère–Maxwell in Fourier space, assuming the continuity equation. An encoder–decoder network acts as a solution operator for the transverse components of the Fourier transformed vector potential, $\hat{A}_⟂(k,t)$, whose two degrees of freedom are used to predict the electromagnetic fields. This method was tested on two electron beam simulations. Among the models investigated, it was found that a U-Net architecture exhibited the best performance as it trained quicker, was more accurate and generalized better than the other architectures examined. We demonstrate that our approach is useful for solving Maxwell’s equations for the electromagnetic fields generated by intense relativistic charged particle beams and that it generalizes well to unseen test data, while being orders of magnitude quicker than conventional simulations. We show that the model can be re-trained to make highly accurate predictions in as few as 20 epochs on a previously unseen data set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Chasing Gamma-Ray Signals from Binary Neutron Star Coalescences with the Cherenkov Telescope Array: Prospects and Observing Strategies

The detection of gravitational waves (GWs) from a binary neutron star (BNS) merger by Advanced LIGO and Advanced Virgo (GW170817), together with its electromagnetic counterpart, the short gamma-ray burst GRB 170817A, heralded the birth of multimessenger astronomy. The detection of TeV emission from GRBs motivates follow-up observations with the Cherenkov Telescope Array Observatory (CTAO), which is ideal for detecting such signals due to its unprecedented sensitivity, rapid response, and wide-field survey capabilities. The aim of this work is to evaluate GeV–TeV GW follow-up strategies for CTAO using a multistep simulation pipeline and to estimate the expected rate of joint GW–GRB detections during observing run O5. Using a simulated sample of BNS systems with corresponding GW detections, gamma-ray emission is simulated through phenomenological prescriptions based on the observed population of short GRBs, including off-axis jet scenarios. CTAO observations are simulated to account for instrument response, sky tiling strategies, integration times, and varying observing conditions. Strategies with variable and constant integration times are investigated. We find that, via an optimized follow-up strategy, about 5% of simulated GW-associated short GRBs produce GeV–TeV radiation detectable by CTAO. Detectability is strongly influenced by the jet opening angle and viewing angle, suggesting that even rough estimates of the viewing angle in GW alerts could enhance targeting. This framework motivates future follow-ups of GW-detectable events, including neutron star–black hole mergers, and further supports the development of advanced strategies incorporating galaxy distributions and synergies with future detectors such as the Einstein Telescope.

Abe, S. [University of Tokyo] (ORCID:0000000172503↗
DOE OSTI2024

Stable vacua with realistic phenomenology and cosmology in heterotic M-theory satisfying Swampland conjectures

We recently described a protocol for computing the potential energy in heterotic M-theory for the dilaton, complex structure and Kähler moduli. This included the leading order non-perturbative contributions to the complex structure, gaugino condensation and worldsheet instantons assuming a hidden sector that contains an anomalous U(1) structure group embedded in E8. In this paper, we elucidate, in detail, the mathematical and computational methods required to utilize this protocol. These methods are then applied to a realistic heterotic M-theory model, the B – L MSSM, whose observable sector is consistent with all particle physics requirements. Within this context, it is shown that the dilaton and universal moduli can be completely stabilized at values compatible with every phenomenological and mathematical constraint — as well as with ΛCDM cosmology. We also show that the heterotic M-theory vacua are consistent with all well-supported Swampland conjectures based on considerations of string theory and quantum gravity, and we discuss the implications of dark energy theorems for compactified theories.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Autonomous Operations for Advanced Reactors Utilizing Supervisory Control

Automation is a critical tenet of reactor plant operations as reliance on nuclear energy increases. Nuclear power plants require a large workforce which does not scale with output; that is, the cost per megawatt increases as reactor output becomes smaller. The economic viability of advanced reactors, particularly small modular reactors (SMRs) and microreactors, requires a significantly reduced onsite workforce. The logical solution is establishing a systematic process of elimination of reliance on human operators, and to the extent possible, replacing these actions with automated functions. In this paper, we propose a method for such transformation to establish a robust technical basis to enable transition to autonomy. Our method is based on finite state automata (FSA)—also known as finite state machines (FSMs). Relying on this method allows us to exploit the rich set of mathematical proofs available in the field of regular languages. FSA are one of the mathematical tools to model discrete event systems (DES). These properties are applied to produce an automated startup controller for the Massachusetts Institute of Technology Research Reactor (MITR). The startup procedure is captured in terms of discrete changes from one state to another while an independent supervisory control system directs the sequence of states and alerts a human in the event of an abnormal operation. First, the design and behavior of the MITR rod control system were modeled in Simulink. Then, the startup procedure was applied to the rod control system and the DES performed a startup by procedurally withdrawing rods to the subcritical position. The simulation also stops rod motion in response to an uncontrollable event and restarts rod motion once the event has been cleared.

46 - INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AN↗
DOE OSTI2025

A Combined Computational and Mathematical Analysis of Interconnect Fatigue Potential in Photovoltaic Modules

A finite element model of a 60-cell monocrystalline silicon glass-polymer photovoltaic module was simulated with ±1.0 kPa and ±2.4 kPa loads applied to the glass to calculate the deformation under load. Cell-to-cell displacements were used to approximate interconnect strain and stress. A mathematical fatigue cycle life relation was fitted to data for the interconnect material (copper), to generate a life prediction at each interconnect location based on the local stress means, reversal extents, and amplitudes. Interconnect stress was found to be significantly asymmetric about zero despite symmetric positive and negative module loads due to laminate thickness offsets about the neutral plane and the effects of module framing. Cycle life results indicated that interconnect fatigue failure was unlikely to occur over a 30-year lifetime of conservative wind and snow load cycles since the typical cell design feature of leaving some unconstrained length between the cell edge and first solder pad increases the effective gauge length and decreases the stress levels below the material endurance limit. Follow-up analyses found that 3.6 mm and 6.4 mm were the minimum unconstrained lengths required to survive the assumed lifetime of wind and snow cycles, respectively, confirming that typical industrial module constructions with 8–15 mm unconstrained lengths should survive conservatively. Notably, large magnitude, low-cycle snow loading was consistently the limiting factor requiring a longer unconstrained interconnect length. Finally, insights and workflows from this study inform module interconnection design limits for survival against mechanical fatigue in deployment environments.

14 SOLAR ENERGY↗
DOE OSTI2025

Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty

Engineering and applied science rely on computational experiments to rigorously study physical systems. The mathematical models used to probe these systems are highly complex, and sampling-intensive studies often require prohibitively many simulations for acceptable accuracy. Surrogate models provide a means of circumventing the high computational expense of sampling such complex models. In particular, polynomial chaos expansions (PCEs) have been successfully used for uncertainty quantification studies of deterministic models where the dominant source of uncertainty is parametric. We discuss an extension to conventional PCE surrogate modeling to enable surrogate construction for stochastic computational models that have intrinsic noise in addition to parametric uncertainty. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt transformations, which are evaluated via kernel density estimation of the associated conditional cumulative distributions. Furthermore, we extend the construction to random field data via the Karhunen–Loève expansion. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model which quantifies the intrinsic noise contribution to the overall model output variance. Additionally, the resulting joint PCE is generative in the sense that it allows generating random realizations at any input parameter setting that are statistically approximately equivalent to realizations from the underlying stochastic model. The method is demonstrated on a chemical catalysis example model and a synthetic example controlled by a parameter that enables a switch from unimodal to bimodal response distributions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Robust Containment Queries over Collections of Trimmed NURBS Surfaces via Generalized Winding Numbers

Here, we propose a containment query that is robust to the watertightness of regions bound by trimmed NURBS surfaces, as this property is difficult to guarantee for in-the-wild CAD models. Containment is determined through the generalized winding number (GWN), a mathematical construction that is indifferent to the arrangement of surfaces in the shape. Applying contemporary techniques for the 3D GWN to trimmed NURBS surfaces requires some form of geometric discretization, introducing computational inefficiency to the algorithm and even risking containment misclassifications near the surface. In contrast, our proposed method leverages properties of the 3D solid angle to solve the relevant surface integral using a boundary formulation with rapidly converging adaptive quadrature. Batches of queries are further accelerated by memoizing (i.e., caching and reusing) quadrature node positions and tangents as they are evaluated. We demonstrate that our GWN method is robust to complex trimming geometry in a CAD model, and is accurate up to arbitrary precision at arbitrary distances from the surface. The derived containment query is therefore robust to model non-watertightness while respecting all curved features of the input shape.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Neuromorphic intermediate representation: A unified instruction set for interoperable brain-inspired computing

Abstract Spiking neural networks and neuromorphic hardware platforms that simulate neuronal dynamics are getting wide attention and are being applied to many relevant problems using Machine Learning. Despite a well-established mathematical foundation for neural dynamics, there exists numerous software and hardware solutions and stacks whose variability makes it difficult to reproduce findings. Here, we establish a common reference frame for computations in digital neuromorphic systems, titled Neuromorphic Intermediate Representation (NIR). NIR defines a set of computational and composable model primitives as hybrid systems combining continuous-time dynamics and discrete events. By abstracting away assumptions around discretization and hardware constraints, NIR faithfully captures the computational model, while bridging differences between the evaluated implementation and the underlying mathematical formalism. NIR supports an unprecedented number of neuromorphic systems, which we demonstrate by reproducing three spiking neural network models of different complexity across 7 neuromorphic simulators and 4 digital hardware platforms. NIR decouples the development of neuromorphic hardware and software, enabling interoperability between platforms and improving accessibility to multiple neuromorphic technologies. We believe that NIR is a key next step in brain-inspired hardware-software co-evolution, enabling research towards the implementation of energy efficient computational principles of nervous systems. NIR is available atneuroir.org

Science & Technology - Other Topics↗
DOE OSTI2025

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Simple, Scalable Large Deformation Solid Mechanics Implementation in the MOOSE Framework

This article describes a large deformation solid mechanics solver implemented as part of the freely available and open source MOOSE finite element simulation framework. The article documents the choices made in developing the solid mechanics framework and describes novel formulations for the gradient operator and constitutive modeling framework made to simplify implementations of different coordinate systems, stabilized gradient operators, and different constitutive model inputs and outputs. In the process, the article describes a new formulation that casts objective integration of the Cauchy stress as a linear transformation of the small stress rate. Finally, the article presents key implementation details and examines the parallel efficiency of the solid mechanics solver implemented in MOOSE. The implementation retains a good weak scaling efficiency beyond 1,000 parallel processes. The article includes a discussion of the factors limiting the parallel efficiency of implicit, large deformation solid mechanics codes on current high-performance computers, with the main current limitation being the scalability of the algebraic multigrid methods used to solve the linearized equilibrium equations.

Applied computing → Computer-aided design↗
DOE OSTI2024

Hilbert series for covariants and their applications to minimal flavor violation

We elaborate how to apply the Hilbert series method to enumerating group covariants, which transform under any given representation, including but going beyond group invariants. Mathematically, group covariants form a module over the ring of the invariants. The number of independent covariants is given by the rank of the module, which can be computed by taking a ratio of two Hilbert series. In many cases, the rank equals the dimension of the group covariant representation. When this happens, we say that there is a rank saturation. We apply this technology to revisit the hypothesis of Minimal Flavor Violation in constructing Effective Field Theories beyond the Standard Model. We find that rank saturation is guaranteed in this case, leading to the important consequence that the MFV symmetry principle does not impose any restriction on the EFT, i.e. MFV SMEFT = SMEFT, in the absence of additional assumptions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

On the Recoverability of Reactor Dynamics from Point Kinetics Data using SINDYc

Data driven models for reactor dynamics tend to face a few notable challenges. First, the broad range of timescales present across the various feedback mechanisms. Next, high standards for safety and importance of model performance in all operational domains. Finally, the correlations between state variables observed in most transients leads to difficulties when methods attempt to attribute certain dynamic phenomena to a particular cause. The current paper seeks to support efforts towards incorporating physics knowledge into one particular data-driven method for finding reactor dynamics called ``Sparse Identification of Nonlinear Dynamics with Control (SINDYc). The incorporation of physical knowledge into SINDYc will help address the challenges listed above by giving the model an initial understanding of the system being modeled. The demonstration of an exact representation of a set of point reactor dynamics equations in SINDYc is provided. Then, this allows for further discussion with mathematical justification as to why SINDYc, and other data-driven methods, may be difficult to apply to nuclear reactor dynamics due to correlations in the state variables. A particularly useful result of this work is the set of candidate functions required in SINDYc to exactly represent the reactor dynamics under a point approximation. In the future, SINDYc can be integrated with point models for reactor dynamics before being applied to the physical system to yield higher accuracy.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗