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 991 records · Page 55

ORCHA: A performance portability system for extreme heterogeneity

Heterogeneity is the prevalent trend in the rapidly evolving high-performance computing (HPC) landscape in both hardware and application software. The diversity in hardware platforms, currently comprising various accelerators and a future possibility of specializable chiplets, poses a significant challenge for scientific software developers aiming to harness optimal performance across different computing platforms while maintaining the quality of solutions when their applications are simultaneously growing more complex. Code synthesis and code generation can provide mechanisms to mitigate this challenge. We have developed a divide and conquer approach where different aspects of performance are handled by different stand-alone tools that are interfaced with the application through generated code. This portability system, ORCHA, enables users to configure and orchestrate their computations among available resources on a platform by specifying a high-level recipe, thereby permitting a many-to-many paradigm where each recipe results in a different variant of the application. The core design goal is to let users decide the application’s hardware mapping and orchestration by editing only the high-level recipe—without modifying the maintained source code or binding the application to a particular runtime system. Tools in ORCHA distribution are: CG-Kit for translating the recipe into an execution graph; Milhoja to execute the graph by orchestrating data and task movement among hardware resources; and Macroprocessor that enables users to define their own code-shorthand for higher composability and easier management of code variants. Additionally, the design of ORCHA permits tools to work in a plug-and-play mode where the application can build and run without CG-Kit and Milhoja, and either tool can be swapped out for other tools with similar capabilities by modifying the code generation portion of ORCHA. In this paper, we describe the design of ORCHA and the role that code-generation plays in isolating applications from tools. We demonstrate the breadth of configurations ORCHA enables with a case study in which an application configuration is realized on three distinct hardware mappings—a GPU-centric, a CPU/GPU balanced, and a CPU/GPU concurrent layouts by using different recipes.

Lee, Youngjun↗

Optimization and Control of Burning Plasmas Through High Performance Computing

This project has revived the FACETS code, that has been developed under SciDAC fund- ing in 2008-2012. The code has been dormant for a number of years after the SciDAC funding stopped. FACETS depends on external packages. The external packages and libraries such as PETSc, FFTW, HDF5 and NETCDF that are included in FACETS have evolved during these years. Some packages in FACETS are also parts of other codes such as PlasmaState, NUBEAM, GACODES, and UEDGE. These packages have been also evolved together with their host codes which include TRANSP, TGYRO and XPTOR. Finally, there is also a set of packages in FACETS that are being developed and maintained by Tech-X. These packages include BILDER, SciMake, and FcioWrappers. Many of these packages evolved significantly during the last several years and FACETS had to be updated to synchronize with the re- cent progress in the external packages. The PI has introduced new changes to the BILDER package to support the updated interfaces to the external modules. During the last year of the project, the FACETS version of the UEDGE code has been extracted from FACETS as a standalone package. The PI collaborates with the scientists from LLNL on the updated UEDGE model in FACETS. Drs. T. Rognlien, M. Umansky and A. Dimits from LLNL are contributing to this task.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

FLOW Estimation and Rose Superposition (FLOWERS): an integral approach to engineering wake models

Abstract. Annual energy production (AEP) is often the objective function in wind plant layout optimization studies. The conventional method to compute AEP for a wind farm is to first evaluate power production for each discrete wind direction and speed using either computational fluid dynamics simulations or engineering wake models. The AEP is then calculated by weighted-averaging (based on the wind rose at the wind farm site) the power produced across all wind directions and speeds. We propose a novel formulation for time-averaged wake velocity that incorporates an analytical integral of a wake deficit model across every wind direction. This approach computes the average flow field more efficiently, and layout optimization is an obvious application to exploit this benefit. The clear advantage of this new approach is that the layout optimization produces solutions with comparable AEP performance yet is completed 2 orders of magnitude faster. The analytical integral and the use of a Fourier expansion to express the wind speed and wind direction frequency create a relatively smooth solution space for the gradient-based optimizer to excel in comparison to the existing weighted-averaging power calculation.

17 WIND ENERGY↗

DECA: scalable XHMM exome copy-number variant calling with ADAM and Apache Spark

