Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “program optimizations”

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 1,351 records · Page 75

One- and Two-Qubit Gates: Rabi Technique and Single Unipolar Pulses

Methods for controlling states of interacting superconducting flux qubits using power-efficient devices of fast single-quantum logic (Josephson nonlinearity cavities) are studied. One- and two-qubit quantum logical operations performed within the conventional control technique using Rabi pulses and using picosecond single unipolar magnetic field pulses are comparatively analyzed. It is shown that all main operations can be implemented with an accuracy of better than 97% due to optimization of the shape and parameters of unipolar control pulses (associated with, e.g., propagation of fluxons in transmission lines). The efficiency of the developed technique for programming a two-qubit quantum processor implementing the simplest Deutsch–Jozsa algorithm is demonstrated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Applied & Computational MathematicsChallenges for the Design and Control of Dynamic Energy Systems

The Energy Independence and Security Act of 2007 (EISA) was passed with the goal 'to move the United States toward greater energy independence and security.' Energy security and independence cannot be achieved unless the United States addresses the issue of energy consumption in the building sector and significantly reduces energy consumption in buildings. Commercial and residential buildings account for approximately 40% of the U.S. energy consumption and emit 50% of CO{sub 2} emissions in the U.S. which is more than twice the total energy consumption of the entire U.S. automobile and light truck fleet. A 50%-80% improvement in building energy efficiency in both new construction and in retrofitting existing buildings could significantly reduce U.S. energy consumption and mitigate climate change. Reaching these aggressive building efficiency goals will not happen without significant Federal investments in areas of computational and mathematical sciences. Applied and computational mathematics are required to enable the development of algorithms and tools to design, control and optimize energy efficient buildings. The challenge has been issued by the U.S. Secretary of Energy, Dr. Steven Chu (emphasis added): 'We need to do more transformational research at DOE including computer design tools for commercial and residential buildings that enable reductions in energy consumption of up to 80 percent with investments that will pay for themselves in less than 10 years.' On July 8-9, 2010 a team of technical experts from industry, government and academia were assembled in Arlington, Virginia to identify the challenges associated with developing and deploying newcomputational methodologies and tools thatwill address building energy efficiency. These experts concluded that investments in fundamental applied and computational mathematics will be required to build enabling technology that can be used to realize the target of 80% reductions in energy consumption. In addition the finding was that there are tools and technologies that can be assembled and deployed in the short term - the next 3-5 years - that can be used to significantly reduce the cost and time effective delivery of moderate energy savings in the U.S. building stock. Simulation tools, which are a core strength of current DOE computational research programs, provide only a part of the answer by providing a basis for simulation enabled design. New investments will be required within a broad dynamics and control research agenda which must focus on dynamics, control, optimization and simulation of multi-scale energy systems during design and operation. U.S. investments in high performance and high productivity computing (HP2C) should be leveraged and coupled with advances in dynamics and control to impact both the existing building stock through retrofits and also new construction. The essential R&D areas requiring investment are: (1) Characterizing the Dynamics of Multi-scale Energy Systems; (2) Control and Optimization Methodologies of Multi-scale Energy Systems Under Uncertainty; and (3) Multiscale Modeling and Simulation Enabled Design and Operation. The concept of using design and control specific computational tools is a new idea for the building industry. The potential payoffs in terms of accelerated design cycle times, performance optimization and optimal supervisory control to obtain and maintain energy savings are huge. Recent advances in computational power, computer science, and mathematical algorithms offer the foundations to address the control problems presented by the complex dynamics of whole building systems. The key areas for focus and associated metrics with targets for establishing competitiveness in energy efficient building design and operation are: (1) Scalability - Current methodology and tools can provide design guidance for very low energy buildings in weeks to months; what is needed is hours to days. A 50X improvement is needed. (2) Installation and commissioning - Current methodology and tools can target a three month window for commissioning of building subsystems; what is needed is one week. A 10X improvement is needed. (3) Quality - Current design tools can achieve 30% accuracy; what is needed to make design decisions is 5% with quantification of uncertainty. A 5X improvement is needed. These challenges cannot be overcome by raw computational power alone and require the development of new algorithms. Here algorithms mean much more than simulating the building physics but need to be inclusive of a much better understanding of the building and the control systems associated with the building and to capture the entire set of dynamics. The algorithmsmust represent computationally new mathematical approaches to modeling, simulation, optimization and control of large multi-scale dynamic systems and bringing these elements to bear on industry in simulation enabled design approaches.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Three-Phase Solid Oxide Fuel Cell Anode Microstructure Realization Using Two-Point Correlation Functions

