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,693 records · Page 94

Evaluation and optimization of the performance of frame geometries for lithium-ion battery application by computer simulation

Tailoring battery geometries is essential for many applications, as geometry influences the delivered capacity value. Two geometries, frame and conventional, have been studied and, for a given scan rate of 330C, the square frame shows a capacity value of 305,52 Ahm{sup −2}, which is 527 times higher than the one for the conventional geometry for a constant the area of all components.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Optimal sensor network design for multi-scale, time-varying differential algebraic equation systems: Application to an entrained-flow gasifier refractory brick

An algorithm for optimal sensor network design for multi-scale, time-varying differential algebraic equation systems with non-separable dynamics is presented. As the process is time-varying, an integral normalized posterior error covariance of a multi-scale filter is minimized to obtain the optimal sensor locations. For reducing the computational cost, an adaptive sampling rate approach is considered for the slowly-varying variables. The algorithm is applied to a smart refractory brick with embedded sensors as part of an entrained-flow gasifier. Thermistors and interdigital capacitors are considered as candidate measurement technologies for estimating temperature and slag penetration profile along the gasifier wall. Finally, when the optimal set of sensors obtained from the algorithm is used for estimating temperature and slag penetration profiles in a multi-scale Kalman filter framework, satisfactory estimates are obtained despite high measurement noise and model mismatch.

42 ENGINEERING↗

Exploiting Power Flow Manifold to Solve AC Optimal Power Flow

AC optimal power flow has proven difficult to solve with interior point methods on GPUs. This is largely due to challenging linear algebra problems that current state of the art massively parallel linear solvers struggle with. However, the advent of Riemannian optimization techniques and the fact that the power flow equations form a smooth manifold present an alternative approach. In this talk, we present the basics of Riemannian optimization techniques in which optimization is done directly on a manifold. Then we present computational results showing that Riemannian techniques are capable of producing solutions of comparable quality as interior point methods.

AC optimal power flow↗

A digital twin platform for building performance monitoring and optimization: Performance simulation and case studies

Advancements in sensor technology, data analytics, affordable compute, and communication infrastructure have paved the way for Digital Twin technology in optimizing building operations and controls. This study presents the development of an open and interoperable web-based Digital Twin platform for integrating diverse data streams and facilitating effective user interactions. The platform utilizes modern technologies for the web framework and time-series data management, ensuring scalability and responsiveness. The backend supports seamless integration of diverse data sources and emulators, incorporating data from building sensors and meters, external weather Application Programming Interfaces, and advanced EnergyPlus simulation models of the building and its energy systems including the Distributed Energy Resources that are formulated in Functional Mockup Units. A simulation case study was conducted with FlexLab, a test facility on Lawrence Berkeley National Laboratory campus. The case study includes normal operations, Distributed Energy Resource integration, and power outage scenarios, to illustrate the Digital Twin’s ability to provide critical insights into energy performance and thermal resilience. The results demonstrated the platform’s potential as a decision-support tool for optimizing building energy performance and enhancing resilience against extreme weather events. Future work will focus on deploying the Digital Twin platform to a real building for field validation, extending its capabilities to cover more scenarios such as bidirectional Electric Vehicle interactions, and enhancing user engagement.

EnergyPlus↗

Multi-objective optimization of a PCHE-type intermediate heat exchanger using genetic algorithms

For the advanced nuclear reactor systems and power conversion units, it is important to optimize the design of intermediate heat exchangers (IHXs) which transfer heat from the primary loop to the secondary or intermediate loop. For a multi-objective optimization problem, a printed circuit heat exchanger-type IHX with zigzag and S-shaped fin channels is selected to be optimized in terms of both the total cost and the heat exchanger thermal effectiveness using genetic algorithms. A computer code is developed to search a set of optimized designs of the zigzag channel geometry. It is found that among the Pareto-optimal solutions, the total cost is approximately linearly related to the thermal effectiveness between 88 and 95% while it rises rapidly after the effectiveness exceeds 95%. An optimal flow channel diameter is also determined through the optimization. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Accelerating computational fluid dynamics simulation of post-combustion carbon capture modeling with MeshGraphNets

