Engineering Papers⌕ Search

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.

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Dynamic analysis and control of lightweight manipulators with flexible parallel link mechanisms

The flexible parallel link mechanism is designed for increased rigidity to sustain the buckling when it carries a heavy payload. Compared to a one link flexible manipulator, a two link flexible manipulator, especially the flexible parallel mechanism, has more complicated characteristics in dynamics and control. The objective of this research is the theoretical analysis and the experimental verification of dynamics and control of a two link flexible manipulator with a flexible parallel link mechanism. Nonlinear equations of motion of the lightweight manipulator are derived by the Lagrangian method in symbolic form to better understand the structure of the dynamic model. A manipulator with a flexible parallel link mechanism is a constrained dynamic system whose equations are sensitive to numerical integration error. This constrained system is solved using singular value decomposition of the constraint Jacobian matrix. The discrepancies between the analytical model and the experiment are explained using a simplified and a detailed finite element model. The step response of the analytical model and the TREETOPS model match each other well. The nonlinear dynamics is studied using a sinusoidal excitation. The actuator dynamic effect on a flexible robot was investigated. The effects are explained by the root loci and the Bode plot theoretically and experimentally. For the base performance for the advanced control scheme, a simple decoupled feedback scheme is applied.

Lee, Jeh Won↗
NASA NTRS1990

Rapid design of aerospace vehicle

This document presents in viewgraph form techniques for the optimal design of aerospace vehicles which take into account vehicle shape, aerodynamic performance, and weight minimization. Methods include multilevel optimization with linear decomposition, multi-constraint optimization, global sensitivity matrix, and calculation of sensitivity derivatives using both first and second order derivatives. The effects of including flexibility in the optimization is discussed.

Abdi, Frank↗
NASA NTRS1991

Large constraint length high speed viterbi decoder based on a modular hierarchial decomposition of the deBruijn graph

A method of formulating and packaging decision-making elements into a long constraint length Viterbi decoder which involves formulating the decision-making processors as individual Viterbi butterfly processors that are interconnected in a deBruijn graph configuration. A fully distributed architecture, which achieves high decoding speeds, is made feasible by novel wiring and partitioning of the state diagram. This partitioning defines universal modules, which can be used to build any size decoder, such that a large number of wires is contained inside each module, and a small number of wires is needed to connect modules. The total system is modular and hierarchical, and it implements a large proportion of the required wiring internally within modules and may include some external wiring to fully complete the deBruijn graph. pg,14.

Collins, Oliver↗
DOE OSTI2023

Quantum Many-Body Theory from a Solution of the N -Representability Problem

Here, in this study, we present a many-body theory based on a solution of the N-representability problem in which the ground-state two-particle reduced density matrix (2-RDM) is determined directly without the many-particle wave function. We derive an equation that re-expresses physical constraints on higher-order RDMs to generate direct constraints on the 2-RDM, which are required for its derivation from an N-particle density matrix, known as N-representability conditions. The approach produces a complete hierarchy of 2-RDM constraints that do not depend explicitly upon the higher RDMs or the wave function. By using the two-particle part of a unitary decomposition of higher order constraint matrices, we can solve the energy minimization by semidefinite programming in a form where the low-rank structure of these matrices can be potentially exploited. We illustrate by computing the ground-state electronic energy and properties of the H 8 ring.

74 ATOMIC AND MOLECULAR PHYSICS↗
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 OSTI2024

Electric field effects during disruptions

Tokamak disruptions are associated with breaking magnetic surfaces, which makes magnetic field lines chaotic in large regions of the plasma. The enforcement of quasi-neutrality in a region of chaotic field lines requires an electric potential that has both short and long correlation distances across the magnetic field lines. The short correlation distances produce a Bohm-like diffusion coefficient ∼Te/eB and the long correlation distances aT produce a large scale flow ∼Te/eBaT. This cross-field diffusion and flow are important for sweeping impurities into the core of a disrupting tokamak. The analysis separates the electric field in a plasma into the sum of a divergence-free, E→B, and a curl-free, E→q, part, a Helmholtz decomposition. The divergence-free part of E→ determines the evolution of the magnetic field. The curl-free part enforces quasi-neutrality, E→q=−∇→Φq. Magnetic helicity evolution gives the required boundary condition for a unique Helmholtz decomposition and an unfortunate constraint on steady-state tokamak maintenance.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

