Search NASA⌕ Search

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.

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

At least 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

FIRM: federated image reconstruction using multimodal tomographic data

Here, we propose a federated algorithm for reconstructing images using multimodal tomographic data sourced from dispersed locations, addressing the challenges of traditional unimodal approaches that are prone to noise and reduced image quality, as well as the limitations of centralized multimodal approaches that require extensive data transfer, leading to significant communication overhead, storage demands, and potential data privacy concerns. Our approach formulates a joint inverse optimization problem incorporating multimodality constraints and solves it in a federated framework through local gradient computations complemented by lightweight central operations, thereby ensuring data decentralization. Leveraging the connection between our federated algorithm and the quadratic penalty method, we introduce an adaptive step-size rule with guaranteed sublinear convergence. Numerical results demonstrate superior computational efficiency and improved image reconstruction quality compared to existing approaches.

federated algorithm↗
DOE OSTI2024

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗
DOE OSTI2024

Weighted Composition Operators for Learning Nonlinear Dynamics

Operator theoretic methods in dynamical system have been dominated by the use of Koopman operators and their continuous time counterparts, such as Koopman Generators and Liouville Operators. The advantage gained from their use primarily stems from the ability to extract subspaces and eigenfunctions within a space of observables that are invariant with respect to the Koopman operator over that space. When this occurs, a dynamic mode decomposition of the systems state provides a linear model for the dynamical system. Not all Koopman operators have eigenfunctions that may be exploited in this manner. However, the framework can still be leveraged for approximations using other operators. In this setting, we present a different operator for the study of dynamical systems, the weighted composition operator. These operators are compact for a wide range of dynamics and spaces, and through their interactions with occupation kernels and vector valued kernels, they admit an estimation of the underlying dynamics. Here, this manuscript presents a new algorithm for the data driven study of dynamical systems from data, and also provides two numerical experiments where convergence is achieved as a proof of concept.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Validation and moisture content sensitivity analysis of cross-laminated timber wall assemblies in EnergyPlus

Cross-laminated timber buildings are becoming more common in North America, with many numerical studies showing potential energy savings. However, no studies have validated any EnergyPlus heat transfer algorithms or quantified their accuracy in simulating CLT in building envelopes. This study empirically validates the heat flux predictions for each of EnergyPlus's heat transfer algorithms (Conduction Transfer Functions (CTF), Effective Moisture Penetration Depth (EMPD), Conduction Finite Difference (CondFD), and Heat and Moisture Transfer (HAMT)) for two different CLT ply thicknesses with both summer and winter boundary conditions measured in controlled lab experiments. It also evaluates the model sensitivity of heat flux and heating and cooling loads to moisture content. The 1D validation shows that the HAMT model is the most accurate among all algorithms. All EnergyPlus's heat flux predictions are accurate independent of CLT plate thickness for summer conditions. However, the three constant property algorithms (CTF, EMPD, and CondFD) underpredict heat flux throughout the whole day during winter conditions. The 1D sensitivity analysis indicates that elevated moisture content can increase peak heat fluxes through the material by up to 20 %. Finally, the whole building model sensitivity analysis shows increased heating load and slight cooling load variation due to increased moisture content when using constant property models. The analysis shows significantly lower peak thermal demand (7 % lower heating and 6 % lower cooling) and monthly thermal load (8 % less cooling and 6 % less heating) predictions when using HAMT vs a constant property model.

42 ENGINEERING↗
DOE OSTI2024

Steady-state properties of multi-orbital systems using quantum Monte Carlo

A precise dynamical characterization of quantum impurity models with multiple interacting orbitals is challenging. In quantum Monte Carlo methods, this is embodied by sign problems. A dynamical sign problem makes it exponentially difficult to simulate long times. A multi-orbital sign problem generally results in a prohibitive computational cost for systems with multiple impurity degrees of freedom even in static equilibrium calculations. Here, we present a numerically exact inchworm method that simultaneously alleviates both sign problems, enabling simulation of multi-orbital systems directly in the equilibrium or nonequilibrium steady-state. The method combines ideas from the recently developed steady-state inchworm Monte Carlo framework [Erpenbeck et al., Phys. Rev. Lett. 130, 186301 (2023)] with other ideas from the equilibrium multi-orbital inchworm algorithm [Eidelstein et al., Phys. Rev. Lett. 124, 206405 (2020)]. We verify our method by comparison with analytical limits and numerical results from previous methods.

