SEARCH · Search NASA

Results for “numerical algorithm”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 397 records · Page 22

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Collaborative Research: Enabling multi-scale studies of magnetic reconnection with interpretable data-driven models

The development of accurate reduced descriptions and improved closures for magnetic reconnection is an important and a long‐standing challenge in plasma physics. The four‐fluid approach, and associated closures, that were investigated have the potential to improve the accuracy of plasma fluid models, capturing physical effects which would otherwise require a kinetic description. If successful, this approach could have an important impact for the modeling of laboratory and space plasmas. The major goals of this project were to develop new machine learning (ML) tools based on sparse and symbolic regression techniques, and to extract interpretable and generalizable reduced models (e.g., in the form of partial differential equations - PDEs) from data generated by first principles plasma simulations. Preserving interpretability of such data‐driven models is key to addressing the long‐standing theoretical and numerical challenges. Prior proof‐of‐principle studies have demonstrated the enormous potential of this approach, by recovering the well‐established hierarchy of plasma equations (from Vlasov to MHD) from data produced by particle‐in‐cell (PIC) simulations. Our goal in this project was to extend and apply these new tools to construct better kinetic closures for magnetic reconnection; to derive better models of particle injection and acceleration by this fundamental plasma process; and to use this understanding to accelerate the development of multi‐scale plasma algorithms. While our immediate focus was on the problem of magnetic reconnection, the tools that were will developed are general and applicable to other areas of plasma physics, and more broadly to many‐body phenomena. We anticipate that the development of these multi‐scale models will have a significant impact across different areas of plasma science, from fusion to space and astrophysical plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2024

Quantum error mitigation by layerwise Richardson extrapolation

A widely used method for mitigating errors in noisy quantum computers is Richardson extrapolation, a technique in which the overall effect of noise on the estimation of quantum expectation values is captured by a single parameter that, after being scaled to larger values, is eventually extrapolated to the zero-noise limit. We generalize this approach by introducing layerwise Richardson extrapolation (LRE), an error mitigation protocol in which the noise of different individual layers (or larger chunks of the circuit) is amplified and the associated expectation values are linearly combined to estimate the zero-noise limit. The coefficients of the linear combination are analytically obtained from the theory of multivariate Lagrange interpolation. LRE leverages the flexible configurational space of layerwise unitary folding, allowing for a more nuanced mitigation of errors by treating the noise level of each layer of the quantum circuit as an independent variable. Furthermore, we provide numerical simulations demonstrating scenarios where LRE achieves superior performance compared to traditional (single-variable) Richardson extrapolation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

3D hybrid fluid-particle jet simulations and the importance of synchrotron radiative losses

Context. Relativistic jets in active galactic nuclei are known for their exceptional energy output, and imaging the synthetic synchrotron emission of numerical jet simulations is essential for a comparison with observed jet polarization emission. Aims. Through the use of 3D hybrid fluid-particle jet simulations (with the PLUTO code), we overcome some of the commonly made assumptions in relativistic magnetohydrodynamic (RMHD) simulations by using non-thermal particle attributes to account for the resulting synchrotron radiation. Polarized radiative transfer and ray-tracing (via the RADMC-3D code) highlight the differences in total intensity maps when (i) the jet is simulated purely with the RMHD approach, (ii) a jet tracer is considered in the RMHD approach, and (iii) a hybrid fluid-particle approach is used. The resulting emission maps were compared to the example of the radio galaxy Centaurus A. Methods. We applied the Lagrangian particle module implemented in the latest version of the PLUTO code. This new module contains a state-of-the-art algorithm for modeling diffusive shock acceleration and for accounting for radiative losses in RMHD jet simulations. The module implements the physical postulates missing in RMHD jet simulations by accounting for a cooled ambient medium and strengthening the central jet emission. Results. We find a distinction between the innermost structure of the jet and the back-flowing material by mimicking the radio emission of the Seyfert II radio galaxy Centaurus A when considering an edge-brightened jet with an underlying purely toroidal magnetic field. We demonstrate the necessity of synchrotron cooling as well as the improvements gained when directly accounting for non-thermal synchrotron radiation via non-thermal particles.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Machine learning for the identification of phase transitions in interacting agent-based systems: A Desai-Zwanzig example

