Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Decomposition 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 73 records · Page 4

Data-Driven Adaptive Damping Controller for Wind Power Plants with Doubly-Fed Induction Generators: Preprint

This paper presents an adaptive damping controller for wind power plants in which the turbines are equipped with doubly-fed induction generators. The controller is designed to respond to an input control signal that is triggered according to the system operating conditions. A processing unit continuously estimates the electromechanical modes of oscillation based on real-time streaming data acquired from a phasor measurement unit that is strategically positioned on the grid. The decision to trigger (or not trigger) the control signal is automatic, based on the relative damping of the dominant mode. The modes are estimated using the dynamic mode decomposition algorithm with time-delay embedding. Numerical simulations performed on the two-area system demonstrate that the proposed controller enhances the rotor angle stability for both small-signal and large disturbances, and is adaptive to changing grid conditions.

61 RADIATION PROTECTION AND DOSIMETRY↗

Resilient NdFeB magnet recycling under the impacts of COVID-19 pandemic: Stochastic programming and Benders decomposition

Neodymium-iron-boron (NdFeB) magnets are the most powerful magnets per unit volume sold in the commercial market. Despite the increasing demand for clean energy applications such as electric vehicles and wind turbines, disruptive events including the COVID-19 pandemic have caused significant uncertainties in the supply and demand for NdFeB magnets. Therefore, this study aims to alleviate the risk of supply shortage for NdFeB magnets and the containing critical materials, rare-earth elements (REEs), through the development of a resilient reverse supply chain and logistics network design. We develop scenarios to model the unique impact of the COVID-19 pandemic on the proposed business, incorporating both disruption intensity and recovery rate. We formulate a chance-constrained two-stage stochastic programming model to maximize the profit while guaranteeing the network resiliency against disruption risks. To solve the problem in large-scale instances, we develop an efficient Benders decomposition algorithm that reduces the computational time by 98.5% on average compared to the default CPLEX algorithm. When applied to the United States, the model suggests the optimal facility locations, processing capacities, inventory levels, and material flows for NdFeB magnet recyclers that could meet 99.7% of the demand. To the best of our knowledge, this study is the first to incorporate the impacts of the COVID-19 pandemic to design a resilient NdFeB magnet recycling supply chain and logistics network, leveraging risk-averse stochastic programming.

42 ENGINEERING↗

A multistage distributionally robust optimization approach to water allocation under climate uncertainty

This paper investigates a Multistage Distributionally Robust Optimization (MDRO) approach to water allocation under climate uncertainty. The MDRO is formed by creating sets of conditional distributions (called conditional ambiguity sets) on a finite scenario tree. The distributions in the conditional ambiguity sets remain close to a nominal conditional distribution according a ø-divergence (e.g., Kullback-Leibler divergence, Hellinger distance, Burg entropy, etc.). Here, the paper discusses a decomposition algorithm to solve the resulting MDRO with ø-divergences, which uses the dual formulation and solves only linear subproblems instead of convex ones. Some properties of the algorithm such as generating feasible policies and valid upper/lower bounds are established. The paper then applies the modeling and solution techniques to allocate water in a rapidly-developing area of Tucson, Arizona. Tucson, like many arid and semi-arid regions around the world, faces considerable uncertainty in its ability to provide water for its citizens in the future. The primary sources of uncertainty in the Tucson region include (1) unpredictable population growth, (2) the availability of water from the Colorado River, and (3) the effects of climate variability on water consumption. This paper integrates forecasts for all these sources of uncertainty into a single optimization model for robust and sustainable water allocation. Then, it uses this model to analyze the value of constructing additional treatment facilities to reduce future water shortages. The results indicate that the MDRO approach can be very valuable for water managers by providing insights to minimize their risks and help them plan for the future.

54 ENVIRONMENTAL SCIENCES↗

Multistage Stochastic optimization for mid-term integrated generation and maintenance scheduling of cascaded hydroelectric system with renewable energy uncertainty

