Search NASASearch

SEARCH · Search NASA

Results for “Recursion”

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

ZERNIPAX: A fast and accurate Zernike polynomial calculator in Python

Zernike polynomials serve as an orthogonal basis on the unit disc, and have proven to be effective in optics simulations, astrophysics, and more recently in plasma simulations. Unlike Bessel functions, Zernike polynomials are inherently finite and smooth at the disc center (r=0), ensuring continuous differentiability along the axis. This property makes them particularly suitable for simulations, requiring no additional handling at the origin. We developed ZERNIPAX, an open-source Python package capable of utilizing CPU/GPUs, leveraging Google's JAX package and available on GitHub as well as the Python software repository PyPI. Furthermore, our implementation of the recursion relation between Jacobi polynomials significantly improves computation time compared to alternative methods by use of parallel computing while still performing more accurately for high-mode numbers.

Astrophysics

Multi-frequency progressive refinement for learned inverse scattering

Interpreting scattered acoustic and electromagnetic wave patterns is a computational task that enables remote imaging in a number of important applications, including medical imaging, geophysical exploration, sonar and radar detection, and nondestructive testing of materials. However, accurately and stably recovering an inhomogeneous medium from far-field scattered wave measurements is a computationally difficult problem, due to the nonlinear and non-local nature of the forward scattering process. We design a neural network, called Multi-Frequency Inverse Scattering Network (MFISNet), and a training method to approximate the inverse map from far-field scattered wave measurements at multiple frequencies. We consider three variants of MFISNet, with the strongest performing variant inspired by the recursive linearization method — a commonly used technique for stably inverting scattered wavefield data — that progressively refines the estimate with higher frequency content. MFISNet outperforms past methods in regimes with high-contrast, heterogeneous large objects, and inhomogeneous unknown backgrounds.

97 MATHEMATICS AND COMPUTING

Joint state-parameter estimation for the reduced fracture model via the united filter

Here, in this paper, we introduce an effective United Filter method for jointly estimating the solution state and physical parameters in flow and transport problems within fractured porous media. Fluid flow and transport in fractured porous media are critical in subsurface hydrology, geophysics, and reservoir geomechanics. Reduced fracture models, which represent fractures as lower-dimensional interfaces, enable efficient multi-scale simulations. However, reduced fracture models also face accuracy challenges due to modeling errors and uncertainties in physical parameters such as permeability and fracture geometry. To address these challenges, we propose a United Filter method, which integrates the Ensemble Score Filter (EnSF) for state estimation with the Direct Filter for parameter estimation. EnSF, based on a score-based diffusion model framework, produces ensemble representations of the state distribution without deep learning. Meanwhile, the Direct Filter, a recursive Bayesian inference method, estimates parameters directly from state observations. The United Filter combines these methods iteratively: EnSF estimates are used to refine parameter values, which are then fed back to improve state estimation. Numerical experiments demonstrate that the United Filter method surpasses the state-of-the-art Augmented Ensemble Kalman Filter, delivering more accurate state and parameter estimation for reduced fracture models. This framework also provides a robust and efficient solution for PDE-constrained inverse problems with uncertainties and sparse observations.

Bayesian inference

A score-based diffusion model approach for adaptive learning of stochastic partial differential equation solutions

In this paper, we propose a novel framework for adaptively learning the time-evolving solutions of stochastic partial differential equations (SPDEs) using score-based diffusion models within a recursive Bayesian inference setting. SPDEs play a central role in modeling complex physical systems under uncertainty, but their numerical solutions often suffer from model errors and reduced accuracy due to incomplete physical knowledge and environmental variability. To address these challenges, we encode the governing physics into the score function of a diffusion model using simulation data and incorporate observational information via a likelihood-based correction in a reverse-time stochastic differential equation. This enables adaptive learning through iterative refinement of the solution as new data becomes available. To improve computational efficiency in high-dimensional settings, we introduce the ensemble score filter, a training-free approximation of the score function designed for real-time inference. Numerical experiments on benchmark SPDEs demonstrate the accuracy and robustness of the proposed method under sparse and noisy observations.

97 MATHEMATICS AND COMPUTING