Deriving closed-form analytical expressions for reduced-order models, and judiciously choosing the closures leading to them, has long been the strategy of choice for studying phase- and noise-induced transitions for agent-based models (ABMs). In this paper, we propose a data-driven framework that pinpoints phase transitions for an ABM—the Desai-Zwanzig model—in its mean-field limit, using a smaller number of variables than traditional closed-form models. To this end, we use the manifold learning algorithm Diffusion Maps to identify a parsimonious set of data-driven latent variables, and we show that they are in one-to-one correspondence with the expected theoretical order parameter of the ABM. We then utilize a deep learning framework to obtain a conformal reparametrization of the data-driven coordinates that facilitates, in our example, the identification of a single parameter-dependent ordinary differential equation (ODE) in these coordinates. Additionally, we identify this ODE through a residual neural network inspired by a numerical integration scheme (forward Euler). We then use the identified ODE—enabled through an odd symmetry transformation—to construct the bifurcation diagram exhibiting the phase transition.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Nyström type exponential integrators for strongly magnetized charged particle dynamics

Solving for charged particle motion in electromagnetic fields (i.e. the particle pushing problem) is a computationally intensive component of particle-in-cell (PIC) methods for plasma physics simulations. This task is especially challenging when the plasma is strongly magnetized due numerical stiffness arising from the wide range of time scales between highly oscillatory gyromotion and long term macroscopic behavior. A promising approach to solve these problems is by a class of methods known as exponential integrators that can solve linear problems exactly and are A-stable. This work extends the standard exponential integration framework to derive Nyström-type exponential integrators that integrates the Newtonian equations of motion as a second-order differential equation directly. In particular, we derive second-order and third-order Nyström-type exponential integrators for strongly magnetized particle pushing problems. Numerical experiments show that the Nyström-type exponential integrators exhibit significant improvement in computation speed over the standard exponential integrators.

general physics↗

DOE OSTI2025

Constraints on f ( R ) gravity from thermal-Sunyaev-Zel’dovich-effect-selected SPT galaxy clusters and weak lensing mass calibration from DES and HST

We present constraints on the f ( R ) gravity model using a sample of 1005 galaxy clusters in the redshift range 0.25–1.78 that have been selected through the thermal Sunyaev-Zel’dovich effect from South Pole Telescope data and subjected to optical and near-infrared confirmation with the multicomponent matched filter algorithm. We employ weak gravitational lensing mass calibration from the Dark Energy Survey Year 3 data for 688 clusters at z < 0.95 and from the Hubble Space Telescope for 39 clusters with 0.6 < z < 1.7 . Our cluster sample is a powerful probe of f ( R ) gravity, because this model predicts a scale-dependent enhancement in the growth of structure, which impacts the halo mass function (HMF) at cluster mass scales. To account for these modified gravity effects on the HMF, our analysis employs a semianalytical approach calibrated with numerical simulations. Combining calibrated cluster counts with primary cosmic microwave background temperature and polarization anisotropy measurements from the Planck 2018 release, we derive robust constraints on the f ( R ) parameter f R 0 . Our results, log 10 | f R 0 | < − 5.32 at the 95% credible level, are the tightest current constraints on f ( R ) gravity from cosmological scales. This upper limit rules out f ( R ) -like deviations from general relativity that result in more than a ∼ 20 % enhancement of the cluster population on mass scales M 200 c > 3 × 10 14 M ⊙ . Published by the American Physical Society 2025

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2026

A conservative discontinuous Galerkin algorithm for particle kinetics on smooth manifolds