The uncertainties resulting from the escalating penetration of renewable energy resources pose severe challenges to the efficient operation of modern power systems. Hydroelectricity is characterized by its flexibility, controllability, and reliability, and thus becomes one of the most ideal energy resources to hedge against such uncertainties. This paper studies the mid-term integrated generation and maintenance scheduling of a cascaded hydroelectric system (CHS) consisting of multiple cascaded reservoirs and hydroelectric units. To precisely describe the mid-term water regulation policies, the hydraulic coupling relationship and water-energy nexus of CHS are incorporated into the proposed optimization model. The uncertainties of natural water inflow and the power outputs of wind/solar energy generation are taken into consideration and captured via a stochastic process modeled by a scenario tree. A multistage stochastic optimization (MSO) approach is developed to coordinate the complementary operations of multiple energy resources, by optimizing the mid-term water resource management, generation scheduling, and maintenance scheduling of CHS. The proposed MSO model is formulated as a large-scale mixed-integer linear program that presents significant computational intractability. To address this issue, a tailored Benders decomposition algorithm is developed. Two real-world case studies are conducted to demonstrate the capability and characteristics of the proposed model and algorithm. The computational results show that the proposed MSO model can exploit the flexibility of hydroelectricity to efficiently respond to variable wind and solar power, and reserve water resources for the generation in peak months to reduce the consumption of fossil fuel. Furthermore, the proposed solution approach also exhibits promising computational efficiency when handling large-scale models.

13 HYDRO ENERGY↗

Proactive Operations and Investment Planning via Stochastic Optimization to Enhance Power Systems’ Extreme Weather Resilience

We present scalable stochastic optimization approaches for improving power systems’ resilience to extreme weather events. We consider both proactive redispatch and transmission line hardening as alternatives for mitigating expected load shed due to extreme weather, resulting in large-scale stochastic linear programs (LPs) and mixed-integer linear programs (MILPs). We solve these stochastic optimization problems with progressive hedging (PH), a parallel, scenario-based decomposition algorithm. Our computational experiments indicate that our proposed method for enhancing power system resilience can provide high-quality solutions efficiently. With up to 128 scenarios on a 2,000-bus network, the operations (redispatch) and investment (hardening) resilience problems can be solved in approximately 6 min and 2 h of wall-clock time, respectively. Additionally, we solve the investment problems with up to 512 scenarios, demonstrating that the approach scales very well with the number of scenarios. Moreover, the method produces high quality solutions that result in statistically significant reductions in expected load shed. Our proposed approach can be augmented to incorporate a variety of other operational and investment resilience strategies, or a combination of such strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Developments in SRW Code and Sirepo Framework Supporting Simulation of Time-Dependent Coherent X-ray Scattering Experiments

Physical optics simulations for beamlines and experiments are essential for the effective use of synchrotron light source facilities such as NSLS-II at BNL. The SRW software package supports such source-to-detector simulations for coherent X-ray scattering and imaging experiments through its Python interface and Sirepo browser-based graphical user interface. This allows one to define custom sample models, assess the feasibility of an experiment, and estimate most appropriate beamline settings before using valuable beamtime. We discuss the recent use of general-purpose GPU resources and coherent mode decomposition algorithms in SRW to accelerate physical optics simulations with partially coherent X-rays. To illustrate these new capabilities, we describe simulations of typical time series of partially coherent scattering images used in X-ray Photon Correlation Spectroscopy (XPCS) experiments; aiming to characterize the nanoscale dynamics of a disordered sample, representing a solution of nanoparticles undergoing Brownian diffusion.

36 MATERIALS SCIENCE↗

Retrieval of energy spectra for all flavours of neutrinos from core-collapse supernova with multiple detectors