Development and validation of a software for simulating γ-γ coincidence emission and detection probabilities

Gamma-gamma coincidence spectrometers have the potential to significantly enhance detection sensitivity for ultra-trace radionuclide measurements. The implementation of these spectrometers, however, is limited by the complexity of acquisition hardware, data processing and quantification. This work reports development of a novel radionuclide quantification software for γ-γ coincidence measurements. For any radionuclide, the software parses the Evaluated Nuclear Structure Data File (ENSDF) database, recursively simulating all possible γ-γ coincidence signatures and their respective emission and detection probabilities. Implemented using Python programming language, the software employs several strategies to boost overall computational performance. Since coincidence-based spectrometers are of notable interest in monitoring compliance for the Comprehensive Nuclear-Test-Ban Treaty (CTBT), the software’s execution was tested for 84 CTBT-relevant radionuclides. To date, the software has been experimentally validated for 15 radionuclides using the Advanced Radionuclide Gamma spectrOmeter (ARGO) at Pacific Northwest National Laboratory, USA (PNNL). Notably, the software can be operated in convergence mode, whereby coincidence detection efficiency’s convergence behavior can help avoid unreliable radionuclide activity estimates. With growing number of coincidence spectrometers worldwide, this paper aims to assist the radiation metrology community in developing similar software for their system.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND

ν-point energy correletors with F AST EEC: Small-x physics from LHC jets

In recent years, energy correlators have emerged as a powerful tool for studying jet substructure, with promising applications such as probing the hadronization transition, analyzing the quark-gluon plasma, and improving the precision of top quark mass measurements. The projected N-point correlator measures correlations between N final-state particles by tracking the largest separation between them, showing a scaling behavior related to DGLAP splitting functions. These correlators can be analytically continued in N, commonly referred to as ν-correlators, allowing access to non-integer moments of the splitting functions. Of particular interest is the ν → 0 limit, where the small momentum fraction behavior of the splitting functions requires resummation. Originally, the computational complexity of evaluating ν-correlators for M particles scaled as 2 2M , making it impractical for real-world analyses. However, by using recursion, we reduce this to M 2M , and through the FastEEC method of dynamically resolving subjets, M is replaced by the number of subjets. This breakthrough enables, for the first time, the computation of ν-correlators for LHC data. In practice, limiting the number of subjets to 16 is sufficient to achieve percent-level precision, which we validate using known integer-ν results and convergence tests for non-integer ν. We have implemented this in an update to FastEEC and conducted an initial study of power-law scaling in the perturbative regime as a function of ν, using CMS Open Data on jets. The results agree with DGLAP evolution, except at small ν, where the anomalous dimension saturates to a value that matches the BFKL anomalous dimension.

Energy correlators

Efficient Mixed-Precision Matrix Factorization of the Inverse Overlap Matrix in Electronic Structure Calculations with AI-Hardware and GPUs

In recent years, a new kind of accelerated hardware has gained popularity in the artificial intelligence (AI) community which enables extremely high-performance tensor contractions in reduced precision for deep neural network calculations. In this article, we exploit Nvidia Tensor cores, a prototypical example of such AI-hardware, to develop a mixed precision approach for computing a dense matrix factorization of the inverse overlap matrix in electronic structure theory, S –1 . This factorization of S –1 , written as ZZT = S –1 , is used to transform the general matrix eigenvalue problem into a standard matrix eigenvalue problem. Here we present a mixed precision iterative refinement algorithm where Z is given recursively using matrix–matrix multiplications and can be computed with high performance on Tensor cores. To understand the performance and accuracy of Tensor cores, comparisons are made to GPU-only implementations in single and double precision. Additionally, we propose a nonparametric stopping criteria which is robust in the face of lower precision floating point operations. The algorithm is particularly useful when we have a good initial guess to Z, for example, from previous time steps in quantum-mechanical molecular dynamics simulations or from a previous iteration in a geometry optimization.

36 MATERIALS SCIENCE

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

Machine Learning Correlation of Electron Micrographs and ToF-SIMS for the Analysis of Organic Biomarkers in Mudstone

