Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization applications”

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 109 records · Page 6

Nonlinear dynamics optimization with particle swarm and genetic algorithms for SPEAR3 emittance upgrade

Nonlinear dynamics optimization is carried out for a low emittance upgrade lattice of SPEAR3 in order to improve its dynamic aperture and Touschek lifetime. Two multi-objective optimization algorithms, a genetic algorithm and a particle swarm algorithm, are used for this study. The performance of the two algorithms are compared. The result shows that the particle swarm algorithm converges significantly faster to similar or better solutions than the genetic algorithm and it does not require seeding of good solutions in the initial population. These advantages of the particle swarm algorithm may make it more suitable for many accelerator optimization applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Isopod (inverse Optimization And Design): Moose-based Application For Performing Inverse Optimization On Multiphysics Modeling And Simulation

ISOPOD (InverSe OPtimizatiOn and Design) will be a MOOSE (Multiphysics Object Oriented Simulation Environment)-based framework which will iteratively estimate the parameters by minimizing the difference between simulated and experimental observables. While inverse optimization has long been used for parameter estimation, the unique feature of ISOPOD is rapid solution of new inverse problems, leading to accelerated Research, Development and Demonstration (RD&D) for complex parameter estimation problems. This will be achieved by extending the software structure of MOOSE to inverse optimization, as well as building on the unique automatic differentiation feature of MOOSE.

Munday, LynnB↗

COMPARING NUMERICAL METHODS FOR ISOTHERMAL MAGNETIZED SUPERSONIC TURBULENCE

Many astrophysical applications involve magnetized turbulent flows with shock waves. Ab initio star formation simulations require a robust representation of supersonic turbulence in molecular clouds on a wide range of scales imposing stringent demands on the quality of numerical algorithms. We employ simulations of supersonic super-Alfvenic turbulence decay as a benchmark test problem to assess and compare the performance of nine popular astrophysical MHD methods actively used to model star formation. The set of nine codes includes: ENZO, FLASH, KT-MHD, LL-MHD, PLUTO, PPML, RAMSES, STAGGER, and ZEUS. These applications employ a variety of numerical approaches, including both split and unsplit, finite difference and finite volume, divergence preserving and divergence cleaning, a variety of Riemann solvers, and a range of spatial reconstruction and time integration techniques. We present a comprehensive set of statistical measures designed to quantify the effects of numerical dissipation in these MHD solvers. We compare power spectra for basic fields to determine the effective spectral bandwidth of the methods and rank them based on their relative effective Reynolds numbers. We also compare numerical dissipation for solenoidal and dilatational velocity components to check for possible impacts of the numerics on small-scale density statistics. Finally, we discuss the convergence of various characteristics for the turbulence decay test and the impact of various components of numerical schemes on the accuracy of solutions. The nine codes gave qualitatively the same results, implying that they are all performing reasonably well and are useful for scientific applications. We show that the best performing codes employ a consistently high order of accuracy for spatial reconstruction of the evolved fields, transverse gradient interpolation, conservation law update step, and Lorentz force computation. The best results are achieved with divergence-free evolution of the magnetic field using the constrained transport method and using little to no explicit artificial viscosity. Codes that fall short in one or more of these areas are still useful, but they must compensate for higher numerical dissipation with higher numerical resolution. This paper is the largest, most comprehensive MHD code comparison on an application-like test problem to date. We hope this work will help developers improve their numerical algorithms while helping users to make informed choices about choosing optimal applications for their specific astrophysical problems.

79 ASTRONOMY AND ASTROPHYSICS↗

POEK

POEK (Python Optimization Expression Kernel) is a Python library that supports the expression and manipulation of algebraic expressions commonly used in optimization applications. POEK interfaces with the COEK library to support fast methods for defining and managing expressions and performing automatic differentiation. POEK also interfaces with COEK to directly interface with optimization solvers (i.e. without relying on file I/O). SAND2019-14492 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Hart, William↗

Global Trees: A Framework for Linked Data Structures on Distributed Memory Parallel Systems

This paper describes the Global Trees (GT) system that provides a multi-layered interface to a global address space view of distributed tree data structures, while providing scalable performance on distributed memory systems. The Global Trees system utilizes coarse-grained data movement to enhance locality and communication efficiency. We describe the design and implementation of GT, illustrate its use in the context of a gravitational simulation application, and provide experimental results that demonstrate the effectiveness of the approach. The key benefits of using this system include efficient sharedmemory style programming of distributed trees, tree-specific optimizations for data access and computation, and the ability to customize many aspects of GT to optimize application performance.

