Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal algorithms”

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 829 records · Page 46
All sourcesNASA NTRSDOE OSTI
DOE OSTI2012

Evaluating the Efficiency of a Multi-core Aware Multi-objective Optimization Tool for Calibrating the SWAT Model

The efficiency of calibrating physically-based complex hydrologic models is a major concern in the application of those models to understand and manage natural and human activities that affect watershed systems. In this study, we developed a multi-core aware multi-objective evolutionary optimization algorithm (MAMEOA) to improve the efficiency of calibrating a worldwide used watershed model (Soil and Water Assessment Tool (SWAT)). The test results show that MAMEOA can save about 1-9%, 26-51%, and 39-56% time consumed by calibrating SWAT as compared with sequential method by using dual-core, quad-core, and eight-core machines, respectively. Potential and limitations of MAMEOA for calibrating SWAT are discussed. MAMEOA is open source software.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

MASK3 for Advanced WEC Dynamics and Controls

This report outlines the "MASK3" wave tank test within the Advanced WEC Dynamics and Controls (AWDC) project. This test represents the final test in the AWDC project. The focus of the MASK3 test was to consider coordinated 3-degree-of-freedom (3DOF) control of a WEC in a realistic ocean environment. A key aspect of this test was the inclusion of a "self-tuning" mechanism which uses an optimization algorithm to update controller gains based on a changing sea state. The successful implementation of the self-tuning mechanism is the last crucial step required for such a controller to be implemented in real ocean environments.

16 TIDAL AND WAVE POWER↗
DOE OSTI2016

Quantitative microstructural imaging by scanning Laue x-ray micro- and nanodiffraction

We present that local crystal structure, crystal orientation, and crystal deformation can all be probed by Laue diffraction using a submicron x-ray beam. This technique, employed at a synchrotron facility, is particularly suitable for fast mapping the mechanical and microstructural properties of inhomogeneous multiphase polycrystalline samples, as well as imperfect epitaxial films or crystals. As synchrotron Laue x-ray microdiffraction enters its 20th year of existence and new synchrotron nanoprobe facilities are being built and commissioned around the world, we take the opportunity to overview current capabilities as well as the latest technical developments. Fast data collection provided by state-of-the-art area detectors and fully automated pattern indexing algorithms optimized for speed make it possible to map large portions of a sample with fine step size and obtain quantitative images of its microstructure in near real time. Lastly, we extrapolate how the technique is anticipated to evolve in the near future and its potential emerging applications at a free-electron laser facility.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Beam-Based Diagnostics of Electric Guide Fields and Lattice Parameters for Run-1 of the Muon g-2 Storage Ring at Fermilab

A portion of the Muon g-2 Storage Ring electric system, which provides vertical beam focusing, exhibited an unexpected time dependence that produced a characteristic evolution of the stored beam during Run-1 of the Muon g-2 Experiment at Fermilab (E989). A method to reconstruct the Run-1 electric guide fields has been developed, which is based on a numerical model of the muon storage ring and optimization algorithms supported by COSY INFINITY. This method takes beam profile measurements from the Muon g-2 straw tracking detectors as input, and it produces a full reconstruction of the time-dependent fields. The fields can then be used for the reproduction of detailed beam tracking simulations and the calculation of ring lattice parameters for acceptance studies and systematic error evaluations.

43 PARTICLE ACCELERATORS↗
DOE OSTI2012

Reuse of Produced Water from CO 2 Enhanced Oil Recovery, Coal-Bed Methane, and Mine Pool Water by Coal-Based Power Plants