The spatial distribution of organics in geological samples can be used to determine when and how these organics were incorporated into the host rock. Mass spectrometry (MS) imaging can rapidly collect a large amount of data, but ions produced are mixed without discrimination, resulting in complex mass spectra that can be difficult to interpret. Here, we apply unsupervised and supervised machine learning (ML) to help interpret spectra from time-of-flight-secondary ion mass spectrometry (ToF-SIMS) of an organic-carbon-rich mudstone of the Middle Jurassic of England (UK). It was previously shown that the presence of sterane molecular biomarkers in this sample can be detected via ToF-SIMS (Pasterski, M. J. et al., Astrobiology 2023, 23, 936). We use unsupervised ML on scanning electron microscopy–electron dispersive spectroscopy (SEM-EDS) measurements to define compositional categories based on differences in elemental abundances. We then test the ability of four ML algorithms─k-nearest neighbors (KNN), recursive partitioning and regressive trees (RPART), eXtreme gradient boost (XGBoost), and random forest (RF)─to classify the ToF-SIM spectra using (1) the categories assigned via SEM-EDS, (2) organic and inorganic labels assigned via SEM-EDS, and (3) the presence or absence of detectable steranes in ToF-SIMS spectra. In terms of predictive accuracy and balanced accuracy, KNN was the best performing model and RPART the worst. The feature importance, or the specific features of the ToF-SIM spectra used by the models to make classifications, cannot be determined for KNN, preventing posthoc model interpretation. Nevertheless, the feature importance extracted from the other models was useful for interpreting spectra. In conclusion, we determined that some of the organic ions used to classify biomarker containing spectra may be fragment ions derived from kerogen which is abundant in this mudstone sample.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Spectroscopy of the fractal Hofstadter energy spectrum

Hofstadter’s butterfly, the predicted energy spectrum for non-interacting electrons confined to a two-dimensional lattice in a magnetic field, is one of the most remarkable fractal structures in nature. At rational ratios of magnetic flux quanta per lattice unit cell, this spectrum shows self-similar distributions of energy levels that reflect its recursive construction. For most materials, Hofstadter’s butterfly is predicted under experimental conditions that are unachievable using laboratory-scale magnetic fields. More recently, electrical transport studies have provided evidence for Hofstadter’s butterfly in materials engineered to have artificially large lattice constants, such as those with moiré superlattices. Yet, so far, direct spectroscopy of the fractal energy spectrum predicted by Hofstadter nearly 50 years ago has remained out of reach. Here, in this work, we use high-resolution scanning tunnelling microscopy/spectroscopy (STM/STS) to investigate the flat electronic bands in twisted bilayer graphene (TBG) near the predicted second magic angle, an ideal setting for spectroscopic studies of Hofstadter’s spectrum. Our study shows the fractionalization of flat moiré bands into discrete Hofstadter subbands and discerns experimental signatures of self-similarity of this spectrum. Moreover, our measurements uncover a spectrum that evolves dynamically with electron density, showing phenomena beyond that of Hofstadter’s original model owing to the combined effects of strong correlations, Coulomb interactions and the quantum degeneracy of electrons in TBG.

electronic properties and materials

Connected Traffic Signal Coordination Optimization Framework through Network-Wide Adaptive Linear Quadratic Regulator–Based Control Strategy

Traffic congestion in metropolitan areas causes several significant challenges, such as longer travel times, decreased productivity, increased fuel consumption and vehicle emissions, and even severe injuries during crashes. Traffic signal control is a management approach to reduce traffic congestion and allocate the appropriate right of way for safety and mobility efficiency, both in temporal and spatial domains. Here, this study proposes a network-wide adaptive signal control coordination optimization framework based on the linear quadratic regulator algorithm. The traffic flow conditions driven by signal control inputs are formulated based on their network-wide state-space representation. After modeling traffic control regulation constraints, an adaptive linear quadratic regulator algorithm is designed to maximize the network-wide total throughput under the current conditions. Optimal signal control split time durations for multiple intersections in the network are derived by solving the algebraic Riccati equation. Furthermore, the recursive least square parameter estimation method is employed to quantify dynamic traffic condition changes. To verify the effectiveness of this proposed signal control framework, both simulation and real-world experimental tests are conducted for multiple intersections in downtown Chattanooga, Tennessee, United States. In preparation for real-world experimental tests, pipelines for real-time data processing implementation and historical traffic flow data analysis are conducted. The test results demonstrate that the proposed control framework achieves a decrease in travel time by up to 19.4%, total time spent (TTS) by up to 11.9%, and relative queue balance (RQB) by up to 15.6%. The research findings indicate that the proposed signal control framework can be generalized to handle large scale signal control optimization network-wide.

