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 73 records · Page 4

Computational design of microarchitected porous electrodes for redox flow batteries

Porous electrodes are used as the core reactive component across electrochemical technologies. In flowing systems, controlling the fluid distribution, species transport, and reactive environment is critical to attaining high performance. However, conventional electrode materials like felts and papers provide few opportunities for precise engineering of the electrode and its microstructure. To address these limitations, architected electrodes composed of unit cells with spatially varying geometry determined via computational optimization are proposed. Resolved simulation is employed to develop a homogenized description of the constituent unit cells. These effective properties serve as inputs to a continuum model for the electrode when used in the negative half-cell of a vanadium redox flow battery. Porosity distributions minimizing power loss are then determined via computational design optimization to generate architected porosity electrodes. The architected electrodes are compared to bulk, uniform porosity electrodes and found to lead to increased power efficiency across operating flow rates and currents. The design methodology is further used to generate a scaled-up electrode with comparable power efficiency to the bench-scale systems. Finally, the variable porosity architecture and computational design methodology presented here thus offers a novel pathway for automatically generating spatially engineered electrode structures with improved power performance.

25 ENERGY STORAGE↗

Adaptive building load control to enable high penetration of solar photovoltaic generation

This paper investigates the ability of a collection of deferrable heating, ventilation and air conditioning (HVAC) loads to directly emulate energy storage devices (ESD), that is, to absorb any low frequency fluctuations in solar generation. We find the optimal number of aggregated HVAC loads to absorb solar fluctuation in the same frequency band based on frequency analysis. To guarantee quality of service in afleet of residential buildings, an optimization problem is formed to compute optimal schedule of the HVAC loads considering temperature comfort band and available solar generation. By minimizing the tracking error between solar generation and total consumption, the proposed method also quantifies the minimum capacity of ESD (battery or fly-wheel) . The simulation results show that the proposed techniques are able to achieve good solar tracking performance as well as obtain a minimal ESD capacity. Therefore, we show that most of the renewable generation can be consumed locally through an intelligent coordination of HVAC loads, their impacts on the grid would be minimal and the required ESD capacity can be minimized.

Dong, Jin↗

Blood flow imaging by optimal matching of computational fluid dynamics to 4D-flow data

Three-dimensional, time-resolved blood flow measurement (4D-flow) is a powerful research and clinical tool, but improved resolution and scan times are needed. Therefore, this study aims to (1) present a postprocessing framework for optimization-driven simulation-based flow imaging, called 4D-flow High-resolution Imaging with a priori Knowledge Incorporating the Navier-Stokes equations and the discontinuous Galerkin method (4D-flow HIKING), (2) investigate the framework in synthetic tests, (3) perform phantom validation using laser particle imaging velocimetry, and (4) demonstrate the use of the framework in vivo. An optimizing computational fluid dynamics solver including adjoint-based optimization was developed to fit computational fluid dynamics solutions to 4D-flow data. Synthetic tests were performed in 2D, and phantom validation was performed with pulsatile flow. Reference velocity data were acquired using particle imaging velocimetry, and 4D-flow data were acquired at 1.5 T. In vivo testing was performed on intracranial arteries in a healthy volunteer at 7 T, with 2D flow as the reference. Results Synthetic tests showed low error (0.4%-0.7%). Phantom validation showed improved agreement with laser particle imaging velocimetry compared with input 4D-flow in the horizontal (mean -0.05 vs -1.11 cm/s, P < .001; SD 1.86 vs 4.26 cm/s, P < .001) and vertical directions (mean 0.05 vs -0.04 cm/s, P = .29; SD 1.36 vs 3.95 cm/s, P < .001). In vivo data show a reduction in flow rate error from 14% to 3.5%. Phantom and in vivo results from 4D-flow HIKING show promise for future applications with higher resolution, shorter scan times, and accurate quantification of physiological parameters.

4D-flow MRI↗

Dielectric Resonator Design for Low Power and Low Temperature Microwave Plasma

