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 685 records · Page 38

Evaluation of erosion potential of bio-based multicomponent blendstocks using experimentally-validated computational fluid dynamics

The optimization of the fuel-engine interface and associated performance is a significant goal for CoOptima and the industry. The strategic driver for fuel-engine optimization is clear: diesel optimization can significantly reduce emissions including NOx, particulate matter, and CO2 emissions. Previous evaluations of ethanol and diesel blends raised significant concerns with fuel injector erosion using ethanol blends. While Sylvatex’s technology can use ethanol, it also utilizes a surfactant and water to compatibilize and modify ethanol blends, thereby controlling its impact in diesel engines. The results from the project will (1) provide important insights into complex fuels and erosion, which will be used to design additional, improved formulations; and (2) expand capabilities of Argonne’s cavitation-induced erosion risk assessment (CIERA) tool to model multi-component systems, furthering Co-Optima objectives.

09 BIOMASS FUELS↗

Strategic priming with multiple antigens can yield memory cell phenotypes optimized for infection with Mycobacterium tuberculosis : A computational study

Lack of an effective vaccine results in 9 million new cases of tuberculosis (TB) every year and 1.8 million deaths worldwide. While many infants are vaccinated at birth with BCG (an attenuated M. bovis ), this does not prevent infection or development of TB after childhood. Immune responses necessary for prevention of infection or disease are still unknown, making development of effective vaccines against TB challenging. Several new vaccines are ready for human clinical trials, but these trials are difficult and expensive; especially challenging is determining the appropriate cellular response necessary for protection. The magnitude of an immune response is likely key to generating a successful vaccine. Characteristics such as numbers of central memory (CM) and effector memory (EM) T cells responsive to a diverse set of epitopes are also correlated with protection. Promising vaccines against TB contain mycobacterial subunit antigens (Ag) present during both active and latent infection. We hypothesize that protection against different key immunodominant antigens could require a vaccine that produces different levels of EM and CM for each Ag-specific memory population. We created a computational model to explore EM and CM values, and their ratio, within what we term Memory Design Space. Our model captures events involved in T cell priming within lymph nodes and tracks their circulation through blood to peripheral tissues. We used the model to test whether multiple Ag-specific memory cell populations could be generated with distinct locations within Memory Design Space at a specific time point post vaccination. Boosting can further shift memory populations to memory cell ratios unreachable by initial priming events. By strategically varying antigen load, properties of cellular interactions within the LN, and delivery parameters (e.g., number of boosts) of multi-subunit vaccines, we can generate multiple Ag-specific memory populations that cover a wide range of Memory Design Space. As a result, given a set of desired characteristics for Ag-specific memory populations, we can use our model as a tool to predict vaccine formulations that will generate those populations.

59 BASIC BIOLOGICAL SCIENCES↗

Fuzzified PaCcET for Economic-Emission Scheduling of Microgrids

In this paper, a new approach is proposed to solve a multi-objective economic-emission scheduling problem in microgrids (MGs) by simultaneously minimizing the energy and emission costs of the MG with various distributed energy resources (DERs). The proposed approach is an extension of a computationally effective multiobjective optimization technique, Pareto concavity elimination transformation (PaCcET). The proposed approach, referred to as Fuzzified-PaCcET, employs a fuzzy logic controller to dynamically revise crossover and mutation rates in the original PaCcET leading to the faster convergence of the solution. The proposed approach finds the best Pareto front, also referred to as a Non-dominated set (NDS) of solutions, instead of finding a single optimal solution. In order to find the solutions on concave areas of the Pareto front, an iterative objective space transformation is performed in the PaCcET algorithm to allow a linear combination of objective functions (in the transformed objective space). The proposed Fuzzified-PaCcET-based scheduling is implemented on a MG with various dispatchable and non-dispatchable DERs to find the set of optimal solutions according to the total fuel cost of DERs, as well as the most optimum environmental cost. In order to extract the best compromise solution (BCS) among NDS of solutions, a fuzzy-based method is implemented. The comparison of the simulation results of the Fuzzified-PaCcET with that of PaCcET shows that Fuzzified-PaCcET can generate better solution with less computational burden.

42 ENGINEERING↗

Managing code transformations for better performance portability

Code optimization is an intricate task that is getting more complex as computing systems evolve. Managing the program optimization process, including the implementation and evaluation of code variants, is tedious, inefficient, and errors are likely to be introduced in the process. Moreover, because each platform typically requires a different sequence of transformations to fully harness its computing power, the optimization process complexity grows as new platforms are adopted. To address these issues, systems and frameworks have been proposed to automate the code optimization process. They, however, have not been widely adopted and are primarily used by experts with deep knowledge about underlying architecture and compiler intricacies. This article describes the requirements that we believe necessary for making automatic performance tuning more broadly used, especially in complex, long-lived high-performance computing applications. Besides discussing limitations of current systems and strategies to overcome these, we describe the design of a system that is able to semi-automatically generate efficient platform-specific code. In the proposed system, the code optimization is programmer-guided, separately from application code, on an external file in what we call optimization programming. The language to program the optimization process is able to represent complex collections of transformations and, as a result, generate efficient platform-specific code. A database manages different optimized versions of code regions, providing a pragmatic approach to performance portability, and the framework itself has separate components, allowing the optimized code to be used on systems without installing all of the modules required for the code generation. We present experiments on two different platforms to illustrate the generation of efficient platform-specific code that performs comparable to hand-optimized, vendor-provided code.

