Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematical Methods”

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

Developing ML/AI Methods for High-Throughput Characterization of Multiple-Sensor Streams of Tokamak Dynamics for High-Speed Control (Final Report)

This project evaluated and developed new mathematical and algorithmic techniques capable of handling (in real-time) the growing amounts of data generated by modern fusion research. While existing numerical linear algebra (NLA) methods provide the backbone to classical data analysis and algorithms, these methods fundamentally do not port to distributed architectures nor do they allow low-latency data reduction for control. Motivated by the needs for modern fusion reactors, this project explored and implemented new numerical methods to characterize plasma dynamics, respond in real-time to discharge evolution, and to process massive-scale data accurately and rapidly more fully. This project links expertise in multiple-sensor diagnostics of tokamak plasma dynamics from Columbia University’s Plasma Physics Laboratory with expertise in massive-scale data reduction and extreme data control algorithms at Columbia University’s Data Science Institute. This interdisciplinary project (i) applied machine learning methods, (ii) implemented a properly-trained neural-network for very fast processing of high-speed plasma videography, and (ii) developed the applied mathematical methods, based on randomized-NLA (rNLA) routines, for data analysis, reduction, and real-time control. The Columbia University High Beta Tokamak-Extended Pulse (HBT-EP) facility provided data to test new algorithms and partnership with Columbia University's Data Sciences Institute evaluated the broader use of new algorithms for many challenging control applications.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Introducing a Markov chain-based time calibration procedure for multi-channel particle detectors: application to the SuperFGD and ToF detectors of the T2K experiment

Inter-channel mis-synchronisation can be a limiting factor to the time resolution of high performance timing detectors with multiple readout channels and independent electronics units. In these systems, time calibration methods employed must be able to efficiently correct for minimal mis-synchronisation between channels and achieve the best detector performance. We present an iterative time calibration method based on Markov Chains, suitable for detector systems with multiple readout channels. Starting from correlated hit pairs alone, and without requiring an external reference time measurement, the method solves for fixed per-channel offsets, with precision limited only by the intrinsic single-channel resolution. A mathematical proof that the method is able to find the correct time offsets to be assigned to each detector channel in order to achieve inter-channel synchronisation is given, and it is shown that the number of iterations to reach convergence within the desired precision is controllable with a single parameter. Numerical studies are used to confirm unbiased recovery of true offsets. Finally, the application of the calibration method to the Super Fine-Grained Detector (SuperFGD) and the Time of Flight (TOF) detector at the upgraded T2K near detector (ND280) shows good improvement in overall timing resolution, demonstrating the effectiveness in a real-world scenario and scalability.

calibration and fitting methods↗
DOE OSTI2024

Practical and Optimal Sequential Bayesian Experimental Design for Complex Systems Incorporating Human Experimenter Preferences (Final Scientific/Technical Report)

Experiments are indispensable for developing models of complex systems. Carefully designed experiments can provide substantial savings for these expensive data-acquisition opportunities. However, designs based on heuristics are often suboptimal for systems with multiphysics, nonlinear dynamics, and uncertain and noisy environments. Optimal experimental design, while leveraging predictive models, seeks to systematically quantify and maximize the value of experiments. In this project, we focused on the design of multiple experiments, where current approaches are largely suboptimal: batch-design does not adapt to new data acquired during the experiment campaign (no feedback), and greedy/myopic design ignores future dynamics and consequences (no lookahead). We developed the mathematical framework and computational methods for sequential optimal experimental design (sOED) for complex systems. We enabled tractable model-based sOED in a rigorous manner through novel algorithms based on reinforcement learning, and investigated the effects of human experimenters on the design process. Our methods are fully Bayesian, able to quantify and update uncertainty in a principled manner. The traits aimed by our approach—mathematical rigor and optimality, human effects and uncertainty quantification, computational practicality—are crucial for elevating the standards of artificial intelligence (AI) to support decision-making in scientific domains, and contribute toward trust and realistic adoption of AI in experimental design practice.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Machine Learning meets Algebraic Combinatorics: A Suite of Benchmark Datasets to Accelerate AI for Mathematics Research

The use of benchmark datasets has become an important engine of progress in machine learning (ML) over the past 15 years. Recently there has been growing interest in utilizing machine learning to drive advances in research-level mathematics. However, off-the-shelf solutions often fail to deliver the types of insights required by mathematicians. This suggests the need for new ML methods specifically designed with mathematics in mind. The question then is: what benchmarks should the community use to evaluate these? On the one hand, toy problems such as learning the multiplicative structure of small finite groups have become popular in the mechanistic interpretability community whose perspective on explainability aligns well with the needs of mathematicians. While toy datasets are a useful benchmark for initial work, they lack the scale, complexity, and sophistication of many of the principal objects of study in modern mathematics. To address this, we introduce a new collection of benchmark datasets, Algebraic Combinatorics Benchmarks (ACBench), representing either classic or open problems in algebraic combinatorics, a subfield of mathematics that studies discrete structures arising from abstract algebra. After describing the datasets, we discuss the challenges involved in constructing “good” mathematics benchmarks, describe baseline model performance, and discuss some of the insights these datasets can provide that may be of interest even to those who are not interested in mathematics research itself.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Small-𝑥 behavior in QCD from maximal entanglement and conformal invariance

