Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization applications”

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 595 records · Page 33

Numerical Optimization of Density Functional Tight Binding Models: Application to Molecules Containing Carbon, Hydrogen, Nitrogen, and Oxygen

New parametrizations for semiempirical density functional tight binding (DFTB) theory have been developed by the numerical optimization of adjustable parameters to minimize errors in the atomization energy and interatomic forces with respect to ab initio calculated data. Initial guesses for the radial dependences of the Slater- Koster bond integrals and overlap integrals were obtained from minimum basis density functional theory calculations. The radial dependences of the pair potentials and the bond and overlap integrals were represented by simple analytic functions. The adjustable parameters in these functions were optimized by simulated annealing and steepest descent algorithms to minimize the value of an objective function that quantifies the error between the DFTB model and ab initio calculated data. The accuracy and transferability of the resulting DFTB models for the C, H, N, and O system were assessed by comparing the predicted atomization energies and equilibrium molecular geometries of small molecules that were not included in the training data from DFTB to ab initio data. The DFTB models provide accurate predictions of the properties of hydrocarbons and more complex molecules containing C, H, N, and O.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Tool Support for Software Lookup Table Optimization

A number of scientific applications are performance-limited by expressions that repeatedly call costly elementary functions. Lookup table (LUT) optimization accelerates the evaluation of such functions by reusing previously computed results. LUT methods can speed up applications that tolerate an approximation of function results, thereby achieving a high level of fuzzy reuse. One problem with LUT optimization is the difficulty of controlling the tradeoff between performance and accuracy. The current practice of manual LUT optimization adds programming effort by requiring extensive experimentation to make this tradeoff, and such hand tuning can obfuscate algorithms. In this paper we describe a methodology and tool implementation to improve the application of software LUT optimization. Our Mesa tool implements source-to-source transformations for C or C++ code to automate the tedious and error-prone aspects of LUT generation such as domain profiling, error analysis, and code generation. We evaluate Mesa with five scientific applications. Our results show a performance improvement of 3.0× and 6.9× for two molecular biology algorithms, 1.4× for a molecular dynamics program, 2.1× to 2.8× for a neural network application, and 4.6× for a hydrology calculation. We find that Mesa enables LUT optimization with more control over accuracy and less effort than manual approaches.

Wilcox, Chris↗

Shape Optimization for Control and Isolation of Structural Vibrations in Aerospace and Defense Applications

Among the main challenges in shape optimization is the coupling of Finite Element Method (FEM) codes in a way that facilitates efficient computation of shape derivatives. This is particularly difficult with multi-physics problems involving legacy codes, where the costs of implementing and maintaining shape derivative capabilities are prohibitive. There are two mathematically equivalent approaches to computing the shape derivative: the volume method, and the boundary method. Each has a major drawback: the boundary method is less accurate, while the volume method is more invasive to the FEM code. Prior implementations of shape derivatives at Sandia have been based on the volume method. We introduce the strip method, which computes shape derivatives on a strip adjacent to the boundary. The strip method makes code coupling simple. Like the boundary method, it queries the state and adjoint solutions at quadrature nodes, but requires no knowledge of the FEM code implementations. At the same time, it exhibits the higher accuracy of the volume method. The development of the strip method also offers us the opportunity to share some lessons learned about implementing the volume method and boundary method, to show shape optimization results on problems of interest, and to begin addressing the other main challenges at hand: constraints on optimized shapes, and their interplay with optimization algorithms.

97 MATHEMATICS AND COMPUTING↗

Doping Bottleneck in Hematite: Multipole Clustering by Small Polarons

We report highly effective doping in transition metal oxides is critical to fundamentally overcome low carrier conductivity due to small polaron formation and reach their ideal efficiency for energy conversion applications. However, the optimal doping concentration in polaronic oxides such as hematite has been extremely low, for example, less than a percent, which hinders the benefits of doping for practical applications. In this work, we investigate the underlying mechanism of low optimal doping concentration with group IV (Ti, Zr, and Hf) and XIV (Si, Ge, Sn, and Pb) dopants from first-principles calculations. We find that novel dopant-polaron clustering occurs even at very low dopant concentrations and resembles electric multipoles. These multipoles can be very stable at room temperature and are difficult to fully ionize compared to separate dopants, and thus they are detrimental to carrier concentration improvement. This allows us to uncover mysteries of the doping bottleneck in hematite and provide guidance for optimizing doping and carrier conductivity in polaronic oxides toward highly efficient energy conversion applications.