ABSTRACT We present a new method by which to retrieve energy spectrum for all falvours of neutrinos from core-collapse supernova (CCSN). In the retrieval process, we do not assume any analytic formulas to express the energy spectrum of neutrinos but rather take a direct way of spectrum reconstruction from the observed data; the singular value decomposition algorithm with a newly developed adaptive energy-gridding technique is adopted. We employ three independent reaction channels having different flavour sensitivity to neutrinos. Two reaction channels, inverse beta decay on proton and elastic scattering on electrons, from a water Cherenkov detector such as Super-Kamiokande (SK) and Hyper-Kamiokande (HK), and a charged current reaction channel with Argon from the Deep Underground Neutrino Experiment (DUNE) are adopted. Given neutrino oscillation models, we iteratively search the neutrino energy spectra at the CCSN source until they provide the consistent event counts in the three reaction channels. We test the capability of our method by demonstrating the spectrum retrieval to a theoretical neutrino data computed by our recent three-dimensional CCSN simulation. Although the energy spectrum with either electron-type or electron-type antineutrinos at the CCSN source has relatively large error compared to that of other species, the joint analysis with HK + DUNE or SK + DUNE will provide precise energy spectrum of all flavours of neutrinos at the source. Finally, we discuss perspectives for improvements of our method by using neutrino data of other detectors.

79 ASTRONOMY AND ASTROPHYSICS↗

The phase and turbulent properties of Cattail

ABSTRACT A recent publication discovered one of the largest filamentary neutral hydrogen features dubbed Cattail from high-resolution Five-hundred-meter Aperture Spherical radio Telescope observations that might be a new galactic arm of the Milky Way. We evaluate the turbulent and phase properties of Cattail via the newly developed Velocity Decomposition Algorithm and Force Balancing Model. We discover that if there exists a phase transition, then Cattail is unlikely in the cold neutral media phase. We also show that the Cattail is two disjoint features in caustics space, suggesting that the Cattail has two different turbulent systems. We check the spectra of the individual system separated via VDA to confirm this argument. We do not exclude the existence of smaller scale cold media being embedded within this structure.

79 ASTRONOMY AND ASTROPHYSICS↗

Image Gradient Decomposition for Parallel and Memory-Efficient Ptychographic Reconstruction

Ptychography is a popular microscopic imaging modality for many scientific discoveries and sets the record for highest image resolution. Unfortunately, the high image resolution for ptychographic reconstruction requires significant amount of memory and computations, forcing many applications to compromise their image resolution in exchange for a smaller memory footprint and a shorter reconstruction time. In this paper, we propose a novel image gradient decomposition method that significantly reduces the memory footprint for ptychographic reconstruction by tessellating image gradients and diffraction measurements into tiles. In addition, we propose a parallel image gradient decomposition method that enables asynchronous point-to-point communications and parallel pipelining with minimal overhead on a large number of GPUs. Our experiments on a Titanate material dataset (PbTiO3) with 16632 probe locations show that our Gradient Decomposition algorithm reduces memory footprint by 51 times. In addition, it achieves time-to-solution within 2.2 minutes by scaling to 4158 GPUs with a super-linear strong scaling efficiency at 364% compared to runtimes at 6 GPUs. This performance is 2.7 times more memory efficient, 9 times more scalable and 86 times faster than the state-of-the-art algorithm.

Wang, Xiao↗

Distributionally Robust Decentralized Volt-Var Control With Network Reconfiguration

Here, this paper presents a decentralized volt-var optimization (VVO) and network reconfiguration strategy to address the challenges arising from the growing integration of distributed energy resources, particularly photovoltaic (PV) generation units, in active distribution networks. To reconcile control measures with different time resolutions and empower local control centers to handle intermittency locally, the proposed approach leverages a two-stage distributionally robust optimization; decisions on slow-responding control measures and set points that link neighboring subnetworks are made in advance while considering all plausible distributions of uncertain PV outputs. We present a decomposition algorithm with an acceleration scheme for solving the proposed model. Numerical experiments on the IEEE 123 bus distribution system are given to demonstrate its outstanding out-of-sample performance and computational efficiency, which suggests that the proposed method can effectively localize uncertainty via risk-informed proactive timely decisions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multilevel Techniques for Compression and Reduction of Scientific Data---The Unstructured Case

