Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “decomposition algorithms”

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 55 records · Page 3

Reliable and Efficient Parallel Processing Algorithms and Architectures for Modern Signal Processing

Least-squares (LS) estimations and spectral decomposition algorithms constitute the heart of modern signal processing and communication problems. Implementations of recursive LS and spectral decomposition algorithms onto parallel processing architectures such as systolic arrays with efficient fault-tolerant schemes are the major concerns of this dissertation. There are four major results in this dissertation. First, we propose the systolic block Householder transformation with application to the recursive least-squares minimization. It is successfully implemented on a systolic array with a two-level pipelined implementation at the vector level as well as at the word level. Second, a real-time algorithm-based concurrent error detection scheme based on the residual method is proposed for the QRD RLS systolic array. The fault diagnosis, order degraded reconfiguration, and performance analysis are also considered. Third, the dynamic range, stability, error detection capability under finite-precision implementation, order degraded performance, and residual estimation under faulty situations for the QRD RLS systolic array are studied in details. Finally, we propose the use of multi-phase systolic algorithms for spectral decomposition based on the QR algorithm. Two systolic architectures, one based on triangular array and another based on rectangular array, are presented for the multiphase operations with fault-tolerant considerations. Eigenvectors and singular vectors can be easily obtained by using the multi-pase operations. Performance issues are also considered.

Liu, Kuojuey Ray↗

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗

Partitioning of unstructured problems for parallel processing

Many large-scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. The question of how to distribute such unstructured computational domains over a large number of processors in a MIMD machine with distributed memory is addressed. A graph theoretical framework for these problems is established. Based on this framework three decomposition algorithms are introduced. In particular a new decomposition algorithm is discussed, which is based on the computation of an eigenvector of the Laplacian matrix associated with the graph. Numerical comparisons on large-scale two- and three-dimensional problems demonstrate the superiority of the new spectral bisection algorithm.

Simon, H. D.↗

On a concurrent element-by-element preconditioned conjugate gradient algorithm for multiple load cases

Element-by-element preconditioned conjugate gradient (EBE-PCG) algorithms have been advocated for use in parallel/vector processing environments as being superior to the conventional LDL(exp T) decomposition algorithm for single load cases. Although there may be some advantages in using such algorithms for a single load case, when it comes to situations involving multiple load cases, the LDL(exp T) decomposition algorithm would appear to be decidedly more cost-effective. The authors have outlined an EBE-PCG algorithm suitable for multiple load cases and compared its effectiveness to the highly efficient LDL(exp T) decomposition scheme. The proposed algorithm offers almost no advantages over the LDL(exp T) algorithm for the linear problems investigated on the Alliant FX/8. However, there may be some merit in the algorithm in solving nonlinear problems with load incrementation, but that remains to be investigated.

Watson, Brian↗

Postmortem validation of breast density using dual-energy mammography

Purpose: Mammographic density has been shown to be an indicator of breast cancer risk and also reduces the sensitivity of screening mammography. Currently, there is no accepted standard for measuring breast density. Dual energy mammography has been proposed as a technique for accurate measurement of breast density. The purpose of this study is to validate its accuracy in postmortem breasts and compare it with other existing techniques. Methods: Forty postmortem breasts were imaged using a dual energy mammography system. Glandular and adipose equivalent phantoms of uniform thickness were used to calibrate a dual energy basis decomposition algorithm. Dual energy decomposition was applied after scatter correction to calculate breast density. Breast density was also estimated using radiologist reader assessment, standard histogram thresholding and a fuzzy C-mean algorithm. Chemical analysis was used as the reference standard to assess the accuracy of different techniques to measure breast composition. Results: Breast density measurements using radiologist reader assessment, standard histogram thresholding, fuzzy C-mean algorithm, and dual energy were in good agreement with the measured fibroglandular volume fraction using chemical analysis. The standard error estimates using radiologist reader assessment, standard histogram thresholding, fuzzy C-mean, and dual energy were 9.9%, 8.6%, 7.2%, and 4.7%, respectively. Conclusions: The results indicate that dual energy mammography can be used to accurately measure breast density. The variability in breast density estimation using dual energy mammography was lower than reader assessment rankings, standard histogram thresholding, and fuzzy C-mean algorithm. Improved quantification of breast density is expected to further enhance its utility as a risk factor for breast cancer.

60 APPLIED LIFE SCIENCES↗

Algorithms for Spectral Decomposition with Applications to Optical Plume Anomaly Detection

The analysis of spectral signals for features that represent physical phenomenon is ubiquitous in the science and engineering communities. There are two main approaches that can be taken to extract relevant features from these high-dimensional data streams. The first set of approaches relies on extracting features using a physics-based paradigm where the underlying physical mechanism that generates the spectra is used to infer the most important features in the data stream. We focus on a complementary methodology that uses a data-driven technique that is informed by the underlying physics but also has the ability to adapt to unmodeled system attributes and dynamics. We discuss the following four algorithms: Spectral Decomposition Algorithm (SDA), Non-Negative Matrix Factorization (NMF), Independent Component Analysis (ICA) and Principal Components Analysis (PCA) and compare their performance on a spectral emulator which we use to generate artificial data with known statistical properties. This spectral emulator mimics the real-world phenomena arising from the plume of the space shuttle main engine and can be used to validate the results that arise from various spectral decomposition algorithms and is very useful for situations where real-world systems have very low probabilities of fault or failure. Our results indicate that methods like SDA and NMF provide a straightforward way of incorporating prior physical knowledge while NMF with a tuning mechanism can give superior performance on some tests. We demonstrate these algorithms to detect potential system-health issues on data from a spectral emulator with tunable health parameters.