Power generation in the Illinois Basin is expected to increase by as much as 30% by the year 2030, and this would increase the cooling water consumption in the region by approximately 40%. This project investigated the potential use of produced water from CO 2 enhanced oil recovery (CO 2 -EOR) operations; coal-bed methane (CBM) recovery; and active and abandoned underground coal mines for power plant cooling in the Illinois Basin. Specific objectives of this project were: (1) to characterize the quantity, quality, and geographic distribution of produced water in the Illinois Basin; (2) to evaluate treatment options so that produced water may be used beneficially at power plants; and (3) to perform a techno-economic analysis of the treatment and transportation of produced water to thermoelectric power plants in the Illinois Basin. Current produced water availability within the basin is not large, but potential flow rates up to 257 million liters per day (68 million gallons per day (MGD)) are possible if CO 2 -enhanced oil recovery and coal bed methane recovery are implemented on a large scale. Produced water samples taken during the project tend to have dissolved solids concentrations between 10 and 100 g/L, and water from coal beds tends to have lower TDS values than water from oil fields. Current pretreatment and desalination technologies including filtration, adsorption, reverse osmosis (RO), and distillation can be used to treat produced water to a high quality level, with estimated costs ranging from $2.6 to $10.5 per cubic meter ($10 to $40 per 1000 gallons). Because of the distances between produced water sources and power plants, transportation costs tend to be greater than treatment costs. An optimization algorithm was developed to determine the lowest cost pipe network connecting sources and sinks. Total water costs increased with flow rate up to 26 million liters per day (7 MGD), and the range was from $4 to $16 per cubic meter ($15 to $60 per 1000 gallons), with treatment costs accounting for 13-23% of the overall cost. Results from this project suggest that produced water is a potential large source of cooling water, but treatment and transportation costs for this water are large.

20 FOSSIL-FUELED POWER PLANTS↗
DOE OSTI2013

Final report on DOE ASCR Grant DESC0001862 (ER25894)

As was outlined in the proposal, the overall objective of this project is to investigate advanced optimization algorithms for solving entropy maximization problems. Entropy maximization is a general tool for reconstructing the least biased estimate of the state of a complex system, based on available information. In transport and kinetic theory, entropy maximization is used to derive closures for moment models in order to reduce the complexity of a kinetic description while maintaining many of its fundamental features. Application areas include gas dynamics, charged-particle transport, thermal radiative transfer, and neutron transport. Some such applications are of prime importance to the Department of Energy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

A multiresolution spatial parametrization for the estimation of fossil-fuel carbon dioxide emissions via atmospheric inversions.

The estimation of fossil-fuel CO2 emissions (ffCO2) from limited ground-based and satellite measurements of CO2 concentrations will form a key component of the monitoring of treaties aimed at the abatement of greenhouse gas emissions. To that end, we construct a multiresolution spatial parametrization for fossil-fuel CO2 emissions (ffCO2), to be used in atmospheric inversions. Such a parametrization does not currently exist. The parametrization uses wavelets to accurately capture the multiscale, nonstationary nature of ffCO2 emissions and employs proxies of human habitation, e.g., images of lights at night and maps of built-up areas to reduce the dimensionality of the multiresolution parametrization. The parametrization is used in a synthetic data inversion to test its suitability for use in atmospheric inverse problem. This linear inverse problem is predicated on observations of ffCO2 concentrations collected at measurement towers. We adapt a convex optimization technique, commonly used in the reconstruction of compressively sensed images, to perform sparse reconstruction of the time-variant ffCO2 emission field. We also borrow concepts from compressive sensing to impose boundary conditions i.e., to limit ffCO2 emissions within an irregularly shaped region (the United States, in our case). We find that the optimization algorithm performs a data-driven sparsification of the spatial parametrization and retains only of those wavelets whose weights could be estimated from the observations. Further, our method for the imposition of boundary conditions leads to a 10 computational saving over conventional means of doing so. We conclude with a discussion of the accuracy of the estimated emissions and the suitability of the spatial parametrization for use in inverse problems with a significant degree of regularization.

Ray, Jaideep↗
DOE OSTI2014

Matrix Algebra for GPU and Multicore Architectures (MAGMA) for Large Petascale Systems

The goal of the MAGMA project is to create a new generation of linear algebra libraries that achieve the fastest possible time to an accurate solution on hybrid Multicore+GPU-based systems, using all the processing power that future high-end systems can make available within given energy constraints. Our efforts at the University of Tennessee achieved the goals set in all of the five areas identified in the proposal: 1. Communication optimal algorithms; 2. Autotuning for GPU and hybrid processors; 3. Scheduling and memory management techniques for heterogeneity and scale; 4. Fault tolerance and robustness for large scale systems; 5. Building energy efficiency into software foundations. The University of Tennessee’s main contributions, as proposed, were the research and software development of new algorithms for hybrid multi/many-core CPUs and GPUs, as related to two-sided factorizations and complete eigenproblem solvers, hybrid BLAS, and energy efficiency for dense, as well as sparse, operations. Furthermore, as proposed, we investigated and experimented with various techniques targeting the five main areas outlined.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Visualization for Hyper-Heuristics: Front-End Graphical User Interface

Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. While such automated design has great advantages, it can often be difficult to understand exactly how a design was derived and why it should be trusted. This project aims to address these issues of usability by creating an easy-to-use graphical user interface (GUI) for hyper-heuristics to support practitioners, as well as scientific visualization of the produced automated designs. My contributions to this project are exhibited in the user-facing portion of the developed system and the detailed scientific visualizations created from back-end data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