36 MATERIALS SCIENCE↗

Gaussian Process Optimization of Sensitivity-Based Similarity Metrics between New Nuclear Applications and New/Existing Benchmarks [Slides]

This presentation discusses Nuclear Criticality Safety (NCS) and how designing safe, new nuclear criticality experiments requires expert judgement, which could take years of experience. Sensitivity/uncertainty (S/U) analysis can be utilized by less experienced individuals to conservatively estimate uncertainties in important parameters, such as k eff , in newly proposed nuclear experiments. The presentation poses the question of how this analysis can be performed and states that the answer lies in matching new nuclear experiments with existing benchmark experiments using similarity metrics. By increasing the criticality safety of the application in this work, higher mass limits could be used in PF-4 operations. Additionally, the presentation discusses MCNP6.2®, Whisper-1.1, the software that can be used in this analysis. Also discussed is the fact that International Criticality Safety Benchmark Evaluation Project (ICSBEP) benchmarks rarely match new nuclear applications and that there are significant differences in given set of materials and/or geometry. If there are no benchmarks that match the application, the presentation discusses the possibility of creating new benchmarks. In conclusion, this work presents a Gaussian process (GP) optimization scheme that was used to generate new benchmarks with the highest sensitivity-based similarity metrics to user-defined nuclear applications. The Gaussian process optimization successfully designed 3 new experimental benchmarks that were highly correlated to the application of interest and had k eff values near critical. Optimization over c k,i-r has shown that investigating specific isotope reactions for different applications is crucial to designing benchmark experiments. Partial contribution from Pu dominates c k similarity metric. Future work includes testing new stand-alone similarity metrics or new combinations of similarity metrics as the design criterion of this optimization – design criterion is application dependent.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Critical Path-Based Thread Placement for NUMA Systems

Multicore multiprocessors use a Non Uniform Memory Architecture (NUMA) to improve their scalability. However, NUMA introduces performance penalties due to remote memory accesses. Without efficiently managing data layout and thread mapping to cores, scientific applications, even if they are optimized for NUMA, may suffer performance loss. In this paper, we present algorithms and a runtime system that optimize the execution of OpenMP applications on NUMA architectures. By collecting information from hardware counters, the runtime system directs thread placement and reduces performance penalties by minimizing the critical path of OpenMP parallel regions. The runtime system uses a scalable algorithm that derives placement decisions with negligible overhead. We evaluate our algorithms and runtime system with four NPB applications implemented in OpenMP. On average the algorithms achieve between 8.13% and 25.68% performance improvement compared to the default Linux thread placement scheme. The algorithms miss the optimal thread placement in only 8.9% of the cases.

97 MATHEMATICS AND COMPUTING↗

Global Transformations for Legacy Parallel Applications via Structural Analysis and Rewriting

Performance and scalability optimization of large HPC applications is currently a labor-intensive, manual process with very low productivity. Major difficulties come from the disaggregated environment for HPC application development: the compiler is only involved in local decisions (core or multithreaded domain), while a library-based, communication-oriented programming model realizes whole-machine parallelism. Realizing any major global change in such a disaggregated environment is very difficult and involves changing large portions of the source code. We present semi-automated techniques, based on structural analysis and rewriting, for performing global transformations on an HPC application source code. We present two case studies using the Self-Consistent Field (SCF) standalone benchmark as well as the Coupled Cluster (CCSD) module (2.9 million lines of Fortran code), a key module of the NWChem computational chemistry application. We demonstrate how structural rewriting techniques can be used to automate transformations that affect multiple sections of the application's source code. We show that the transformations can be applied in a systematic fashion across the source code bases with minimal manual effort. These transformations improve the scalability of the SCF benchmark by more than two orders of magnitude and the performance of the full CCSD module by a factor of 4.0.

legacy parallel applications↗

Application of Time-Lapse Seismic Monitoring for the Control and Optimization of CO2 Enhanced Oil Recovery Operations