Previous work on multilevel techniques for compression and reduction of scientific data is extended to the case of data given on unstructured meshes in two and three dimensions. The centerpiece of the work is a decomposition algorithm which is shown to be optimal, in terms of both storage and operational complexity, applicable to unstructured grids in both two and three dimensions, and which implicitly gives a Riesz basis that can be exploited to reduce the data while maintaining rigorous bounds on the loss incurred. The flexibility of the approach is illustrated by applications to potential flow around an airfoil and the effect of compression on quantities of interest relevant to airfoil design; compression of computational simulation of a nonlinear reaction-diffusion system with special attention given to the problem of time series reduction; and, data from a simulation of magnetically confined plasma in a fusion reactor reduced so as to preserve the electric field computed from the data.

97 MATHEMATICS AND COMPUTING↗

Dynamic Transmission Line Switching Amid Wildfire-Prone Weather Under Decision-Dependent Uncertainty

During dry and windy seasons, environmental conditions significantly increase the risk of wildfires, exposing power grids to disruptions caused by transmission line failures. Wildfire propagation exacerbates grid vulnerability, potentially leading to prolonged power outages. To address this challenge, we propose a multistage optimization model that dynamically adjusts transmission grid topology in response to wildfire propagation, aiming to develop an optimal response policy. By accounting for decision-dependent uncertainty, where line survival probabilities depend on usage, we employ distributionally robust optimization to model uncertainty in line survival distributions. We adapt the stochastic nested decomposition algorithm and derive a deterministic upper bound for its finite convergence. To enhance computational efficiency, we exploit the Lagrangian dual problem structure for a faster generation of Lagrangian cuts. Using realistic data from the California transmission grid, we demonstrate the superior performance of dynamic response policies against two-stage alternatives through a comprehensive case study. In addition, after solving the multistage formulation, we construct easy-to-implement policies that significantly reduce computational burden while maintaining good performance in real-time deployment. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms and Applications. Funding: This work was supported by the U.S. Department of Energy, Office of Electricity [Grant DE-AC02-05CH11231]. The work of R. Jiang was supported in part by the U.S. National Science Foundation, Division of Electrical, Communications and Cyber Systems [Grant ECCS-1845980] and the U.S. Air Force Office of Scientific Research [Grant FA9550-23-1-0323]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1210 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1210 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Estrada-Garcia, Juan-Alberto↗

Extreme-scale stochastic optimization and simulation via learning-enhanced decomposition and parallelization (Final Technical Report)

Stochastic optimization and simulation models ubiquitously arise in designing and operating complex service/engineering systems. They can be extreme in scale due to high-dimensional data and decisions, and can also involve decisions made sequentially in response to newly revealed data, both causing significant computational challenge. The objective of this research is to explore a unified framework that integrates machine learning with discrete optimization and risk-averse modeling, to improve the efficiency of decomposition paradigms for stochastic optimization and simulations at extreme scale. The models we consider represent a broad class of complex decision-making problems, where 0-1 or continuous decisions are made before and/or after knowing multiple sources of uncertainties that could be correlated. We will employ machine learning methods to dynamically decide and prioritize computational procedures, including cut generation, branching, and bounding of the optimal objective. Furthermore, the research will shed new lights on the traditional decomposition algorithms for extreme-scale computing. Deliverables of the research include new modeling and computational methods for advancing the state-of-the-art research in optimization and simulation, bringing many relevant risk-averse, data-driven optimization problems in practice within the range of tractability. Examples include distributed computing server scheduling and sensor deployment for monitoring critical infrastructures. Success in this effort will enable progress in solving multiple extreme-scale problems in the complex system design and operations arising from DoE missions in energy, environment, and national security.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Small-amplitude Compressible Magnetohydrodynamic Turbulence Modulated by Collisionless Damping in Earth’s Magnetosheath: Observation Matches Theory

