Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational optimization”

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,063 records · Page 59

DEVELOPING A TRAFFIC SIGNAL ECO-COOPERATIVE ADAPTIVE CRUISE CONTROL SYSTEM FOR BATTERY ELECTRIC VEHICLES

This study developed an eco-driving strategy for battery electric vehicles (BEVs) in the vicinity of signalized intersections, known as BEV Eco-Cooperative Adaptive Cruise Control at Intersections (Eco-CACC-I). The system computes a real-time, energy-optimized vehicle trajectory using a BEV vehicle dynamics and energy consumption model. In the proposed approach, the relationship between vehicle speed, acceleration level, and tractive/resistance forces on the vehicle follows the vehicle dynamics model. The Virginia Tech Comprehensive Power-based Electric Vehicle Energy Consumption Model (VT-CPEM) is used to compute the instantaneous battery energy consumption, with the consideration of battery energy regeneration during braking. The Eco-CACC-I energy-optimum trajectory computation is formulated as an optimization problem with constraints. Considering that the optimization solution needs to be computed at a rapid frequency (e.g., 10 Hz) for real-time applications, an A-star algorithm was used here to expedite the computational speed. Lastly, the proposed BEV Eco-CACC-I system was tested in simulation by considering the impacts of various road grades, speed limits, and signal timings. Simulations for an Internal Combustion Engine Vehicles (ICEVs) was conducted to compare with the BEV test results. The results of the comparison indicate that the energy-optimum solution for BEVs is different from that for ICEVs and thus demonstrating the need for vehicle-tailored optimum trajectories.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Bilevel optimization, deep learning and fractional Laplacian regularization with applications in tomography

Here we consider a generalized bilevel optimization framework for solving inverse problems. We introduce fractional Laplacian as a regularizer to improve the reconstruction quality, and compare it with the total variation regularization. We emphasize that the key advantage of using fractional Laplacian as a regularizer is that it leads to a linear operator, as opposed to the total variation regularization which results in a nonlinear degenerate operator. Inspired by residual neural networks, to learn the optimal strength of regularization and the exponent of fractional Laplacian, we develop a dedicated bilevel optimization neural network with a variable depth for a general regularized inverse problem. We illustrate how to incorporate various regularizer choices into our proposed network. As an example, we consider tomographic reconstruction as a model problem and show an improvement in reconstruction quality, especially for limited data, via fractional Laplacian regularization. We successfully learn the regularization strength and the fractional exponent via our proposed bilevel optimization neural network. We observe that the fractional Laplacian regularization outperforms total variation regularization. This is specially encouraging, and important, in the case of limited and noisy data.

97 MATHEMATICS AND COMPUTING↗

Exploration of Optimization Options for Increasing Performance of a GPU Implementation of a Three-dimensional Bilateral Filter

This report explores using GPUs as a platform for performing high performance medical image data processing, specifically smoothing using a 3D bilateral filter, which performs anisotropic, edge-preserving smoothing. The algorithm consists of a running a specialized 3D convolution kernel over a source volume to produce an output volume. Overall, our objective is to understand what algorithmic design choices and configuration options lead to optimal performance of this algorithm on the GPU. We explore the performance impact of using different memory access patterns, of using different types of device/on-chip memories, of using strictly aligned and unaligned memory, and of varying the size/shape of thread blocks. Our results reveal optimal configuration parameters for our algorithm when executed sample 3D medical data set, and show performance gains ranging from 30x to over 200x as compared to a single-threaded CPU implementation.

97 MATHEMATICS AND COMPUTING↗

Nonconvex Robust Optimization for the Design and Operation of Advanced Energy Systems Using PyROS

This work discusses recent advances of the two-stage robust optimization (RO) solver PyROS and applications to advanced energy systems optimization. To demonstrate the computational performance and reliability of PyROS, a study on a monoethanolamine (MEA)-based CO2 absorption flowsheet is presented. (Near-)robust feasible designs for CO2 absorption flowsheet at high carbon capture are obtained with the PyROS solver. The results demonstrate that the PyROS solver, including recent extensions to multi-stage RO settings, provides a reliable avenue to optimize the design and operation of advanced energy systems subject to various sources of parametric uncertainty.

Sherman, Jason↗