A Comparison of Genetic Programming Variants for Hyper-Heuristics

Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved, such as routing vehicles over highways with constantly changing traffic flows, because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. Hyper-heuristics typically employ Genetic Programming (GP) and this project has investigated the relationship between the choice of GP and performance in Hyper-heuristics. Results are presented demonstrating the existence of problems for which there is a statistically significant performance differential between the use of different types of GP.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Visualization for Hyper-Heuristics: Back-End Processing

Modern society is faced with increasingly complex problems, many of which can be formulated as generate-and-test optimization problems. Yet, general-purpose optimization algorithms may sometimes require too much computational time. In these instances, hyperheuristics may be used. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario, finding the solution significantly faster than its predecessor. However, it may be difficult to understand exactly how a design was derived and why it should be trusted. This project aims to address these issues by creating an easy-to-use graphical user interface (GUI) for hyper-heuristics and an easy-to-understand scientific visualization for the produced solutions. To support the development of this GUI, my portion of the research involved developing algorithms that would allow for parsing of the data produced by the hyper-heuristics. This data would then be sent to the front-end, where it would be displayed to the end user.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Parameter Estimation and Model Validation of Nonlinear Dynamical Networks

In the performance period of this work under a DOE contract, the co-PIs, Philip Gill and Henry Abarbanel, developed new methods for statistical data assimilation for problems of DOE interest, including geophysical and biological problems. This included numerical optimization algorithms for variational principles, new parallel processing Monte Carlo routines for performing the path integrals of statistical data assimilation. These results have been summarized in the monograph: “Predicting the Future: Completing Models of Observed Complex Systems” by Henry Abarbanel, published by Spring-Verlag in June 2013. Additional results and details have appeared in the peer reviewed literature.

42 ENGINEERING↗
DOE OSTI2013

Multi-meson systems in lattice QCD / Many-body QCD

Nuclear physics entails the study of the properties and interactions of hadrons, such as the proton and neutron, and atomic nuclei and it is central to our understanding of our world at the smallest scales. The underlying basis for nuclear physics is provided by the Standard Model of particle physics which describes how matter interacts through the strong, electromagnetic and weak (electroweak) forces. This theory was developed in the 1970s and provides an extremely successful description of our world at the most fundamental level to which it has been probed. The Standard Model has been, and continues to be, subject to stringent tests at particle accelerators around the world, so far passing without blemish. However, at the relatively low energies that are relevant for nuclear physics, calculations involving the strong interaction, governed by the equations of Quantum Chromodynamics (QCD), are enormously challenging, and to date, the only systematic way to perform them is numerically, using a framework known as lattice QCD (LQCD). In this approach, one discretizes space-time and numerically solves the equations of QCD on a space-time lattice; for realistic calculations, this requires highly optimized algorithms and cutting-edge high performance computing (HPC) resources. Progress over the project period is discussed in detail in the following subsections

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

Optimal Ground Source Heat Pump System Design

Despite the facts that GSHPs first gained popularity as early as the 1940’s and they can achieve 30 to 60 percent in energy savings and carbon emission reductions relative to conventional HVAC systems, the use of geothermal energy in the U.S. has been less than 1 percent of the total energy consumption. The key barriers preventing this technically-mature technology from reaching its full commercial potential have been its high installation cost and limited consumer knowledge and trust in GSHP systems to deliver the technology in a cost-effective manner in the market place. Led by ENVIRON, with support from University Hartford and University of Vermont, the team developed and tested a software-based a decision making tool (‘OptGSHP’) for the least-cost design of ground-source heat pump (‘GSHP’) systems. OptGSHP combines state of the art optimization algorithms with GSHP-specific HVAC and groundwater flow and heat transport simulation. The particular strength of OptGSHP is in integrating heat transport due to groundwater flow into the design, which most of the GSHP designs do not get credit for and therefore are overdesigned.

42 ENGINEERING↗
DOE OSTI2017