Srivastava, Askok N.↗

Coordinated Planning Strategy for Integrated Energy Systems in a District Energy Sector

With the ever-growing integration of diverse distributed energy resources, modern district energy sectors are transitioning into integrated energy systems (IESs), which generally consist of various energy carriers such as electric power, natural gas, and heat. Instead of modeling individual energy carriers, the emergence of IESs requires comprehensive consideration of all involved energy systems in both planning and operation phases. This paper proposes a comprehensive planning strategy for a district energy sector to address the challenges of IES planning considering the coupling of power, gas, and heat systems. The proposed planning model contains an operational module that develops a steady-state optimal multi-energy flow (OMEF) for the IES considered and a multi-stage expansion module that optimizes the investment decisions. To efficiently solve the proposed planning model, which is formulated as a mixed-integer nonlinear programming problem, an improved generalized Benders decomposition algorithm that utilizes dynamic dual multipliers to improve the convergence speed is employed. The effectiveness of the proposed planning model and the feasibility of the improved Benders decomposition algorithm are verified in case studies.

coordinated planning↗

A parallel hierarchical blocked adaptive cross approximation algorithm

This article presents a low-rank decomposition algorithm based on subsampling of matrix entries. The proposed algorithm first computes rank-revealing decompositions of submatrices with a blocked adaptive cross approximation (BACA) algorithm, and then applies a hierarchical merge operation via truncated singular value decompositions (H-BACA). The proposed algorithm significantly improves the convergence of the baseline ACA algorithm and achieves reduced computational complexity compared to the traditional decompositions such as rank-revealing QR. Numerical results demonstrate the efficiency, accuracy, and parallel scalability of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Coordinated Transmission and Distribution AC Optimal Power Flow

The current separate transmission and distribution energy management system faces multiple challenges associated with integrating distributed generators (DGs) into future grids. These challenges, such as a voltage rise issue resulting in curtailment of DGs, are difficult to solve via the current separate energy management. Thus, coordination between transmission and distribution is suggested, and a coordinated transmission and distribution AC optimal power flow (TDOPF) is proposed in this paper. A mathematical TDOPF model is established and analyzed in a master-slave structure. A heterogeneous decomposition algorithm (HGD), which is inspired by heterogeneous transmission and distribution characteristics, is proposed to solve the TDOPF in a distributed manner. The HGD is compared to other typical multi-area OPF decomposition algorithms and the differences are discussed. Numerical tests verify the benefit of the TDOPF to both transmission and distribution systems. The TDOPF improves economic operations, mitigates voltage rises, and decreases boundary bus mismatches. Hence, more DGs can be accommodated by the grid. In addition, a series of numerical tests indicate that the HGD competitively solves the TDOPF.

decomposition↗

Two-stage minimax stochastic unit commitment

The study proposes a stochastic optimisation approach based on discrete scenarios and the minimax criterion to deal with demand uncertainty in the two-stage unit commitment problem. To avoid making an over-conservative decision, the approach is designed to assign a probability-based weight to each demand scenario and provide a unit commitment schedule that minimises the maximum possible-weighted generation cost. Unit commitment is determined in the first stage and the economic dispatch under the scenario that corresponds to the maximum possible-weighted generation cost is determined in the second stage. The problem is formulated as a type of min-max-min mixed integer programming model. By introducing an auxiliary variable, the model is further transformed into a minimisation problem. A Benders decomposition algorithm is developed to solve the problem. The Benders master problem determines the unit commitment decision, while the Benders subproblem determines the dispatch decision. Multiple Benders feasibility cuts are constructed when the Benders subproblem is infeasible. Valid inequalities are derived to improve the lower bound provided by the Benders master problem. Numerical results show the performance of the algorithm.

Che, Ping↗

Optimization-Driven Scenario Grouping

Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. Here, we develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed grouping problem is NP-hard in general, identify a polynomially solvable case, and present two formulations for solving the problem: a matching formulation for a special case and a mixed-integer programming formulation for the general case. We use the proposed grouping scheme as a preprocessing step for a particular scenario decomposition algorithm and demonstrate its effectiveness in solving standard test instances of two-stage 0–1 stochastic programs. Using this approach, we are able to prove optimality for all previously unsolved instances of a standard test set. Additionally, we implement this scheme as a preprocessing step for PySP, a publicly available and widely used implementation of progressive hedging, and compare this grouping approach with standard grouping approaches on large-scale stochastic unit commitment instances. Finally, the idea is extended to propose a finitely convergent algorithm for two-stage stochastic programs with a finite feasible region.