A novel, conservative discontinuous Galerkin algorithm is presented for particle kinetics on manifolds. The motion of particles on the manifold is represented using both canonical and non-canonical Hamiltonian formulations. Our schemes apply to both formulations, but the canonical formulation results in a particularly efficient scheme that also conserves particle density and energy exactly. The collisionless update is coupled to a Bhatnagar-Gross-Krook (BGK) collision operator that provides a simplified model for relaxation to local thermodynamic equilibrium. An iterative scheme is constructed to ensure collisional invariants (density, momentum and energy) are preserved numerically. Rotation of the manifold is incorporated by modifying the Hamiltonian while ensuring a canonical formulation. Several test problems, including a kinetic version of the classical Sod shock problem, Kelvin-Helmholtz instability on the surfaces of a sphere and a hyperboloid, with and without rotations, are presented. A prospectus for further development of this approach to simulation of kinetic theory in general relativity is presented.

Discontinuous Galerkin↗

DOE OSTI2025

Analog Systems for Edge Optimization

Over the past decade, analog computing has the subject of substantial research interest providing a path toward improved computational efficiency in the post-Dennard era. Analog matrix vector multiplication (MVM) accelerators provide a popular approach given the ubiquity of MVM operations in numerous applications. However, historically analog computing systems can struggle with applications requiring high precision due to the inherent susceptibility of these systems to analog non-idealities. Therefore, prior work on analog systems has focused either on applications known to be tolerant of limited precision (e.g., neural network inference), or using expensive techniques to emulate high-precision using many analog MVM operations. In this work, we propose an alternative approach. Motivated by recent advances in inexact nonlinear solvers and optimizers, we explore the potential of co-designing optimization algorithms which can take full advantage of the fundamentally inexact analog MVM operations. To enable these co-designed algorithms we also develop a general mathematical theory of the precision and energy efficiency of analog operations, and a new system architecture for tightly-coupled analog and digital computation. Finally, we examine the applicability of analog computing to a wider class of symmetric positive definite systems and find potential in using analog operations as a sparse approximate inverse preconditioner. With these core innovations, this project provides a path toward effectively implementing optimization algorithms on power-constrained autonomous and semi-autonomous systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Challenges and Technology-Driven Opportunities for Safeguarding Microreactors

Nuclear microreactors (MRs) represent a new class of reactors characterized by their compactness, portability, and low power output. These features enable MRs to supply electricity and process heat to remote areas like military bases; inaccessible locations; small grids, such as on islands; or disaster impacted areas. Compared to traditional light water reactors, MRs have a unique set of attributes that need to be considered for the implementation of safeguard strategies. Current safeguard methodologies are reactor technology specific and are employed on large, stationary reactors where there is easy access by safeguards inspectors and where safeguard equipment can be easily installed and retrofitted. While there are numerous benefits to MRs, their compact size, portability, scalability, and operational lifetime create challenges to the traditional safeguard approaches, thus needing novel safeguard strategies. Here, this paper addresses the unique challenges posed by MRs to the international nuclear safeguards regime, including limited human resources, and explores how technology advancements can help mitigate these challenges. Specifically, it examines novel technologies that could contribute to establishing a comprehensive safeguards framework for MRs. These safeguards-enabling technologies encompass safeguards by design, remote sensing and monitoring technologies, applications of artificial intelligence and machine learning algorithms, utilization of digital twins, and system of systems assessments. While each of these safeguards-enabling technologies offers partial solutions to the challenges posed by MRs for the international safeguards regime, none of them alone can entirely address these challenges. Consequently, a combination of the safeguards-enabling technologies outlined in this paper is recommended to establish a robust safeguards regime for MRs.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

DOE OSTI2025

A resolution independent neural operator