Computer Science↗

Structure prediction of epitaxial inorganic interfaces by lattice and surface matching with Ogre

We present a new version of the Ogre open source Python package with the capability to perform structure prediction of epitaxial inorganic interfaces by lattice and surface matching. In the lattice matching step, a scan over combinations of substrate and film Miller indices is performed to identify the domain-matched interfaces with the lowest mismatch. Subsequently, surface matching is conducted by Bayesian optimization to find the optimal interfacial distance and in-plane registry between the substrate and the film. For the objective function, a geometric score function is proposed based on the overlap and empty space between atomic spheres at the interface. The score function reproduces the results of density functional theory (DFT) at a fraction of the computational cost. The optimized interfaces are pre-ranked using a score function based on the similarity of the atomic environment at the interface to the bulk environment. Final ranking of the top candidate structures is performed with DFT. Ogre streamlines DFT calculations of interface energies and electronic properties by automating the construction of interface models. The application of Ogre is demonstrated for two interfaces of interest for quantum computing and spintronics, Al/InAs and Fe/InSb.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Three-dimensional NDE of VHTR core components via simulation-based testing. Final report

A next generation, simulation-driven-and-enabled testing platform is developed for the 3D detection and characterization of defects and damage in nuclear graphite and composite structures in Very High Temperature Reactors (VHTRs). The proposed work addresses the critical need for the development of high-fidelity Non-Destructive Examination (NDE) technologies for as-manufactured and replaceable in-service VHTR components. Centered around the novel use of elastic (sonic and ultrasonic) waves, this project deploys a robust, non-iterative inverse solution for the 3D defect reconstruction together with a non-contact, laser-based approach to the measurement of experimental waveforms in VHTR core components. In particular, this research (1) deploys three-dimensional Scanning Laser Doppler Vibrometry (3D SLDV) as a means to accurately and remotely measure 3D displacement waveforms over the accessible surface of a VHTR core component excited by mechanical vibratory source; (2) implements a powerful new inverse technique, based on the concept of Topological Sensitivity (TS), for non-iterative elastic waveform tomography of internal defects - that permits robust 3D detection, reconstruction and characterization of discrete damage (e.g. holes and fractures) in nuclear graphite from limited-aperture NDE measurements; (3) implements state-of-the art computational (finite element) model that caters for accurately simulating elastic wave propagation in 3D blocks of nuclear graphite; (4) integrates the SLDV testing methodology with the TS imaging algorithm into a non-contact, high-fidelity NDE platform for the 3D reconstruction and characterization of defects and damage in VHTR core components; and (5) applies the proposed methodology to VHTR core component samples (both two- and three-dimensional) with a priori induced, discrete damage in the form of holes and fractures. Overall, the newly established SLDV-TS testing platform represents a next-generation NDE tool that surpasses all existing techniques for the 3D ultrasonic imaging of material damage from non-contact, limited-aperture waveform measurements. Outlook. The next stage in the development of this technology includes items such as (a) non-contact generation of mechanical vibrations in VHTR components via thermal expansion created by high-intensity laser; (b) development and incorporation of Synthetic Aperture Focusing Technique (SAFT) for elevating the accuracy of 3D imaging in highly noisy environments with minimal accessible surface; (c) further analytical and computational developments to facilitate the reconstruction of diffuse damage (e.g. microcracks) in nuclear graphite as they lead to the dispersion of elastic waves, (d) concept of model updating for accurate tracking of the evolution of material damage via periodic inspections; (d) adoption of the Bayesian framework to obtain information on the certainty of obtained images; and (e) optimization of the computational scheme toward real-time, model-based imaging of damage in VHTR core components.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

SBIR Phase I Final Report, TACO: Distributed and Heterogeneous Sparse Compiler

Tensor algebra is a powerful tool for computing, but writing optimized codes that operate on sparse tensors can be very complex. This project enables a Tensor Algebra Compiler (TACO) that simplifies this task from man-years to man-days and extends TACO to support complex and large distributed systems. This report details the hypotheses, approaches used, and findings in this project.

97 MATHEMATICS AND COMPUTING↗

Graph-based modeling and simulation of complex systems