97 MATHEMATICS AND COMPUTING↗

Decomposition and Algorithmic Approaches for Solving Large-Scale Process Family Design Problems

Our most recent work expands the water desalination case study from 76 variants to 10,897 variants using the equation-oriented model built in Pyomo as part of the PARETO project. Using the discretization formulation presented in Stinchfield (2024a), rather than solving for all 10,897 variants simultaneously, we decompose the formulation into subproblems containing subsets of variants from the process family. We solve the overall problem with Progressive Hedging (PH) deployed in parallel on a distributed HPC cluster using the open-source Python package mpi-sppy (Knueven et al., 2023). This approach allowed us to solve this process family design problem to ~1.5% relative optimality gap in about 5 hours; in comparison, Gurobi reached ~50% relative optimality gap in about 6 hours (Stinchfield et al., 2024b). However, this approach still requires discretization of the common unit module design ranges; additionally, PH acts as a heuristic for MILP’s with gap-closing capabilities. Ideally, we would not have to use ML surrogates or discretization to solve this problem, instead solving the process family design problem with the equation-oriented model directly to achieve the most accurate results. However, recall that we did not consider solving the MINLP directly due to complexity and size. In this work, we aim to decompose and solve this large-scale MINLP using a Structured Nonlinear Global Optimization algorithm presented by Cao and Zavala (2019).

Stinchfield, Georgia↗

Prototype maneuver decomposition algorith for genesis

This paper addresses a prototype of a maneuver decomposition algorithm developed by the Genesis Navigation Team at JPL. The algorithm described herein is an early prototype designed to support navigation analyses and to provide the basis for later development of operational software by the Spacecraft Team. The basis algorithm is applicable to any spin-stabilized spacecraft with axisymmetric thrusters.

Genesis↗

Reliable algorithm for modal decomposition

This paper describes a reliable, general algorithm for modal decomposition in real arithmetic and its use in analyzing and synthesizing control logic for linear dynamic systems. The numerical difficulties are described associated with computing the Jordan canonical form when the system has repeated, or nearly repeated, eigenvalues. A new algorithm is described that satisfactorily solves these numerical difficulties. The relation and extension to related numerical analysis research are discussed to clarify the reliability of the techniques. Finally, its implementation as a practical modal decomposition method for efficiently computing the matrix exponential, transfer functions, and frequency response is also described.

Walker, Robert A.↗

Developing an Accurate CFD Based Gust Model for the Truss Braced Wing Aircraft

The increased flexibility of long endurance aircraft having high aspect ratio wings necessitates attention to gust response and perhaps the incorporation of gust load alleviation. The design of civil transport aircraft with a strut or truss-braced high aspect ratio wing furthermore requires gust response analysis in the transonic cruise range. This requirement motivates the use of high fidelity nonlinear computational fluid dynamics (CFD) for gust response analysis. This paper presents the development of a CFD based gust model for the truss braced wing aircraft. A sharp-edged gust provides the gust system identification. The result of the system identification is several thousand time steps of instantaneous pressure coefficients over the entire vehicle. This data is filtered and downsampled to provide the snapshot data set from which a reduced order model is developed. A stochastic singular value decomposition algorithm is used to obtain a proper orthogonal decomposition (POD). The POD model is combined with a convolution integral to predict the time varying pressure coefficient distribution due to a novel gust profile. Finally the unsteady surface pressure response of the truss braced wing vehicle to a one-minus-cosine gust, simulated using the reduced order model, is compared with the full CFD.

Bartels, Robert E.↗

A biomimetic approach to fast selection of optimal controlled variables using multiagent algorithms and a decomposition approach

Selection of primary controlled variables (CVs) with due consideration of economic loss and ease of control is an important step for achieving optimal plant operation under design and off-design conditions. However, the computational expense of the combinatorial optimization step that is undertaken for CV selection renders the existing approaches unaffordable for fast selection of optimal CVs. Two approaches are proposed in this paper for improving the computational efficiency of the optimization step. Typically, the CV selection process is typically executed by considering the entire plant together. Opposed to that, the first approach proposed here seeks to decompose the process plant into multiple partitions based on the connectivity strength. Then the CV selection algorithm can be executed on each partition independently. The decomposition algorithm is biomimetic and has been developed, in analogy to neuroscience, mimicking how the information about the connectivity information is extracted using a dynamic casual model. This approach can significantly decrease the number of combinatorial optimization problems that needs to be solved and facilitates parallelization of the solution. In the second approach, a multiagent optimization framework is proposed that utilizes metaheuristic optimization strategies such as the efficient ant colony algorithm, simulated annealing and the genetic algorithm. These two approaches can be used by themselves or in combination. This framework enables cooperative search by a group of algorithmic agents facilitated through an information sharing protocol. These two approaches are applied to a toy problem and an acid gas removal unit as part of an integrated gasification combined cycle. This study shows how the computational time and economic and control performance of the optimal CV sets vary as the number of partitions are changed.

42 ENGINEERING↗

Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation

Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.

97 MATHEMATICS AND COMPUTING↗