An Intelligent System for Automatic Selection of DC-DC Converter Topology with Optimal Design

In this paper, we present an intelligent system that has the capabilities of automatically selecting topology classes and optimizing circuit parameters of DC-DC power converters for a given design specification. The system, Machine-Learning-enhanced Automated Circuit Configuration and Evaluation of Power Converters (ML-ACCEPT), uses a hybrid of machine learning technologies, decision tree inference, reinforcement learning and deep neural networks. The system gives high accurate recommendations of design topology classes and computationally efficient results in optimizing power efficiencies in power converter design.

Xue, Lincoln↗

Towards Scalable Optimal Sequence Homology Detection

Abstract—The field of bioinformatics and computational biol- ogy is experiencing a data revolution — experimental techniques to procure data have increased in throughput, improved in accuracy and reduced in costs. This has spurred an array of high profile sequencing and data generation projects. While the data repositories represent untapped reservoirs of rich information critical for scientific breakthroughs, the analytical software tools that are needed to analyze large volumes of such sequence data have significantly lagged behind in their capacity to scale. In this paper, we address homology detection, which is a funda- mental problem in large-scale sequence analysis with numerous applications. We present a scalable framework to conduct large- scale optimal homology detection on massively parallel super- computing platforms. Our approach employs distributed memory work stealing to effectively parallelize optimal pairwise alignment computation tasks. Results on 120,000 cores of the Hopper Cray XE6 supercomputer demonstrate strong scaling and up to 2.42 × 107 optimal pairwise sequence alignments computed per second (PSAPS), the highest reported in the literature.

Daily, Jeffrey A.↗

A framework for modeling and optimizing dynamic systems under uncertainty

Algebraic modeling languages (AMLs) have drastically simplified the implementation of algebraic optimization problems. However, there are still many classes of optimization problems that are not easily represented in most AMLs. These classes of problems are typically reformulated before implementation, which requires significant effort and time from the modeler and obscures the original problem structure or context. In this work we demonstrate how the Pyomo AML can be used to represent complex optimization problems using high-level modeling constructs. We focus on the operation of dynamic systems under uncertainty and demonstrate the combination of Pyomo extensions for dynamic optimization and stochastic programming. We use a dynamic semibatch reactor model and a large-scale bubbling fluidized bed adsorber model as test cases.

97 MATHEMATICS AND COMPUTING↗

Evaluation of the Single-precision Floatingpoint Vector Add Kernel Using the Intel FPGA SDK for OpenCL

Open Computing Language (OpenCL) is a high-level language that enables software programmers to explore Field Programmable Gate Arrays (FPGAs) for application acceleration. The Intel FPGA software development kit (SDK) for OpenCL allows a user to specify applications at a high level and explore the performance of low-level hardware acceleration. In this report, we present the FPGA performance and power consumption results of the single-precision floating-point vector add OpenCL kernel using the Intel FPGA SDK for OpenCL on the Nallatech 385A FPGA board. The board features an Arria 10 FPGA. We evaluate the FPGA implementations using the compute unit duplication and kernel vectorization optimization techniques. On the Nallatech 385A FPGA board, the maximum compute kernel bandwidth we achieve is 25.8 GB/s, approximately 76% of the peak memory bandwidth. The power consumption of the FPGA device when running the kernels ranges from 29W to 42W.

97 MATHEMATICS AND COMPUTING↗

Exascale for Energy: The Role of Exascale Computing in Energy Security

How will the United States satisfy energy demand in a tightening global energy marketplace while, at the same time, reducing greenhouse gas emissions? Exascale computing -- expected to be available within the next eight to ten years ? may play a crucial role in answering that question by enabling a paradigm shift from test-based to science-based design and engineering. Computational modeling of complete power generation systems and engines, based on scientific first principles, will accelerate the improvement of existing energy technologies and the development of new transformational technologies by pre-selecting the designs most likely to be successful for experimental validation, rather than relying on trial and error. The predictive understanding of complex engineered systems made possible by computational modeling will also reduce the construction and operations costs, optimize performance, and improve safety. Exascale computing will make possible fundamentally new approaches to quantifying the uncertainty of safety and performance engineering. This report discusses potential contributions of exa-scale modeling in four areas of energy production and distribution: nuclear power, combustion, the electrical grid, and renewable sources of energy, which include hydrogen fuel, bioenergy conversion, photovoltaic solar energy, and wind turbines. Examples of current research are taken from projects funded by the U.S. Department of Energy (DOE) Office of Science at universities and national laboratories, with a special focus on research conducted at Lawrence Berkeley National Laboratory.