Packed columns are commonly used in post-combustion processes to capture CO 2 emissions by providing enhanced contact area between a CO 2 -laden gas and CO 2 -absorbing solvent. To study and optimize solvent-based post-combustion carbon capture systems (CCSs), computational fluid dynamics (CFD) can be used to model the liquid–gas countercurrent flow hydrodynamics in these columns and derive key determinants of CO 2 -capture efficiency. However, the large design space of these systems hinders the application of CFD for design optimization due to its high computational cost. In contrast, data-driven modeling approaches can produce fast surrogates to study large-scale physics problems. We build our surrogates using MeshGraphNets (MGN), a graph neural network framework that efficiently learns and produces mesh-based simulations. We apply MGN to a random packed column modeled with over 160K graph nodes and a design space consisting of three key input parameters: solvent surface tension, inlet velocity, and contact angle. Our models can adapt to a wide range of these parameters and accurately predict the complex interactions within the system at rates over 1700 times faster than CFD, affirming its practicality in downstream design optimization tasks. This underscores the robustness and versatility of MGN in modeling complex fluid dynamics for large-scale CCS analyses.

97 MATHEMATICS AND COMPUTING↗

Accelerating DCA++ (Dynamical Cluster Approximation) Scientific Application on the Summit supercomputer

Optimizing scientific applications on today’s accelerator-based high performance computing systems can be challenging, especially when multiple GPUs and CPUs with heterogeneous memories and persistent non-volatile memories are present. An example is Summit, an accelerator-based system at the Oak Ridge Leadership Computing Facility (OLCF) that is rated as the world’s fastest supercomputer to-date. New strategies are thus needed to expose the parallelism in legacy applications, while being amenable to efficient mapping to the underlying architecture.In this paper we discuss our experiences and strategies to port a scientific application, DCA++, to Summit. DCA++ is a highperformance research application that solves quantum manybody problems with a cutting edge quantum cluster algorithm, the dynamical cluster approximation.Our strategies aim to synergize the strengths of the different programming models in the code. These include: (a) streamlining the interactions between the CPU threads and the GPUs, (b) implementing computing kernels on the GPUs and decreasing CPU-GPU memory transfers, (c) allowing asynchronous GPU communications, and (d) increasing compute intensity by combining linear algebraic operations.Full-scale production runs using all 4600 Summit nodes attained a peak performance of 73.5 PFLOPS with a mixed precision implementation.We observed a perfect strong and weak scaling for the quantum Monte Carlo solver in DCA++, while encountering about 2× input/output (I/O) and MPI communication overhead on the time-to-solution for the full machine run. Our hardware agnostic optimizations are designed to alleviate the communication and I/O challenges observed, while improving the compute intensity and obtaining optimal performance on a complex, hybrid architecture like Summit.

Balduzzi, Giovanni↗

Development of Corrosion- and Erosion-Resistant Coatings for Advanced Ultra-Supercritical Materials