This project, 'Application of Time-Lapse Seismic Monitoring for the Control and Optimization of CO{sub 2} Enhanced Oil Recovery Operations', investigated the potential for monitoring CO{sub 2} floods in carbonate reservoirs through the use of standard p-wave seismic data. This primarily involved the use of 4D seismic (time lapse seismic) in an attempt to observe and map the movement of the injected CO{sub 2} through a carbonate reservoir. The differences between certain seismic attributes, such as amplitude, were used for this purpose. This technique has recently been shown to be effective in CO{sub 2} monitoring in Enhanced Oil Recovery (EOR) projects, such as Weyborne. This study was conducted in the Charlton 30/31 field in the northern Michigan Basin, which is a Silurian pinnacle reef that completed its primary production in 1997 and was scheduled for enhanced oil recovery using injected CO{sub 2}. Prior to injection an initial 'Base' 3D survey was obtained over the field and was then processed and interpreted. CO{sub 2} injection within the main portion of the reef was conducted intermittently during 13 months starting in August 2005. During this time, 29,000 tons of CO{sub 2} was injected into the Guelph formation, historically known as the Niagaran Brown formation. By September 2006, the reservoir pressure within the reef had risen to approximately 2000 lbs and oil and water production from the one producing well within the field had increased significantly. The determination of the reservoir's porosity distribution, a critical aspect of reservoir characterization and simulation, proved to be a significant portion of this project. In order to relate the differences observed between the seismic attributes seen on the multiple 3D seismic surveys and the actual location of the CO{sub 2}, a predictive reservoir simulation model was developed based on seismic attributes obtained from the base 3D seismic survey and available well data. This simulation predicted that the CO{sub 2} injected into the reef would remain in the northern portion of the field. Two new wells, the State Charlton 4-30 and the Larsen 3-31, were drilled into the field in 2006 and 2008 respectively and supported this assessment. A second (or 'Monitor') 3D seismic survey was acquired during September 2007 over most of the field and duplicated the first (Base) survey, as much as possible. However, as the simulation and new well data available at that time indicated that the CO{sub 2} was concentrated in the northern portion of the field, the second seismic survey was not acquired over the extreme southern end of the area covered by the original (or Base) 3D survey. Basic processing was performed on the second 3D seismic survey and, finally, 4D processing methods were applied to both the Base and the Monitor surveys. In addition to this 3D data, a shear wave seismic data set was obtained at the same time. Interpretation of the 4D seismic data indicated that a significant amplitude change, not attributable to differences in acquisition or processing, existed at the locations within the reef predicted by the reservoir simulation. The reservoir simulation was based on the porosity distribution obtained from seismic attributes from the Base 3D survey. Using this validated reservoir simulation the location of oil within the reef at the time the Monitor survey was obtained and recommendations made for the drilling of additional EOR wells. The economic impact of this project has been estimated in terms of both enhanced oil recovery and CO{sub 2} sequestration potential. In the northern Michigan Basin alone, the Niagaran reef play is comprised of over 700 Niagaran reefs with reservoirs already depleted by primary production. Potentially there is over 1 billion bbls of oil (original oil in place minus primary recovery) remains in the reefs in Michigan, much of which could be more efficiently mobilized utilizing techniques similar to those employed in this study.

02 PETROLEUM↗

Optimal filtering and generation of entangled photons for quantum applications in the presence of noise

Filtering is commonly used in quantum optics to reject noise photons, and also to enable interference between independent photons. However, filtering the joint spectrum of photon pairs can reduce the inherent coincidence probability or loss-independent heralding efficiency. Here we investigate filtering for multiphoton applications based on entanglement and interference (e.g., quantum teleportation). We multiplex C-band entangled photons and C-band classical communications into the same long-distance fibers, which enables scalable low-loss quantum networking but requires filtering of spontaneous Raman scattering noise from classical light. Using tunable-bandwidth filters, low-jitter detectors, and polarization filters, we distribute wavelength-degenerate time-bin entangled photons in the C band (1536.5 nm) over 25 km/25 km standard fibers (50 km) each carrying 10 Gbit/s C-band classical data signals. Narrow filtering enables milliwatt-level C-band power, which exceeds the power achieved by comparable studies by roughly an order of magnitude and could feasibly support terabit per second classical rates. We evaluate how performance depends on pump and filter bandwidths, multipair emission, filter shapes, loss, phase matching, and how quantum information is measured. We find a trade-off between reducing noise impact and increasing single-mode purity, and discuss mitigation methods toward optimal multiphoton applications. Importantly, these results apply to noise in free space and in quantum devices (sources, frequency converters, switches, detectors, etc.) and provide insight into filter-induced degradation of single-photon purity and rates even in noise-free environments.

Thomas, Jordan M. [Fermilab; Northwestern U.]↗