97 MATHEMATICS AND COMPUTING↗

A Tchebycheff-based multi-objective combined with a PSO–SQP dynamic real-time optimization framework for cycling energy systems

The aim in this work is to develop an optimization framework to address cycling of baseload energy systems due to the penetration of renewables into the grid. The developed strategy corresponds to a multi-objective and dynamic real-time optimization (MOO-DRTO) framework applied to a postcombustion MEA-based CO 2 capture process from a baseload coal-fired power plant under cycling conditions. A Tchebycheff-based method is used for the multi-objective optimization (MOO) component. Also, a hybrid approach consisting of Particle Swarm Optimization (PSO) and Sequential Quadratic Programming (SQP) is implemented for the first time in process systems engineering to solve the dynamic real-time optimization (DRTO) component. The objectives considered in the MOO-DRTO framework are economic and environmental. The proposed MOO-DRTO strategy is successfully implemented and 24-h optimal output trajectories for the carbon capture system under cycling are generated. Also, the optimal compromise is chosen from the Pareto front according to a set of selected weights for the objectives with minimal interaction between the framework and decision maker. The results indicated that the developed framework has potential to be extended to plant-wide optimization applications under cycling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Monotonically convergent optimization in quantum control using Krotov's method

The non-linear optimization method developed by A. Konnov and V. Krotov [Autom. Remote Cont. (Engl. Transl.) 60, 1427 (1999)] has been used previously to extend the capabilities of optimal control theory from the linear to the non-linear Schroedinger equation [S. E. Sklarz and D. J. Tannor, Phys. Rev. A 66, 053619 (2002)]. Here we show that based on the Konnov-Krotov method, monotonically convergent algorithms are obtained for a large class of quantum control problems. It includes, in addition to nonlinear equations of motion, control problems that are characterized by non-unitary time evolution, nonlinear dependencies of the Hamiltonian on the control, time-dependent targets, and optimization functionals that depend to higher than second order on the time-evolving states. We furthermore show that the nonlinear (second order) contribution can be estimated either analytically or numerically, yielding readily applicable optimization algorithms. We demonstrate monotonic convergence for an optimization functional that is an eighth-degree polynomial in the states. For the ''standard'' quantum control problem of a convex final-time functional, linear equations of motion and linear dependency of the Hamiltonian on the field, the second-order contribution is not required for monotonic convergence but can be used to speed up convergence. We demonstrate this by comparing the performance of first- and second-order algorithms for two examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of stochastic optimization to nuclear power plant asset management decisions

