Search NASA⌕ Search

SEARCH · Search NASA

Results for “decomposition strategies”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Flexible User-Defined Domain Decomposition in Kilometer-Scale E3SM Land Model Simulation

The Energy Exascale Earth System Model (E3SM) Land Model (ELM) has been extended to kilometer-scale (km-ELM) resolutions, enabling high-fidelity simulations of terrestrial processes at 1 km x 1 km grid spacing. In ELM, domain decomposition partitions the computational domain across processors, ensuring efficient parallel execution. Currently, round-robin decomposition is applied, providing a straightforward way to distribute computational workload. As ELM continues evolving at the kilometer-scale (km-scale), particularly with integrating lateral flow modeling, decomposition strategies must also account for the increased workload and data movement. This paper introduces a flexible user-defined domain decomposition framework, allowing users to customize domain partitioning based on application requirements. The impact of different decomposition strategies is evaluated across various applications concerning computation, communication, and I/O. Results demonstrate that while 1D partitioning yields superior I/O performance, k-nearest neighbors (KNN) clustering effectively reduces inter-process communication overhead. This study lays the groundwork for scalable partitioning in large-scale land surface simulations, enhancing next-generation Earth system modeling.

Wang, Dali [ORNL] (ORCID:0000000168065108)↗
DOE OSTI2025

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms↗
DOE OSTI2023

A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming

We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the merit function. Within each SQP iteration, we approximately solve the Newton system using an overlapping temporal decomposition strategy. We show that the approximate search direction is still a descent direction of the augmented Lagrangian provided the overlap size and penalty parameters are suitably chosen, which allows us to establish the global convergence. Moreover, we show that a unit step size is accepted locally for the approximate search direction and further establish a uniform, local linear convergence over stages. This local convergence rate matches the rate of the recent Schwarz scheme (Na et al. 2022). However, the Schwarz scheme has to solve nonlinear subproblems to optimality in each iteration, whereas we only perform a single Newton step instead. Numerical experiments validate our theories and demonstrate the superiority of our method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

AdversarialTensors

This library builds a framework for defending ML models against adversarial attacks. The library will be developed at various stages leading to publication and software release at each stage. We employ tensor decomposition strategies as preprocessing stages for the first stage to provide robustness against the prominent adversarial noise. In the second stage, we develop a latent noise generator capable of generating novel adversarial noise that threatens the existing state-of-the-art defense strategy. In the third stage, we develop a UNSUP-GAN model, where the generator is trained to denoise against latent noise and most adversarial noises. This generator can provide a robust adversarial attack against any unseen attack.

Bhattarai, Manish↗
DOE OSTI2025

SPADES (Scalable Parallel Discrete Events Simulation) [SWR-24-99]

SPADES (Solver for PArallel Discrete Event Simulation) is an open-source parallel discrete event simulation (PDES) package built on the AMReX library. Targeted at solving discrete event systems in parallel, this software package aims to be performance portable and scalable on heterogeneous computing architectures, e.g., graphic processing units (GPU). SPADES implements optimistic synchronization with rollback through an implementation of the Time Warp algorithm. An alternative conservative synchronization approach is also implemented using the Lower Bound on Incoming Time Stamp. In our implementation, logical processes are represented as cells in a grid and event messages are represented as particles. SPADES supports various parallel decomposition strategies, including the use of the Message Passing Interface (MPI) and OpenMP threading. All major GPU architectures (e.g., Intel, AMD, NVIDIA) are supported through the use of performance portability functionalities implemented in AMReX. The SPADES software is released in NREL Software Record SWR-24-99 “SPADES (Scalable Parallel Discrete Events Simulation)”.