Abstract Background XHMM is a widely used tool for copy-number variant (CNV) discovery from whole exome sequencing data but can require hours to days to run for large cohorts. A more scalable implementation would reduce the need for specialized computational resources and enable increased exploration of the configuration parameter space to obtain the best possible results. Results DECA is a horizontally scalable implementation of the XHMM algorithm using the ADAM framework and Apache Spark that incorporates novel algorithmic optimizations to eliminate unneeded computation. DECA parallelizes XHMM on both multi-core shared memory computers and large shared-nothing Spark clusters. We performed CNV discovery from the read-depth matrix in 2535 exomes in 9.3 min on a 16-core workstation (35.3× speedup vs. XHMM), 12.7 min using 10 executor cores on a Spark cluster (18.8× speedup vs. XHMM), and 9.8 min using 32 executor cores on Amazon AWS’ Elastic MapReduce. We performed CNV discovery from the original BAM files in 292 min using 640 executor cores on a Spark cluster. Conclusions We describe DECA’s performance, our algorithmic and implementation enhancements to XHMM to obtain that performance, and our lessons learned porting a complex genome analysis application to ADAM and Spark. ADAM and Apache Spark are a performant and productive platform for implementing large-scale genome analyses, but efficiently utilizing large clusters can require algorithmic optimizations and careful attention to Spark’s configuration parameters.

Linderman, Michael D. (ORCID:0000000296437148)↗

Hypothesis testing via AI: Generating physically interpretable models of scientific data with machine learning (Full Technical Report)

Deep learning has demonstrated an exceptional ability to solve complex tasks (an engineering success); however, it has done so at the expense of the ability to generate new knowledge (a scientific failure). We propose an alternative framework—entitled Deep Symbolic Regression (DSR)—in which artificial neural networks (NNs) rapidly generate hypotheses about physical relationships among inputs. This framework bypasses the need to interpret an NN altogether, while still leveraging the representational power of deep learning. The resulting models are tractable mathematical expressions, which are inherently and readily human interpretable and can provide insights into underlying physical phenomena. Further, we fold this methodology into the scientific process by allowing the scientist to directly integrate a priori knowledge and beliefs to accelerate learning. We demonstrate this methodology on symbolic regression—the problem of rediscovering underlying expressions describing a dataset—and achieve state-of-the-art performance across a wide variety of symbolic regression problems. Further, we generalize our DSR framework to apply to the more general class of symbolic optimization problems, in which one seeks to optimize a sequence of symbols or “tokens” under a black-box reward function. Examples of other symbolic optimization problems include neural architecture search and computational antibody design. Our generalized tool, Deep Symbolic Optimization (DSO), has been demonstrated on the task of learning symbolic control policies for reinforcement learning environments, and has been adopted as an enabling capability for computational antibody design.

97 MATHEMATICS AND COMPUTING↗

Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis

We lay the foundation for a benchmarking methodology for assessing current and future quantum computers. We pose and begin addressing fundamental questions about how to fairly compare computational devices at vastly different stages of technological maturity. We critically evaluate and offer our own contributions to current quantum benchmarking efforts, in particular those involving adiabatic quantum computation and the Adiabatic Quantum Optimizers produced by D-Wave Systems, Inc. We find that the performance of D-Wave's Adiabatic Quantum Optimizers scales roughly on par with classical approaches for some hard combinatorial optimization problems; however, architectural limitations of D-Wave devices present a significant hurdle in evaluating real-world applications. In addition to identifying and isolating such limitations, we develop algorithmic tools for circumventing these limitations on future D-Wave devices, assuming they continue to grow and mature at an exponential rate for the next several years.

97 MATHEMATICS AND COMPUTING↗

One System, Many Models: Designing a Surrogate Model for Sulfur Thermal Energy Storage: Preprint

Industrial process heating (IPH) relies primarily on thermal energy generated by fossil fuel combustion to produce, treat, and alter manufactured goods. Thermal energy storage (TES) helps reduce the carbon footprint of IPH systems by facilitating the utilization of renewable and waste heat sources. A promising new TES technology uses elemental sulfur as the heat-storage medium. The design of sulfur TES systems can be evaluated with the aid of computational fluid dynamics (CFD). However, the computational cost of such CFD efforts is prohibitive to comprehensive optimizations over design parameters. To reduce this computational cost, machine learning (ML) models can be developed to act as surrogates for CFD. In this paper, we describe the process of building and evaluating surrogate ML models for facilitating optimization of sulfur TES systems for IPH. To enforce the thermodynamic relationship between the two modeled quantities, we develop a hybrid model for sulfur temperature using both direct predictions of temperature and calculations of temperature from predictions of the heat transfer coefficient. The hybrid model enforces this constraint at the expense of the slightly reduced accuracy compared to two disjoint models. The overall high accuracy observed in our model evaluation demonstrates the usefulness of such surrogate modeling for studying TES systems. This work contributes to the field of TES surrogate modeling by offering a novel accurate hybrid approach to predicting simultaneously the heat transfer coefficient and temperature of the heat storage medium.

