Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational Design”

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 757 records · Page 42

Improved Chemical Kinetics and Algorithms for More Accurate, Faster Simulations

Internal combustion engine design is increasingly driven by computational models used to predict change in performance as a result of design changes, which previously would have been made by limited intuition or expensive and time-consuming physical testing. Improved model capabilities shorten design cycles and enable the production of cleaner and more efficient engines. This project focuses on advancing the state-of-the-art in internal combustion engine simulations. The overarching goal is to enable predictive models and reduced time to solution for simulations that impact combustion engine design.

02 PETROLEUM↗

Improved Chemical Kinetics and Algorithms for More Accurate, Faster Simulations

Internal combustion engine design is increasingly driven by computational models used to predict change in performance due to change of design. The design process previously depended on limited intuition and expensive and time-consuming physical testing. Improved model capabilities shorten design cycles and enable the production of cleaner and more efficient engines. This project focuses on advancing the state of the art in internal combustion engine simulations. The overarching goal is to enable predictive models and reduced time to solution for simulations that impact combustion engine design.

02 PETROLEUM↗

Design-Space Exploration for Inverse-Design of Wind Turbine Blades Using Data-Driven Methods

The state-of-the-practice aerodynamic design methods for wind turbine blades is typically based on Blade-Element Momentum (BEM) theory using a pre-designed frozen family of airfoils. The airfoils are themselves typically designed using panel methods. The design of the next-generation of large flexible rotors will need to capture the non-linear aerodynamics and three-dimensional flow to reduce the levelized cost of wind energy. Data-driven methods for aerodynamic design using data generated by computational fluid dynamics offer an attractive alternative to BEM-based methods that captures the non-linear aerodynamics of the component airfoils as well as the root and tip sections. In this work, we develop and demonstrate a framework to "smartly" explore the relevant design space in combination with an appropriate automated CFD pipeline to evaluate the aerodynamics of each design. The design-space exploration framework uses appropriate perturbations to the airfoil shape and induction profile from a baseline shape in combination with the inverse-design using BEM. The resulting designs are evaluated using an automated CFD pipeline using the in-house CFD solver framework "Mercury". We perform verification and validation to establish the capability of the Mercury framework to predict the aerodynamic performance of wind turbines. The CFD simulation of the perturbed blade shapes are optimized to restart from the converged baseline simulation to reduce the computational time. Finally, we demonstrate the design-space exploration technique for the design of the outboard section and the full rotor using perturbations to the shape and operating conditions of the NREL 5-MW turbine.

aerodynamic design methods↗

Artificial Intelligence and Machine Learning for Bioenergy Research: Opportunities and Challenges