The Deep operator network (DeepONet) is a powerful yet simple neural operator architecture that utilizes two deep neural networks to learn mappings between infinite-dimensional function spaces. This architecture is highly flexible, allowing the evaluation of the solution field at any location within the desired domain. However, it imposes a strict constraint on the input space, requiring all input functions to be discretized at the same locations; this limits its practical applications. Here, in this work, we introduce a general framework for operator learning from input–output data with arbitrary number and locations of sensors. This begins by introducing a resolution-independent DeepONet (RI-DeepONet), enabling it to handle input functions that are arbitrarily, but sufficiently finely, discretized. To this end, we propose two dictionary learning algorithms to adaptively learn a set of appropriate continuous basis functions, parameterized as implicit neural representations (INRs), from correlated signals defined on arbitrary point cloud data. These basis functions are then used to project arbitrary input function data as a point cloud onto an embedding space (i.e., a vector space of finite dimensions) with dimensionality equal to the dictionary size, which can be directly used by DeepONet without any architectural changes. In particular, we utilize sinusoidal representation networks (SIRENs) as trainable INR basis functions. The introduced dictionary learning algorithms are then used in a similar way to learn an appropriate dictionary of basis functions for the output function data, which defines a new neural operator architecture referred to as the R esolution I ndependent N eural O perator (RINO). In the RINO, the operator learning task simplifies to learning a mapping from the coefficients of input basis functions to the coefficients of output basis functions. We demonstrate the robustness and applicability of RINO in handling arbitrarily (but sufficiently richly) sampled input and output functions during both training and inference through several numerical examples.

Deep operator network (DeepONet)↗

DOE OSTI2025

Efficient analysis of small-angle scattering curves for large biomolecular assemblies using Monte Carlo methods

Structure elucidation from small-angle scattering curves of large biomolecular assemblies is notoriously challenging. This is because the simulation of high-resolution features in the structure of large macromolecular assemblies, such as de novo protein assemblies, is computationally demanding when it needs to cover a broad range of length scales. Conventional methods, such as the numerical approximation to the Debye equation or the use of spherical harmonics, do not scale well as the size of the assembly increases, which limits their application to small structures (e.g. individual proteins). This work explores the effectiveness of a Monte Carlo method to simulate and fit scattering curves for large biomolecular assemblies spanning over ranges covering atomic and molecular detail (e.g. spacing and orientation of proteins in an assembly) as well as large-scale (hundreds of nanometres) features. Owing to its speed and scalability, it can be combined with a fitting algorithm to extract structural features from experimental small-angle scattering curves in biomolecular assemblies that are otherwise intractable for interpretation. This work first demonstrates the effectiveness of the tool using experimental small-angle X-ray scattering (SAXS) data from tile-like proteins that assemble into 1D tube-like macromolecular structures. Here, the diameter distribution of tubes is extracted from SAXS fits, and this is quantitatively compared with distributions from electron microscopy. SAXS data are also obtained from 2D sheet-like protein assemblies, and the proposed method is used to quantify structural features such as the separation distance between protein building blocks and the flexing of the sheet. An open-source implementation of the methodology is provided for use in a broad range of biological systems involving multi-scale scattering analysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2026

A Bayesian desmearing algorithm for Bonse–Hart USANS with anisotropic scattering

Ultra-small-angle neutron scattering (USANS) using Bonse–Hart optics provides micrometer-scale structural insights but suffers from severe slit-geometry smearing. While well-established for isotropic systems, quantitative desmearing of anisotropic data remains a challenge because conventional corrections break down for non-radial scattering. In this work, we address this by developing a resolution-aware Bayesian framework that explicitly incorporates anisotropy via an affine deformation to the scattering pattern, guided by the principle of parsimony. This results in orientation-resolved point-spread functions that enable a self-consistent determination of both the resolution and deformation parameters. Using Gaussian process regression with uncertainty quantification and a probabilistic correction for multiple scattering, we demonstrate the framework’s effectiveness through numerical benchmarks and experimental studies of a stretched polymer melt. Our approach enables the seamless integration of SANS and USANS data, facilitating quantitative structural analysis of deformed materials at nanometer to micrometer scales.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Gate-Based Quantum Simulation of Gaussian Bosonic Circuits on Exponentially Many Modes