This final report summarized the research efforts and major findings of the Phase I Project “Development of Corrosion- and Erosion-Resistant Coatings for Advanced Ultra-Supercritical Materials”, for the period of October 1, 2019 – Sept. 30, 2021. This project is a collaborative endeavor between Tennessee Tech University, Purdue University, Oak Ridge National Laboratory, Siemens Corporation, and Eastern Plating, LLC, aiming at improving the durability and lifetime of high-pressure (HP) steam turbine blades in advanced ultra-supercritical (A-USC) coal-fired power plants through the development of corrosion/erosion-resistant coatings manufactured via a low-cost electrolytic codeposition process. While Tribaloy alloy T-400C was identified by the U.S. A-USC Materials Consortium as a promising coating composition, further composition optimization is needed to enhance its corrosion and erosion resistance for protecting the A-USC Ni-base turbine components. An integrated computational and experimental approach was employed to optimize coating composition/microstructure and processing parameters. In order to identify candidate coating compositions that could offer balanced properties, thermodynamic calculations were performed to explore the γ+Laves composition space in the Co-Ni-Cr-Mo-Si system with different alloying additions at 600-800 °C. Guided by the calculation results, experimental assessment of selected alloys led to the development of a new generation of Tribaloy compositions with the optimal levels of Cr, Mo and Si, reactive element (e.g., 0.4-0.6 wt.% Y) and other alloying additions. The low-cost and non-line-of-sight electro-codeposition process was employed to deposit a Ni(Co)-CrMoSiY composite coating on commercial Haynes 282 (H282) Ni-base alloy. A diffusion treatment was subsequently applied to convert the composite to the Tribaloy-type coating. Both the codeposition parameters and heat treatment conditions were varied to achieve the desired coating composition, microstructure and phase constituents. In addition, since additive manufacturing (AM) may be an alternative cost-saving option for potential A-USC turbine repair, laser direct deposition was explored to fabricate the H282 alloy with minimal defects. The electro-codeposited Tribaloy coating was also applied to the AM H282 substrate to demonstrate the viability of the coating process in improving the surface finish of AM alloys. Both high-temperature oxidation performance and solid particle erosion (SPE) resistance of model alloys and electro-codeposited coatings were evaluated. About 25 model alloys with various Cr/Mo ratios and reactive element levels, as well as partial substitution of Mo with Nb were evaluated with regard to their oxidation resistance in both air and pure steam at 760-800°C. Compositions based on Ni(Co)-20Cr-18Mo-2.6Si-0.6Y (wt.%) showed significantly improved oxidation resistance over the baseline T400-C. Based on the alloy development results, three generations of new Tribaloy coatings (Gen-1, Gen-2, and Gen-3) with various Mo/Cr contents and Y levels were prepared via electro-codeposition and their microstructure/performance were evaluated. Outstanding air and steam oxidation resistance was achieved for the Gen-2 and Gen-3 coatings. Furthermore, while the SPE resistance of the coatings depended on many factors such as temperature, environment, erodent, velocity and impact angle, the coated samples exhibited similar or better SPE resistance compared to the H282 substrate when magnetite was used as erodent (which is a realistic erodent in A-USC steam turbines). The new Tribaloy coatings also had good long-term compatibility with the H282 alloy substrate. The two large-sized rotating barrels were designed, constructed, and employed to coat dummy HP blades. Uniform coating thickness and microstructure were achieved at various blade locations. Also, a preliminary techno-economic analysis of the proposed coating process was conducted to quantify the cost-effectiveness and to assess the commercial viability of the corrosion- and erosion-resistant coatings. It is estimated that a cost reduction of ~30% could be achieved with the electro-codeposition coating process over the state-of-the-art high velocity oxygen fuel (HVOF) thermal spray. Compared to the leading Tribaloy coating technologies such as HVOF and plasma transfer alloying, electro-codeposition based process has advantages such as low-cost process equipment, uniform deposition even for complex shapes, low levels of contaminants/porosities, reduction of powder waste, and potentially better surface finish and longer turbine service life. The Phase 1 study has demonstrated that it is feasible to develop an electro-codeposited Tribaloy coating with balanced corrosion and erosion properties, even though additional research efforts such as further coating process scale-up and longer-term performance evaluation under realistic A-USC conditions are clearly needed.

20 FOSSIL-FUELED POWER PLANTS↗

Exploring strongly correlated quantum spin systems with quantum computers

At inception, quantum annealing leveraged quantum mechanics for classical optimization tasks. However, as machine coherence increases, the realization of quantum spin systems has emerged as an even more fruitful application of this computational model. Alternatives to the standard gate model deserve exploration, to achieve useful quantum advantage via analog quantum computing. The recent demonstration of so-called coherent quantum annealing with 1,000s of qubits, further expands the potential for this hardware to explore quantum system dynamics where the effects of quantum fluctuations can be carefully controlled and observed directly. Implementing existing celebrated spin models—or in fact new and dedicated ones—into quantum annealers will lead to observation and detection of quantum phenomena not yet observed, or not visualized directly, in experimental physics laboratories. Rather than computing or simulating quantum systems, these quantum computers allow one to simply build quantum systems, and experiment on them in an uniquely controlled way, with characterization down to the constitutive degree of freedom. This provides an unprecedented opportunity for understanding the physics of quantum spin systems. Keywords: Theoretical physics currently abounds of interesting theoretical spin models to explore frustration, strongly correlated spins, spin liquids, fractionalized excitations, and topological matter. However enticing, such models are generally only weak proxies for the properties of actual materials. In quantum annealers these models could be realized and experimented upon. Moreover, many more realistic models of such materials could be realized in quantum annealers. Employed in this way, quantum annealers provide an extraordinary versatile platform to explore quantum effects that are hard to find, detect, and characterize in natural materials.