Ising Processing Units: Potential and Challenges for Discrete Optimization

The recent emergence of novel computational devices, such as adiabatic quantum computers, CMOS annealers, and optical parametric oscillators, presents new opportunities for hybrid-optimization algorithms that leverage these kinds of specialized hardware. In this work, we propose the idea of an Ising processing unit as a computational abstraction for these emerging tools. Challenges involved in using and bench- marking these devices are presented, and open-source software tools are proposed to address some of these challenges. The proposed benchmarking tools and methodology are demonstrated by conducting a baseline study of established solution methods to a D-Wave 2X adiabatic quantum computer, one example of a commercially available Ising processing unit.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

FY17 Status Report on the Initial Development of a Constitutive Model for Grade 91 Steel

Grade 91 is a candidate structural material for high temperature advanced reactor applications. Existing ASME Section III, Subsection HB, Subpart B simplified design rules based on elastic analysis are setup as conservative screening tools with the intent to supplement these screening rules with full inelastic analysis when required. The Code provides general guidelines for suitable inelastic models but does not provide constitutive model implementations. This report describes the development of an inelastic constitutive model for Gr. 91 steel aimed at fulfilling the ASME Code requirements and being included into a new Section III Code appendix, HBB-Z. A large database of over 300 experiments on Gr. 91 was collected and converted to a standard XML form. Five families of Gr. 91 material models were identified in the literature. Of these five, two are potentially suitable for use in the ASME code. These two models were implemented and evaluated against the experimental database. Both models have deficiencies so the report develops a framework for developing and calibrating an improved model. This required creating a new modeling method for representing changes in material rate sensitivity across the full ASME allowable temperature range for Gr. 91 structural components: room temperature to 650° C. On top of this framework for rate sensitivity the report describes calibrating a model for work hardening and softening in the material using genetic algorithm optimization. Future work will focus on improving this trial model by including tension/compression asymmetry observed in experiments and necessary to capture material ratcheting under zero mean stress and by improving the optimization and analysis framework.

36 MATERIALS SCIENCE↗
DOE OSTI2017

Light Water Reactor Sustainability Program Status of Adaptive Surrogates within the RAVEN framework

The RAVEN code has been under development at the Idaho National Laboratory since 2012. Its main goal is to create a multi-purpose platform for the deploying of all the capabilities needed for Probabilistic Risk Assessment, uncertainty quantification, data mining analysis and optimization studies. RAVEN has demonstrated a good level of maturity in terms of state-of-art and advanced analysis methodologies. Indeed, in the past year the RAVEN code has been released as open-source project and is available to download (raven.inl.gov) free of charge. The main subject of this report is to show the activities that have been recently accomplished with respect the adaptive surrogate modeling: Implementation of the metric system for the assessment of surrogate model validity; Implementation of cross-validation techniques for the global assessment of surrogate models; Implementation of an automatic infrastructure for switching between a high-fidelity model (e.g. physical code) and a surrogate or set of surrogates; Implementation of a scheme for automatic optimization of surrogate model parameters. The aim of this document is to report the status of the development of methods, within the RAVEN framework, to assess the validity of the predictive capabilities of surrogate models. Indeed, after the construction of a surrogate tight to a certain physical model, it is crucial to assess the goodness of its representation, in order to be confident with its prediction. A cross-validation technique has been employed. This report will highlight the implementation details and proof its correct implementation by an application example. The implementation of a way to assess the predictive capabilities of a surrogate allowed the construction of a RAVEN new entity named “HybridModel” that is aimed to switch between an high-fidelity code and its linked surrogate. In addition, leveraging the optimization algorithms that have been implemented in RAVEN last fiscal year, a new scheme has been developed for automatic tuning of the surrogates’ parameters (e.g. penalty factors in support vector machines).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Exploiting Geometric Partitioning in Task Mapping for Parallel Computes

We present a new method for mapping applications' MPI tasks to cores of a parallel computer such that applications' communication time is reduced. We address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network, although our methods generalize to contiguous allocations as well. The goal is to assign tasks to cores so that interdependent tasks are performed by "nearby' cores, thus lowering the distance messages must travel, the amount of congestion in the network, and the overall cost of communication. Our new method applies a geometric partitioning algorithm to both the tasks and the processors, and assigns task parts to the corresponding processor parts. We also present a number of algorithmic optimizations that exploit specific features of the network or application. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 32K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