Unitarization from geometry

We study the perturbative unitarity of scattering amplitudes in general dimensional reductions of Yang–Mills theories and general relativity on closed internal manifolds. For the tree amplitudes of the dimensionally reduced theory to have the expected high-energy behavior of the higher-dimensional theory, the masses and cubic couplings of the Kaluza–Klein states must satisfy certain sum rules that ensure there are nontrivial cancellations between Feynman diagrams. These sum rules give constraints on the spectra and triple overlap integrals of eigenfunctions of Laplacian operators on the internal manifold and can be proven directly using Hodge and eigenfunction decompositions. One consequence of these constraints is that there is an upper bound on the ratio of consecutive eigenvalues of the scalar Laplacian on closed Ricci-flat manifolds with special holonomy. This gives a sharp bound on the allowed gaps between Kaluza–Klein excitations of the graviton that also applies to Calabi–Yau compactifications of string theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A Scalable Mixed-Integer Decomposition Method for Security-Constrained Optimal Power Flow with Complementarity Constraints

This project aimed to develop a scalable algorithm for security-constrained optimal power flow (SCOPF) under contingency scenarios. In particular, the SCOPF problem targeted in the GO Competition is challenging because of the nonconvexity, its nonsmoothness, and the problem size, which increases with the number of contingency events. Complementarity constraints imposed in post-contingency variables are particularly challenging because they lead to a violation of constraint qualifications at any feasible point.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1995

Structural design using equilibrium programming formulations

Solutions to increasingly larger structural optimization problems are desired. However, computational resources are strained to meet this need. New methods will be required to solve increasingly larger problems. The present approaches to solving large-scale problems involve approximations for the constraints of structural optimization problems and/or decomposition of the problem into multiple subproblems that can be solved in parallel. An area of game theory, equilibrium programming (also known as noncooperative game theory), can be used to unify these existing approaches from a theoretical point of view (considering the existence and optimality of solutions), and be used as a framework for the development of new methods for solving large-scale optimization problems. Equilibrium programming theory is described, and existing design techniques such as fully stressed design and constraint approximations are shown to fit within its framework. Two new structural design formulations are also derived. The first new formulation is another approximation technique which is a general updating scheme for the sensitivity derivatives of design constraints. The second new formulation uses a substructure-based decomposition of the structure for analysis and sensitivity calculations. Significant computational benefits of the new formulations compared with a conventional method are demonstrated.

Scotti, Stephen J.↗
DOE OSTI2022

A Lagrangian dual method for two-stage robust optimization with binary uncertainties

This report presents a new exact method to calculate worst-case parameter realizations in two-stage robust optimization problems with categorical or binary-valued uncertain data. Traditional exact algorithms for these problems, notably Benders decomposition and column-and-constraint generation, compute worst-case parameter realizations by solving mixed-integer bilinear optimization subproblems. However, their numerical solution can be computationally expensive not only due to their resulting large size after reformulating the bilinear terms, but also because decision-independent bounds on their variables are typically unknown. We propose an alternative Lagrangian dual method that circumvents these difficulties and is readily integrated in either algorithm. We specialize the method to problems where the binary parameters switch on or off constraints as these are commonly encountered in applications, and discuss extensions to problems that lack relatively complete recourse and to those with integer recourse. Numerical experiments provide evidence of significant computational improvements over existing methods.

42 ENGINEERING↗
NASA NTRS2013

Antarctica, Greenland and Gulf of Alaska Land-ice Evolution from an Iterated GRACE Global Mascon Solution

