Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convex programming”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Controlled Islanding Strategy Considering Uncertainty of Renewable Energy Sources Based on Chance-constrained Model

Controlled islanding plays an essential role in preventing the blackout of power systems. Although there are several studies on this topic in the past, not enough attention is paid to the uncertainty brought by renewable energy sources (RESs) that may cause unpredictable unbalanced power and the observability of power systems after islanding that is essential for back-up black-start measures. Therefore, a novel controlled islanding model based on mixed-integer second-order cone and chance-constrained programming (MISOCCP) is proposed to address these issues. First, the uncertainty of RESs is characterized by their possibility distribution models with chance constraints, and the requirements, e. g., system observ-ability, for rapid back-up black-start measures are also considered. Then, a law of large numbers (LLN) based method is employed for converting the chance constraints into deterministic ones and reformulating the non-convex model into convex one. Finally, case studies on the revised IEEE 39-bus and 118-bus power systems as well as the comparisons among different models are given to demonstrate the effectiveness of the proposed model. The results show that the proposed model can result in less unbalanced power and better observability after islanding compared with other models.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1976

Structural optimization via a design space hierarchy

Mathematical programming techniques provide a general approach to automated structural design. An iterative method is proposed in which design is treated as a hierarchy of subproblems, one being locally constrained and the other being locally unconstrained. It is assumed that the design space is locally convex in the case of good initial designs and that the objective and constraint functions are continuous, with continuous first derivatives. A general design algorithm is outlined for finding a move direction which will decrease the value of the objective function while maintaining a feasible design. The case of one-dimensional search in a two-variable design space is discussed. Possible applications are discussed. A major feature of the proposed algorithm is its application to problems which are inherently ill-conditioned, such as design of structures for optimum geometry.

Vanderplaats, G. N.↗
NASA NTRS1991

Distance estimation and collision prediction for on-line robotic motion planning

An efficient method for computing the minimum distance and predicting collisions between moving objects is presented. This problem has been incorporated in the framework of an in-line motion planning algorithm to satisfy collision avoidance between a robot and moving objects modeled as convex polyhedra. In the beginning the deterministic problem, where the information about the objects is assumed to be certain is examined. If instead of the Euclidean norm, L(sub 1) or L(sub infinity) norms are used to represent distance, the problem becomes a linear programming problem. The stochastic problem is formulated, where the uncertainty is induced by sensing and the unknown dynamics of the moving obstacles. Two problems are considered: (1) filtering of the minimum distance between the robot and the moving object, at the present time; and (2) prediction of the minimum distance in the future, in order to predict possible collisions with the moving obstacles and estimate the collision time.

Kyriakopoulos, K. J.↗
NASA NTRSDate not supplied

AM Powder Flowability Capabilities at NASA Marshall Space Flight Center (MSFC)

Additive Manufacturing (AM) powder flowability is critical to metal 3D printing, because the more fluid the powder is, the better powder spreads. The NASA MSFC’s Contamination Control Team (CCT) studies density, flow, particle size distribution, and morphology for programs such as Moon-to-Mars Planetary Autonomous Construction Technology (MMPACT), ASTM Proficiency Testing for AM and Powder Metallurgy, and MSFC’s AM team. Examining and measuring powder characteristics is essential for improving flowability of AM powder and ensuring lot-to-lot consistency, which will help to prevent defects in manufactured parts. The CCT uses several methods to characterize AM powder. Optical particle size distribution and morphology analyses determine particle parameters including size, circularity, convexity, and dimensions. The Carney and Hall Flowmeter Funnel measures time it takes powder to flow through a funnel to compare relative flowability (free-flowing and non-free-flowing). In addition to this, the device utilizes a density cup which determines apparent density. Lastly, the Revolution Powder Analyzer measures dynamic powder flowability and behavior over time via digital imaging. Using the CCT’s lab, the team has produced ASTM Powder Proficiency Testing results with flow rates, apparent density, particle size distribution, and tap density on titanium-based and nickel-based powder and compared data with other companies/labs. Morphology data was also collected for various regolith simulant powder for the MMPACT program. Lastly, the CCT used morphology data to examine the flowability of Inconel 718 powder for Selective Laser Melting (SLM) and Directed Energy Deposition (DED) printers at MSFC. The CCT’s essential work in studying and enabling AM powder characterization has helped and will continue to help study new and refined powders in the AM industry.