We describe the development and application of stochastic optimization models and algorithms to address an issue of critical importance in the strategic allocation of resources; namely, the selection of a portfolio of capital investment projects under the constraints of a limited and uncertain budget. This issue is significant and one that faces decision-makers across all industries. The objective of this strategic decision process is generally self evident - to maximize the value obtained from the portfolio of selected projects (with value usually measured in terms of the portfolio's net present value). However, heretofore, many organizations have developed processes to make these investment decisions using simplistic rule-based rank-ordering schemes. This approach has the significant limitation of not accounting for the (often large) uncertainties in the costs or economic benefits associated with the candidate projects or in the uncertainties in the actual funds available to be expended over the projected period of time. As a result, the simple heuristic approaches that typically are employed in industrial practice generate outcomes that are non-optimal and do not achieve the level of benefits intended. In this paper we describe the results of research performed to utilize stochastic optimization models and algorithms to address this limitation by explicitly incorporating the evaluation of uncertainties in the analysis and decision making process. (authors)

97 MATHEMATICS AND COMPUTING↗

HPC Resource Allocation Under Energy Constraints

We discuss the new problem faced by High-Performance Computing (HPC) facilities in allocating resources to users of their facilities: while facilities once allocated a single finite resource—node-hours—now facilities must also concurrently allocate a second scarce resource: electrical energy, which is bounded within each facility's annual operations budget. Current application optimization practices encourage conservation of the first resource, but can be potentially unaffordably wasteful of the second. We describe a framework for reasoning about such allocations that can be utilized by facilities to articulate policy, while encouraging scientific application developers to write code mindfully of both constraints. We outline the requirements on facilities, on developers, and on hardware vendors and integrators that are necessary to enable the implementation of this framework.

97 MATHEMATICS AND COMPUTING↗

Protein crystallization with microseed matrix screening: application to human germline antibody Fabs

The power of microseed matrix screening is demonstrated in the crystallization of a panel of antibody Fab fragments. The crystallization of 16 human antibody Fab fragments constructed from all pairs of four different heavy chains and four different light chains was enabled by employing microseed matrix screening (MMS). In initial screening, diffraction-quality crystals were obtained for only three Fabs, while many Fabs produced hits that required optimization. Application of MMS, using the initial screens and/or refinement screens, resulted in diffraction-quality crystals of these Fabs. Five Fabs that failed to give hits in the initial screen were crystallized by cross-seeding MMS followed by MMS optimization. The crystallization protocols and strategies that resulted in structure determination of all 16 Fabs are presented. These results illustrate the power of MMS and provide a basis for developing future strategies for macromolecular crystallization.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

The role of surface ligands in quantum-dot devices: Villain or unsung hero?

For over three decades, the study of nanocrystal quantum dots (QDs), which are solution-synthesized nanometer-scale bits of semiconductor materials, has produced singular advances in both our understanding of quantum confinement effects, and in our ability to make use of them in tech-relevant materials. Accordingly, QDs have found their way into the marketplace, specifically as high-performance fluorophores for, e.g., displays and biolabeling. In such applications, optimization of the QD surface, including the passivating ligands, is key to keeping photo-excited carriers from leaving the QD interior before recombining, resulting in a high fluorescence efficiency. Increasingly, attention has turned to realize the promise of QDs for optoelectronic applications (e.g., solar cells, LEDs, sensors) which require charge carriers to controllably enter, exit and/or travel through QDs, a much more challenging problem. In this scenario, the role of the QD surface must be completely reimagined, from being an impenetrable wall to being a gateway, or even a ramp. In this talk, I’ll explore the inherent contrast between QD fluorophore and device applications, and describe how ligands, originally thought only to be impediments to QD electronic devices, may actually give the savvy QD device designer control over function and performance in a manner unknown in bulk semiconductor devices. Finally, I’ll survey recent efforts at Los Alamos to develop a universal tool box for deposition of conductive QD films that may finally allow the manufacturing of economical, high-performance devices for a wide range of applications.

36 MATERIALS SCIENCE↗

Toward Performance Portable Programming for Heterogeneous System-on-Chips: Case Study with Qualcomm Snapdragon SoC

Future heterogeneous Domain-Specific System-on-Chips (DSSoC) will be extraordinarily complex in terms of processors, memory hierarchies, and interconnection networks.To manage this complexity, architects, system software designers, and application developers need programming technologies that are flexible, accurate, efficient, and productive. These technologies will need to be as independent of any one specific architecture as is practical, because the sheer dimensionality and scale of the complexity will not allow porting and optimizing applications foreach given DSSoC. To address these issues, we are developing Cosmic Castle, a performance portable programming toolchain for streaming applications on heterogeneous architectures. The primary focus of Cosmic Castle is on enabling efficient and performant code generation through the smart compiler and intelligent runtime system. This paper presents the preliminary evaluation of our ongoing work toward Cosmic Castle. Specifically, we detail our code porting efforts and evaluate various benchmarks on the Qualcomm Snapdragon SoC using tools developed through Cosmic Castle.

Cabrera, Anthony↗

PAO

PAO supports the formulation and analysis of mathematical models for complex optimization applications. This capability is commonly associated with algebraic modeling languages (AMLs), which support the description and analysis of mathematical models with a high-level language. PAO is derived from the Pyomo subpackage pyomo.bilevel, which has been deprecated. PAO supports the formulation and solution of optimization models that explicitly represent adversarial behavior. This includes variances of bilevel programming, including methods that represent challenging problems with discrete decisions and uncertain model parameters.

Hart, William↗

Performance Characterization of a Hierarchical MPI Implementations on Large-scale Distributed-memory Platforms

The building blocks of emerging Petascale massively parallel processing (MPP) systems are multi-core processors with four or more cores as a single processing element and a customized network interface. The resulting memory and communication hierarchy of these platforms are now exposed to application developers and end users by creating a hierarchical or multi-core aware message-passing (MPI) programming interface and by providing a handful of runtime, tunable parameters that allows mapping and control of MPI tasks and message handling. We characterize performance of MPI communication patterns and present strategies for optimizing applications performance on Cray XT series systems that are composed of contemporary AMD processors and a proprietary network infrastructure. We highlight dependencies in its memory and network subsystems, which could influence production-level applications performance. We demonstrate that MPI micro-benchmarks could mislead an application developer or end user since these benchmarks often do not expose the interplay between memory allocation and usage in the user space, which depends on the number of tasks or cores and workload characteristics. Our studies show performance improvements compared to the default options for our target scientific benchmarks and production-level applications.

99 GENERAL AND MISCELLANEOUS↗

Optimization of Dry Storage Canister Cutting Operations - 20534

A recent project investigated the optimal cutting method for the opening of a welded dry storage/shielded canister (DSC) or dual purpose canister (DPC) containing Used Nuclear Fuel (UNF). Due to the lack of a disposal path for UNF in the U.S., the majority of UNF is currently moved into welded DSCs and DPCs designed by Orano TN, NAC, and Holtec. As the DSCs/DPCs were neither designed nor licensed for disposal and may not be able to be emplaced in a geologic repository due to physical emplacement constraints, near-term thermal limitations, or long-term criticality issues, the UNF in these existing DSCs/DPCs may need to be repackaged into transportation, aging, and disposal canisters (TADs), generic standard TADs (STADs), transportation casks, new cask/canister systems, and/or cask/canister/package systems suitable for disposal. These DSCs/DPCs may also be opened to simply remove the UNF in preparation for recycling, re-storage, or placement into a waste package suitable for disposal. Regardless of need, the DSCs/DPCs would require to be cut open by a potentially large scale operation. This project examined the multiple means for cutting welded metal systems and considered several factors to determine an optimal approach. Issues arose around some of the cutting approaches when applied to systems with 2 or 3 lids and with pre-cutting gas testing required. The resulting preferences in cutting methods with an optimized application for the opening of DSCs/DPCs are presented. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Parallel simulated annealing with embedded machine learning and multifidelity models for reactor core design

This paper presents extensions to a penalty-free, parallel simulated annealing (SA) algorithm for multi-constrained combinatorial optimization with the aim of embedding multi-fidelity physics models into the annealing procedure. The method uses a low-fidelity, quickly executing model for rapid design space exploration and a high-fidelity model for detailed constraint resolution and on-the-fly bias correction. Machine learning models updated within the annealing procedure were used to bridge the gap between the multi-fidelity models, which led to accurate rapid exploration and efficient detailed constraint resolution. A software implementation of the new multi-fidelity optimization methods, called ML-PSA, was demonstrated on a continuous multi-fidelity optimization problem and a constrained combinatorial PWR lattice design problem. These problems demonstrate some of the features, parallel performance characteristics, and extensible nature of the multi-fidelity SA methods. This paper shows that the developed software and procedure are a general optimization tool that can be applied to a wide variety of scientific and engineering design optimization applications. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Performance and power modeling and prediction using MuMMI and 10 machine learning methods

Energy-efficient scientific applications require insight into how high performance computing system features impact the applications' power and performance. This insight can result from the development of performance and power models. Here, in this article, we use the modeling and prediction tool MuMMI (Multiple Metrics Modeling Infrastructure) and 10 machine learning methods to model and predict performance and power consumption and compare their prediction error rates. We use an algorithm-based fault-tolerant linear algebra code and a multilevel checkpointing fault-tolerant heat distribution code to conduct our modeling and prediction study on the Cray XC40 Theta and IBM BG/Q Mira at Argonne National Laboratory and the Intel Haswell cluster Shepard at Sandia National Laboratories. Our experimental results show that the prediction error rates in performance and power using MuMMI are less than 10% for most cases. By utilizing the models for runtime, node power, CPU power, and memory power, we identify the most significant performance counters for potential application optimizations, and we predict theoretical outcomes of the optimizations. Based on two collected datasets, we analyze and compare the prediction accuracy in performance and power consumption using MuMMI and 10 machine learning methods.

97 MATHEMATICS AND COMPUTING↗