Recent evidence suggests that, at small Bjorken 𝑥, QCD evolution drives the proton into a state of maximal entanglement. If the evolution kernel is assumed to be conformally invariant—as is the case for the Balitsky-Fadin-Kuraev-Lipatov equation—we can describe it by a conformal field theory. Moreover, the central charge 𝑐 of the corresponding conformal field theory emerges as the key parameter governing the 𝑥 dependence of both the entanglement entropy and the structure function. Here we apply the exact Bethe ansatz methods to the quantum spin chain dual to Lipatov’s high energy effective action to extract the central charge of the theory, and find that 𝑐 = 1. This implies the ∼𝑥 −1/3 small 𝑥 behavior for the structure function—the prediction that can be tested at the forthcoming Electron-Ion Collider.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Formally Verified ZTA Requirements for OT/ICS Environments with Isabelle/HOL

The clean energy transformation includes the integration of distributed energy resources with the power grid, which has led to a substantial increase in the complexity of power grids infrastructure and the underlying operational technology environment. Power grids infrastructure represents an operational technology environment that has become a system of systems, integrating heterogeneous devices which are both software-and hardware-intensive; as a result, there are increasing demands to exploit advances in the commodity of software-hardware infrastructures to improve energy systems requirements such as cybersecurity and resilience. In such a setting, system requirements at different levels mix, which leads to vulnerabilities and undesirable outcomes. The use of formal methods to characterize and prove system requirements removes ambiguity, increases automation, and provides high levels of assurance and reliability. In this paper, we contribute a methodology and a framework for the system-level verification of zero trust architecture requirements in operational technology environments. We define a formal specification for the core functionalities of operational technology environments, the corresponding invariants, and security proofs. Of particular note is our modular approach for the formal verification of asynchronous interactions in operational technology environments. The formal specification and the proofs have been mechanized using the interactive theorem proving environment Isabelle/HOL.

formal methods↗
DOE OSTI2024

Exact-Two-Component Complete Active Space Method with Variational Treatment of Magnetic Field and Spin–Orbit Coupling: Application to X-ray Magnetic Circular Dichroism Spectroscopy

We introduce an exact-two-component complete active space self-consistent-field (X2C-CASSCF) method formulated under the restricted-magnetic-balance condition. This framework allows for the nonperturbative treatment of static magnetic fields using gauge-including atomic orbitals (GIAOs). The GIAO-X2C-CASSCF methodology effectively captures all microstates within the same 2J + 1-degenerate manifold and their splitting in a static magnetic field, which are not accessible through single-reference-based methods. We also present mathematical recursive expressions for evaluating one-electron relativistic integrals by using GIAOs in the presence of a finite magnetic field. Benchmark studies include oxygen and nitrogen K-edge X-ray magnetic circular dichroism spectroscopy (XMCD) for closed-shell organic compounds, as well as L-edge XMCD spectroscopy for the high-spin open-shell transition metal ion Mn 2+ and the tetrahedral Mn(II)O 4 6– complex.

Chemical calculations↗
DOE OSTI2025

Zero curvature is a necessary and sufficient condition for a spin-orbital decomposition

There has been an extended debate regarding the existence of a spin-orbital decomposition of the angular momentum of photons and other massless particles. It was recently shown that there are both geometric and topological obstructions preventing any such decomposition. Here we show that any geometric connection on a particle’s state space induces a splitting of the angular momentum into two operators. These operators are well-defined angular momentum operators if and only if the connection has zero curvature. Massive particles have two canonical curved connections corresponding to boosts and rotations, respectively. Furthermore, these can be uniquely combined to produce a flat connection, and this gives a novel derivation of the Newton-Wigner position operator and the corresponding spin and orbital angular momenta for relativistic massive particles. When the mass is taken to zero, transverse boosts and rotations degenerate, leaving only a single connection for massless particles. This connection produces a commonly proposed splitting of the massless angular momentum into two operators. However, the connection is not flat, explaining why these operators do not satisfy the angular momentum commutation relations and are thus not true spin and orbital angular momentum operators.

Angular momentum↗
DOE OSTI2025

Loop-string-hadron approach to SU(3) lattice Yang-Mills theory: Hilbert space of a trivalent vertex