The integration of artificial intelligence and machine learning (AI/ML) with automated experimentation, genomics, biosystems design, and bioprocessing technologies is poised to revolutionize scientific investigation and, particularly, bioenergy research. To identify the opportunities and challenges in this emerging research area, the U.S. Department of Energy’s (DOE) Biological and Environmental Research program (BER) and Bioenergy Technologies Office (BETO) held a joint virtual workshop on AI/ML for Bioenergy Research (AMBER) on August 23–25, 2022. These interests have since been amplified in a September 2022 Executive Order, “Advancing Biotechnology and Biomanufacturing Innovation for a Sustainable, Safe, and Secure U.S. Bioeconomy,” to promote a whole-of government approach to biotechnology development (White House 2022). Approximately 50 scientists with various backgrounds and expertise from academia, industry, and DOE national laboratories met to discuss the opportunities and challenges of AI/ML for bioenergy research. Workshop participants were tasked with assessing the potential for AI/ML and laboratory automation to advance biological understanding and engineering in general. They particularly examined how integrating AI/ML tools with laboratory automation could accelerate biosystems design and optimize biomanufacturing. Discussions included the data and computational infrastructure needed to augment biosystems design applications and the expertise and workforce development efforts urgently required to shift integrated systems toward bioenergy research more broadly. Participants discussed many existing and future applications of AI/ML for biosystems design ranging from enzymes to plants and microbes, microbiomes, and bioprocess development. They also identified three key categories of scientific and technical opportunities and challenges: high-quality data, AI/ML algorithms, and laboratory automation. Several main takeaways emerged from the workshop: 1. Numerous AI/ML and automated experimentation applications exist for a variety of DOE mission needs in energy and the environment; 2. Exemplary research grand challenges for which AI/ML could provide solutions include: building microbes and microbial communities to specifications, developing closed-loop autonomous design and control for biosystems design, and advancing scale-up and automation; 3. Lack of sufficient high-quality, annotated data hinders the development of AI/ML applications; 4. New and improved AI/ML tools are needed, particularly those meeting the specific needs of the BER and BETO research communities; 5. Trade-offs in performance, cost, and reliability exist between deploying commercially available versus building custom-developed instrumentation and software for automated or autonomous experimentation; translation of manual to automated or autonomous methods is often a nontrivial endeavor; 6. Training a new generation of young scientists who can develop and apply AI/ML tools is needed to solve long-standing scientific challenges in bioenergy research. The integration of AI/ML tools and automated experimentation represents a new data-driven research paradigm complementary to the traditional hypothesis-driven research paradigm. This paradigm accelerates design and optimization of biological systems and processes for a variety of DOE mission needs in energy and the environment. The AMBER workshop broadly explored the potential of this new paradigm for bioenergy research, of particular interest to BER and BETO, and identified key challenges and opportunities that DOE can address in the coming years by leveraging its unique capabilities and resources.

59 BASIC BIOLOGICAL SCIENCES↗

A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs

Computing the Euclidean minimum spanning tree (Emst) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing Emst are known, designing an efficient GPU algorithm is challenging due to a complex branching structure, data dependencies, and load imbalances. In this paper, we propose a single-tree $Bor\mathring{u}vka$-based algorithm for computing Emst on GPUs. We use an efficient nearest neighbor algorithm and reduce the number of the required distance calculations by avoiding traversing subtrees with leaf nodes in the same component. The developed algorithms are implemented in a performance portable way using ArborX, an open-source geometric search library based on the Kokkos framework. We evaluate the proposed algorithm on various 2D and 3D datasets, show and compare it with the current state-of-the-art open-source CPU implementations. We demonstrate 4-24 × speedup over the fastest multi-threaded implementation. We prove the portability of our implementation by providing results on a variety of hardware: AMD EPYC 7763, Nvidia A100 and AMD MI250X. We show scalability of the implementation, computing Emst for 37 million 3D cosmological dataset in under a 0.5 second on a single A100 Nvidia GPU.

Prokopenko, Andrey↗

Architector for high-throughput cross-periodic table 3D complex building

Abstract Rare-earth and actinide complexes are critical for a wealth of clean-energy applications. Three-dimensional (3D) structural generation and prediction for these organometallic systems remains a challenge, limiting opportunities for computational chemical discovery. Here, we introduce Architector , a high-throughput in-silico synthesis code for s-, p-, d-, and f-block mononuclear organometallic complexes capable of capturing nearly the full diversity of the known experimental chemical space. Beyond known chemical space, Architector performs in-silico design of new complexes including any chemically accessible metal-ligand combinations. Architector leverages metal-center symmetry, interatomic force fields, and tight binding methods to build many possible 3D conformers from minimal 2D inputs including metal oxidation and spin state. Over a set of more than 6,000 x-ray diffraction (XRD)-determined complexes spanning the periodic table, we demonstrate quantitative agreement between Architector-predicted and experimentally observed structures. Further, we demonstrate out-of-the box conformer generation and energetic rankings of non-minimum energy conformers produced from Architector , which are critical for exploring potential energy surfaces and training force fields. Overall, Architector represents a transformative step towards cross-periodic table computational design of metal complex chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Improving the stellarator through advances in plasma theory