97 MATHEMATICS AND COMPUTING

Polariton spectra under the collective coupling regime. I. Efficient simulation of linear spectra and quantum dynamics

We outline two general theoretical techniques to simulate polariton quantum dynamics and optical spectra under the collective coupling regimes described by a Holstein–Tavis–Cummings (HTC) model Hamiltonian. The first one takes advantage of sparsity of the HTC Hamiltonian, which allows one to reduce the cost of acting polariton Hamiltonian onto a state vector to the linear order of the number of states, instead of the quadratic order. The second one is applying the well-known Chebyshev series expansion approach for quantum dynamics propagation and to simulate the polariton dynamics in the HTC system; this approach allows us to use a much larger time step for propagation and only requires a few recursive operations of the polariton Hamiltonian acting on state vectors. These two theoretical approaches are general and can be applied to any trajectory-based non-adiabatic quantum dynamics methods. We apply these two techniques with our previously developed Lindblad-partially linearized density matrix approach to simulate the linear absorption spectra of the HTC model system, with both inhomogeneous site energy disorders and dipolar orientational disorders. Our numerical results agree well with the previous analytic and numerical work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

An algebraic convolution formulation for multiple-scattering correction in small-angle neutron scattering

Multiple scattering in small-angle neutron scattering (SANS) redistributes spectral weight and distorts structural interpretation, particularly for thick or strongly scattering samples. We develop a finite-dimensional spectral desmearing framework that corrects multiple scattering without resorting to integral transforms or model-dependent extrapolation. The primary intensity is expanded in an orthonormal basis adapted to the isotropic transverse-momentum measure, under which convolution reduces to a recursive tensor contraction, allowing the Poisson-weighted multiple-scattering series to be evaluated directly in a finite-dimensional basis representation. This formulation yields a stable forward–inverse mapping between apparent and primary spectra. Numerical tests demonstrate convergence under repeated convolution and accurate recovery of the single-scattering intensity. Application to SANS measurements collected at multiple neutron facilities, including the Spallation Neutron Source, the High Flux Isotope Reactor, and the Institut Laue-Langevin, shows the quantitative reconstruction of the underlying primary spectrum across a wide range of transmission conditions, including strongly attenuating samples. Here, the method provides a stable, model-agnostic framework for multiple-scattering correction in SANS and enables consistent structural interpretation across instruments and scattering regimes.