A Monte Carlo methodology is developed as a means for three-dimensional (3D) reconstruction of the microstructure of a three-phase anode used in solid oxide fuel cells, based on two-point statistical functions. The salient feature of the presented reconstruction methodology is the ability to realize the 3D microstructure from its 2D SEM image for a three-phase medium extendable to n-phase media. In the realization procedure, different phases of the heterogeneous medium are represented by different cells which are allowed to grow. The growth of cells, however, are controlled via several optimization parameters related to rotation, shrinkage, translation, distribution and growth rates of the cells. Indeed, the proposed realization algorithm can be categorized as a member of dynamic programming methods and is designed so comprehensive that can realize any desired microstructure. To be more specific, at first the initial 2D image is successfully reconstructed and then the final optimization parameters are used as the initial values for the initiation of the 3D reconstruction algorithm. This paper presents a novel hybrid stochastic methodology based on the colony and kinetic algorithm for the simulation of the virtual microstructure. The simulation procedure involves repeated realizations where each realization in turn consists of nucleation and growth of cells. For each of the subsequent realizations, the controlling parameters get updated by minimization of an objective function at the end of the preceding realization. Here, the objective function is defined based on the two-point correlation functions from the simulated and real microstructures. The kinetic growth algorithm is established on the cellular automata approach which facilitates the simulation procedure. Comparison of the two-point correlation functions from different sections of the final 3D reconstructed microstructure with the initial real microstructure shows a satisfactory agreement which confirms the proposed methodology.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Advanced Natural Gas Reciprocating Engine(s)

The objective of the Cummins ARES program, in partnership with the US Department of Energy (DOE), is to develop advanced natural gas engine technologies that increase engine system efficiency at lower emissions levels while attaining lower cost of ownership. The goals of the project are to demonstrate engine system achieving 50% Brake Thermal Efficiency (BTE) in three phases, 44%, 47% and 50% (starting baseline efficiency at 36% BTE) and 0.1 g/bhp-hr NOx system out emissions (starting baseline NOx emissions at 2 – 4 g/bhp-hr NOx). Primary path towards above goals include high Brake Mean Effective Pressure (BMEP), improved closed cycle efficiency, increased air handling efficiency and optimized engine subsystems. Cummins has successfully demonstrated each of the phases of this program. All targets have been achieved through application of a combined set of advanced base engine technologies and Waste Heat Recovery from Charge Air and Exhaust streams, optimized and validated on the demonstration engine and other large engines. The following architectures were selected for each Phase: Phase 1: Lean Burn Spark Ignited (SI) Key Technologies: High Efficiency Turbocharging, Higher Efficiency Combustion System. In production on the 60/91L engines. Over 500MW of ARES Phase 1 technology has been sold. Phase 2: Lean Burn Technology with Exhaust Waste Heat Recovery (WHR) System Key Technologies: Advanced Ignition System, Combustion Improvement, Integrated Waste Heat Recovery System. Base engine technologies intended for production within 2 to 3 years Phase 3: Lean Burn Technology with Exhaust and Charge Air Waste Heat Recovery System Key Technologies: Lower Friction, New Cylinder Head Designs, Improved Integrated Waste Heat Recovery System. Intended for production within 5 to 6 years Cummins is committed to the launch of next generation of large advanced NG engines based on ARES technology to be commercialized worldwide.

Pike, Edward↗

Scout: high-performance heterogeneous computing made simple

Researchers must often write their own simulation and analysis software. During this process they simultaneously confront both computational and scientific problems. Current strategies for aiding the generation of performance-oriented programs do not abstract the software development from the science. Furthermore, the problem is becoming increasingly complex and pressing with the continued development of many-core and heterogeneous (CPU-GPU) architectures. To acbieve high performance, scientists must expertly navigate both software and hardware. Co-design between computer scientists and research scientists can alleviate but not solve this problem. The science community requires better tools for developing, optimizing, and future-proofing codes, allowing scientists to focus on their research while still achieving high computational performance. Scout is a parallel programming language and extensible compiler framework targeting heterogeneous architectures. It provides the abstraction required to buffer scientists from the constantly-shifting details of hardware while still realizing higb-performance by encapsulating software and hardware optimization within a compiler framework.