Simulation-driven optimization of high-order meshes in ALE hydrodynamics

Here we propose tools for high-order mesh optimization and demonstrate their benefits in the context of multi-material Arbitrary Lagrangian-Eulerian (ALE) compressible shock hydrodynamic applications. The mesh optimization process is driven by information provided by the simulation which uses the optimized mesh, such as shock positions, material regions, known error estimates, etc. These simulation features are usually represented discretely, for instance, as finite element functions on the Lagrangian mesh. The discrete nature of the input is critical for the practical applicability of the algorithms we propose and distinguishes this work from approaches that strictly require analytical information. Our methods are based on node movement through a high-order extension of the Target-Matrix Optimization Paradigm (TMOP). The proposed formulation is fully algebraic and relies only on local Jacobian matrices, so it is applicable to all types of mesh elements, in 2D and 3D, and any order of the mesh. We discuss the notions of constructing adaptive target matrices and obtaining their derivatives, reconstructing discrete data in intermediate meshes, node limiting that enables improvement of global mesh quality while preserving space-dependent local mesh features, and appropriate normalization of the objective function. The adaptivity methods are combined with automatic ALE triggers that can provide robustness of the mesh evolution and avoid excessive remap procedures. The benefits of the new high-order TMOP technology are illustrated on several simulations performed in the high-order ALE application BLAST.

97 MATHEMATICS AND COMPUTING↗

A primal–dual algorithm for risk minimization

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗

Numerical Methods for Large-Scale Data Factorization (Final Report (Milestone Date 9/30/11) for Subcontract No. B594099)

The following work has been performed by PI Hans De Sterck and graduate student Manda Winlaw for the required tasks 1-5 (as listed in the Statement of Work). Graduate student Manda Winlaw has visited LLNL January 31-March 11, 2011 and May 23-August 19, 2010, working with Van Henson and Mike O'Hara on non-negative matrix factorizations (NMF). She has investigated the dense subgraph clustering algorithm from 'Finding Dense Subgraphs for Sparse Undirected, Directed, and Bipartite Graphs' by Chen and Saad, testing this method on several term-document matrices and adapting it to cluster based on the rank of the subgraphs instead of the density. Manda Winlaw was awarded a first prize in the annual LLNL summer student poster competition for a poster on her NMF research. PI Hans De Sterck has developed a new adaptive algebraic multigrid algorithm for computing a few dominant or minimal singular triplets of sparse rectangular matrices. This work builds on adaptive algebraic multigrid methods that were further developed by the PI and collaborators (including Sanders and Henson) for Markov chains. The method also combines and extends existing multigrid algorithms for the symmetric eigenproblem. The PI has visited LLNL February 22-25, 2011, and has given a CASC seminar 'Algebraic Multigrid for the Singular Value Problem' on this work on February 23, 2011. During his visit, he has discussed this work and related topics with Van Henson, Geoffrey Sanders, Panayot Vassilevski, and others. He has tested the algorithm on PDE matrices and on a term-document matrix, with promising initial results. Manda Winlaw has also started to work, with O'Hara, on estimating probability distributions over undirected graph edges. The goal is to estimate probabilistic models from sets of undirected graph edges for the purpose of prediction, anomaly detection and support to supervised learning. Graduate student Manda Winlaw is writing a paper on the results obtained with O'Hara which will be submitted some time later in 2011 to a data mining conference. PI Hans De Sterck has developed a new optimization algorithm for canonical tensor approximation, formulating an extension of the nonlinear GMRES method to optimization problems. Numerical results for tensors with up to 8 modes show that this new method is efficient for sparse and dense tensors. He has written a paper on this which has been submitted to the SIAM Journal on Scientific Computing. PI Hans De Sterck has further developed his new optimization algorithm for canonical tensor approximation, formulating an extension in terms of steepest-descent preconditioning, which makes the approach generally applicable for nonlinear optimization. He has written a paper on this extension which has been submitted to Numerical Linear Algebra with Applications.

97 MATHEMATICS AND COMPUTING↗

Parallelizing autotuning for HPC applications: Unveiling the potential of the speculation strategy in Bayesian optimization