We present graph-based modeling abstractions to represent cyber-physical dependencies arising in complex systems. Specifically, we propose an algebraic graph abstraction to capture physical connectivity in complex optimization models and a computing graph abstraction to capture communication connectivity in computing architectures. The proposed abstractions are scalable and are used as the backbone of a Julia-based software package that we call Plasmo.j1. Here, we show how the algebraic graph abstraction facilitates the implementation, analysis, and decomposition of optimization problems and we show how the computing graph abstraction facilitates the implementation of optimization and control algorithms and their simulation in virtual environments that involve distributed, centralized, and hierarchical computing architectures.

97 MATHEMATICS AND COMPUTING↗

Inference-Engine v0.1.0

Given a pre-trained neural network, Inference-Engine performs maps network inputs to outputs by executing the forward pass through the provided network. Although the predominant programming language for machine-learning is Python, most high-performance computing (HPC) applications are written in Fortran, C, or C++. Inference-Engine aims to support HPC programs and is written in Fortran, a language with a large feature set supporting interoperability with C. This software exposes concurrency in a portable way by using standard language features that some modern Fortran compilers can exploit with various optimizations, including offloading computation to a Graphics Processing Unit (GPU). In particular, this software makes extensive use of Fortran's "do concurrent" parallel loop construct, implicitly parallel array statements, and pure procedures that can be invoked inside "do concurrent" blocks. Inference-Engine also supports dynamic choice of inference methods at runtime. Two current options include one method that uses Fortran's "dot_product" intrinsic function inside "do concurrent" blocks and another method that instead uses Fortran' "matmul" array intrinsic function. We plan to investigate automatic compiler offloading of "do concurrent" calculations to GPUs and compile-time substitution of optimized libraries such as the Basic Linear Algebra Library (BLAS) for "matmul" invocations. We also envision the potential for the choice of which method to use could happen at program launch based on in situ performance measurements on any given platform.

Rouson, Damian↗

Parallel implementation and performance optimization of the configuration-interaction method

The configuration-interaction (CI) method, long a popular approach to describe quantum many-body systems, is cast as a very large sparse matrix eigenpair problem with matrices whose dimension can exceed one billion. Such formulations place high demands on memory capacity and memory bandwidth - - two quantities at a premium today. In this paper, we describe an efficient, scalable implementation, BIGSTICK, which, by factorizing both the basis and the interaction into two levels, can reconstruct the nonzero matrix elements on the fly, reduce the memory requirements by one or two orders of magnitude, and enable researchers to trade reduced resources for increased computational time. We optimize BIGSTICK on two leading HPC platforms - - the Cray XC30 and the IBM Blue Gene/Q. Specifically, we not only develop an empirically-driven load balancing strategy that can evenly distribute the matrix-vector multiplication across 256K threads, we also developed techniques that improve the performance of the Lanczos reorthogonalization. Combined, these optimizations improved performance by 1.3-8× depending on platform and configuration.

97 MATHEMATICS AND COMPUTING↗

Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch

Two parallelized hybrid methods are presented for single-function optimization problems with side constraints. The optimization problems are difficult not only due to possible existence of local minima and nonsmoothness of functions, but also due to the fact that objective function and constraint values for a solution vector can only be obtained by querying a black box whose execution requires considerable computational effort. Examples are optimization problems in Engineering where objective function and constraint values are computed via complex simulation programs, and where local minima exist and smoothness of functions is not assured. The hybrid methods consist of the well-known method NOMAD and two new methods called DENCON and DENPAR that are based on the linesearch scheme CS-DFN. The hybrid methods compute for each query a set of solution vectors that are evaluated in parallel. The hybrid methods have been tested on a set of difficult optimization problems produced by a certain seeding scheme for multiobjective optimization. We compare computational results with solution by NOMAD, DENCON, and DENPAR as stand-alone methods. It turns out that among the stand-alone methods, NOMAD is significantly better than DENCON and DENPAR. However, the hybrid methods are definitely better than NOMAD.

97 MATHEMATICS AND COMPUTING↗

A staggered-grid finite-difference scheme optimized in the time–space domain for modeling scalar-wave propagation in geophysical problems

For modeling scalar-wave propagation in geophysical problems using finite-difference schemes, optimizing the coefficients of the finite-difference operators can reduce numerical dispersion. Most optimized finite-difference schemes for modeling seismic-wave propagation suppress only spatial but not temporal dispersion errors. We develop a novel optimized finite-difference scheme for numerical scalar-wave modeling to control dispersion errors not only in space but also in time. Our optimized scheme is based on a new stencil that contains a few more grid points than the standard stencil. We design an objective function for minimizing relative errors of phase velocities of waves propagating in all directions within a given range of wavenumbers. Dispersion analysis and numerical examples demonstrate that our optimized finite-difference scheme is computationally up to 2.5 times faster than the optimized schemes using the standard stencil to achieve the similar modeling accuracy for a given 2D or 3D problem. Compared with the high-order finite-difference scheme using the same new stencil, our optimized scheme reduces 50 percent of the computational cost to achieve the similar modeling accuracy. This new optimized finite-difference scheme is particularly useful for large-scale 3D scalar-wave modeling and inversion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