36 MATERIALS SCIENCE↗

Approximate Scheduling of DERs with Discrete Complex Injections

Rapid penetration of renewable energy based Distributed Energy Resources (DER) has the potential to exacerbate the challenges inherent in grid frequency and voltage regulation. However, their real time controllability can be leveraged to not only mitigate such challenges, but improve the economics and quality of grid operations. A plethora of DER scheduling algorithms have been developed for fast and efficient scheduling of these resources. These algorithms schedule the complex - real and reactive power injected into (or drawn from) the grid by the DERs under various cost objective functions and grid constraints. However, a vast majority of such algorithms assume the feasible range of power injections to be continuous. In reality, the control options available for several DERs form a discrete space. This implies that the feasible range of power injections also forms a discrete space. This makes DER scheduling an NP-hard problem. Integer/Mixed Integer program based algorithms, which guarantee optimality in the objective value, have been developed. But these are prohibitively expensive in terms of computational time requirements. On the other hand, fast heuristic based solutions have also been developed. But as they do not provide any guarantee on the optimality of the objective, or on satisfying the constraints, they are unreliable for grid operations. Recent works have developed approximation algorithms which offer the best of both the approaches above: (near) optimality and low computational complexity, both of which are governed by a user defined accuracy parameter ϵ. In this work, we significantly improve upon such existing works by developing an approximation algorithm which schedules DERs with complex injections (as opposed to only real injection) and whose runtime is polynomial (as opposed to exponential) in 1/ϵ. We provide theoretical analysis and support them with experimental results to validate the guarantees provided by our approximation algorithm.

14 SOLAR ENERGY↗

Multigrid solution of a distributed optimal control problem constrained by the Stokes equations

We construct multigrid preconditioners to accelerate the solution process of a linear-quadratic optimal control problem constrained by the Stokes system. The first order optimality conditions of the control problem form a linear system (the KKT system) connecting the state, adjoint, and control variables. Our approach is to eliminate the state and adjoint variables by essentially solving two Stokes systems, and to construct efficient multigrid preconditioners for the Schur-complement of the block associated with the state and adjoint variables. These multigrid preconditioners are shown to be of optimal order with respect to the convergence properties of the discrete methods used to solve the Stokes system. In particular, the number of conjugate gradient iterations is shown to decrease as the resolution increases, a feature shared by similar multigrid preconditioners for elliptic constrained optimal control problems.

97 MATHEMATICS AND COMPUTING↗

ENGINE COMBUSTION SYSTEM OPTIMIZATION USING CFD AND MACHINE LEARNING: A METHODOLOGICAL APPROACH

Gasoline compression ignition (GCI) engines are considered an attractive alternative to traditional spark-ignition and diesel engines. In this work, a Machine Learning-Grid Gradient Algorithm (ML-GGA) approach was developed to optimize the performance of internal combustion engines. Machine learning (ML) offers a pathway to transform complex physical processes that occur in a combustion engine into compact informational processes. The developed ML-GGA model was compared with a recently developed Machine learning Genetic Algorithm (ML-GA). Detailed investigations of optimization solver parameters and variables limits extension were performed in the present ML-GGA model to improve the accuracy and robustness of the optimization process. Detailed descriptions of the different procedures, optimization tools and criteria that must be followed for a successful output are provided here. The developed ML-GGA approach was used to optimize the operating conditions (case 1) and the piston bowl design (case 2) of a heavy-duty diesel engine running on a gasoline fuel with a Research Octane Number (RON) of 80. The ML-GGA approach yielded > 2% improvements in the merit function, compared to the optimum obtained from a thorough computational fluid dynamics (CFD) guided system optimization. The predictions from the ML-GGA approach were validated with engine CFD simulations. This study demonstrates the potential of ML-GGA to significantly reduce the time needed for optimization problems, without loss in accuracy compared to traditional approaches.