97 MATHEMATICS AND COMPUTING↗

Event Reconstruction for Many-core Architectures using Java

Although Moore's Law remains technically valid, the performance enhancements in computing which traditionally resulted from increased CPU speeds ended years ago. Chip manufacturers have chosen to increase the number of core CPUs per chip instead of increasing clock speed. Unfortunately, these extra CPUs do not automatically result in improvements in simulation or reconstruction times. To take advantage of this extra computing power requires changing how software is written. Event reconstruction is globally serial, in the sense that raw data has to be unpacked first, channels have to be clustered to produce hits before those hits are identified as belonging to a track or shower, tracks have to be found and fit before they are vertexed, etc. However, many of the individual procedures along the reconstruction chain are intrinsically independent and are perfect candidates for optimization using multi-core architecture. Threading is perhaps the simplest approach to parallelizing a program and Java includes a powerful threading facility built into the language. We have developed a fast and flexible reconstruction package (org.lcsim) written in Java that has been used for numerous physics and detector optimization studies. In this paper we present the results of our studies on optimizing the performance of this toolkit using multiple threads on many-core architectures.

99 GENERAL AND MISCELLANEOUS↗

NEW COMPLETENESS METHODS FOR ESTIMATING EXOPLANET DISCOVERIES BY DIRECT DETECTION

We report on new methods for evaluating realistic observing programs that search stars for planets by direct imaging, where observations are selected from an optimized star list and stars can be observed multiple times. We show how these methods bring critical insight into the design of the mission and its instruments. These methods provide an estimate of the outcome of the observing program: the probability distribution of discoveries (detection and/or characterization) and an estimate of the occurrence rate of planets ({eta}). We show that these parameters can be accurately estimated from a single mission simulation, without the need for a complete Monte Carlo mission simulation, and we prove the accuracy of this new approach. Our methods provide tools to define a mission for a particular science goal; for example, a mission can be defined by the expected number of discoveries and its confidence level. We detail how an optimized star list can be built and how successive observations can be selected. Our approach also provides other critical mission attributes, such as the number of stars expected to be searched and the probability of zero discoveries. Because these attributes depend strongly on the mission scale (telescope diameter, observing capabilities and constraints, mission lifetime, etc.), our methods are directly applicable to the design of such future missions and provide guidance to the mission and instrument design based on scientific performance. We illustrate our new methods with practical calculations and exploratory design reference missions for the James Webb Space Telescope (JWST) operating with a distant starshade to reduce scattered and diffracted starlight on the focal plane. We estimate that five habitable Earth-mass planets would be discovered and characterized with spectroscopy, with a probability of zero discoveries of 0.004, assuming a small fraction of JWST observing time (7%), {eta} = 0.3, and 70 observing visits, limited by starshade fuel.

79 ASTRONOMY AND ASTROPHYSICS↗

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗

Riemannian Optimization Applied to AC Optimal Power Flow

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. This is done by using the Julia programming language and the Julia packages PowerModels.jl and Manopt.jl.

AC optimal power flow↗

Summer Proceedings 2019

The Computer Science Research Institute (CSRI) brings university faculty and students to Sandia for focused collaborative research on Department of Energy (DOE) computer and computational science problems. The institute provides an opportunity for university researchers to learn about problems in computer and computational science at DOE laboratories. Participants conduct leading-edge research, interact with scientists and engineers at the laboratories, and help transfer results of their research to programs at the labs. Some specific CSRI research interest areas are: scalable solvers, optimization, adaptivity and mesh refinement, graph-based, discrete, and combinatorial algorithms, uncertainty estimation, mesh generation, dynamic load-balancing, virus and other malicious-code defense, visualization, scalable cluster computers and heterogeneous computers, data-intensive computing, environments for scalable computing, parallel input/output, advanced architectures, and theoretical computer science. The CSRI Summer Program includes the organization of a weekly seminar series and the publication of this summer proceedings.

97 MATHEMATICS AND COMPUTING↗

Decentralised optimisation of cogeneration in virtual power plants