Additive Manufacturing↗
NASA NTRSDate not supplied

AM Powder Flowability Capabilities at NASA Marshall Space Flight Center (MSFC)

Additive Manufacturing (AM) powder flowability is critical to metal 3D printing, because the more fluid the powder is, the better powder spreads. AM Powder Flowability Capabilities at NASA MSFC studies density, flow, particle size distribution, and morphology for programs such as Moon-to-Mars Planetary Autonomous Construction Technology (MMPACT), ASTM Proficiency Testing for AM and Powder Metallurgy, and MSFC’s AM team. Examining and measuring powder characteristics is essential for improving flowability of AM powder and ensuring lot-to-lot consistency, which will help to prevent defects in manufactured parts. The Contamination Control Team (CCT) uses several methods to characterize AM powder. Optical particle size distribution and morphology analyses determine particle parameters including size, circularity, convexity, and dimensions. The Carney and Hall Flowmeter Funnel measures time it takes powder to flow through a funnel to compare relative flowability (free-flowing and non-free-flowing). In addition to this, the device utilizes a density cup which determines apparent density. Lastly, the Revolution Powder Analyzer measures dynamic powder flowability and behavior over time via digital imaging. Using the CCT’s lab, the team has produced ASTM Powder Proficiency Testing results with flow rates, apparent density, particle size distribution, and tap density on titanium-based and nickel-based powder and compared data with other companies/labs. Morphology data was also collected for various regolith simulant powder for the MMPACT program. Lastly, the CCT used morphology data to examine the flowability of Inconel 718 powder for Selective Laser Melting (SLM) and Directed Energy Deposition (DED) printers at MSFC. The CCT’s essential work in studying and enabling AM powder characterization has helped and will continue to help study new and refined powders in the AM industry.

Additive Manufacturing↗
DOE OSTI2023

Certifiably Correct Range-Aided SLAM

We present the first algorithm capable of efficiently computing certifiably optimal solutions to range-aided simultaneous localization and mapping (RA-SLAM) problems. Robotic navigation systems are increasingly incorporating point-to-point ranging sensors, leading state estimation which takes the form of RA-SLAM. However, the RA-SLAM problem is more difficult to solve than traditional pose-graph SLAM; ranging sensor models introduce additional non-convexity, unlike pose-pose or pose-landmark measurements, a single range measurement does not uniquely determine the relative transform between the involved sensors, and RA-SLAM inference is highly sensitive to initial estimates. Our approach relaxes the RA-SLAM problem to a semidefinite program (SDP), which we show how to solve efficiently using the Riemannian staircase methodology. The solution of this SDP provides a high-quality initialization for our original RA-SLAM problem, which is subsequently refined via local optimization, as well as a lower-bound on the RA-SLAM problem's optimal value. Our algorithm, named certifiably correct RA-SLAM (CORA), applies to problems comprised of arbitrary pose-pose, pose-landmark, and ranging measurements. Evaluation on simulated and real-world marine examples shows that our algorithm frequently produces certifiably optimal RA-SLAM solutions; moreover, even suboptimal estimates are typically within 1-2\% of the optimal value.

Papalia, Alan↗
NASA NTRS1992

Network issues for large mass storage requirements