The construction of gauge-invariant states of SU(3) lattice gauge theories has garnered new interest in recent years, but implementing them is complicated by the need for SU(3) Clebsch-Gordon coefficients. In the loop-string-hadron (LSH) approach to lattice gauge theories, the elementary excitations are strictly gauge invariant, and constructing the basis requires no knowledge of Clebsch-Gordon coefficients. Originally developed for SU(2), the LSH formulation was recently generalized to SU(3), but limited to one spatial dimension. In this work, we generalize the LSH approach to constructing the basis of SU(3) gauge-invariant states at a trivalent vertex—the essential building block to multidimensional space. A direct generalization from the SU(2) vertex yields a legitimate basis; however, in certain sectors of the Hilbert space, the naive LSH basis vectors so defined suffer from being nonorthogonal. The issues with orthogonality are directly related to the “missing label” or “outer multiplicity” problem associated with SU(3) tensor products and may also be phrased in terms of Littlewood-Richardson coefficients or the need for a “seventh Casimir” operator. The states that are unaffected by the problem are orthonormalized in closed form. For the sectors that are afflicted, we discuss the nonorthogonal bases and their orthogonalization. A few candidates for seventh Casimir operators are readily constructed from the suite of LSH gauge-singlet operators. The diagonalization of a seventh Casimir represents one prescriptive solution toward obtaining a complete orthonormal basis, but a closed-form general solution remains to be found. Published by the American Physical Society 2025

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

CUDO: closed-form universal dwell-time optimization for computer-controlled optical surfacing

Precision optical figuring demands fast and accurate dwell time optimization to reach nanometer- and sub-nanometer-level accuracy in next-generation optical systems. We introduce CUDO (closed-form universal dwell-time optimization), the first, to the best of our knowledge, unified closed-form analytical framework that supports both function-form and matrix-form dwell time models in computer-controlled optical surfacing (CCOS). In contrast to traditional methods, which rely on iterative optimization and hyperparameter tuning, our framework derives direct analytical solutions with no adjustable parameters. This approach unifies the solution principles of existing methods within a single mathematical model, delivering three key advantages: (1) accuracy on par with, or superior to, iterative solvers, (2) substantial reduction in computation time, and (3) numerical robustness. Comparative studies with prior art confirm that closed-form solutions achieve equivalent residual error while removing runtime bottlenecks. By simplifying the implementation and enabling real-time, scalable deployment, CUDO establishes a practical foundation for future deterministic fabrication of large-aperture and high-performance optics.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Tracking the topology of neural manifolds across populations

Neural manifolds summarize the intrinsic structure of the information encoded by a population of neurons. Advances in experimental techniques have made simultaneous recordings from multiple brain regions increasingly commonplace, raising the possibility of studying how these manifolds relate across populations. However, when the manifolds are nonlinear and possibly code for multiple unknown variables, it is challenging to extract robust and falsifiable information about their relationships. We introduce a framework, called the method of analogous cycles, for matching topological features of neural manifolds using only observed dissimilarity matrices within and between neural populations. We demonstrate via analysis of simulations and in vivo experimental data that this method can be used to correctly identify multiple shared circular coordinate systems across both stimuli and inferred neural manifolds. Conversely, the method rejects matching features that are not intrinsic to one of the systems. Further, as this method is deterministic and does not rely on dimensionality reduction or optimization methods, it is amenable to direct mathematical investigation and interpretation in terms of the underlying neural activity. We thus propose the method of analogous cycles as a suitable foundation for a theory of cross-population analysis via neural manifolds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Refining a Novel Process Monitoring Method to Safeguard Continuously Cycling Designs Using Isotopic Ratios

In advanced reactor (AR) designs, a common feature is continuous chemical processing and circulation of the nuclear material. This work bridges a significant measurement gap in safeguarding reactors with circulating fuel or continuous refueling by leveraging and building on the isotope ratio method first developed by our team under an FY21 Advanced Reactors International Safeguards Engagement (ARISE) project (Uribe et al. 2021). In circulating fuel designs, the radioisotope inventory changes from traditional effects (e.g., radioactive decay, fission) but also includes material transport due to pressure and temperature gradients. Such designs may also require regular or continuous additions or removals during operation, which significantly increases the rate of inventory change compared to traditional pressurized water reactor (PWR)s. Thus, directly tracking the nuclear inventory is ineffective since the isotopes are continuously added and removed. The isotope ratio method instead focuses on detecting changes to the input and output flows of radioisotopes. Previous work showed that for well-chosen pairs of isotopes, the isotopic ratio provides a sensitive and lasting indicator of deviation from normal conditions (e.g., startup, shutdown, diversion). The isotope ratio method is a process monitoring method with potential for application in for forward-looking approaches to International Atomic Energy Agency (IAEA) safeguards. The original process monitoring method was developed for a specific case—the decay tank of a thorium-fueled molten salt breeder reactor. In this expanded work, we explored other types of reactors and processes with nonstationary (e.g., flowing) nuclear material, which are difficult to safeguard with traditional methods because of the transient nature of the systems. The goal of the present work is to generalize the isotope ratio method for use in processes with continuously flowing nuclear material. All continuous processes have an average time for isotopes to be replaced in the system. The isotope ratio method works by choosing radioisotopes with half-lives both above and below the processing time. The present work seeks to explore which isotopes are suitable for the method by simulating the nuclear inventory, radioisotope emissions, and detector responses for several classes of advanced reactors. While the method can in principle be applied to other processes (e.g., enrichment or reprocessing facilities), the present work limits scope to ARs with continuously flowing fuel. Section 2 details the mathematics supporting the isotope ratio method, and Section 3 introduces the representative ARs selected for this work. Section 4 discusses how each reactor was analyzed, and Section 5 showcases the results for each representative reactor. Finally, Section 6 provides concluding remarks and suggests pathways for further analysis.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2024