We introduce a framework for simulating, on an ( n + 1 )-qubit quantum computer, the action of a Gaussian bosonic (GB) circuit on a state over 2 n modes. Specifically, we encode the initial bosonic state’s expectation values over quadrature operators (and their covariance matrix) as an input qubit state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real- (imaginary-) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a bounded-error-quantum-polynomial time (BQP)-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on ∼ 8 × 10 9 modes, illustrating the power of our framework. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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 OSTI2025

Understanding and Estimating Error Propagation in Neural Networks for Scientific Data Analysis

Neural networks are increasingly integrated into scientific discovery, where input data reduction and model quantization play a key role in accelerating inference. However, understanding and mitigating the impact of these techniques on output error is critical for ensuring reliable results, particularly in tasks demanding high numerical precision. This paper introduces a comprehensive framework for optimizing neural network inference in scientific computing by combining data reduction and weight quantization while maintaining error-controlled outcomes. We develop theoretical analyses to bound error propagation under these reductions and propose a framework that balances computational performance with error constraints. Evaluation on real-world learning-based combustion simulations and satellite image classification demonstrates that our derived error bounds accurately predict observed errors while enabling significant computational speedup under our framework. This work highlights the potential for further leveraging advancements in modern lossy compression algorithms and hardware accelerators that support lower-precision formats.

He, Weiming [New Jersey Institute of Technology]↗

DOE OSTI2024

Exact wave solver for nonparaxial laser beam propagation

Simulations of inertial confinement fusion (ICF) experiments require high-fidelity models for laser beam propagation in a nonuniform plasma with varying index of refraction. We describe a new numerical wave solver that is applicable to centimeter-scale length plasmas encountered in indirect drive ICF applications. The one-way Helmholtz equation (OHE) generalizes the time-harmonic paraxial wave equation to large angles. Here, we present a methodology to numerically evaluate the exact solution to the OHE. This solution is computed by analytically advancing eigenfunctions of the one-way Helmholtz operator along a propagation direction and is applicable to any given index of a refraction profile. We compare our exact method with a commonly used approximate split-step technique for solving the OHE. As a test problem, we consider nonparaxial propagation of Gaussian and speckled beams in a plasma density channel with internal reflection. We find that the split-step approach incurs significant errors compared to the exact solution computed using the novel algorithm.

Belyaev, Mikhail A. (ORCID:0000000224908887)↗

DOE OSTI2024

Continuous-variable quantum computation of the O(3) model in 1+1 dimensions

We formulate the $O(3)$ non-linear sigma model in $1+1$ dimensions as a limit of a three-component scalar field theory restricted to the unit sphere in the large squeezing limit. This allows us to describe the model in terms of the continuous variable (CV) approach to quantum computing. Here we construct the ground state and excited states using the coupled cluster ansatz and find excellent agreement with the exact diagonalization results for a small number of lattice sites. We then present the simulation protocol for the time evolution of the model using CV gates, estimate the discretization error, and present numerical results obtained from a photonic quantum simulator. We expect that the methods developed in this work will be useful for exploring interesting dynamics for a wide class of sigma models and gauge theories, as well as for simulating scattering events on quantum hardware in the coming decade.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Hardware acceleration for HPS algorithms in two and three dimensions

We provide a flexible, open-source framework for hardware acceleration, namely massively-parallel execution on general-purpose graphics processing units (GPUs), applied to the hierarchical Poincaré–Steklov (HPS) family of algorithms for building fast direct solvers for linear elliptic partial differential equations. To take full advantage of the power of hardware acceleration, we propose two variants of HPS algorithms to improve performance on two- and three-dimensional problems. In the two-dimensional setting, we introduce a novel recomputation strategy that minimizes costly data transfers to and from the GPU; in three dimensions, we modify and extend the adaptive discretization technique of Geldermans and Gillman [1] to greatly reduce peak memory usage. We provide an open-source implementation of these methods written in JAX, a high-level accelerated linear algebra package, which allows for the first integration of a high-order fast direct solver with automatic differentiation tools. We conclude with extensive numerical examples showing our methods are fast and accurate on two- and three-dimensional problems.

Fast direct solvers↗