File Servers and Supercomputing environments need high performance networks to balance the I/O requirements seen in today's demanding computing scenarios. UltraNet is one solution which permits both high aggregate transfer rates and high task-to-task transfer rates as demonstrated in actual tests. UltraNet provides this capability as both a Server-to-Server and Server-to-Client access network giving the supercomputing center the following advantages highest performance Transport Level connections (to 40 MBytes/sec effective rates); matches the throughput of the emerging high performance disk technologies, such as RAID, parallel head transfer devices and software striping; supports standard network and file system applications using SOCKET's based application program interface such as FTP, rcp, rdump, etc.; supports access to the Network File System (NFS) and LARGE aggregate bandwidth for large NFS usage; provides access to a distributed, hierarchical data server capability using DISCOS UniTree product; supports file server solutions available from multiple vendors, including Cray, Convex, Alliant, FPS, IBM, and others.

Perdue, James↗
DOE OSTI2023

Convex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor

Finding the transient and steady state properties of open quantum systems is a central problem in various fields of quantum technologies. Here, in this work, we present a quantum-assisted algorithm to determine the steady states of open system dynamics. By reformulating the problem of finding the fixed point of Lindblad dynamics as a feasibility semidefinite program, we bypass several well-known issues with variational quantum approaches to solving for steady states. We demonstrate that our hybrid approach allows us to estimate the steady states of higher dimensional open quantum systems and discuss how our method can find multiple steady states for systems with symmetries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Remark on Algorithm 1012: Computing Projections with Large Datasets

In ACM TOMS Algorithm 1012, the DELAUNAYSPARSE software is given for performing Delaunay interpolation in medium to high dimensions. When extrapolating outside the convex hull of the training set, DELAUNAYSPARSE calls the nonnegative least squares solver DWNNLS to compute projections onto the convex hull. However, DWNNLS and many other available sum-of-squares optimization solvers were not intended for usage with many variable problems, which result from the large training sets that are typical in machine learning applications. Thus, a new PROJECT subroutine is given, based on the highly customizable quadratic program solver BQPD. This solution is shown to be as robust as DELAUNAYSPARSE for projection onto both synthetic and real-world datasets, where other available solvers frequently fail. Although it is intended as an update for DELAUNAYSPARSE, due to the difficulty and prevalence of the problem, this solution is likely to be of external interest as well.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2003

Long Focal Length Large Mirror Fabrication System

The goals of this ambitious program are (1) to develop systems to make large superpolished optical mirrors, (2) to develop low scatter polishing techniques using centrifugal elutriation, (3) to develop a means of measuring scatter at any point on the mirror, (4) to polish a Hindle sphere to measure the optical figure of a one meter diameter convex mandrel, and (5) to fabricate low scatter, large adaptive optic graphite filled, cyanate ester replica transfer mirrors using these mandrels. Deliverables are a 30 cm diameter superpolished composite AO mirror. We fabricated a 1/3rd meter superpolished zerodur flat mandrel and with the support of our major subcontractor, Composite Mirror Applications Inc (CMA) we have demonstrated a 30 cm lightweight cyanate ester mirror with an rms microroughness between 0.6 and 0.8 nm and 8 faceplate influence function of 5 cm. The influence function was chosen to be comparable to the atmospheric correlation coefficient r(sub 0) which is about 5 cm at sea level. There was no print-thru of the graphite fibers in the cyanate ester surface (the bane of many previous efforts to use cyanate ester mirrors). Our subcontractor has devised a means for developing a 30-50 nm thick layer of graphite free pure ester resin on the surface of the mirrors. This graphite fiber filled material has a thermal expansion coefficient in the 10(exp -8) centimeter per Kelvin range (the same range of expansion coefficient as Zerodur and ULE glasses) and does not take up water and swell, so it is a nearly ideal mirror material in these areas. Unfortunately for these 0.8mm thick faceplates, the number of plies is not enough to result in isometric coverage. Isolated figure irregularities can appear, making it necessary to go to thicker faceplates. The influence function will then only approximate the length of r(sub 0), at higher altitudes or longer wavelengths. The influence function goes as the cube of the thickness, so we are now making a faceplate optimized for an infrared wavelength, possibly that used for the AO system of the Keck telescope, instead of 0.63 microns. We have polished a 55 cm diameter mandrel to better than 1/20th wave optical figure in the visible using centrifugal elutriation. CMA has just told us that it needs to retool to get optimum mirror faceplate quality in this size, so implementing the 55 cm AO mirror may be delayed somewhat. We expect to complete our 1/3 rd meter AO mirror on time using novel piezoelectric actuators with a throw of one micrometer per volt, as compared to 0.005 micrometers per volt for conventional piezoelectric actuators. We will then demonstrate its AO performance interferometrically.