Henry de Frahan, Marc [National Renewable Energy L↗
DOE OSTI2025

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2026

Local reduced-order modeling for electrostatic plasmas by physics-informed solution manifold decomposition

Despite advancements in high-performance computing and modern numerical algorithms, computational cost remains prohibitive for multi-query kinetic plasma simulations. Here, in this work, we develop data-driven reduced-order models (ROMs) for collisionless electrostatic plasma dynamics, based on the kinetic Vlasov-Poisson equation. Our ROM approach projects the equation onto a linear subspace defined by the proper orthogonal decomposition (POD) modes. We introduce an efficient tensorial method to update the nonlinear term using a precomputed third-order tensor. We capture multiscale behavior with a minimal number of POD modes by decomposing the solution manifold into multiple time windows and creating temporally local ROMs. We consider two strategies for decomposition: one based on the physical time and the other based on the electric field energy. Applied to the 1D1V Vlasov–Poisson simulations, that is, prescribed E-field, Landau damping, and two-stream instability, we demonstrate that our ROMs accurately capture the total energy of the system both for parametric and time extrapolation cases. The temporally local ROMs are more efficient and accurate than the single ROM. In addition, in the two-stream instability case, we show that the energy-windowing reduced-order model (EW-ROM) is more efficient and accurate than the time-windowing reduced-order model (TW-ROM). With the tensorial approach, EW-ROM solves the equation approximately 90 times faster than Eulerian simulations while maintaining a maximum relative error of 7.5% for the training data and 11% for the testing data.

Electrostatic plasmas↗
DOE OSTI2023

A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty

Practical solution of stochastic programming problems generally requires the use of parallel computing resources. Here, we describe the open source package mpi-sppy, in which efficient and scalable parallelization is a central feature. We report computational experiments that demonstrate the ability to solve very large stochastic programming problems - including mixed-integer variants - in minutes of wall clock time, efficiently leveraging significant parallel computing resources. We report results for the largest publicly available instances of stochastic mixed-integer unit commitment problems, solving to provably tight optimality gaps. In addition, we introduce a novel software architecture that facilitates combinations of methods for accelerating convergence that can be combined in plug-and-play manner. Finally, the mpi-sppy package is written in Python, leverages the widely used Pyomo (http://www.pyomo.org) library for modeling mathematical programs, builds on existing MPI implementations to ensure efficiency and scalability, and is available via http://github.com/Pyomo/mpi-sppy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Study of Different Formulations for the Multiperiod Blending Problem Applied to Lithium Recovery from Produced Water

We present several formulations to solve the MPBP for the recovery of REE/CMs from produced water and propose a decomposition approach thatleverages strategies in general disjunctive programming to enhance its performance. We compare these proposed formulations/strategies via two illustrative case studies on recovering lithium from a network of produced water sources.

Ovalle, Daniel↗
DOE OSTI2023

Rolling Horizon Based Temporal Decomposition for the Offline Pickup and Delivery Problem with Time Windows

The offline pickup and delivery problem with time windows (PDPTW) is a classical combinatorial optimization problem in the transportation community, which has proven to be very challenging computationally. Due to the complexity of the problem, practical problem instances can be solved only via heuristics, which trade-off solution quality for computational tractability. Among the various heuristics, a common strategy is problem decomposition, that is, the reduction of a large-scale problem into a collection of smaller sub-problems, with spatial and temporal decompositions being two natural approaches. While spatial decomposition has been successful in certain settings, effective temporal decomposition has been challenging due to the difficulty of stitching together the sub-problem solutions across the decomposition boundaries. In this work, we introduce a novel temporal decomposition scheme for solving a class of PDPTWs that have narrow time windows, for which it is able to provide both fast and high-quality solutions. We utilize techniques that have been popularized recently in the context of online dial-a-ride problems along with the general idea of rolling horizon optimization. To the best of our knowledge, this is the first attempt to solve offline PDPTWs using such an approach. To show the performance and scalability of our framework, we use the optimization of paratransit services as a motivating example. Due to the lack of benchmark solvers similar to ours (i.e., temporal decomposition with an online solver), we compare our results with an offline heuristic algorithm using Google OR-Tools. In smaller problem instances (with an average of 129 requests per instance), the baseline approach is as competitive as our framework. However, in larger problem instances (approximately 2,500 requests per instance), our framework is more scalable and can provide good solutions to problem instances of varying degrees of difficulty, while the baseline algorithm often fails to find a feasible solution within comparable compute times.

Kim, Youngseo↗
DOE OSTI2026

Rank-Limiting Strategies for Optimizing Tensor-Train Finite-Difference Time-Domain Simulations

We introduce rank-limiting strategies to optimize tensor-train decompositions for three-dimensional finite-difference time-domain simulations using the relationship between the tensors and their specific dimensionality. These include the use of hard caps on the inner ranks of the tensor train decomposition and the use of a group rounding algorithm taking into account all field components simultaneously. Here, several numerical examples are considered to verify the efficacy of the proposed optimization strategies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Flavor diagonal nucleon charges using clover fermions on MILC HISQ ensembles

We present lattice results for the flavor diagonal charges of the proton from the analysis of eight ensembles generated using 2+1+1-flavors of highly improved staggered quarks by the MILC Collaboration. The calculation includes all the needed connected and disconnected contributions to nucleon three-point function. For extracting matrix elements using fits to the spectral decomposition of these correlation functions, two strategies to remove excited state contributions are employed and compared. To renormalize these charges, the 2+1-flavor mixing matrix is calculated in the regularization independent symmetric momentum subtraction intermediate scheme on the lattice. The final results are presented in the $\overline{MS}$ scheme at scale 2 GeV. The axial charges for the proton are $𝑔$$^{𝑢}_{𝐴}$ = 0.781⁢(25), $𝑔$$^{𝑑}_{𝐴}$ =−0.440⁢(39), and $𝑔$$^{𝑠}_{𝐴}$ = −0.055⁢(9); the tensor charges are $𝑔$$^{𝑢}_{𝑇}$ = 0.782⁢(28), $𝑔$$^{𝑑}_{𝑇}$ = −0.195⁢(16), and $𝑔$$^{𝑠}_{𝑇}$ = −0.0016⁢(12); and the scalar charges are $𝑔$$^{𝑢}_{𝑆}$ = 9.39⁢(88), $𝑔$$^{𝑑}_{𝑆}$ = 8.84⁢(93), and $𝑔$$^{𝑠}_{𝑆}$ = 0.37⁢(14). Results for the neutron are given by the 𝑢 ↔ 𝑑 interchange. Results for the sigma terms are 𝜎 𝜋⁢𝑁 | standard = 42⁢(6) MeV from a “standard” analysis and 𝜎 𝜋⁢𝑁 | 𝑁⁢𝜋 = 61⁢(6) MeV from an “𝑁⁢𝜋” analysis that includes the contributions of multihadron 𝑁⁢𝜋 excited states as motivated by chiral perturbation theory. Our preferred value 𝜎 𝜋⁢𝑁 | 𝑁⁢𝜋 is consistent with the phenomenological extraction from 𝜋 −𝑁 scattering data. The strangeness content of the proton, for which the standard analysis is appropriate, is 𝜎 𝑠 | standard = 35⁢(13) MeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

The Active Optics System on the Vera C. Rubin Observatory: Optimal Control of Degeneracy among the Large Number of Degrees of Freedom

Abstract The Vera C. Rubin Observatory is a unique facility for survey astronomy that will soon be commissioned and begin operations. Crucial to many of its scientific goals is the achievement of sustained high image quality, limited only by the seeing at the site. This will be maintained through an active optics system that controls optical element misalignments and corrects mirror figure error to minimize aberrations caused by both thermal and gravitational effects. However, the large number of adjustment degrees of freedom available on the Rubin Observatory introduces a range of degeneracies, including many that are induced by noise due to imperfect measurement of the wave-front errors. We present a structured methodology for identifying these degeneracies through an analysis of image noise level. We also present a novel scaling strategy based on truncated singular value decomposition that mitigates the degeneracy and optimally distributes the adjustment over the available degrees of freedom. Our approach ensures the attainment of optimal image quality, while avoiding excursions around the noise-induced subspace of degeneracies, marking a significant improvement over the previous techniques adopted for Rubin, which were based on an optimal integral controller. This new approach is likely to also yield significant benefits for all telescopes that incorporate large numbers of degrees of freedom of adjustment.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Online Dynamic Mode Decomposition Based System Identification of Multi-Zone Building HVAC Systems

Many works have recently been conducted to reduce the electricity consumption of smart buildings and allow them to support various grid services. Most of these works require accurate system models for the various appliances in the building including heating, ventilation, and air conditioning (HVAC) units. In this paper, we investigate a recursive data-driven system identification strategy to construct the thermal model for a time-varying building with a multi-zone HVAC unit. The online dynamic mode decomposition (DMD)-based strategy is employed to identify the multi-zone thermal building dynamics, where a simple information update (rank-1) is selected to avoid computational complexity. The DMD-based identification strategy is validated using a real gymnasium building equipped with a 4-zone HVAC unit, and its performance is compared with that of the traditional nuclear-norm subspace identification (N2SID) strategy.

Wu, Tumin [University of Tennessee, Knoxville (UTK↗
DOE OSTI2025

Modeling Plant Nutrient Acquisition Strategies Alters Projections of Carbon and Nitrogen Dynamics in Bioenergy Agroecosystems

Plant strategies to acquire nutrients from limited environments help shape ecosystem carbon (C) and nitrogen (N) cycling and response to environmental change. The effects of plant strategies on ecosystem dynamics are largely uncharacterized in bioenergy agroecosystems, where the impacts could determine bioenergy's ability to meet its sustainability goals of storing C and reducing N loss. We used FUN-BioCROP (Fixation and Uptake of Nitrogen-Bioenergy Carbon, Rhizosphere, Organisms and Protection), a plant–microbe interaction model of coupled plant nutrient uptake and soil organic matter decomposition, to simulate the effects of nutrient acquisition strategies on soil microbial activity and ecosystem nutrient cycling in bioenergy feedstocks miscanthus (Miscanthus × giganteus) and sorghum (Sorghum bicolor (L.) Moench). We examined the model's ability to reproduce the relative effects of belowground nutrient uptake on microbial activity using a reanalysis of empirical data showing that miscanthus root exudation provoked a larger soil microbial response than sorghum. From baseline model simulations, we found that the ability of miscanthus to retranslocate N resulted in higher N uptake at a lower C cost than the sorghum/soybean rotation and that soil C and N pools increased under perennial (miscanthus) and decreased under annual (sorghum/soybean) cultivation. The model also predicted that greater root exudation increased soil C accumulation, highlighting the role of roots in forming stable soil C. Overall, the baseline model was unable to reproduce field observations of miscanthus root exudation stimulating microbial activity more than sorghum. To improve the model, we updated the soil microbial parameters in miscanthus to have faster decomposition, a higher C/N ratio, and greater carbon use efficiency. These changes improved the simulated soil microbial response to miscanthus root exudation, supporting the hypothesis that miscanthus soils foster a microbial community that is more responsive to root exudation than that of sorghum.

09 BIOMASS FUELS↗
DOE OSTI2026

The role of transition metal formyl intermediates in the reduction of CO and CO 2

Transition-metal formyl (metalloformyl) complexes occupy a central position in the activation of small molecules, particularly in the reduction of carbon monoxide (CO) and carbon dioxide (CO 2 ). This review examines five decades of progress in the synthesis of metalloformyl complexes and investigations into their structure and reactivity. The bonding in the M–CHO unit is best described as a resonance hybrid between a classical σ-bound formyl ligand and an oxycarbene-like electronic structure, which governs their distinctive spectroscopic signatures and versatile reactivity. Established synthetic routes are summarized, including pathways involving hydride addition and CO insertion, alongside a discussion of the thermodynamic and kinetic factors that control formyl stability. Decomposition pathways and Lewis-acid stabilization strategies are analyzed as key design principles for extending metalloformyl lifetimes under catalytic conditions. Particular attention is given to hydride transfer processes and the role of metalloformyl intermediates as both reactive substrates and hydride sources in reduction chemistry. Lastly, emerging catalytic strategies that exploit metalloformyl intermediates in CO 2 and CO reduction are evaluated, highlighting how control of hydricity, redox potential, and secondary-sphere interactions enables selective C—H bond formation under comparatively mild conditions. Collectively, these studies establish metalloformyl complexes as mechanistically informative and functionally relevant intermediates that bridge fundamental organometallic chemistry with modern approaches to small-molecule activation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