08 HYDROGEN↗

A model to calculate fatigue damage caused by partial waking during wind farm optimization

Abstract. Wind turbines in wind farms often operate in waked or partially waked conditions, which can greatly increase the fatigue damage. Some fatigue considerations may be included, but currently a full fidelity analysis of the increased damage a turbine experiences in a wind farm is not considered in wind farm layout optimization because existing models are too computationally expensive. In this paper, we present a model to calculate fatigue damage caused by partial waking on a wind turbine that is computationally efficient and can be included in wind farm layout optimization. The model relies on analytic velocity, turbulence, and load models commonly used in farm research and design, and it captures some of the effects of turbulence on the fatigue loading. Compared to high-fidelity simulation data, our model accurately predicts the damage trends of various waking conditions. We also perform example wind farm layout optimizations with our presented model in which we maximize the annual energy production (AEP) of a wind farm while constraining the damage of the turbines in the farm. The results of our optimization show that the turbine damage can be significantly reduced, more than 10 %, with only a small sacrifice of around 0.07 % to the AEP, or the damage can be reduced by 20 % with an AEP sacrifice of 0.6 %.

17 WIND ENERGY↗

A new hybrid genetic algorithm for optimizing the single and multivariate objective functions

In this work a new hybrid genetic algorithm was developed which combines a rudimentary adaptive steepest ascent hill climbing algorithm with a sophisticated evolutionary algorithm in order to optimize complex multivariate design problems. By combining a highly stochastic algorithm (evolutionary) with a simple deterministic optimization algorithm (adaptive steepest ascent) computational resources are conserved and the solution converges rapidly when compared to either algorithm alone. In genetic algorithms natural selection is mimicked by random events such as breeding and mutation. In the adaptive steepest ascent algorithm each variable is perturbed by a small amount and the variable that caused the most improvement is incremented by a small step. If the direction of most benefit is exactly opposite of the previous direction with the most benefit then the step size is reduced by a factor of 2, thus the step size adapts to the terrain. A graphical user interface was created in MATLAB to provide an interface between the hybrid genetic algorithm and the user. Additional features such as bounding the solution space and weighting the objective functions individually are also built into the interface. The algorithm developed was tested to optimize the functions developed for a wood pelleting process. Using process variables (such as feedstock moisture content, die speed, and preheating temperature) pellet properties were appropriately optimized. Specifically, variables were found which maximized unit density, bulk density, tapped density, and durability while minimizing pellet moisture content and specific energy consumption. The time and computational resources required for the optimization were dramatically decreased using the hybrid genetic algorithm when compared to MATLAB's native evolutionary optimization tool.

feedstock↗

Dosimetric evaluation of total marrow irradiation using 2 different planning systems

This study compared 2 different treatment planning systems (TPSs) for quality and efficiency of total marrow irradiation (TMI) plans. The TPSs used in this study were VOxel-Less Optimization (VoLO) (Accuray Inc, Sunnyvale, CA) using helical dose delivery on a Tomotherapy Hi-Art treatment unit and Eclipse (Varian Medical Systems Inc, Palo Alto, CA) using volumetric modulated arc therapy (VMAT) dose delivery on a Varian iX treatment unit. A total dose of 1200 cGy was prescribed to cover 95% of the planning target volume (PTV). The plans were optimized and calculated based on a single CT data and structure set using the Alderson Rando phantom (The Phantom Laboratory, Salem, NY) and physician contoured target and organ at risk (OAR) volumes. The OARs were lungs, heart, liver, kidneys, brain, and small bowel. The plans were evaluated based on plan quality, time to optimize the plan and calculate the dose, and beam on time. The resulting mean and maximum doses to the PTV were 1268 and 1465 cGy for VoLO and 1284 and 1541 cGy for Eclipse, respectively. For 5 of 6 OAR structures the VoLO system achieved lower mean and D10 doses ranging from 22% to 52% and 3% to 44%, respectively. Total computational time including only optimization and dose calculation were 0.9 hours for VoLO and 3.8 hours for Eclipse. These times do not include user-dependent target delineation and field setup. Both planning systems are capable of creating high-quality plans for total marrow irradiation. The VoLO planning system was able to achieve more uniform dose distribution throughout the target volume and steeper dose fall off, resulting in superior OAR sparing. VoLO's graphics processing unit (GPU)–based optimization and dose calculation algorithm also allowed much faster creation of TMI plans.