Within several projects we investigated grid structures and management strategies for active grids with high penetration of renewable energy resources and distributed generation (RES and DG). Those ''smart grids'' should be designed and managed by model based methods, which are elaborated within these projects. Cogeneration plants (CHP) can reduce the greenhouse gas emissions by locally producing heat and electricity. The integration of thermal storage devices is suitable to get more flexibility for the cogeneration operation. If several power plants are bound to centrally managed clusters, it is called ''virtual power plant''. To operate smart grids optimally, new optimisation and model reduction techniques are necessary to get rid with the complexity. There is a great potential for the optimised management of CHPs, which is not yet used. Due to the fact that electrical and thermal demands do not occur simultaneously, a thermally driven CHP cannot supply electrical peak loads when needed. With the usage of thermal storage systems it is possible to decouple electric and thermal production. We developed an optimisation method based on mixed integer linear programming (MILP) for the management of local heat supply systems with CHPs, heating boilers and thermal storages. The algorithm allows the production of thermal and electric energy with a maximal benefit. In addition to fuel and maintenance costs it is assumed that the produced electricity of the CHP is sold at dynamic prices. This developed optimisation algorithm was used for an existing local heat system with 5 CHP units of the same type. An analysis of the potential showed that about 10% increase in benefit is possible compared to a typical thermally driven CHP system under current German boundary conditions. The quality of the optimisation result depends on an accurate prognosis of the thermal load which is realised with an empiric formula fitted with measured data by a multiple regression method. The key functionality of a virtual power plant is to increase the value of the produced power by clustering different plants. The first step of the optimisation concerns the local operation of the individual power generator, the second step is to calculate the contribution to the virtual power plant. With small extensions the suggested MILP algorithm can be used for an overall EEX (European Energy Exchange) optimised management of clustered CHP systems in form of the virtual power plant. This algorithm has been used to control cogeneration plants within a distribution grid. (author)

20 FOSSIL-FUELED POWER PLANTS↗

Conditions for the Solvability of the Linear Programming Formulation for Constrained Discounted Markov Decision Processes

We consider a discrete-time constrained discounted Markov decision process (MDP) with Borel state and action spaces, compact action sets, and lower semi-continuous cost functions. We introduce a set of hypotheses related to a positive weight function which allow us to consider cost functions that might not be bounded below by a constant, and which imply the solvability of the linear programming formulation of the constrained MDP. In particular, we establish the existence of a constrained optimal stationary policy. Our results are illustrated with an application to a fishery management problem.

97 MATHEMATICS AND COMPUTING↗

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

Here, this paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which characterizes worst-case uncertain parameters for its inner maximization problem. This condition offers an alternative proof, a counterexample, and an extension to previous works. Additionally, the condition highlights the potential advantage of a specific distance metric for out-of-sample performance, as exemplified in a numerical study on a facility location problem with demand uncertainty. Furthermore, cutting-plane-based algorithms, equipped with a unified scenario generation framework, are proposed for addressing both unbounded support and second-stage dual feasible regions, with a finite convergence proof under less stringent assumptions.

Wasserstein↗

A shared-mobility-based framework for evacuation planning and operations under forecast uncertainty

To meet evacuation needs from carless populations who need personalized assistance to evacuate safely, in this article we propose a ridesharing-based evacuation program that recruits volunteer drivers before a disaster strikes, and then matches volunteer drivers with evacuees once demand is realized. Here we optimize resource planning and evacuation operations under uncertain spatiotemporal demand, and construct a two-stage stochastic mixed-integer program to ensure high demand fulfillment rates. We consider three formulations to improve the number of evacuees served, by minimizing an expected penalty cost, imposing a probabilistic constraint, and enforcing a constraint on the conditional value at risk of the total number of unserved evacuees, respectively. We discuss the benefits and disadvantages of the different risk measures used in the three formulations, given certain carless population sizes and the variety of evacuation modes available. We also develop a heuristic approach to provide quick, dynamic and conservative solutions. We demonstrate the performance of our approaches using five different networks of varying sizes based on regions of Charleston County, South Carolina, an area that experienced a mandatory evacuation order during Hurricane Florence, and utilize real demographic data and hourly traffic count data to estimate the demand distribution.

97 MATHEMATICS AND COMPUTING↗

Generating moment matching scenarios using optimization techniques