Chemistry↗
DOE OSTI2025

Electromagnetic Transient Simulation of Large-Scale Inverter-Based Resources With High-Granularity

The power grid is undergoing a significant transformation with the rapid increase in inverter-based resources (IBRs), including large-scale photovoltaic (PV) plants. Ensuring reliable and resilient grid operation in this new paradigm necessitates high-granularity electromagnetic transient (EMT) modeling that accurately captures the behavior of individual inverters and their interactions within IBR plants. Central to this approach is the detailed representation of both the IBR plant’s collector system and the dynamics of individual inverters. To achieve this, a high-granularity EMT model of a large-scale PV plant has been developed using advanced simulation algorithms, including matrix splitting and the Schur complement. These proposed techniques significantly enhance simulation speed, numerical stability, and accuracy while improving the modularity and efficiency of the collector system’s representation. The effectiveness of the proposed methods is validated through simulations of a representative large-scale PV plant consisting of 125 individual PV inverters, 25 IBR unit transformers, and a 52-bus collector system.

Choi, Jongchan [Oak Ridge National Laboratory (ORN↗
DOE OSTI2025

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

Here, this paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which characterizes worst-case uncertain parameters for its inner maximization problem. This condition offers an alternative proof, a counterexample, and an extension to previous works. Additionally, the condition highlights the potential advantage of a specific distance metric for out-of-sample performance, as exemplified in a numerical study on a facility location problem with demand uncertainty. Furthermore, cutting-plane-based algorithms, equipped with a unified scenario generation framework, are proposed for addressing both unbounded support and second-stage dual feasible regions, with a finite convergence proof under less stringent assumptions.

Wasserstein↗
DOE OSTI2025

Thermal Radiation Transport with Tensor Trains

We present a novel tensor network algorithm to solve the time-dependent, gray thermal radiation transport equation. The method invokes a tensor train (TT) decomposition for the specific intensity. The efficiency of this approach is dictated by the rank of the decomposition. When the solution is “low rank,” the memory footprint of the specific intensity solution vector may be significantly compressed. The algorithm, following a step-then-truncate approach of a traditional discrete ordinates method, operates directly on the compressed state vector, thereby enabling large speedups for low-rank solutions. To achieve these speedups, we rely on a recently developed rounding approach based on the Gram-SVD. We detail how familiar S N algorithms for (gray) thermal transport can be mapped to this TT framework and present several numerical examples testing both the optically thick and thin regimes. The TT framework finds low-rank structure and supplies up to ≃60× speedups and ≃1000× compressions for problems demanding large angle counts, thereby enabling previously intractable SN calculations and supplying a promising avenue to mitigate ray effects.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Predicting Flow in Fracture Networks With Quantum Algorithms

Uncertainty quantification plays a crucial role in the modeling of subsurface flow. For instance, uncertainties in the properties of geologic fracture networks significantly impact flow, requiring numerous simulations to accurately estimate quantities of interest. However, each simulation is computationally expensive because it requires solving a large linear system to capture features that involve both small and large fractures. An example is in percolation, where the interaction of many small fractures (which cumulatively can have a large surface area) with the rock matrix must be modeled precisely. Quantum computing is an emerging tool with the potential to address this issue. Quantum algorithms offer a significant speedup in solving linear systems, achieving efficiencies that are challenging to match with classical approaches. These classical approaches include direct solvers, such as LU decomposition, and iterative methods, notably preconditioned conjugate gradient, commonly used in subsurface modeling to solve large sparse systems. However, applying quantum algorithms to geologic fracture flow requires careful attention to algorithmic and problem-specific constraints to fully realize this quantum advantage. In this work we describe a quantum algorithm for generalized Monte Carlo applications with a quadratic speedup over the classical approaches which can be combined with the quantum speedup, currently under investigation, for solving quantum linear systems for subsurface flow. We show that for quantum algorithms the computational cost of estimating a quantity of interest for a statistical ensemble of networks is roughly the same as that of a single realization, essentially implying that one can get uncertainty quantification for free.

58 GEOSCIENCES↗
DOE OSTI2026

Code for the manuscript "Lagrangian Attention Tensor Networks for Velocity Gradient Statistical Mode

We disclose a python/pytorch implementation of the physics-informed machine learning algorithm described in "Lagrangian Attention Tensor Networks for Velocity Gradient Statistical Modeling", LA-UR-24-30678. Direct numerical simulation (DNS) of ubiquitous turbulence phenomena is computationally infeasible for realistic flows. As a result, reduced modeling for turbulent flows aim to reduce the number of resolved scales while retaining accurate representations of the small-scale physics. The dynamics of the velocity gradient tensor (VGT) is a key ingredient in reduced or subgrid turbulence models. The evolution equation for the VGT involves nonlocal terms, requiring closure modeling. This implementation of the novel methodology of Lagrangian Attention Tensor Networks (LATN), utilizes a structured representation of the history of the VGT to inform a physics-informed machine learning algorithm. This addition of structured memory terms is shown to outperform previous models when trained and evaluated on DNS data.

Livescu, Daniel [LANL]↗
DOE OSTI2026

Numerical Modeling & Optimization of the iProTech Pitching Inertial Pump (PIP) Wave Energy Converter (WEC) (CRADA Final Report)

This project represents a continuation of the collaboration between iProTech and NLR to simulate, optimize and design the iProTech Pitching Inertial Pump (PIP) device. The objectives of this TEAMER project are twofold: 1. Refining the physical characteristics of the existing iProTech PIP WEC-Sim model to enhance the model’s fidelity and include controllable components. Key model enhancements target the inclusion of Coulomb friction, the introduction of a controllable bypass valve, and the replacement of traditional check valves with advanced motorized ones. 2. Exploring traditional and advanced control algorithms. From traditional methods like latching control to cutting-edge reinforcement learning (RL) algorithms, the goal is to ensure the PIP device's adaptability and optimal performance across a range of ocean conditions. NLR is tasked with augmenting the WEC-Sim model and implementing the control algorithms, culminating in performance comparison analyses. iProTech will update their existing 3D models, advise on model improvements, and determine crucial system metrics. WEC-Sim, developed in MATLAB/SIMULINK with Simscape Multibody, is the main piece of software that will be used in this project. Coupled with the MATLAB RL Toolbox, it offers a robust platform for in-depth simulation and optimization of the iProTech PIP device. Building on previous work to explore the PIP design space and optimize its geometry, mass distribution, center of gravity and other key parameters, this project aims to refine iProTech’s existing numerical models and develop effective control algorithms that can seamlessly integrate into their future hardware testing campaigns.

16 TIDAL AND WAVE POWER↗
DOE OSTI2025

Least H 2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms

One particular class of derivative-free optimization algorithms is trust-region algorithms based on quadratic models given by the under-determined interpolation. Different techniques in updating the quadratic model from iteration to iteration will give different interpolation models. We propose a new way to update the quadratic model by minimizing the $H^{2}$ norm of the difference between neighboring quadratic models. The motivation for applying the $H^{2}$ norm is given. The theoretical properties of our new updating technique are also presented. We propose the projection in the sense of $H^{2}$ norm and the interpolation error analysis of our model function. We obtain the coefficients of the quadratic model function using the Karush–Kuhn–Tucker (KKT) conditions. Numerical results show the advantages of our model on the test set considered, and the derivative-free algorithms based on our least $H^{2}$ norm updating quadratic model functions can solve test problems with fewer function evaluations than the algorithm based on the least Frobenius norm updating model and the other compared methods.

derivative-free optimization↗
DOE OSTI2024

Comparison of machine learning and electrical resistivity arrays to inverse modeling for locating and characterizing subsurface targets

Here, this study evaluates the performance of multiple machine learning (ML) algorithms and electrical resistivity (ER) arrays for inversion with comparison to a conventional Gauss-Newton numerical inversion method. Four different ML models and four arrays were used for the estimation of only six variables for locating and characterizing hypothetical subsurface targets. The combination of dipole-dipole with Multilayer Perceptron Neural Network (MLP-NN) had the highest accuracy. Evaluation showed that both MLP-NN and Gauss-Newton methods performed well for estimating the matrix resistivity while target resistivity accuracy was lower, and MLP-NN produced sharper contrast at target boundaries for the field and hypothetical data. Both methods exhibited comparable target characterization performance, whereas MLP-NN had increased accuracy compared to Gauss-Newton in prediction of target width and height, which was attributed to numerical smoothing present in the Gauss-Newton approach. MLP-NN was also applied to a field dataset acquired at U.S. DOE Hanford site.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

A Two-Stage Quantum Reinforcement Learning Method for Multi-Objective Transmission Switching

Multi-objective transmission switching (MO-TS) problems involve the strategic reconfiguration of network topology to simultaneously optimize multiple objectives. As the system scale increases, finding feasible solutions becomes increasingly challenging due to the problem's nonlinearity and high computational complexity. To address these challenges, this paper proposes a two-stage quantum reinforcement learning method that leverages potential quantum advantages for MO-TS. In the first stage, candidate switching lines are identified using a graph-theoretical approach to reduce the problem's dimensionality. The second stage introduces a quantum-classical reinforcement learning framework, where a learnable measurement-based CNN-ResVQC architecture is developed to effectively reduce the input dimension for quantum processing, mitigate vanishing gradients, and enhance trainability while improving the quantum circuit's flexibility in modeling complex decision policies for MO-TS. Numerical studies on IEEE 14-bus, 57-bus, and 118-bus systems demonstrate that the proposed algorithm achieves superior training stability and faster convergence with approximately 1% of the network parameters required by classical algorithms, highlighting its effectiveness, efficiency, and scalability. Furthermore, the practicality is validated through its stable convergence under three common quantum noise channels.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2026

Kinetic Model of HoxEFU reduction by NADH [SWR-26-087]

This repository is used to release code generated for manuscripts on the Photosynthetic Energy Transduction core program. This code simulates the reduction of HoxEFU by NADH. The electro transfer rate constants for the simulation are specified in the .csv files. The two .csv files correspond tot he two models described in Dawson et al. Cell. Rep. Phys. Sci. 2026. The code utilizes a chemical master equation, a set of differential equations, defining the time evolution of the oxidation and reduction kinetics of NAD+, NADH, a FMN flavin, and a set of iron sulfur clusters. The kinetics of HoxEFU reduction by NADH are evaluated by numerical integration of the chemical master equation using a variable-time-step Runge-Kutta algorithm.

Dahl, Peter [National Laboratory of the Rockies (N↗
DOE OSTI2025

Analysis of the SiMPL Method for Density-Based Topology Optimization

We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct. Multidiscip. Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. Here, we refer to the new algorithm as the SiMPL method (pronounced “simple”), which stands for Sigmoidal Mirror descent with a Projected Latent variable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Algorithmic Advancements for High-Order Self-Gravitating Hydrodynamics

Self-gravity plays a key role in the formation and evolution of many astronomical objects. Though gravity is often dominant at large scales, other forces (e.g., gas pressure gradients, radiation, and/or magnetic fields) often compete. It is therefore essential for numerical simulations to evaluate their interplay accurately and robustly. Hanawa & Mullen derived a 4th-order accurate finite volume scheme to solve the equations of self-gravitating hydrodynamics on a uniform Cartesian grid. In this work, we supply improvements to the algorithm that (1) mitigate spurious gravitational circulation and (2) greatly simplify the evaluation of the high order corrections. The proposed algorithm provides the gravitational acceleration (ρg) and the gravitational energy release (ρv · g) as source terms for the hydrodynamic equations, all while preserving conservation of linear momentum. Spurious heating and/or cooling associated with truncation error in the numerical evaluation of the gravitational energy release decreases in proportion to the fourth power of the cell width. We demonstrate fourth order convergence on smooth problems (e.g., 3D inclined sound wave propagation and 3D equilibria). An application test tracks the spherical collapse of a polytrope by an imposed, sudden decrease of the central gas pressure; a bounce and second collapse (associated with a spherical accretion shock) are robustly captured by the high order algorithm.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Physics-Reinforced Machine Learning Algorithms for Multiscale Closure Model Discovery

The central objective of this project was to address the challenge of modeling and simulating complex multiscale turbulence phenomena by leveraging physics-guided machine learning (PGML) and hybrid modeling approaches. By integrating physics-based methods with data-driven models, the research focused on achieving robust and scalable solutions for geophysical turbulence, enhancing numerical weather prediction and climate research tools. The project resulted in significant advancements in computational modeling paradigms, predictive tools for reduced-order modeling, and innovative algorithms for fluid dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