Plasma turbulence is a ubiquitous dynamical process that transfers energy across many spatial and temporal scales and affects energetic particle transport. Recent advances in the understanding of compressible magnetohydrodynamic (MHD) turbulence demonstrate the important role of damping in shaping energy distributions on small scales, yet its observational evidence is still lacking. This study provides the first observational evidence of substantial collisionless damping (CD) modulation on the small-amplitude compressible MHD turbulence cascade in Earth’s magnetosheath using four Cluster spacecraft. Based on an improved compressible MHD decomposition algorithm, turbulence is decomposed into three eigenmodes: incompressible Alfvén modes and compressible slow and fast (magnetosonic) modes. Our observations demonstrate that CD enhances the anisotropy of compressible MHD modes because CD has a strong dependence on wave propagation angle. The wavenumber distributions of slow modes are mainly stretched perpendicular to the background magnetic field (B 0 ) and weakly modulated by CD. In contrast, fast modes are subjected to a more significant CD modulation. Fast modes exhibit a weak, scale-independent anisotropy above the CD truncation scale. Below the CD truncation scale, the anisotropy of fast modes enhances as wavenumbers increase. As a result, fast-mode fractions in the total energy of compressible modes decrease with the increase of perpendicular wavenumber (to B 0 ) or wave propagation angle. Our findings reveal how the turbulence cascade is shaped by CD and its consequences for anisotropies in the space environment.

97 MATHEMATICS AND COMPUTING↗

On the eigenvalue and eigenvector derivatives of a general matrix

The existence of differentiable eigenvalues and eigenvectors for a general matrix is addressed. The eigenspace which contains differentiable eigenvectors is determined and computed by using the concept of subspace intersection in conjunction with the singular value decomposition algorithm. The differentiable eigenvectors associated with repeated eigenvalues should be simultaneously the eigenvectors of the general matrix and its corresponding sensitivity matrix. Furthermore, the derivatives for differentiable eigenvectors associated with repeated eigenvalues can be computed using higher order derivatives of the matrix, whereas the corresponding eigenvalue derivatives are the eigenvalues of the sensitivity matrix.

Juang, Jer-Nan↗

ICASE Computer Science Program

The Institute for Computer Applications in Science and Engineering computer science program is discussed in outline form. Information is given on such topics as problem decomposition, algorithm development, programming languages, and parallel architectures.

Source record↗

Compressible flow calculations employing the Galerkin/least-squares method

A multielement group, domain decomposition algorithm is presented for solving linear nonsymmetric systems arising in the finite-element analysis of compressible flows employing the Galerkin/least-squares method. The iterative strategy employed is based on the generalized minimum residual (GMRES) procedure originally proposed by Saad and Shultz. Two levels of preconditioning are investigated. Applications to problems of high-speed compressible flow illustrate the effectiveness of the scheme.

Shakib, F.↗

Parallel processing methods for space based power systems

This report presents a method for doing load-flow analysis of a power system by using a decomposition approach. The power system for the Space Shuttle is used as a basis to build a model for the load-flow analysis. To test the decomposition method for doing load-flow analysis, simulations were performed on power systems of 16, 25, 34, 43, 52, 61, 70, and 79 nodes. Each of the power systems was divided into subsystems and simulated under steady-state conditions. The results from these tests have been found to be as accurate as tests performed using a standard serial simulator. The division of the power systems into different subsystems was done by assigning a processor to each area. There were 13 transputers available, therefore, up to 13 different subsystems could be simulated at the same time. This report has preliminary results for a load-flow analysis using a decomposition principal. The report shows that the decomposition algorithm for load-flow analysis is well suited for parallel processing and provides increases in the speed of execution.

Berry, F. C.↗