SEARCH · Search NASA
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.
Deep ReLU networks have exponential expressive potential but behave identically to their shallow counterparts under random initialization. This paper introduces a novel training paradigm that constrains weights into mathematically optimized patterns. This enables the resulting network to make exponential use of its depth.
The visibility of pavement markings is one of the most critical factors for traffic safety, and a periodical assessment plan is crucial for maintaining this function. Traditional assessment methods, such as visual windshield surveys or manual testing using handheld devices, are unsafe, time-consuming, and labor-intensive. In recent years, transportation agencies have begun to adopt the use of mobile retroreflectivity units (MRUs) for condition assessment of pavement markings. MRUs, different from other manual methods, can be utilized to collect large-scale retroreflectivity data in an efficient manner. However, no relevant research has yet proposed a mathematical optimization model for arranging the evaluation schedule and paths of MRUs. This study aims to propose a MRU routing model, and an efficient solution methodology. A branch-and-price algorithm, including column generation and branch-and-bound, was implemented. Computational experiments have been conducted based on actual tasks from the Florida MRU program for validation. In conclusion, results show that the proposed solution methodology with a set partitioning model in this study not only finds the optimal solution for problems with tasks less than 60, but also effectively narrows the solution gap to be within 1.0% for problems with tasks less than 131.
Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display good parallelization properties. Since current architecture trends are favoring regular compute patterns to achieve high performance, the ability to express structure has become much more important. The hypre software library provides high-performance multigrid preconditioners and solvers through conceptual interfaces, including a semistructured interface that describes matrices primarily in terms of stencils and logically structured grids. This paper presents a new semistructured algebraic multigrid (SSAMG) method built on this interface. The numerical convergence and performance of a CPU implementation of this method are evaluated for a set of semistructured problems. In conclusion, SSAMG achieves significantly better setup times than hypre’s unstructured AMG solvers and comparable convergence. In addition, the new method is capable of solving more complex problems than hypre’s structured solvers.
With increasing interest in using biomass as a raw material for fuel, the development of biorefineries is an active area of research. However, increasing market competition, uncertainty, and environmental concerns are a few of the challenges that need to be addressed. In this work, mathematical optimization formulations are proposed to address these challenges simultaneously. A multiobjective deterministic optimization framework is proposed to address economic and environmental objectives. A two-stage stochastic optimization framework is proposed to account for uncertainties in material flow and product yields. To model the environmental objective, an environmental risk metric is proposed. Finally, as modularization is gaining popularity in the process industry due to its ability to save capital cost because of standardization and reduce time to market, a formulation for simultaneously achieving modular process design and biorefinery configuration is proposed. Furthermore, the results demonstrate the efficacy of the proposed approach.
This paper introduces a model for simulating hybrid plants participating in energy and ancillary services for bulk power system studies. The model considers a hybrid plant comprised of a renewable energy source, a thermal power unit, a storage unit, fixed power loads, or any combination of these technologies. The model focuses on Production Cost Modeling (PCM) studies under the assumption of centralized dispatch. We present an example case study to illustrate the use of the model in a single-stage production cost model similar to those conducted by planning agencies. We explore the allocation of behind-the-meter ancillary services products and total energy participation to hybrid plant sub-assets and the resulting impacts on the system's ancillary service allocation. The model is implemented and simulated in a unit commitment problem in the RTS test system, which was modified to include a hybrid plant asset.
With the advent of the next-generation traffic monitoring systems, there has been a significant increase in the spatial-temporal resolution of vehicle mobility data in many cities. Effective analysis and visualization of such data can provide transportation planners with data-driven insights, which can facilitate the understanding of multiscale traffic dynamics. In this paper, we present a web-based traffic emulator for emulating and visualizing near-real-time and historical traffic flows on highways using data from road-side sensors. To construct a continuous traffic flow, the emulator adopts an analytical pipeline that can (a) integrate traffic data collected from discrete road-side radar detection sensors, (b) interpolate traffic conditions (vehicle speed and volume) on unmeasured road segments based on traffic flow theory, and (c) generate lane-specific vehicle trajectories and movements using a mathematically optimized representation of the road network. Our app also provides an integrated visual workflow that allows users to explore the interconnected traffic dynamics using an appropriate traffic flow visualization selected based on the level of detail. We devise two innovative geo-visualization techniques that utilize an animated strips-network representation and a lane usage matrix to visualize lane performances. To ensure a smooth emulation of large-scale traffic flow in an easy-to-access web environment, we implement the emulator using client-side GPU-accelerated techniques. Lastly, we close with a case study that visualizes traffic dynamics of two scenarios - an afternoon peak hour and a traffic accident - in Chattanooga, Tennessee. Our app visualizes the responses of traffic dynamics during different traffic conditions, and to the presence of the traffic accident at different spatial scales.
The electrochemical reduction of CO 2 (CO 2 R) to value-added products is an attractive technology for tackling the rising atmospheric CO 2 levels and storing intermittent renewable energy into chemical bonds. Fundamental understanding of CO 2 R has progressed significantly in recent years and is critical in the development of CO 2 R to liquid-fuel electrolyzers, where gas-diffusion electrodes (GDEs) have been shown to be key enabling architectures. Various designs have been proposed and studied in the literature to enhance overall selectivity, rates, and maximize the conversion of CO 2 , the latter of which is only now being recognized as a critical issue. In this respect, there is a need to explore the governing phenomena inherent in these architectures to enable optimization. Mathematical modeling is ideally suited to tackle and explore these multiphysics interactions and provide virtual design analysis. In this talk, we discuss modeling methodologies and physics inherent in these devices and present our recent modeling of GDEs for CO 2 reduction. We specifically examine the impacts of multiphase flow and related phenomena on overall cell performance. We then explore the performance and limitations of various cell designs guided by simulation results and examine potential methods for improving water management and tuning catalyst selectivity including the use of different anion-exchange and bipolar membranes. Finally, we discuss the disparities in local environments between aqueous and GDE devices and propose strategies to reduce the gap in knowledge between the two systems.
The electrochemical reduction of CO 2 (CO2R) to value-added products is an attractive technology for tackling the rising atmospheric CO 2 levels and storing intermittent renewable energy into chemical bonds. Fundamental understanding of CO 2 R has progressed significantly in recent years and is critical in the development of CO 2 R to liquid-fuel electrolyzers, where gas-diffusion electrodes (GDEs) have been shown to be key enabling architectures. Various designs have been proposed and studied in the literature to enhance overall selectivity, rates, and maximize the conversion of CO 2 , the latter of which is only now being recognized as a critical issue. In this respect, there is a need to explore the governing phenomena inherent in these architectures to enable optimization. Mathematical modeling is ideally suited to tackle and explore these multiphysics interactions and provide virtual design analysis. In this talk, we discuss modeling methodologies and physics inherent in these devices and present our recent modeling of GDEs for CO 2 reduction. Here, we specifically examine the impacts of multiphase flow and related phenomena on overall cell performance. We then explore the performance and limitations of various cell designs guided by simulation results and examine potential methods for improving water management and tuning catalyst selectivity including the use of different anion-exchange and bipolar membranes. Finally, we discuss the disparities in local environments between aqueous and GDE devices and propose strategies to reduce the gap in knowledge between the two systems.
FIERRO is a parallel C++ code designed to simulate fluid mechanics, heat transfer, and solid mechanics in two- and three-dimensional space. FIERRO is written to run on homogeneous (CPU) and heterogeneous (CPU+GPU) high performance computing machines. Fierro can aid a) modeling and design efforts that have historically relied on commercial implicit and explicit finite element codes, b) numerical methods research, c) manufacturing research, and d) computer science research. The code contains diverse numerical methods to solve the governing physics equations for both quasi-static and dynamic problems. Mathematical optimization solvers are coupled to the numerical methods to research topology and shape optimization that has application to additive manufacturing, and to create novel numerical approaches. Phase-field methods with micromechanical solvers are provided to simulate microstructure formation and evolution in manufacturing processes. The micromechanical solvers can also help research efforts create continuum-scale constitutive models for solids, as a function of the microstructure, in situ in a calculation or in a stand-alone manner. No physical data exists within the code.
FIERRO is a parallel C++ code designed to simulate fluid mechanics, heat transfer, and solid mechanics in two- and three dimensional space. FIERRO is written to run on homogeneous (CPU) and heterogeneous (CPU+GPU) high performance computing machines. Fierro can aid a) modeling and design efforts that have historically relied on commercial implicit and explicit finite element codes, b) numerical methods research, c) manufacturing research, and d) computer science research. The code contains diverse numerical methods to solve the governing physics equations for both quasi-static and dynamic problems. Mathematical optimization solvers are coupled to the numerical methods to research topology and shape optimization that has application to additive manufacturing, and to create novel numerical approaches. Phase-field methods with micromechanical solvers are provided to simulate microstructure formation and evolution in manufacturing processes. The micromechanical solvers can also help research efforts create continuum-scale constitutive models for solids, as a function of the microstructure, in situ in a calculation or in a stand-alone manner. No physical data exists within the code.
In the photonic design problem, a scientist or engineer chooses the physical parameters of a device to best match some desired device behavior. Many instances of the photonic design problem can be naturally stated as a mathematical optimization problem that is computationally difficult to solve globally. Because of this, several heuristic methods have been developed to approximately solve such problems. These methods often produce very good designs, and, in many practical applications, easily outperform ‘traditional’ designs that rely on human intuition. Yet, because these heuristic methods do not guarantee that the approximate solution found is globally optimal, the question remains of just how much better a designer might hope to do. This question is addressed by performance bounds or impossibility results, which determine a performance level that no design can achieve. We focus on algorithmic performance bounds, which involve substantial computation to determine. We illustrate a variety of both heuristic methods and performance bounds on two examples. In these examples (and many others not reported here) the performance bounds show that the heuristic designs are nearly optimal, and can be considered globally optimal in practice. This review serves to clearly set up the photonic design problem and unify existing approaches for calculating performance bounds, while also providing some natural generalizations and properties.
The ExaLearn miniGAN team (Ellis and Rajamanickam) have released miniGAN, a generative adversarial network(GAN) proxy application, through the ECP proxy application suite. miniGAN is the first machine learning proxy application in the suite (note: the ECP CANDLE project did previously release some benchmarks) and models the performance for training generator and discriminator networks. The GAN's generator and discriminator generate plausible 2D/3D maps and identify fake maps, respectively. miniGAN aims to be a proxy application for related applications in cosmology (CosmoFlow, ExaGAN) and wind energy (ExaWind). miniGAN has been developed so that optimized mathematical kernels (e.g., kernels provided by Kokkos Kernels) can be plugged into to the proxy application to explore potential performance improvements. miniGAN has been released as open source software and is available through the ECP proxy application website (https://proxyapps.exascaleproject.ordecp-proxy-appssuite/) and on GitHub (https://github.com/SandiaMLMiniApps/miniGAN). As part of this release, a generator is provided to generate a data set (series of images) that are inputs to the proxy application.
Energy storage has been proven to yield positive effects on planning, operation and control of electric grids. It has become a crucial task to properly model the energy storage systems (ESS) under the framework of grid optimization on transmission and distribution networks including microgrids. This paper presents a review on mathematical models and test cases of ESSs used for grid optimization studies, where the network constraints of power systems are included. The existing ESS models are mainly classified into two categories – linear and nonlinear models. The two main categories are further divided into several subcategories respectively; such as mixed-integer linear and convex nonlinear sub-categories. Based on the review and discussions, this paper aims at providing suggestions for choosing proper ESS models for specific grid optimization studies considering the chosen power network model.
The goal of our Early Career Research Project (ECRP) is to establish a modern mathematical foundation that will enable next-generation computational methods for polynomial approximation of high-dimensional systems, having a certain set of constraints, from a limited amount of noisy data. Such a foundation is critical to realizing the future potential of the DOE user facilities, and will ultimately empower scientists to address a fundamental question, namely, “how many realizations of a nonlinear manifold are required to recover the entire high-dimensional solution map, with optimal approximation guarantees and minimal computational cost?” The central theme of this effort aims to conquer this challenge by pioneering the development of extraordinarily innovative theoretical analysis and transformational non-intrusive computational methodologies. Such approaches will enable the reconstruction of the entire high-dimensional solution map, with accuracy comparable to the best approximation, while utilizing an optimal number of samples. During this reporting period we have made significant progress on four thrusts.
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. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.
The advancements in next-generation sequencing have made it possible to effectively detect somatic mutations, which has led to the development of personalized neoantigen cancer vaccines that are tailored to the unique variants found in a patient’s cancer. These vaccines can provide significant clinical benefit by leveraging the patient’s immune response to eliminate malignant cells. However, determining the optimal vaccine dose for each patient is a challenge due to the heterogeneity of tumors. To address this challenge, we formulate a mathematical dose optimization problem based on a previous mathematical model that encompasses the immune response cascade produced by the vaccine in a patient. We propose an optimization approach to identify the optimal personalized vaccine doses, considering a fixed vaccination schedule, while simultaneously minimizing the overall number of tumor and activated T cells. To validate our approach, we perform in silico experiments on six real-world clinical trial patients with advanced melanoma. We compare the results of applying an optimal vaccine dose to those of a suboptimal dose (the dose used in the clinical trial and its deviations). Our simulations reveal that an optimal vaccine regimen of higher initial doses and lower final doses may lead to a reduction in tumor size for certain patients. Our mathematical dose optimization offers a promising approach to determining an optimal vaccine dose for each patient and improving clinical outcomes.
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.
We introduce a class of variational actor-critic algorithms based on a variational formulation over both the value function and the policy. The objective function of the variational formulation consists of two parts: one for maximizing the value function and the other for minimizing the Bellman residual. Besides the vanilla gradient descent with both the value function and the policy updates, we propose two variants, the clipping method and the flipping method, in order to speed up the convergence. We also prove that, when the prefactor of the Bellman residual is sufficiently large, the fixed point of the algorithm is close to the optimal policy.