An optimization based method is proposed to generate moment matching scenarios for numerical integration and its use in stochastic programming. The main advantage of the method is its flexibility: it can generate scenarios matching any prescribed set of moments of the underlying distribution rather than matching all moments up to a certain order, and the distribution can be defined over an arbitrary set. This allows for a reduction in the number of scenarios and allows the scenarios to be better tailored to the problem at hand. The method is based on a semi-infinite linear programming formulation of the problem that is shown to be solvable with polynomial iteration complexity. A practical column generation method is implemented. The column generation subproblems are polynomial optimization problems; however, they need not be solved to optimality. It is found that the columns in the column generation approach can be efficiently generated by random sampling. The number of scenarios generated matches a lower bound of Tchakaloff's. The rate of convergence of the approximation error is established for continuous integrands, and an improved bound is given for smooth integrands. Extensive numerical experiments are presented in which variants of the proposed method are compared to Monte Carlo and quasi-Monte Carlo methods on both numerical integration problems and stochastic optimization problems. The benefits of being able to match any prescribed set of moments, rather than all moments up to a certain order, is also demonstrated using optimization problems with 100-dimensional random vectors. Here, empirical results show that the proposed approach outperforms Monte Carlo and quasi-Monte Carlo based approaches on the tested problems.

97 MATHEMATICS AND COMPUTING↗

Stochastic Programming Approach for Resource Selection under Demand Uncertainty

Cost-efficient selection and scheduling of a subset of geographically distributed resources to meet the demands of a scientific workflow is a challenging problem. The problem is exacerbated by uncertainties in demand and availability of resources. In this paper, we present a stochastic optimization based framework for robust decision making in the selection of distributed resources over a planning horizon under demand uncertainty. We present a novel two-stage stochastic programming model for resource selection, and implement an L-shaped decomposition algorithm to solve this model. A Sample Average Approximation algorithm is integrated to enable stochastic optimization to solve problems with a large number of scenarios. Using the metric of stochastic solution, we demonstrate up to 30% cost reduction relative to solutions without explicit consideration of demand uncertainty for a 24-month problem. We also demonstrate up to 54% cost reduction relative to a previously developed solution for a 36-month problem. We further argue that the composition of resources selected is superior to solutions computed without explicit consideration of uncertainties. Given the importance of resource selection and scheduling of complex scientific workflows, especially in the context of commercial cloud computing, we believe that our novel stochastic programming framework will benefit many researchers as well as users of distributed computing resources.

scientific workflows, task scheduling, optimizatio↗

Spatial and Spin Symmetry Breaking in Semidefinite-Programming-Based Hartree–Fock Theory

The Hartree–Fock problem was recently recast as a semidefinite optimization over the space of rank-constrained two-body reduced-density matrices (RDMs) [ Phys. Rev. A 2014, 89, 010502(R)]. This formulation of the problem transfers the nonconvexity of the Hartree–Fock energy functional to the rank constraint on the two-body RDM. We consider an equivalent optimization over the space of positive semidefinite one-electron RDMs (1-RDMs) that retains the nonconvexity of the Hartree–Fock energy expression. The optimized 1-RDM satisfies ensemble N-representability conditions, and ensemble spin-state conditions may be imposed as well. The spin-state conditions place additional linear and nonlinear constraints on the 1-RDM. We apply this RDM-based approach to several molecular systems and explore its spatial (point group) and spin (Ŝ 2 and Ŝ 3 ) symmetry breaking properties. When imposing Ŝ 2 and Ŝ 3 symmetry but relaxing point group symmetry, the procedure often locates spatial-symmetry-broken solutions that are difficult to identify using standard algorithms. For example, the RDM-based approach yields a smooth, spatial-symmetry-broken potential energy curve for the well-known Be–H 2 insertion pathway. We also demonstrate numerically that, upon relaxation of Ŝ 2 and Ŝ 3 symmetry constraints, the RDM-based approach is equivalent to real-valued generalized Hartree–Fock theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

MOGO: Model-Oriented Global Optimization of Petascale Applications

The MOGO project was initiated under in 2008 under the DOE Program Announcement for Software Development Tools for Improved Ease-of-Use on Petascale systems (LAB 08-19). The MOGO team consisted of Oak Ridge National Lab, Argonne National Lab, and the University of Oregon. The overall goal of MOGO was to attack petascale performance analysis by developing a general framework where empirical performance data could be efficiently and accurately compared with performance expectations at various levels of abstraction. This information could then be used to automatically identify and remediate performance problems. MOGO was be based on performance models derived from application knowledge, performance experiments, and symbolic analysis. MOGO was able to make reasonable impact on existing DOE applications and systems. New tools and techniques were developed, which, in turn, were used on important DOE applications on DOE LCF systems to show significant performance improvements.

97 MATHEMATICS AND COMPUTING↗