Waveguide-based microwave plasmas generally operate at high temperatures (2000 - 6000K)[1], making it difficult to directly interface solid materials with the plasma without significant thermal damage. Dielectric microwave resonators (DMRs), long studied for wave-based manipulation of electromagnetic radiation for telecom and optics, can focus radiation to extremely small mode volumes, creating intense localized fields with low-power input.[2] This phenomenon can be used for applications ranging from efficient plasma electronics to near-ambient plasma-materials interactions. Such DMR-based plasmas have been demonstrated a handful of times in the literature, but the majority of research towards this utilize the lowest frequency resonance mode.[3], [4], [5] By carefully controlling the geometry of cylindrical resonators, a variety of electromagnetic modes can be excited. In this work, COMSOL Multiphysics simulations are used to study the electric field enhancement and absorption properties of CaTiO3 DMRs as a function of geometry and excitation frequency. Whereas previous studies have utilized the HEM111 resonance frequency to drive low power plasma excitation, we find that higher order resonance frequencies are more effective at field enhancement and result in less power loss within the dielectric material, hence less wasted heating. The effectiveness of these modes is also geometry dependent and can be computationally optimized for plasma generation. Complementing these computational efforts, we demonstrate a new closed-system reactor design built in a WR-650 waveguide and experimentally demonstrate the formation of atmospheric argon microwave plasma using < 30 W input power on DMR dimers. We observe a shifting resonance frequency as the DMRs heat in response to microwave excitation and develop a Python-based lock-in mechanism to effectively track the DMR resonance over time, leading to stable plasma operation. We use infrared thermal imaging to monitor the temperature of the DMR dimers and surrounding quartz chamber, demonstrating thermal temperatures < 60 degreesC. Finally, we utilize optical emission spectroscopy (OES) to probe the plasma properties as a function of the resonance mode.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

Halappanavar, Mahantesh↗

Explosively driven Richtmyer–Meshkov instability jet suppression and enhancement via coupling machine learning and additive manufacturing

The ability to control the behavior of fluid instabilities at material interfaces, such as the shock-driven Richtmyer–Meshkov instability, is a grand technological challenge with a broad number of applications ranging from inertial confinement fusion experiments to explosively driven shaped charges. In this work, we use a linear-geometry shaped charge as a means of studying methods for controlling material jetting that results from the Richtmyer–Meshkov instability. A shaped charge produces a high-velocity jet by focusing the energy from the detonation of high explosives. The interaction of the resulting detonation wave with a hollowed cavity lined with a thin metal layer produces the unstable jetting effect. By modifying the characteristics of the detonation wave prior to striking the lined cavity, the kinetic energy of the jet can be enhanced or reduced. Modifying the geometry of the liner material can also be used to alter jetting properties. We apply optimization methods to investigate several design parameterizations for both enhancing or suppressing the shaped-charge jet. This is accomplished using 2D and 3D hydrodynamic simulations to investigate the design space that we consider. We also apply new additive manufacturing methods for producing the shaped-charge assemblies, which allow for the experimental testing of complicated design geometries obtained through computational optimization. We present a direct comparison of our optimized designs with experimental results carried out at the High Explosives Application Facility at Lawrence Livermore National Laboratory.

36 MATERIALS SCIENCE↗

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗

TEAM Project Review, Year 2

This report summarizes our research activities within the TEAM project between December 2020 and December 2021, funded by the ASCR Advanced Research in Quantum Computing program. During the reporting period the LLNL-MSU team has made progress on several fronts. An overarching goal of the team is to provide a comprehensive suite of software tools that can be used for the Characterize-Optimize-Compute loop needed to implement and execute algorithms on quantum devices. We are concurrently developing lightweight solvers that can be used on desktop computers to find optimal control pulses and to characterize small quantum systems (consisting of a few transmons and cavities). However, desktop computers are insufficient for simulating and characterizing larger quantum systems. We have therefore also developed parallel, distributed memory, simulators and optimization solvers, both for open and closed quantum systems. These parallel solvers have, for example, been used to study quantum optimal control for pure-state preparation, utilizing 1000’s of cores on a modern high-performance computing (HPC) platform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Review of multi-fidelity models

Multi-fidelity models provide a framework for integrating computational models of varying complexity, allowing for accurate predictions while optimizing computational resources. These models are especially beneficial when acquiring high-accuracy data is costly or computationally intensive. This review offers a comprehensive analysis of multi-fidelity models, focusing on their applications in scientific and engineering fields, particularly in optimization and uncertainty quantification. It classifies publications on multi-fidelity modeling according to several criteria, including application area, surrogate model selection, types of fidelity, combination methods and year of publication. The study investigates techniques for combining different fidelity levels, with an emphasis on multi-fidelity surrogate models. Here this work discusses reproducibility, open-sourcing methodologies and benchmarking procedures to promote transparency. The manuscript also includes educational toy problems to enhance understanding. Additionally, this paper outlines best practices for presenting multi-fidelity-related savings in a standardized, succinct and yet thorough manner. The review concludes by examining current trends in multi-fidelity modeling, including emerging techniques, recent advancements, and promising research directions.