In the exascale computing era, tuning High-Performance Computing (HPC) applications has become a significant computational challenge. Although Bayesian optimization (BO) has emerged as a promising tool for HPC performance tuning, the BO workflow is inherently sequential (i.e., one function evaluation at a time) and cannot leverage the huge amount of parallel resources present in modern supercomputers, resulting in a considerable underutilization of their computational capabilities. This paper explores the trade-off between search quality and parallelism in BO, investigating a diverse set of methods. Building upon both previous approaches from the literature and novel methodologies introduced in this work, our study provides a deep analysis to accelerate BO performance tuning. By examining a set of synthetic functions and practical HPC applications, our exploration analyzes the interaction among various BO methods for parallelization, the quantity of parallel resources, the runtime distribution of target HPC applications, and the costs associated with different search orchestration mechanisms that have been overlooked in previous studies. Compared to sequential BO, our novel methodology achieves comparable quality while demonstrating robust scalability in search time as the amount of parallel resources increases; it also outperforms a state-of-the-art tuner, which supports parallelization, achieving up to 3.67x faster search time. We provide high-value insights for practitioners seeking to leverage the power of parallel computing for efficient HPC application tuning. Additionally, to further assist researchers in accelerating the performance tuning of their HPC applications, we provide an extension of an existing open-source tuning framework that incorporates our methods.

Bayesian optimization↗

Optimal Sizing Tool for Battery Storage in Grid Applications

The battery storage sizing tool developed at Pacific Northwest National Laboratory can be used to evaluate economic performance and determine the optimal size of battery storage in different use cases considering multiple power system applications. The considered use cases include i) utility owned battery storage, and ii) battery storage behind customer meter. The power system applications from energy storage include energy arbitrage, balancing services, T&D deferral, outage mitigation, demand charge reduction etc. Most of existing solutions consider only one or two grid services simultaneously, such as balancing service and energy arbitrage. ES-select developed by Sandia and KEMA is able to consider multiple grid services but it stacks the grid services based on priorities instead of co-optimization. This tool is the first one that provides a co-optimization for systematic and local grid services.

Wu, Di↗

Recent Advances of PyROS: A Pyomo Solver for Nonconvex Two-Stage Robust Optimization in Process Systems Engineering

This poster highlights uncertainty and technical risk reduction capabilities in CCSI2, with a focus on robust optimization. It presents recent advances of the two-stage robust optimization (RO) solver PyROS and applications to advanced energy systems optimization. To demonstrate the computational performance and reliability of PyROS, a benchmarking study on a library of over 8,500 small-scale RO problems is presented. Further, PyROS is used to obtain robust system designs of a MEA-based CO2 absorber under uncertainty in the thermodynamic property models for a variety of CO2 capture rate threshold requirements. Overall, the results demonstrate that the PyROS solver, including recent extensions to multi-stage RO settings, provides a reliable avenue to optimize the design and operation of advanced energy systems subject to various sources of parametric uncertainty.

Sherman, Jason↗

Recent Advances of PyROS: A Pyomo Solver for Nonconvex Two-Stage Robust Optimization in Process Systems Engineering

This poster highlights uncertainty and technical risk reduction capabilities in CCSI2, with a focus on robust optimization. It presents recent advances of the two-stage robust optimization (RO) solver PyROS and applications to advanced energy systems optimization. To demonstrate the computational performance and reliability of PyROS, a benchmarking study on a library of over 8,500 small-scale RO problems is presented. Further, PyROS is used to obtain robust system designs of a MEA-based CO2 absorber under uncertainty in the thermodynamic property models for a variety of CO2 capture rate threshold requirements. Overall, the results demonstrate that the PyROS solver, including recent extensions to multi-stage RO settings, provides a reliable avenue to optimize the design and operation of advanced energy systems subject to various sources of parametric uncertainty.

Sherman, Jason↗

Nonconvex Robust Optimization for the Design and Operation of Advanced Energy Systems Using PyROS

This work discusses recent advances of the two-stage robust optimization (RO) solver PyROS and applications to advanced energy systems optimization. To demonstrate the computational performance and reliability of PyROS, a study on a monoethanolamine (MEA)-based CO2 absorption flowsheet is presented. (Near-)robust feasible designs for CO2 absorption flowsheet at high carbon capture are obtained with the PyROS solver. The results demonstrate that the PyROS solver, including recent extensions to multi-stage RO settings, provides a reliable avenue to optimize the design and operation of advanced energy systems subject to various sources of parametric uncertainty.

Sherman, Jason↗

Instanton-based techniques for analysis and reduction of error floor of LDPC codes

We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.

97 MATHEMATICS AND COMPUTING↗