Bennett, H. E.↗
NASA NTRS1995

RISC Processors and High Performance Computing

In this tutorial, we will discuss top five current RISC microprocessors: The IBM Power2, which is used in the IBM RS6000/590 workstation and in the IBM SP2 parallel supercomputer, the DEC Alpha, which is in the DEC Alpha workstation and in the Cray T3D; the MIPS R8000, which is used in the SGI Power Challenge; the HP PA-RISC 7100, which is used in the HP 700 series workstations and in the Convex Exemplar; and the Cray proprietary processor, which is used in the new Cray J916. The architecture of these microprocessors will first be presented. The effective performance of these processors will then be compared, both by citing standard benchmarks and also in the context of implementing a real applications. In the process, different programming models such as data parallel (CM Fortran and HPF) and message passing (PVM and MPI) will be introduced and compared. The latest NAS Parallel Benchmark (NPB) absolute performance and performance per dollar figures will be presented. The next generation of the NP13 will also be described. The tutorial will conclude with a discussion of general trends in the field of high performance computing, including likely future developments in hardware and software technology, and the relative roles of vector supercomputers tightly coupled parallel computers, and clusters of workstations. This tutorial will provide a unique cross-machine comparison not available elsewhere.

Saini, Subhash↗
NASA NTRS1976

Roller bearing geometry design

A theory of kinematic stabilization of rolling cylinders is extended and applied to the design of cylindrical roller bearings. The kinematic stabilization mechanism puts a reverse skew into the rolling elements by changing the roller taper. Twelve basic bearing modification designs are identified amd modeled. Four have single transverse convex curvature in their rollers while eight have rollers which have compound transverse curvature made up of a central cylindrical band surrounded by symmetric bands with slope and transverse curvature. The bearing designs are modeled for restoring torque per unit axial displacement, contact stress capacity, and contact area including dynamic loading, misalignment sensitivity and roller proportion. Design programs are available which size the single transverse curvature roller designs for a series of roller slopes and load separations and which design the compound roller bearings for a series of slopes and transverse radii of curvature. The compound rollers are proportioned to have equal contact stresses and minimum size. Design examples are also given.

Savage, M.↗
NASA NTRS1996

Multi Objective Controller Design for Linear System via Optimal Interpolation

We propose a methodology for the design of a controller which satisfies a set of closed-loop objectives simultaneously. The set of objectives consists of: (1) pole placement, (2) decoupled command tracking of step inputs at steady-state, and (3) minimization of step response transients with respect to envelope specifications. We first obtain a characterization of all controllers placing the closed-loop poles in a prescribed region of the complex plane. In this characterization, the free parameter matrix Q(s) is to be determined to attain objectives (2) and (3). Objective (2) is expressed as determining a Pareto optimal solution to a vector valued optimization problem. The solution of this problem is obtained by transforming it to a scalar convex optimization problem. This solution determines Q(O) and the remaining freedom in choosing Q(s) is used to satisfy objective (3). We write Q(s) = (l/v(s))bar-Q(s) for a prescribed polynomial v(s). Bar-Q(s) is a polynomial matrix which is arbitrary except that Q(O) and the order of bar-Q(s) are fixed. Obeying these constraints bar-Q(s) is now to be 'shaped' to minimize the step response characteristics of specific input/output pairs according to the maximum envelope violations. This problem is expressed as a vector valued optimization problem using the concept of Pareto optimality. We then investigate a scalar optimization problem associated with this vector valued problem and show that it is convex. The organization of the report is as follows. The next section includes some definitions and preliminary lemmas. We then give the problem statement which is followed by a section including a detailed development of the design procedure. We then consider an aircraft control example. The last section gives some concluding remarks. The Appendix includes the proofs of technical lemmas, printouts of computer programs, and figures.