A Low-Rank QTT-based Finite Element Method for Elasticity Problems

We present an efficient and robust numerical algorithm for solving the linear elasticity problem that combines the Quantized Tensor Train format and a domain partitioning strategy. This approach makes it possible to solve the linear elasticity problem on a computational domain that is more general than a square. By integrating Z-ordering and subdomain concatenation, our method substantially decreases memory usage and achieves a notable reduction in rank compared to established Finite Element implementations like the FEniCS platform. This efficiency is maintained while still guaranteeing exponential convergence with respect to the number of degrees of freedom. This performance gain, however, requires a fundamental rethinking of how core finite element operations are implemented. This includes changes to mesh discretization, node and degree of freedom ordering, stiffness matrix and internal nodal force assembly, and the execution of algebraic matrix-vector operations. In this work, we discuss all these aspects in detail and assess the method’s performance in the numerical approximation of three representative test cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Exact closed-form unitary transformations of fermionic operators

Unitary transformations play a fundamental role in many-body physics, and except for special cases, they are not expressible in closed form. We present closed-form expressions for unitary transformations generated by a single fermionic operator for Hermitian and anti-Hermitian generators. We demonstrate the usefulness of these expressions in formal analyses of unitary transformations and numerical applications to Hamiltonian downfolding in quantum computing and Heisenberg dynamics. Furthermore, this work paves the way for new analytical treatments of unitary transformations and numerical many-body methods for fermions.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

Development of Accelerated Kinetic Monte Carlo Code for Simulation of Helium Bubble Evolution

A mesoscale model to predict helium bubble evolution is needed for tritium applications. Such a model requires that the conventional kinetic Monte Carlo (kMC) simulations be significantly accelerated. The objective of this report is to (a) highlight the concepts and mathematical expressions of the accelerated method for defect implementation that have not been published, (b) show an example input file to run the kMC code, and (c) provide suggestions on future improvement following my retirement.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Position Papers for Inverse Methods for Complex Systems under Uncertainty Workshop

The ability to solve inverse problems – inferring unknown parameters, structures, or states of a system from observed data – is essential for advancing scientific discovery and innovation capabilities for the DOE mission. Basic research needs and challenges are particularly acute in emerging areas such as the interactive, data-driven, modeling and simulation of digital twins; decision support for experiments at DOE scientific user facilities; and for other complex systems and workflows. Inverse problems are at the heart of understanding and controlling complex systems due to factors such as observational data with varying modalities and fidelities, inherent uncertainties in physical measurements and numerical models, and the computational demands of rapid and high-fidelity simulations. The convergence of recent scientific computing trends – scientific machine learning, artificial intelligence, and computing advances such as exascale computing – is creating unprecedented opportunities. These advancements offer the potential to revolutionize how we approach inverse problems to extract actionable insights with the required level of accuracy and computational efficiency. This workshop and the Call for Position Papers are vital steps in bringing together experts to collectively explore and identify the new computational and mathematical directions needed in inverse methods for complex systems under uncertainty.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Efficient proximal subproblem solvers for a nonsmooth trust-region method

In [R. J. Baraldi and D. P. Kouri, Mathematical Programming, (2022), pp. 1-40], we introduced an inexact trust-region algorithm for minimizing the sum of a smooth nonconvex and nonsmooth convex function. The principle expense of this method is in computing a trial iterate that satisfies the so-called fraction of Cauchy decrease condition—a bound that ensures the trial iterate produces sufficient decrease of the subproblem model. In this paper, we expound on various proximal trust-region subproblem solvers that generalize traditional trust-region methods for smooth unconstrained and convex-constrained problems. We introduce a simplified spectral proximal gradient solver, a truncated nonlinear conjugate gradient solver, and a dogleg method. Finally, we compare algorithm performance on examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