computational fluid dynamics↗

Asymmetrical Magnet Shape Optimization Based on S-C Mapping for Torque Profile Mitigation in Unidirectional Application of SPMS Machine

Surface-mounted Permanent Magnet Synchronous (SPMS) machines are widely used in applications that require low torque ripple, reduced vibration and acoustic noise. For those applications of SPMSM in which only unidirectional operation is needed, asymmetric design optimization show to have significant advantages over symmetric designs. In this paper, an analytical method based on Schwarz -Christoffel mapping is presented for asymmetrical magnet shape optimization in SPMS machine. In this method, permanent magnet is divided into finite cells so that each cell can be assigned with either air (OFF) or magnet (ON). The Optimization problem is solved using Genetic Algorithms (GAs). In order to remove non-manufacturable shapes, the cluster of materials and cleaning method is used and applied into magnet cells. The analytical method can significantly reduce the computation time used by optimization process as compared with methods based on Finite Element Analysis (FEA). This method is applied to a 12-pole SPMS machine. Validation of the S-C mapping method and final results are carried out using 2D and 3D finite element analysis. Here, the results obtained demonstrate that asymmetrical magnet shape improves cogging torque and torque ripple performance of SPMS machine by a significant margin.

42 ENGINEERING↗

Multi-scale topology optimization of multi-material structures with controllable geometric complexity — Applications to heat transfer problems

This study presents a topology optimization method to design assemblies of periodic cellular materials with controllable geometric complexity. The framework is based on a novel multi-scale and multi-material design model in which the structure, the layout of the material subdomains, and their micro-structures are optimized concurrently. To allow a tight control over its geometrical complexity, the layout at the macro-scale is described by level-set fields, parameterized by geometric primitives. The micro-scale geometry is represented through a density approach. A nonlinear programming algorithm drives the optimization process using design sensitivities computed by the discrete adjoint method. The proposed design framework is studied with heat transfer problems. Practical design problems, such as a heat sink and a thermal storage unit with phase change are discussed. The macro-scale analysis model relies on a generalized transient diffusion equation. At the micro-scale, homogenization is used to compute equivalent material properties. The numerical examples in this study show that the optimized multi-scale multi-material layouts outperform the corresponding mono-scale structures while maintaining geometric simplicity at the macro-scale level.

42 ENGINEERING↗

Learning viscoelasticity models from indirect data using deep neural networks

In this study, we propose a novel approach to model viscoelasticity materials, where rate-dependent and non-linear constitutive relationships are approximated with deep neural networks. We assume that inputs and outputs of the neural networks are not directly observable, and therefore common training techniques with input–output pairs for the neural networks are inapplicable. To that end, we develop a novel computational approach to both calibrate parametric and learn neural-network-based constitutive relations of viscoelasticity materials from indirect displacement data in the context of multiple-physics systems. We show that limited displacement data holds sufficient information to quantify the viscoelasticity behavior. We formulate the inverse computation – modeling viscoelasticity properties from observed displacement data – as a PDE-constrained optimization problem and minimize the error functional using a gradient-based optimization method. The gradients are computed by a combination of automatic differentiation and implicit function differentiation rules. The effectiveness of our method is demonstrated through numerous benchmark problems in geomechanics and porous media transport.

97 MATHEMATICS AND COMPUTING↗

The Importance of the Scaffold for de Novo Enzymes: A Case Study with Kemp Eliminase

We report electric field values relevant to the reactant and transition states of designed Kemp eliminases KE07 and KE70 and their improved variants from laboratory directed evolution (LDE), using atomistic simulations with the AMOEBA polarizable force field. We find that the catalytic base residue contributes the most to the electric field stabilization of the transition state of the LDE variants of the KE07 and KE70 enzymes, whereas the electric fields of the remainder of the enzyme and solvent disfavor the catalytic reaction in both cases. By contrast, we show that the electrostatic environment plays a large and stabilizing role for the naturally occurring enzyme ketosteroid isomerase (KSI). These results suggest that LDE is ultimately a limited strategy for improving de novo enzymes since it is largely restricted to optimization of chemical positioning in the active site, thus yielding a ~3 order magnitude improvement over the uncatalyzed reaction, which we suggest may be an absolute upper bound estimate based on LDE applied to comparable de novo Kemp eliminases and other enzymes like KSI. Instead de novo enzymatic reactions could more productively benefit from optimization of the electrostatics of the protein scaffold in early stages of the computational design, utilizing electric field optimization as guidance.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