Ozbay, Hitay↗
NASA NTRS1994

Integrating UniTree with the data migration API

The Data Migration Application Programming Interface (DMAPI) has the potential to allow developers of open systems Hierarchical Storage Management (HSM) products to virtualize native file systems without the requirement to make changes to the underlying operating system. This paper describes advantages of virtualizing native file systems in hierarchical storage management systems, the DMAPI at a high level, what the goals are for the interface, and the integration of the Convex UniTree+HSM with DMAPI along with some of the benefits derived in the resulting product.

Schrodel, David G.↗
NASA NTRS2000

Computerized Generation and Simulation of Meshing and Contact of New Type of Novikov-Wildhaber Helical Gears

In this report, we propose a new geometry for low-noise, increased-strength helical gears of the Novikov-Wildhaber type. Contact stresses are reduced as a result of their convex-concave gear tooth surfaces. The gear tooth surfaces are crowned in the profile direction to localize bearing contact and in the longitudinal direction to obtain a parabolic function of transmission errors. Such a function results in the reduction of noise and vibrations. Methods for the generation of the proposed gear tooth surfaces by grinding and hobbing are considered, and a tooth contact analysis (TCA) computer program to simulate meshing and contact is applied. The report also investigates the influence of misalignment on transmission errors and shift of bearing contact. Numerical examples to illustrate the developed approaches are proposed. The proposed geometry was patented by Ford/UIC (Serial Number 09-340-824, pending) on June 28, 1999.

Litvin, Faydor L.↗
NASA NTRS1976

Computer subroutines for the estimation of nuclear reaction effects in proton-tissue-dose calculations

Calculational methods for estimation of dose from external proton exposure of arbitrary convex bodies are briefly reviewed. All the necessary information for the estimation of dose in soft tissue is presented. Special emphasis is placed on retaining the effects of nuclear reaction, especially in relation to the dose equivalent. Computer subroutines to evaluate all of the relevant functions are discussed. Nuclear reaction contributions for standard space radiations are in most cases found to be significant. Many of the existing computer programs for estimating dose in which nuclear reaction effects are neglected can be readily converted to include nuclear reaction effects by use of the subroutines described herein.

Wilson, J. W.↗
DOE OSTI2023

Knots and entanglement

We extend the entanglement bootstrap program to (3+1)-dimensions. We study knotted excitations of (3+1)-dimensional liquid topological orders and exotic fusion processes of loops. As in previous work in (2+1)-dimensions [Ann. Phys. 418, 168164 (2020), Phys. Rev. B 103, 115150 (2021)], we define a variety of superselection sectors and fusion spaces from two axioms on the ground state entanglement entropy. In particular, we identify fusion spaces associated with knots. We generalize the information convex set to a new class of regions called immersed regions, promoting various theorems to this new context. Examples from solvable models are provided; for instance, a concrete calculation of knot multiplicity shows that the knot complement of a trefoil knot can store quantum information. We define spiral maps that allow us to understand consistency relations for torus knots as well as spiral fusions of fluxes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Solving the Dynamics-Aware Economic Dispatch Problem with the Koopman Operator

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, in contrast to T-ED, DED is a nonlinear, non-convex optimization problem that is computationally prohibitive to solve. We introduce a machine learning-based operator-theoretic approach for solving the DED problem efficiently. Specifically, we develop a novel discrete-time Koopman Operator (KO) formulation that embeds domain information into the structure of the KO to learn high-fidelity approximations of the generator dynamics. Using the KO approximation, the DED problem can be reformulated as a computationally tractable linear program (abbreviated DED-KO). We demonstrate the high solution quality and computational-time savings of the DED-KO model over the original DED formulation on a 9-bus test system.

King, Ethan↗