Improvements to the stellarator concept can be realized through advancements in theoretical and computational plasma physics. Herein, recent advances are reported in the topical areas of: (1) improved energetic ion confinement, (2) the impact of three-dimensional (3D) shaping on turbulent transport, (3) reducing coil complexity, (4) novel optimization and design methods, and (5) computational magnetohydrodynamic tools. Furthermore, these advances enable the development of new stellarator configurations with improved confinement properties.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

CCSI Toolset 3.21 Release

CCSI Toolset 3.21 Release Highlights Parallelization support was added for Sequential Design of Experiments (SDOE) computations using Dask (preliminary). Input type dependent ordering capability was added to the SDOE module. With this implementation the user can specify the level of difficulty to change an input (Easy or Hard) and FOQUS will generate the appropriate ordered design depending on the input difficulty combination. Python version support was extended. FOQUS is now compatible with Python 3.8 through 3.12. Platforms used for automated testing were expanded to include macOS ARM (Apple Silicon). Updates to the FOQUS documentation to include information on how to set paths for SimSinter and TurbineLite. Turbine configuration section was added to Debugging Documentation.

AS↗

Advanced Compact Generation Module with Fish Safe Runner Technology

Hydropower is an important contributor of stable, load-leveling renewable energy to our national grid. Increasingly, the development of new hydropower facilities or the retrofit of existing ones hinges not only on minimizing costs but also environmental impact. In this report, the analysis and testing of a modular and scalable low-head hydropower generation design using Natel Energy’s Restoration Hydro Turbine is described. This design leverages many established industry approaches for compactness and efficiency while simultaneously allowing for safe downstream fish passage through the turbines themselves. This unique approach reduces overall hydropower facility costs and enables a simpler inclusive method of project design and operation. To assess this design, mechanical and fluid computational analyses were used to study and optimize key parameters. Passage tests of important migratory species (salmonids, American eel) were conducted through representative turbines. The unique propeller geometry of the fish-safe Restoration Hydro Turbine was subjected to detailed design and testing using advanced manufacturing composite techniques. Comprehensive module cost models were developed and assessed alongside hydraulic efficiency. The results of this project show promising and economical applications for downstream passage offish through Restoration Hydro Turbine modules.

13 HYDRO ENERGY↗

ASAP: Automatic Synthesis of Area-Efficient and Precision-Aware CGRAs

Coarse-grained reconfigurable accelerators (CGRAs) are a promising accelerator design choice that strikes a balance between performance and adaptability to different computing patterns across various applications domains. Designing a CGRA for a specific application domain involves enormous software/hardware engineering effort. Recent research works explore loop transformations, functional unit types, network topology, and memory size to identify optimal CGRA designs given a set of kernels from a specific application do- main. Unfortunately, the impact of functional units with different precision support has rarely been investigated. To address this gap, we propose ASAP – a hardware/software co-design framework that automatically identifies and synthesizes optimal precision-aware CGRA for a set of applications of interest. Our evaluation shows that ASAP generates specialized designs 3.2×, 4.21×, and 5.8× more efficient (in terms of performance per unit of energy or area) than non-specialized homogeneous CGRAs, for the scientific computing, embedded, and edge machine learning domains, respectively, with limited accuracy loss. Moreover, ASAP provides more efficient designs than other state-of-the-art synthesis frameworks for specialized CGRAs.

artificial intelligence↗

Bayesian D‐Optimal Designs for Gaussian Process Surrogate Models