engine optimization↗

SU-E-T-806: Very Fast GPU-Based IMPT Dose Computation

Purpose: Designing particle therapy treatment plans is a dosimetrist-in-the-loop optimization wherein the conflicting constraints of achieving a desired tumor dose distribution must be balanced against the need to minimize the dose to nearby OARs. IMPT introduces an additional, inner, numerical optimization step in which the dosimetrist’s current set of constraints are used to determine the weighting of beam spots. Very fast dose calculations are needed to enable the dosimetrist to perform many iterations of the outer optimization in a commercially reasonable time. Methods: We have developed a GPU-based convolution-type dose computation algorithm that more accurately handles heterogeneities than earlier algorithms by redistributing energy from dose computed in a water volume. The depth dependence of the beam size is handled by pre-processing Bragg curves using a weighted superposition of Gaussian bases. Additionally, scattering, the orientation of treatment ports, and the non-parallel propagation of beams are handled by large, but sparse, energy-redistribution matrices that implement affine transforms. Results: We tested our algorithm using a brain tumor dataset with 1 mm voxels and a single treatment port from the patient’s anterior through the sinuses. The resulting dose volume is 100 × 100 × 230 mm with 66,200 beam spots on a 3 × 3 × 2 mm grid. The dose computation takes <1 msec on a GeForce GTX Titan GPU with the Gamma passing rate for 2mm/2% criterion of 99.1% compared to dose calculated by an alternative dose algorithm based on pencil beams. We will present comparisons to Monte Carlo dose calculations. Conclusion: Our high-speed dose computation method enables the IMPT spot weights to be optimized in <1 second, resulting in a nearly instantaneous response to user changes to dose constraints. This permits the creation of higher quality plans by allowing the dosimetrist to evaluate more alternatives in a short period of time.

60 APPLIED LIFE SCIENCES↗

Artificial Intelligence for Data Center Operations (AIOps): Cooperative Research and Development (Final Report)

High performance computing data centers will increasingly need to rely on automation to keep pace with exascale growth in compute capability and to manage and optimize the data center environment and facility resources. Artificial intelligence and machine learning approaches provide the means to improve HPC data center operational efficiency, by learning historical trends and training models to operate on real-time data collected from both IT and facilities sources. NREL has developed methods of real-time collection, aggregation and streaming of these data in the ESIF HPC Data Center and has collected a significant dataset of relevant metrics across computer systems, racks, environmental, building and utility sources for research into various predictive analytics problems. HPE's Advanced Technology Group (ATG) is doing comprehensive research into exascale monitoring and management for High Performance Computing (HPC) systems (hereinafter HPE's Data Monitoring/ Management Technology). NREL and HPE will collaborate to add Artificial Intelligence (AI) to NREL's real-time data collection/ aggregation/ streaming system and HPE's Data Monitoring/ Management System, with the goal of improving the operational efficiency of NREL's Energy Systems Integration Facility (ESIF) HPC Data Center through data analytics on both historical and real-time data from IT systems and facilities operations. This collaboration will consist of efforts in Data Management, Data Analytics, and AI/ML Optimization for both manual and autonomous intervention in data center operations. This will be a multi-year, multi-staged effort with a goal towards building capabilities for an Advanced Smart Facility, and demonstration of these techniques in the NREL ESIF HPC Data Center.

97 MATHEMATICS AND COMPUTING↗

RAJA Performance Suite