Tung, Chi-Huan [Oak Ridge National Laboratory (ORN

Analog and symbolic computation through the Koopman framework

We develop a Koopman operator framework for studying the computational structure of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ‘Koopman halting problem’ that is recursively enumerable in general. For symbolic systems, such as those defined on Cantor space, this operator formulation captures reachability between clopen sets, while for equicontinuous systems we prove that the Koopman halting problem is decidable. Our framework demonstrates that absorbing (halting) states in coarse-grained finite automata correspond to Koopman eigenfunctions with eigenvalue one, while cycles in the transition graph impose spectral constraints associated with periodic dynamics. These results provide a unifying perspective on computation in symbolic and analog systems, showing how computational universality is reflected in operator spectra, invariant subspaces, and algebraic structures. Beyond symbolic dynamics, this operator-theoretic lens opens pathways to analyze the computational properties of a broader class of dynamical systems, including polynomial and analog models, and suggests that computational hardness may admit dynamical signatures in terms of Koopman spectral structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Linear complexity

We present factorization and solution phases for a new linear complexity direct solver designed for concurrent batch operations on fine-grained parallel architectures, for matrices amenable to hierarchical representation. We focus on the strong-admissibility-based $\mathscr{H}^{2}$ format, where strong recursive skeletonization factorization compresses remote interactions. We build upon previous implementations of $\mathscr{H}^{2}$ matrix construction for efficient factorization and solution algorithm design, which are illustrated graphically in stepwise detail. The algorithms are ‘blackbox’ in the sense that the only inputs are the matrix and right-hand side, without analytical or geometrical information about the origin of the system. We demonstrate linear complexity scaling in both time and memory on four representative families of dense matrices up to one million in size. Parallel scaling up to 16 threads is enabled by a multi-level matrix graph coloring and avoidance of dynamic memory allocations thanks to prefix-sum memory management. An experimental backward error analysis is included. We break down the timings of different phases, identify phases that are memory-bandwidth limited, and discuss alternatives for phases that may be sensitive to the trend to employ lower precisions for performance.

Boukaram, Wajih

Moment method and continued fraction expansion in Floquet operator Krylov space

Recursion methods such as Krylov techniques map complex dynamics to an effective noninteracting problem in one dimension. For example, the operator Krylov space for Floquet dynamics can be mapped to the dynamics of an edge operator of the one-dimensional Floquet inhomogeneous transverse field Ising model (ITFIM), where the latter, after a Jordan-Wigner transformation, is a Floquet model of noninteracting Majorana fermions and the couplings correspond to Krylov angles. We present an application of this showing that a moment method exists where given an autocorrelation function, one can construct the corresponding Krylov angles and from that the corresponding Floquet ITFIM. Consequently, when no solutions for the Krylov angles are obtained, it indicates that the autocorrelation is not generated by unitary dynamics. We highlight this by studying certain special cases: stable m-period dynamics derived using the method of continued fractions, exponentially decaying, and power-law decaying stroboscopic dynamics. Remarkably, our examples of stable m-period dynamics correspond to m-period edge modes for the Floquet ITFIM where, deep in the chain, the couplings correspond to a critical phase. Furthermore our results pave the way to engineer Floquet systems with desired properties of edge modes and also provide examples of persistent edge modes in gapless Floquet systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND

Momentum shift and on-shell constructible massive amplitudes

We construct tree-level amplitude for massive particles using on-shell recursion relations based on two classes of momentum shifts: an all-line transverse shift that deforms momentum by its transverse polarization vector, and a massive Britto-Cachazo-Feng-Witten-type shift. We illustrate that these shifts allow us to correctly calculate four-point and five-point amplitudes in massive QED, without an ambiguity associated with the contact terms that may arise from a simple “gluing” of lower-point on-shell amplitudes. We discuss various aspects and applicability of the two shifts, including the large-z behavior and complexity scaling. We show that there exists a “good” all-line transverse shift for all possible little group configurations of the external particles, which can be extended to a broader class of theories with massive particles such as massive QCD and theories with massive spin-1 particles. The massive Britto-Cachazo-Feng-Witten-type shift enjoys more simplicity, but a “good” shift does not exist for all the spin states due to the specific choice of spin axis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Surface Kinematics and the Canonical Yang-Mills All-Loop Integrand

It has been a long-standing challenge to define a canonical loop integrand for nonsupersymmetric gluon scattering amplitudes in the planar limit. Naive integrands are inflicted with 1 / 0 ambiguities associated with tadpoles and massless external bubbles, which destroy integrand-level gauge invariance as well as consistent on-shell factorization on single loop cuts. In this Letter, we show that this essentially kinematical obstruction to defining “the” integrand for Yang-Mills theory has a structural solution, handed to us by the formulation of gluon amplitudes in terms of curves on surfaces. This defines “surface kinematics” generalizing momenta, making it possible to define the integrand satisfying both a (surface generalized) notion of gauge-invariance and consistent loop cuts. The integrand also vanishes at infinity in appropriate directions, allowing it to be recursively computed for nonsupersymmetric Yang-Mills theory in any number of dimensions. We illustrate these ideas through one loop for all multiplicity, and for the simplest two-loop integrand. Published by the American Physical Society 2025

Arkani-Hamed, Nima