Computer experiments often employ space-filling strategies to create surrogate models with strong predictive performance. The impact of model parameter estimation for Gaussian process surrogates, however, is often overlooked. Obtaining a better initial estimate of the covariance lengthscale parameter, θ, can greatly improve the resulting Gaussian process fit through more effective sequential acquisitions during active learning. In this work, we propose a novel initial design maximizing the Bayesian D-optimality criterion of the Gaussian process lengthscale parameter. Previously published results have shown the emphasis on lengthscale estimation to be promising, but relied on an empirically driven design creation process. Our Bayesian D-optimal designs are rooted in information theory and lead to more informative sequential acquisitions by improving lengthscale estimation. In many cases, these gains eventually result in better surrogates than those seeded with space-filling initial designs. Furthermore, Bayesian D-optimal designs can be tailored to either isotropic or anisotropic covariance structures, and the Bayesian framework enables the inclusion of prior knowledge in the design process, offering greater flexibility and adaptability. Through several simulation studies, we demonstrate the advantages of Bayesian D-optimal designs in terms of both lengthscale estimation accuracy and predictive performance during active learning.

Bayesian experimental design↗

Latent Space Simulation for Carbon Capture Design Optimization

The CO2 capture efficiency in solvent-based carbon capture systems (CCSs) critically depends on the gas-solvent interfacial area (IA), making maximization of IA a foundational challenge in CCS design. While the IA associated with a particular CCS design can be estimated via a computational fluid dynamics (CFD) simulation, using CFD to derive the IAs associated with numerous CCS designs is prohibitively costly. However, previous works such as Deep Fluids (Kim et al., 2019) show that large simulation speed-ups and low error are achievable by replacing CFD simulators with neural-network (NN) surrogates that mimic the CFD simulation process. This raises the possibility for a fast, accurate replacement for a CFD simulator, and thus computationally feasible IA-based CCS-design optimization. As such, here, we explore whether an existing NN-surrogate approach (and variants we develop) can successfully be applied to our complex carbon-capture CFD simulations, with the ultimate goal of obtaining a fast and accurate simulator for our CCS-design application. Our experiments build on the Deep Fluids approach and find that resulting surrogates can produce large speed ups (4000x) while maintaining IA relative errors as low as 4% on unseen CCS configurations (interpolating between configurations seen during training). Thus, despite less faithfulness to the underlying physics of the problem, NN surrogates may be a promising tool for our CCS design optimization problem. Notably, though, the Deep Fluids approach has limitations for our application (such as model non-transferability to CCS-packing changes), which we discuss. We conclude with potential directions for future work that may, like innovations we introduced here (e.g., transformer-based dynamics prediction), improve performance on our complicated dataset of CCS CFD simulations.

AI Surrogate Simulation, Carbon Capture, design op↗

Enabling particle applications for exascale computing platforms

The Exascale Computing Project (ECP) is invested in co-design to assure that key applications are ready for exascale computing. Within ECP, the Co-design Center for Particle Applications (CoPA) is addressing challenges faced by particle-based applications across four “sub-motifs”: short-range particle–particle interactions (e.g., those which often dominate molecular dynamics (MD) and smoothed particle hydrodynamics (SPH) methods), long-range particle–particle interactions (e.g., electrostatic MD and gravitational N-body), particle-in-cell (PIC) methods, and linear-scaling electronic structure and quantum molecular dynamics (QMD) algorithms. Our crosscutting co-designed technologies fall into two categories: proxy applications (or “apps”) and libraries. Proxy apps are vehicles used to evaluate the viability of incorporating various types of algorithms, data structures, and architecture-specific optimizations and the associated trade-offs; examples include ExaMiniMD, CabanaMD, CabanaPIC, and ExaSP2. Libraries are modular instantiations that multiple applications can utilize or be built upon; CoPA has developed the Cabana particle library, PROGRESS/BML libraries for QMD, and the SWFFT and fftMPI parallel FFT libraries. Success is measured by identifiable “lessons learned” that are translated either directly into parent production application codes or into libraries, with demonstrated performance and/or productivity improvement. The libraries and their use in CoPA’s ECP application partner codes are also addressed.

97 MATHEMATICS AND COMPUTING↗

Quantum algorithms for geologic fracture networks

