SEARCH · Engineering Papers
Results for “constraint decomposition”
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.
Spectral Clustering-Based Partitioning of Large-Scale Power Electronics-Based Power Systems for Small-Signal Stability Analysis
The nodal admittance matrix (NAM)-based approach is well-suited for small-signal stability analysis of large-scale power electronics-based power systems (PEPSs), as it preserves the system structure through its admittance matrix. Previous studies have explored partitioning such systems into subareas and interconnections to reduce computational burden; however, they lacked a formal algorithmic procedure for determining feasible partitions. While several grid partitioning methods, such as those based on graph theory or machine learning, exist in the literature, they cannot be directly applied to NAM-based analysis due to differing objectives and constraints. Here, this paper addresses this gap by presenting a systematic, step-by-step procedure for applying a spectral partitioning algorithm that yields a division of the system into subareas suitable for NAM-based analysis. The computational complexity of the proposed method is also derived to demonstrate its efficiency and justify the practicality of the resulting subarea decomposition. The performance of the partitioning method is evaluated by applying the spectral clustering-derived subareas and interconnections to the NAM-based partitioning approach on a 140-bus system. Computational times for the full-system and partitioned NAM analyses are compared using MATLAB. Additionally, PSCAD simulations of the complete system and partitioned subareas are carried out to verify the effectiveness of the proposed method.
Time dependent supervisory control update with FARM using rolling window
This report describes improvements to the Feasible Actuator Range Modifier (FARM) component of the RAVEN-based HYBRID framework for analysis of Integrated Energy Systems (IES). FARM supports the HERON plug-in that solves the power dispatch problem. The solution to the dispatch problem involves economically optimal dispatches that satisfy limits on production variables and their rates of variation (explicit constraints) as well as process variables tied to the service life of equipment (implicit constraints). FARM serves to validate or confirm that a HERON solution for explicit constraints also satisfies the implicit constraints. FARM-alpha was released by Argonne National Laboratory in January 2021 followed by FARM-Beta in January 2022 with the latter providing increased flexibility for the user. In this report, FARM-Gamma, the latest version of the code, is described. The major improvement is the implementation of a system identification algorithm based on the Dynamic Mode Decomposition with Control (DMDc) coupled with a “Rolling Window” scheme that allows obtaining linear time-varying state-space models. This feature equips FARM with the most accurate approximation of system dynamics, and it relieves the user from the burden of performing an exhaustive off-line characterization of the dynamics. FARM-Gamma capabilities are assessed by solving the power dispatch problem for a representative IES unit. The simulation times corresponding to the different releases are estimated and compared. These values capture the increasing computational burden of the successively higher fidelity state-space models adopted by FARM-Alpha, FARM-Beta and FARM-Gamma. The code implementation provides significant flexibility, i.e., the user can always select the most suitable version of FARM according to the problem to be solved and the available computational resources. It is anticipated that FARM will play a role in addressing several future IES applications. We outline how it can support the coordinated management and safe operation of a nuclear plant coupled to industrial processes to produce hydrogen and synfuels.
The Delta(dot) B = O Constraint vs. Minimization of Numerical Errors in MHD Simulations
The MHD equations are a system of non-strictly hyperbolic conservation laws. The non-convexity of the inviscid flux vector resulted in corresponding Jacobian matrices with undesirable properties. On the other hand, the MHD equations can be derived from basic principles in either conservative or non-conservative form. The non-conservative system has a better conditioned eigensystem. The Delta(dot)B = 0 constraint of the A4HD equations is only an initial condition constraint. One does not need the Delta(dot)B condition to close the MHD system. We formulate our new low dissipative high order scheme together with the Cargo & Gallice (1997) form of the MHD approximate Riemann solver in curvilinear grids for both versions of the MHD equations. A novel feature of our new method is that the well-conditioned eigen-decomposition of the non-conservative MHD equations is used to solve the conservative equations. This new feature of the method provides well-conditioned eigenvectors for the conservative formulation, so that correct wave speeds for discontinuities are assured. The justification for using the non-conservative eigen-decomposition to solve the conservative equations is that our scheme has a better control of the numerical error associated with the Delta(dot)B condition. Consequently, computing both forms of the equations with the same eigen-decomposition is almost equivalent. It will be shown that this approach, using the non-conservative eigensystem when solving the conservative equations, also works well in the context of standard shock-capturing schemes.
Constraints on Triple Oxygen Isotope Kinetics
Isotopic disequilibrium is not as well constrained as equilibrium, hindering interpretation of isotopic variations. Kinetic isotope effects, a subset of disequilibrium, are common in nature and have been assumed to be distinct from equilibrium and mass independent isotope effects based on underdeveloped criteria. Using basic physical principles, we provide needed mechanistic constraints on mass-dependent kinetic isotope effects for the triple oxygen isotope system. We find some kinetic isotope effects yield large isotopic variations, exceeding equilibrium, which could be mistaken for mass independent relationships. Meanwhile, other kinetic isotope effects are found to have triple oxygen isotope relationships that could be mistaken for equilibrium isotope effects. Comparison against prior case studies of thermal decomposition of calcite (CaCO3) and brucite (Mg(OH)2) further tests our results. Although oxygen is the focus here, our approach applies to any system with more than two isotopes.
A two-level trajectory decomposition algorithm featuring optimal intermediate target selection
A decomposition algorithm is presented that optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.
A two-level trajectory decomposition algorithm featuring optimal intermediate target selection
A decomposition algorithm is presented which optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.
Decomposition-Based Decision Making for Aerospace Vehicle Design
Most practical engineering systems design problems have multiple and conflicting objectives. Furthermore, the satisfactory attainment level for each objective ( requirement ) is likely uncertain early in the design process. Systems with long design cycle times will exhibit more of this uncertainty throughout the design process. This is further complicated if the system is expected to perform for a relatively long period of time, as now it will need to grow as new requirements are identified and new technologies are introduced. These points identify a need for a systems design technique that enables decision making amongst multiple objectives in the presence of uncertainty. Traditional design techniques deal with a single objective or a small number of objectives that are often aggregates of the overarching goals sought through the generation of a new system. Other requirements, although uncertain, are viewed as static constraints to this single or multiple objective optimization problem. With either of these formulations, enabling tradeoffs between the requirements, objectives, or combinations thereof is a slow, serial process that becomes increasingly complex as more criteria are added. This research proposal outlines a technique that attempts to address these and other idiosyncrasies associated with modern aerospace systems design. The proposed formulation first recasts systems design into a multiple criteria decision making problem. The now multiple objectives are decomposed to discover the critical characteristics of the objective space. Tradeoffs between the objectives are considered amongst these critical characteristics by comparison to a probabilistic ideal tradeoff solution. The proposed formulation represents a radical departure from traditional methods. A pitfall of this technique is in the validation of the solution: in a multi-objective sense, how can a decision maker justify a choice between non-dominated alternatives? A series of examples help the reader to observe how this technique can be applied to aerospace systems design and compare the results of this so-called Decomposition-Based Decision Making to more traditional design approaches.
The Delta x B = 0 Constraint Versus Minimization of Numerical Errors in MHD Simulations
The MHD equations are a system of non-strictly hyperbolic conservation laws. The non-convexity of the inviscid flux vector resulted in corresponding Jacobian matrices with undesirable properties. It has previously been shown by Powell et al. (1995) that an 'almost' equivalent MHD system in non-conservative form can be derived. This non-conservative system has a better conditioned eigensystem. Aside from Powell et al., the MHD equations can be derived from basic principles in either conservative or non-conservative form. The Delta x B = 0 constraint of the MHD equations is only an initial condition constraint, it is very different from the incompressible Navier-Stokes equations in which the divergence condition is needed to close the system (i.e., to have the same number of equations and the same number of unknown). In the MHD formulations, if Delta x B = 0 initially, all one needs is to construct appropriate numerical schemes that preserve this constraint at later time evolutions. In other words, one does not need the Delta x B condition to close the MHD system. We formulate our new scheme together with the Cargo & Gallice (1997) form of the MHD approximate Riemann solver in curvilinear grids for both versions of the MHD equations. A novel feature of our new method is that the well-conditioned eigen-decomposition of the non-conservative MHD equations is used to solve the conservative equations. This new feature of the method provides well-conditioned eigenvectors for the conservative formulation, so that correct wave speeds for discontinuities are assured. The justification for using the non-conservative eigen-decomposition to solve the conservative equations is that our scheme has a better control of the numerical error associated with the divergence of the magnetic condition. Consequently, computing both forms of the equations with the same eigen-decomposition is almost equivalent. It will be shown that this approach, using the non-conservative eigensystem when solving the conservative equations, also works well in the context of standard shock-capturing schemes.
Differences in substrate use linked to divergent carbon flow during litter decomposition
ABSTRACT Discovering widespread microbial processes that create variation in soil carbon (C) cycling within ecosystems may improve soil C modeling. Toward this end, we screened 206 soil communities decomposing plant litter in a common garden microcosm environment and examined features linked to divergent patterns of C flow. C flow was measured as carbon dioxide (CO2) and dissolved organic carbon (DOC) from 44-days of litter decomposition. Two large groups of microbial communities representing ‘high’ and ‘low’ DOC phenotypes from original soil and 44-day microcosm samples were down-selected for fungal and bacterial profiling. Metatranscriptomes were also sequenced from a smaller subset of communities in each group. The two groups exhibited differences in average rate of CO2 production, demonstrating that the divergent patterns of C flow arose from innate functional constraints on C metabolism, not a time-dependent artefact. To infer functional constraints, we identified features – traits at the organism, pathway or gene level – linked to the high and low DOC phenotypes using RNA-Seq approaches and machine learning approaches. Substrate use differed across the high and low DOC phenotypes. Additional features suggested that divergent patterns of C flow may be driven in part by differences in organism interactions that affect DOC abundance directly or indirectly by controlling community structure.
Coding gains and error rates from the Big Viterbi Decoder
A prototype hardware Big Viterbi Decoder (BVD) was completed for an experiment with the Galileo Spacecraft. Searches for new convolutional codes, studies of Viterbi decoder hardware designs and architectures, mathematical formulations, and decompositions of the deBruijn graph into identical and hierarchical subgraphs, and very large scale integration (VLSI) chip design are just a few examples of tasks completed for this project. The BVD bit error rates (BER), measured from hardware and software simulations, are plotted as a function of bit signal to noise ratio E sub b/N sub 0 on the additive white Gaussian noise channel. Using the constraint length 15, rate 1/4, experimental convolutional code for the Galileo mission, the BVD gains 1.5 dB over the NASA standard (7,1/2) Maximum Likelihood Convolution Decoder (MCD) at a BER of 0.005. At this BER, the same gain results when the (255,233) NASA standard Reed-Solomon decoder is used, which yields a word error rate of 2.1 x 10(exp -8) and a BER of 1.4 x 10(exp -9). The (15, 1/6) code to be used by the Cometary Rendezvous Asteroid Flyby (CRAF)/Cassini Missions yields 1.7 dB of coding gain. These gains are measured with respect to symbols input to the BVD and increase with decreasing BER. Also, 8-bit input symbol quantization makes the BVD resistant to demodulated signal-level variations which may cause higher bandwidth than the NASA (7,1/2) code, these gains are offset by about 0.1 dB of expected additional receiver losses. Coding gains of several decibels are possible by compressing all spacecraft data.
Neurocomputing strategies in decomposition based structural design
The present paper explores the applicability of neurocomputing strategies in decomposition based structural optimization problems. It is shown that the modeling capability of a backpropagation neural network can be used to detect weak couplings in a system, and to effectively decompose it into smaller, more tractable, subsystems. When such partitioning of a design space is possible, parallel optimization can be performed in each subsystem, with a penalty term added to its objective function to account for constraint violations in all other subsystems. Dependencies among subsystems are represented in terms of global design variables, and a neural network is used to map the relations between these variables and all subsystem constraints. A vector quantization technique, referred to as a z-Network, can effectively be used for this purpose. The approach is illustrated with applications to minimum weight sizing of truss structures with multiple design constraints.
Analytical and Computational Properties of Distributed Approaches to MDO
Historical evolution of engineering disciplines and the complexity of the MDO problem suggest that disciplinary autonomy is a desirable goal in formulating and solving MDO problems. We examine the notion of disciplinary autonomy and discuss the analytical properties of three approaches to formulating and solving MDO problems that achieve varying degrees of autonomy by distributing the problem along disciplinary lines. Two of the approaches-Optimization by Linear Decomposition and Collaborative Optimization-are based on bi-level optimization and reflect what we call a structural perspective. The third approach, Distributed Analysis Optimization, is a single-level approach that arises from what we call an algorithmic perspective. The main conclusion of the paper is that disciplinary autonomy may come at a price: in the bi-level approaches, the system-level constraints introduced to relax the interdisciplinary coupling and enable disciplinary autonomy can cause analytical and computational difficulties for optimization algorithms. The single-level alternative we discuss affords a more limited degree of autonomy than that of the bi-level approaches, but without the computational difficulties of the bi-level methods. Key Words: Autonomy, bi-level optimization, distributed optimization, multidisciplinary optimization, multilevel optimization, nonlinear programming, problem integration, system synthesis
Decentralized Schemes with Overlap for Solving Graph-Structured Optimization Problems
We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it uses overlapping subdomains to promote and accelerate convergence. We show that the algorithm converges if the size of the overlap is sufficiently large and that the convergence rate improves exponentially with the size of the overlap. The proposed approach provides a bridge between fully decentralized and centralized architectures and is flexible in that it enables the implementation of asynchronous schemes, handling of constraints, and balancing of computing, communication, and data privacy needs. The proposed scheme is tested in an estimation problem for a 9241-node power network and we show that it outperforms the alternating direction method of multipliers.
Comprehensive investigation of HgCdTe metalorganic chemical vapor deposition
The principal objective of this experimental and theoretical research program was to explore the possibility of depositing high quality epitaxial CdTe and HgCdTe at very low pressures through metalorganic chemical vapor deposition (MOCVD). We explored two important aspects of this potential process: (1) the interaction of molecular flow transport and deposition in an MOCVD reactor with a commercial configuration, and (2) the kinetics of metal alkyl source gas adsorption, decomposition and desorption from the growing film surface using ultra high vacuum surface science reaction techniques. To explore the transport-reaction issue, we have developed a reaction engineering analysis of a multiple wafer-in-tube ultrahigh vacuum chemical vapor deposition (UHV/CVD) reactor which allows an estimate of wafer or substrate throughput for a reactor of fixed geometry and a given deposition chemistry with specified film thickness uniformity constraints. The model employs a description of ballistic transport and reaction based on the pseudo-steady approximation to the Boltzmann equation in the limit of pure molecular flow. The model representation takes the form of an integral equation for the flux of each reactant or intermediate species to the wafer surfaces. Expressions for the reactive sticking coefficients (RSC) for each species must be incorporated in the term which represents reemission from a wafer surface. The interactions of MOCVD precursors with Si and CdTe were investigated using temperature programmed desorption (TPD) in ultra high vacuum combined with Auger electron spectroscopy (AES). These studies revealed that diethyltellurium (DETe) and dimethylcadmium (DMCd) adsorb weakly on clean Si(100) and desorb upon heating without decomposing. These precursors adsorb both weakly and strongly on CdTe(111)A, with DMCd exhibiting the stronger interaction with the surface than DETe.
Small UAV Flight Planning in Urban Environments
This work proposes a fast algorithm for generating obstacle-free and wind-efficient flight paths at a constant above-ground-level altitude in urban environments because a fast flight path planning algorithm is an essential function or service needed for enabling small unmanned aerial vehicle (sUAV) to operate in urban environments within Class G airspace. The proposed method first converts the 3D path planning problem to a 2D problem by constructing an obstacle map at a given above-ground-level altitude. A quad-tree decomposition is then used to build a search space in terms of obstacle occupancy and wind difference. The wind cost of traveling through each cell is defined based on energy consumption under various wind conditions. A repulsive potential is also adopted to make sure that the flight plans stay away from obstacles. The Theta* search algorithm, a variant of A* algorithm, is applied to mitigate the path angle change constraints introduced by grid-based graphs. With the Theta* and postsmoothing techniques, an obstacle-free, wind efficient, and constant above-ground-level flight plan can be quickly generated for sUAV operations in urban environments while meeting the lateral path angle constraints. The results showed that the path planning algorithm is efficient and can be finished within several seconds. With a proper choice of wind coefficient, the proposed path planning algorithm outperforms the multiple-shooting trajectory optimization method even in an obstacle-free environment. With the flexibility of incorporating other geo-related costs and computation efficiency, the proposed algorithm shows the potential for real-time flight path planning in complex urban environments.
Machine Learning Assisted Safety Modeling and Analysis of Advanced Reactors
With the advances in computational power and numerical methods, analysts can now rely on first-principle simulations to predict ultra-fine details in a variety of applications. Advances in machine learning (ML) have produced algorithms that can now learn high-level abstractions via hierarchical models. This project aims to leverage advances in ML techniques and the available high-resolution simulation data to develop a novel modeling and simulation (M\&S) methodology for reactor safety analysis. While application-agnostic ML techniques are available, complex physics constraints need to be incorporated into ML techniques to build ML-based closures for computationally efficient predictive simulations. This project intends to develop a physics-guided data-driven multi-scale methodology for M\&S of advanced reactors. The project focuses on thermal fluid (T/F) phenomena, which play major roles in advanced reactor safety. Specifically, we propose a data-driven coarse-mesh turbulence model based on local flow features for the transient analysis of thermal mixing and stratification in a sodium-cooled fast reactor (SFR). The model has a coarse-mesh setup to ensure computational efficiency, while it is trained by fine-mesh computational fluid dynamics (CFD) data with Reynolds-averaged Navier-Stokes (RANS) turbulence model to ensure accuracy. Three different neural networks are developed and tested for loss-of-flow transients in the hot pool of SFR, i.e. the densely connected convolutional neural network (DCNN), long-short-term-memory network based on proper orthogonal decomposition (POD-LSTM), and the DCNN informed by LSTM (DCNN-LSTM). The performances of these three neural networks are evaluated based on baseline models. The DCNN-LSTM model has been chosen for further hyperparameter optimization. Furthermore, based on a simplified two-dimensional case, uncertainty quantification (UQ) of the developed ML-based closure are investigated with three methods, i.e. Monte Carlo dropout, deep ensemble, and Bayesian neural network. The developed ML-based turbulent viscosity closure relation based on deep ensemble is then integrated into the system analysis module SAM and serves as a term in the conservation equations. Such a SAM-ML based procedure guarantees that the obtained results are consistent with the physical constraints of the thermal-fluid system. The SAM-ML simulation on the same loss-of-flow transient showed comparable accuracy with the CFD simulation but with a much coarser mesh setup. Last but not least, the ML-based closure improvement with the support of higher-fidelity data from large eddy simulation (LES) is discussed. As a first step towards this direction, a baseline LES simulation is performed to obtain comparable data with RANS results. Based on the early results, future investigation on further improving the ML-based closure is discussed. We believe the developed approach that combines scientific machine learning with nuclear system analysis code can benefit the advanced reactor community as more accurate safety analyses will better characterize reactor safety margins and reduce licensing efforts.
Constrained non-negative matrix factorization enabling real-time insights of in situ and high-throughput experiments
Non-negative matrix factorization (NMF) is an appealing class of methods for performing unsupervised learning on streaming spectral data, particularly in time-sensitive applications such as in situ characterization of materials. These methods seek to decompose a dataset into a small number of components and weights that can compactly represent the underlying signal while effectively reconstructing the observations with minimal error. However, canonical NMF methods have no underlying requirement that the reconstruction uses components or weights that are representative of the true physical processes. In this work, we demonstrate how constraining a subset of the NMF weights or components as rigid priors, provided as known or assumed values, can provide significant improvement in revealing true underlying phenomena. We present a PyTorch-based method for efficiently applying constrained NMF and demonstrate its application to several synthetic examples. Our implementation allows an expert researcher-in-the-loop to provide and dynamically adjust the constraints during a live experiment involving streaming spectral data. Such interactive priors allow researchers to specify known or identified independent components, as well as functional expectations about the mixing or transitions between the components. We further demonstrate the application of this method to measured synchrotron x-ray total scattering data from in situ beamline experiments. In such a context, constrained NMF can result in a more interpretive and scientifically relevant decomposition than canonical NMF or other decomposition techniques. As a result, the details of the method are provided, along with general guidance for employing constrained NMF in the extraction of critical information and insights during time-sensitive experimental applications.