61 RADIATION PROTECTION AND DOSIMETRY↗

Dynamic Catalysis Fundamentals: I. Fast calculation of limit cycles in dynamic catalysis

Dynamic catalysis—the forced oscillation of catalytic reaction coordinate potential energy surfaces (PES)—has recently emerged as a promising method for the acceleration of heterogeneously-catalyzed reactions. Theoretical study of enhancement of rates and supra-equilibrium product yield via dynamic catalysis has, to-date, been severely limited by onerous computational demands of forward integration of stiff, coupled ordinary differential equations (ODEs) that are necessary to quantitatively describe periodic cycling between PESs. Here, we establish a new approach that reduces, by ≳108×, the computational cost of finding the time-averaged rate at dynamic steady state (i.e. the limit cycle for linear and nonlinear systems of kinetic equations). Our developments are motivated by and conceived from physical and mathematical insight drawn from examination of a simple, didactic case study for which closed-form solutions of rate enhancement are derived in explicit terms of periods of oscillation and elementary step rate constants. Generalization of such closed-form solutions to more complex catalytic systems is achieved by introducing a periodic boundary condition requiring the dynamic steady state solution to have the same periodicity as the kinetic oscillations and solving the corresponding differential equations by linear algebra or Newton-Raphson-based approaches. The methodology is well-suited to extension to non-linear systems for which we detail the potential for multiple solutions or solutions with different periodicities. For linear and non-linear systems alike, the acute decrement in computational expense enables rapid optimization of oscillation waveforms and, consequently, accelerates understanding of the key catalyst properties that enable maximization of reaction rates, conversions, and selectivities during dynamic catalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Algorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems

VTMOP is a Fortran 2008 software package containing two Fortran modules for solving computationally expensive bound-constrained blackbox multiobjective optimization problems. VTMOP implements the algorithm of [32], which handles two or more objectives, does not require any derivatives, and produces well-distributed points over the Pareto front. The first module contains a general framework for solving multiobjective optimization problems by combining response surface methodology, trust region methodology, and an adaptive weighting scheme. The second module features a driver subroutine that implements this framework when the objective functions can be wrapped as a Fortran subroutine. Lastly, support is provided for both serial and parallel execution paradigms, and VTMOP is demonstrated on several test problems as well as one real-world problem in the area of particle accelerator optimization.

97 MATHEMATICS AND COMPUTING↗

An Optimized Parameterization of Sub‐Grid Scale Advection for Convection Permitting Models

Convection‐permitting models (CPMs) explicitly resolve deep convection yet under‐resolve the organized lateral exchanges among drafts and their environment that control entrainment/detrainment, precipitation efficiency, and mesoscale structure. In this work, we introduce the Optimized Advection Scheme (OAS), which introduces a small rotation of the Cartesian frame of reference for the horizontal winds relative to other variables used in advection that induces cross‐gradient transport to mimic under‐resolved convective mixing. The rotation angle is selected to minimize the Kullback–Leibler divergence between the simulated and satellite observed precipitation intensity distributions, yielding a physically consistent perturbation that is computationally inexpensive and portable. Optimized Advection Scheme is implemented in WRF and evaluated over Amazon (April 2014). It shifts precipitation–precipitable‐water joint distributions toward lighter rain, reduces overly intense rates, and improves mesoscale convective system (MCS) lifetime and propagation. Mechanistically, the added cross‐gradient transport promotes convective detrainment and environmental mixing, which cools and moistens the mid‐troposphere, weakens downward momentum transport, alleviates excessive downwelling shortwave biases, and warms the surface temperature. The optimized rotation angle yields comparable improvements at 4‐km and 1‐km grid spacing, demonstrating resolution‐independent benefits across the CPM gray zone. By targeting the dynamical root of under‐mixed convective circulations, rather than tuning model microphysics or closures, OAS delivers robust, scale‐aware improvements in precipitation statistics, cloud vertical structure, and characteristics of MCS (MCSs), offering a practical pathway to more reliable CPM simulations for weather and climate applications.