We have determined the ice mass evolution of the Antarctica and Greenland ice sheets (AIS and GIS) and Gulf of Alaska (GOA) glaciers from a new GRACE global solution of equal-area surface mass concentration parcels (mascons) in equivalent height of water. The mascons were estimated directly from the reduction of the inter-satellite K-band range-rate (KBRR) observations, taking into account the full noise covariance, and formally iterating the solution. The new solution increases signal recovery while reducing the GRACE KBRR observation residuals. The mascons were estimated with 10 day and 1 arc degree equal-area sampling, applying anisotropic constraints. An ensemble empirical mode decomposition adaptive filter was applied to the mascon time series to compute annual mass balances. The details and causes of the spatial and temporal variability of the land-ice regions studied are discussed. The estimated mass trend over the total GIS, AIS and GOA glaciers for the time period 1 December 2003 to 1 December 2010 is -380 plus or minus 31 Gt a(exp -1), equivalent to -1.05 plus or minus 0.09 mma(exp -1) sea-level rise. Over the same time period we estimate the mass acceleration to be -41 plus or minus 27 Gt a(exp -2), equivalent to a 0.11 plus or minus 0.08 mm a(exp -2) rate of change in sea level. The trends and accelerations are dependent on significant seasonal and annual balance anomalies.

MASCON↗
NASA NTRSDate not supplied

Multidisciplinary Design Optimization of Low-Boom Supersonic Aircraft with Mission Constraints

Design of low-boom supersonic aircraft is heavily dictated by aircraft volume and lift distributions. These unique design characteristics make it a challenge to enforce mission requirements (such as static margins and trim requirements) during design optimization. This low-boom design challenge is resolved by using reversed equivalent area targets for low-fidelity low-boom design and a decomposition method for multidisciplinary design optimization(MDO).The corresponding low-boom MDO problem includes aircraft mission constraints for cruise ranges, cruise speeds, trim margin for low-boom cruise, static margins for takeoff/cruise/landing, tail rotation angles for trim at takeoff/landing, takeoff/landing field lengths, and approach velocity, as well as volume constraints for cabin and main landing gear packaging. The decomposition method is developed to optimally resolve the conflicts between the low-boom design objective and other design constraints. The decomposition method is successfully applied to design a low-boom supersonic configuration that carries 40 passengers, has low-boom cruise of Mach 1.6 with range ≥ 2,500 nm, and can also cruise at Mach 1.8 with range ≥ 3,600 nm. The generated configuration satisfies all specified mission constraints and has the potential to achieve a low-boom ground noise level below 75 PLdB.

Wu Li↗
DOE OSTI2020

Determination of latent dimensionality in international trade flow

Currently, high-dimensional data is ubiquitous in data science, which necessitates the development of techniques to decompose and interpret such multidimensional (aka tensor) datasets. Finding a low dimensional representation of the data, that is, its inherent structure, is one of the approaches that can serve to understand the dynamics of low dimensional latent features hidden in the data. Moreover, decomposition methods with non-negative constraints are shown to extract more insightful factors. Nonnegative RESCAL is one such technique, particularly well suited to analyze self-relational data, such as dynamic networks found in international trade flows. Particularly, non-negative RESCAL computes a low dimensional tensor representation by finding the latent space containing multiple modalities. Furthermore, estimating the dimensionality of this latent space is crucial for extracting meaningful latent features. Here, to determine the dimensionality of the latent space with non-negative RESCAL, we propose a latent dimension determination method which is based on clustering of the solutions of multiple realizations of non-negative RESCAL decompositions. We demonstrate the performance of our model selection method on synthetic data. We then apply our method to decompose a network of international trade flows data from International Monetary Fund and shows that with a correct latent dimension determination, the resulting features are able to capture relevant empirical facts from economic literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems

Here we present a decomposition approach for obtaining good feasible solutions for the security-constrained, alternating-current, optimal power flow (SC-AC-OPF) problem at an industrial scale and under real-world time and computational limits. The approach was designed while preparing and participating in ARPA-E’s Grid Optimization Competition (GOC) Challenge 1. The challenge focused on a near-real-time version of the SC-AC-OPF problem, where a base operating point is optimized, taking into account possible single-element contingencies, after which the system adapts its operating point following the response of automatic frequency droop controllers and voltage regulators. Our solution approach for this problem relies on state-of-the-art nonlinear programming algorithms, and it employs nonconvex relaxations for complementarity constraints, a specialized two-stage decomposition technique with sparse approximations of recourse terms and contingency ranking and prescreening. The paper describes and justifies our approach and outlines the features of its implementation, including functions and derivatives evaluation, warm-starting strategies, and asynchronous parallelism. We discuss the results of the independent benchmark of our approach by ARPA-E’s GOC team in Challenge 1, where it was found to consistently produce high-quality solutions across a wide range of network sizes and difficulty, and conclude by outlining future extensions of the approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Thermal Decomposition Kinetics of 4,6‐Diamino‐5,7‐dinitro‐benzo‐furazan

This experimental study investigated the thermal decomposition kinetics of 4,6-diamino-5,7-dinitro-benzo-furazan (referred to as F1 hereafter)—an important decomposition product of 1,3,5-triamino-2,4,6-trinitrobenzene (TATB—a prototypical insensitive high explosive). Simultaneous differential scanning calorimetry (DSC), thermogravimetric analysis (TGA), and mass spectrometry (MS) measurements were employed to determine the decomposition kinetics of F1 and to track the evolution of product gases. The DSC profiles were measured at 10 different heating rates between 0.025°C/min and 10°C/min. The measured exotherms were influenced by F1 melting at heating rates above 0.25°C/min, and corresponding changes in decomposition enthalpy and TGA mass-loss-rate profiles indicated a transition from solid-to-gas decomposition to an increasing contribution from liquid-to-gas decomposition. Analysis of low-heating-rate DSC data between 0.025°C/min and 0.17°C/min with the extended Prout–Tompkins model yielded an activation energy of 305 kJ/mol for solid-to-gas F1 decomposition, higher than previous values inferred from TATB decomposition models involving F1. This study provides the first direct experimental determination of the energy barrier for F1 decomposition. MS measurements showed that the major gaseous products matched species previously reported for TATB decomposition (e.g., CO 2 , HCN, C 2 N 2 , etc.), with water identified as the dominant product. Furthermore, these results provide important experimental constraints for improving chemical kinetics models of TATB decomposition and for predicting the reactivity, stability, and safety of TATB-based high explosives under long-term aging conditions and abnormal thermal environments.

4,6-Diamino-5,7-dinitro-benzo-furazan↗
DOE OSTI2022

Cryogenic energy storage: Standalone design, rigorous optimization and techno-economic analysis

Energy storage allows flexible use and management of excess electricity and intermittently available renewable energy. Cryogenic energy storage (CES) is a promising storage alternative with a high technology readiness level and maturity, but the round-trip efficiency is often moderate and the Levelized Cost of Storage (LCOS) remains high. The complex flowsheets with intricate thermodynamics at cryogenic temperatures as well as the presence of multiple loops and refrigeration cycles pose considerable challenges for rigorous model-based design and optimization of CES systems. We present an optimization strategy that couples rigorous process simulation and Bayesian optimization with flowsheet decomposition and identification of hidden coupling constraints to optimally design standalone CES systems. Further refinement is done via a local search using the limited-memory Broyden–Fletcher–Goldfarb–Shanno algorithm. Here our results indicate that it is possible to achieve more than 52% round-trip efficiency and an LCOS of $153/MWh for a standalone 100 MW/400 MWh CES system limited to short-term storage with daily charging–discharging. However, a detailed techno-economic assessment reveals that the LCOS considering total capital investment may exceed $267/MWh when all direct and indirect costs of installation and operation are considered.

25 ENERGY STORAGE↗
NASA NTRS1990

New evidence favoring multilevel decomposition and optimization

A new multilevel optimization technique based on a global sensitivity matrix which uses behavior variables in addition to design variables and constraints to decompose the problem is proposed. The technique simplifies the decomposition of the design problem and the programming task and improves the convergence speed of multilevel optimization compared to conventional optimization. The technique is particularly well suited to problems with large numbers of design variables and with computationally expensive constraints.

Padula, Sharon L.↗