Abstract Solving large systems of equations is a challenge for modeling natural phenomena, such as simulating subsurface flow. To avoid systems that are intractable on current computers, it is often necessary to neglect information at small scales, an approach known as coarse-graining. For many practical applications, such as flow in porous, homogenous materials, coarse-graining offers a sufficiently-accurate approximation of the solution. Unfortunately, fractured systems cannot be accurately coarse-grained, as critical network topology exists at the smallest scales, including topology that can push the network across a percolation threshold. Therefore, new techniques are necessary to accurately model important fracture systems. Quantum algorithms for solving linear systems offer a theoretically-exponential improvement over their classical counterparts, and in this work we introduce two quantum algorithms for fractured flow. The first algorithm, designed for future quantum computers which operate without error, has enormous potential, but we demonstrate that current hardware is too noisy for adequate performance. The second algorithm, designed to be noise resilient, already performs well for problems of small to medium size (order 10–1000 nodes), which we demonstrate experimentally and explain theoretically. We expect further improvements by leveraging quantum error mitigation and preconditioning.

58 GEOSCIENCES↗

Realizing the data-driven, computational discovery of metal-organic framework catalysts

Metal-organic frameworks (MOFs) have been widely investigated for challenging catalytic transformations due to their well-defined structures and high degree of synthetic tunability. These features, at least in principle, make MOFs ideally suited for a computational approach towards catalyst design and discovery. Nonetheless, the widespread use of data science and machine learning to accelerate the discovery of MOF catalysts has yet to be substantially realized. In this review, we provide an overview of recent work that sets the stage for future high-throughput computational screening and machine learning studies involving MOF catalysts. This is followed by a discussion of several challenges currently facing the broad adoption of data-centric approaches in MOF computational catalysis, and we share possible solutions that can help propel the field forward.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Noise and error analysis and optimization in particle-based kinetic plasma simulations

In this paper we analyze the noise in macro-particle methods used in plasma physics and fluid dynamics, leading to approaches for minimizing the total error, focusing on electrostatic models in one dimension. We begin by describing kernel density estimation for continuous values of the spatial variable x, expressing the kernel in a form in which its shape and width are represented separately. The covariance matrix of the noise in the density is computed, first for uniform true density. The bandwidth of the covariance matrix C(x,y) is related to the width of the kernel. A feature that stands out is the presence of constant negative terms in the elements of the covariance matrix both on and off-diagonal. These negative correlations are related to the fact that the total number of particles is fixed at each time step; they also lead to the property ∫C(x,y)dy = 0. We investigate the effect of these negative correlations on the electric field computed by Gauss's law, finding that the noise in the electric field is related to a process called the Ornstein-Uhlenbeck bridge, leading to a covariance matrix of the electric field with variance significantly reduced relative to that of a Brownian process. For non-constant density, p(x), still with continuous x, we analyze the total error in the density estimation and discuss it in terms of bias-variance optimization (BVO). For some characteristic length l, determined by the density and its second derivative, and kernel width h, having too few particles within h leads to too much variance; for h that is large relative to l, there is too much smoothing of the density. The optimum between these two limits is found by BVO. For kernels of the same width, it is shown that this optimum (minimum) is weakly sensitive to the kernel shape. Next, we repeat the analysis for x discretized on a grid. In this case the charge deposition rule is determined by a particle shape. An important property to be respected in the discrete system is the exact preservation of total charge on the grid; this property is necessary to ensure that the electric field is equal at both ends, consistent with periodic boundary conditions. We find that if the particle shapes satisfy a partition of unity property, the particle charge deposited on the grid is conserved exactly. Further, if the particle shape is expressed as the convolution of a kernel with another kernel that satisfies the partition of unity, then the particle shape obeys the partition of unity. This property holds for kernels of arbitrary width, including widths that are not integer multiples of the grid spacing. Furthermore, we show results relaxing the approximations used to do BVO optimization analytically, by doing numerical computations of the total error as a function of the kernel width, on a grid in x. The comparison between numerical and analytical results shows good agreement over a range of particle shapes. We discuss the practical implications of our results, including the criteria for design and implementation of computationally efficient particle shapes that take advantage of the developed theory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