CPM↗

A survey on checkpointing strategies: Should we always checkpoint à la Young/Daly?

The Young/Daly formula provides an approximation of the optimal checkpointing period for a parallel application executing on a supercomputing platform. It was originally designed to handle fail-stop errors for preemptible tightly-coupled applications, but has been extended to other application and resilience frameworks. Here, we provide some background and survey various scenarios to assess the usefulness and limitations of the formula, both for preemptible applications and workflow applications represented as a graph of tasks. We also discuss scenarios with uncertainties, and extend the study to silent errors. We exhibit cases where the optimal period is of a different order than that dictated by the Young/Daly formula, and finally we explain how checkpointing can be further combined with replication.

97 MATHEMATICS AND COMPUTING↗

A Flexible Quasi-Static Mooring Design Optimization Method for Floating Structures

This paper presents a flexible and efficient design method for optimizing the mooring systems of floating structures. Mooring system optimization is challenging because of the strong nonlinearity of mooring system behavior and the many technical constraints that must be satisfied. Furthermore, different mooring configurations can have very different design spaces. While some successful examples of mooring design optimization exist in the literature, developing an optimization approach that can work across various mooring design problems is a larger challenge. We present such a method based on a flexible parameterization that allows a wide variety of mooring designs to be described by a list of variables, a quasi-static mooring model that provides efficient evaluation of a mooring design without directly considering mooring system dynamics, and an optimization framework that generates, evaluates, and adjusts the mooring design while considering user-specified constraints such as offset limits, strength safety factors, and seabed contact limits. We demonstrate the design optimization framework on four mooring design problems, each for a different type of mooring system. We compare the use of different design modes to simplify the optimization problem, showing that they can reduce the computation time by up to 75%. We also compare different optimization algorithms and find that the resulting computational speed can vary by up to 51 times. We perform a sensitivity study on one design and find that the local sensitivity of anchoring radius to water depth has a positive correlation of 0.29, but the global sensitivity shows large nonlinearities. Lastly, we perform a coupled dynamic analysis on one of the optimized designs and find that the predicted mean platform motions and mooring line tensions are within 1% of dynamic results and the extreme motions and tensions are within 14%. Lastly, we show that a DEA-Chain-Polyester mooring configuration is cost-optimal for the given design problem of the demonstrations, which aligns with general industry practice.

16 TIDAL AND WAVE POWER↗

Evaluating Near-Term Adiabatic Quantum Computing

This report summarizes the first year’s effort on the Enceladus project, under which Sandia was asked to evaluate the potential advantages of adiabatic quantum computing for analyzing large data sets in the near future, 5-to-10 years from now. We were not specifically evaluating the machine being sold by D-Wave Systems, Inc; we were asked to anticipate what future adiabatic quantum computers might be able to achieve. While realizing that the greatest potential anticipated from quantum computation is still far into the future, a special purpose quantum computing capability, Adiabatic Quantum Optimization (AQO), is under active development and is maturing relatively rapidly; indeed, D-Wave Systems Inc. already offers an AQO device based on superconducting flux qubits. The AQO architecture solves a particular class of problem, namely unconstrained quadratic Boolean optimization. Problems in this class include many interesting and important instances. Because of this, further investigation is warranted into the range of applicability of this class of problem for addressing challenges of analyzing big data sets and the effectiveness of AQO devices to perform specific analyses on big data. Further, it is of interest to also consider the potential effectiveness of anticipated special purpose adiabatic quantum computers (AQCs), in general, for accelerating the analysis of big data sets. The objective of the present investigation is an evaluation of the potential of AQC to benefit analysis of big data problems in the next five to ten years, with our main focus being on AQO because of its relative maturity. We are not specifically assessing the efficacy of the D-Wave computing systems, though we do hope to perform some experimental calculations on that device in the sequel to this project, at least to provide some data to compare with our theoretical estimates.

97 MATHEMATICS AND COMPUTING↗