The RAJA Performance Suite is designed to evaluate performance of the RAJA performance portability library on a wide variety of important high performance computing (HPC) algorithmic lulmels. These kernels assess compiler optimizations and various parallel programming model backends accessible through RAJA, such as OpenMP, CUDA, etc. The Initial version of the suite contains 25 computational kernels, each of which appears in 6 variants: Baseline SequcntiaJ, RAJA SequentiaJ, Baseline OpenMP, RAJA OpenMP, Baseline CUDA, RAJA CUDA. All variants of each kernel perform essentially the same mathematical operations and the loop body code for each kernel is identical across all variants. There are a few kernels, such as those that contain reduction operations, that require CUDA-specific coding for their CUDA variants. ActuaJ computer instructions executed and how they run in parallel differs depending on the parallel programming model backend used and which optimizations are perfonned by the compiler used to build the Perfonnance Suite executable. The Suite will be used primarily by RAJA developers to perform regular assessments of RAJA performance across a range of hardware platforms and compilers as RAJA features are being developed. It will also be used by LLNL hardware and software vendor panners for new defining requirements for future computing platform procurements and acceptance testing. In particular, the RAJA Performance Suite will be used for compiler acceptance testing of the upcoming CORAUSierra machine {initial LLNL delivery expected in late-2017/early 2018) and the CORAL-2 procurement. The Suite will aJso be used to generate concise source code reproducers of compiler and runtime issues we uncover so that we may provide them to relevant vendors to be fixed.

Hornung, RichardD.↗

Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components

Here, we develop a manifold sampling algorithm for the minimization of a nonsmooth composite function $f \triangleq \psi + h \circ F$ when $\psi$ is smooth with known derivatives, $h$ is a known, nonsmooth, piecewise linear function, and $F$ is smooth but expensive to evaluate. The trust-region algorithm classifies points in the domain of $h$ as belonging to different manifolds and uses this knowledge when computing search directions. Since $h$ is known, classifying objective manifolds using only the values of $F$ is simple. We prove that all cluster points of the sequence of the manifold sampling algorithm iterates are Clarke stationary; this holds although points evaluated by the algorithm are not assumed to be differentiable and when only approximate derivatives of $F$ are available. Numerical results show that manifold sampling using zeroth-order information about $F$ is competitive with algorithms that employ exact subgradient values from $\partial f$.

97 MATHEMATICS AND COMPUTING↗

Large-Scale Stochastic Optimization for Unit Commitment and Economic Dispatch

Our FY 2012 LDRD research on stochastic optimization with its application in power grid planning and operations has advanced the state-of-the-art of this area in the following aspects: (1) Deploying stochastic unit commitment on large real-world applications, (2) Stochastic optimization coupled with real-time production costsimulation (interleaved), and (3) Real-time stochastic optimization with rolling-horizon look-ahead. In conjunction, a number of computational experiments have been performed to evaluate the capability of the latest stochastic optimization software and explore opportunities for future research. In what follows, we discuss each of these contribution areas, including the results of our computational experiments and their implications on the scalability and solvability of large-scale stochastic optimization models.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Gyrokinetic particle-in-cell optimization on emerging multi- and manycore platforms

The next decade of high-performance computing (HPC) systems will see a rapid evolution and divergence of multi- and manycore architectures as power and cooling constraints limit increases in microprocessor clock speeds. Understanding efficient optimization methodologies on diverse multicore designs in the context of demanding numerical methods is one of the greatest challenges faced today by the HPC community. In this paper, we examine the efficient multicore optimization of GTC, a petascale gyrokinetic toroidal fusion code for studying plasma microturbulence in tokamak devices. For GTC’s key computational components (charge deposition and particle push), we explore efficient parallelization strategies across a broad range of emerging multicore designs, including the recently-released Intel Nehalem-EX, the AMD Opteron Istanbul, and the highly multithreaded Sun UltraSparc T2+. We also present the first study on tuning gyrokinetic particle-in-cell (PIC) algorithms for graphics processors, using the NVIDIA C2050 (Fermi). Our work discusses several novel optimization approaches for gyrokinetic PIC, including mixed-precision computation, particle binning and decomposition strategies, grid replication, SIMDized atomic floating-point operations, and effective GPU texture memory utilization. Overall, we achieve significant performance improvements of 1.3–4.7× on these complex PIC kernels, despite the inherent challenges of data dependency and locality. Finally, our work also points to several architectural and programming features that could significantly enhance PIC performance and productivity on next-generation architectures.

97 MATHEMATICS AND COMPUTING↗