42 ENGINEERING↗

Non-Empirical and Self-Interaction Corrections for DFTB: Towards Accurate Quantum Simulations for Large Mesoscale Systems (Final Report)

This project was comprised of two complementary (but parallel) thrusts: (1) implementing massively-parallelized computing hardware (with new computational hardware that may replace GPUs) in the density functional tight binding (DFTB) approach and (2) developing new capabilities in DFTB to calculate the electronic structure and dynamics of large chemical systems. While classical molecular dynamics can handle hundreds of thousands of atoms, it cannot provide a first-principles based description of chemical systems at the quantum level. At the other extreme, conventional Kohn-Sham DFT methods can probe the true quantum mechanical nature of chemical systems; however, these methods cannot tackle the large sizes and length scales relevant to dynamics simulations of realistic systems. The DFTB formalism utilized in this project provides a viable approach for probing these large systems at a quantum mechanical level of detail. However, to utilize the DFTB approach for accurate calculations of electronic properties, it is crucial to incorporate quantum-based corrections in DFTB since exchange-correlation effects can still remain very strong in these large systems. At the same time, enhancing the computational efficiency of DFTB is also essential since optimal computational performance is required for addressing the large size scales associated with realistic chemical systems. As such, the new non-empirical corrections and computing hardware enhancements implemented in this project will enable accurate and computationally efficient approaches to directly probe electronic properties in these large, complex systems.

36 MATERIALS SCIENCE↗

Towards an Agent-Based Blackboard System for Reactor Design Optimization

The field of reactor design is rich with opportunities for applications of computational optimization algorithms; these applications can range from preliminary core design to reactor shuffling patterns. Many of these schemes rely on sets of previously generated solutions (sometimes referred to as “generations”) to inform future decisions. While it is important to build upon prior knowledge, this process requires a full generation of solutions to be formed before future solutions can be examined. Rather than relying on a generational scheme to perform an optimization, we propose using an agent-based approach in conjunction with a blackboard framework for performing reactor design optimizations. Utilizing an agent-based approach allows agents to perform tasks independently, while retaining the ability to build off of previous solutions. We develop an agent-based blackboard system (ABBS) for determining the Pareto front (PF) in sodium fast reactor design optimization problems and compared this with the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). Our goal is to evaluate the viability of the ABBS in producing a PF that is comparable with the NSGA-II algorithm. The design space consists of the fuel height, fuel smear, and plutonium fraction in the core, and we seek to minimize the reactivity swing and plutonium mass, while maximizing the burnup. The diversity, coverage, and spread of the PFs generated by the two methods are examined, and the ABBS is able to converge to the same PF as the NSGA-II algorithm. These results show that the ABBS is able to find optimal designs that are similar to those found by the NSGA-II algorithm. We conclude our study by applying the ABBS to the design of a sodium-cooled fast reactor to dispose of weapons-grade plutonium. The ABBS finds a core design that can burn upwards of 17.5 kg of weapons-grade plutonium per year and degrade an additional 195 kg of weapons-grade plutonium per year into non-weapons-grade material.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Generating Euler Diagrams Through Combinatorial Optimization

Abstract Can a given set system be drawn as an Euler diagram? We present the first method that correctly decides this question for arbitrary set systems if the Euler diagram is required to represent each set with a single connected region. If the answer is yes, our method constructs an Euler diagram. If the answer is no, our method yields an Euler diagram for a simplified version of the set system, where a minimum number of set elements have been removed. Further, we integrate known wellformedness criteria for Euler diagrams as additional optimization objectives into our method. Our focus lies on the computation of a planar graph that is embedded in the plane to serve as the dual graph of the Euler diagram. Since even a basic version of this problem is known to be NP‐hard, we choose an approach based on integer linear programming (ILP), which allows us to compute optimal solutions with existing mathematical solvers. For this, we draw upon previous research on computing planar supports of hypergraphs and adapt existing ILP building blocks for contiguity‐constrained spatial unit allocation and the maximum planar subgraph problem. To generate Euler diagrams for large set systems, for which the proposed simplification through element removal becomes indispensable, we also present an efficient heuristic. We report on experiments with data from MovieDB and Twitter. Over all examples, including 850 non‐trivial instances, our exact optimization method failed only for one set system to find a solution without removing a set element. However, with the removal of only a few set elements, the Euler diagrams can be substantially improved with respect to our wellformedness criteria.

Computer Science↗