Search NASA⌕ Search

SEARCH · Search NASA

Results for “Global 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 469 records · Page 26

Automated Algorithms for Quantum-Level Accuracy in Atomistic Simulations: LDRD Final Report.

This report summarizes the result of LDRD project 12-0395, titled "Automated Algorithms for Quantum-level Accuracy in Atomistic Simulations." During the course of this LDRD, we have developed an interatomic potential for solids and liquids called Spectral Neighbor Analysis Poten- tial (SNAP). The SNAP potential has a very general form and uses machine-learning techniques to reproduce the energies, forces, and stress tensors of a large set of small configurations of atoms, which are obtained using high-accuracy quantum electronic structure (QM) calculations. The local environment of each atom is characterized by a set of bispectrum components of the local neighbor density projected on to a basis of hyperspherical harmonics in four dimensions. The SNAP coef- ficients are determined using weighted least-squares linear regression against the full QM training set. This allows the SNAP potential to be fit in a robust, automated manner to large QM data sets using many bispectrum components. The calculation of the bispectrum components and the SNAP potential are implemented in the LAMMPS parallel molecular dynamics code. Global optimization methods in the DAKOTA software package are used to seek out good choices of hyperparameters that define the overall structure of the SNAP potential. FitSnap.py, a Python-based software pack- age interfacing to both LAMMPS and DAKOTA is used to formulate the linear regression problem, solve it, and analyze the accuracy of the resultant SNAP potential. We describe a SNAP potential for tantalum that accurately reproduces a variety of solid and liquid properties. Most significantly, in contrast to existing tantalum potentials, SNAP correctly predicts the Peierls barrier for screw dislocation motion. We also present results from SNAP potentials generated for indium phosphide (InP) and silica (SiO 2 ). We describe efficient algorithms for calculating SNAP forces and energies in molecular dynamics simulations using massively parallel computers and advanced processor ar- chitectures. Finally, we briefly describe the MSM method for efficient calculation of electrostatic interactions on massively parallel computers.

Thompson, Aidan Patrick↗

Topology for Statistical Modeling of Petascale Data

Many commonly used algorithms for mathematical analysis do not scale well enough to accommodate the size or complexity of petascale data produced by computational simulations. The primary goal of this project is to develop new mathematical tools that address both the petascale size and uncertain nature of current data. At a high level, the approach of the entire team involving all three institutions is based on the complementary techniques of combinatorial topology and statistical modelling. In particular, we use combinatorial topology to filter out spurious data that would otherwise skew statistical modelling techniques, and we employ advanced algorithms from algebraic statistics to efficiently find globally optimal fits to statistical models. The overall technical contributions can be divided loosely into three categories: (1) advances in the field of combinatorial topology, (2) advances in statistical modelling, and (3) new integrated topological and statistical methods. Roughly speaking, the division of labor between our 3 groups (Sandia Labs in Livermore, Texas A&M in College Station, and U Utah in Salt Lake City) is as follows: the Sandia group focuses on statistical methods and their formulation in algebraic terms, and finds the application problems (and data sets) most relevant to this project, the Texas A&M Group develops new algebraic geometry algorithms, in particular with fewnomial theory, and the Utah group develops new algorithms in computational topology via Discrete Morse Theory. However, we hasten to point out that our three groups stay in tight contact via videconference every 2 weeks, so there is much synergy of ideas between the groups. The following of this document is focused on the contributions that had grater direct involvement from the team at the University of Utah in Salt Lake City.

97 MATHEMATICS AND COMPUTING↗

Molecular level structure in water-alcohol mixtures; from shots to pints: L’Chaim!

The two objectives of this work are to look at the molecular level mixing in water-alcohol liquid mixtures and to determine how well the Effective Fragment Potential (EFP) method performs at describing small, heterogenous water-alcohol mixtures. In this work we look both at small clusters, size 2 – 24 molecules, as well as bulk mixtures, 64 or more molecules. For small clusters (2 – 24 molecules), the molecular structure was studied using the EFP method and MP2. Extensive Monte Carlo/simulated annealing (MC/SA) global optimizations were used to locate low energy structures for all water, alcohol, and water-alcohol mixtures. The alcohols studied include the small, straight-chain, primary alcohols: methanol, ethanol, propanol, and 1-butanol as well as the secondary alcohol 2-butanol, and tertiary butanol. It is shown that a number of low energy mixed clusters retain the structural characteristics of the pure clusters. It is also shown that the EFP method performs well at describing small, heterogenous water-alcohol mixtures. The molecular structure in bulk water, alcohol, and water-alcohol mixtures is studied with the EFP method and molecular dynamics simulations. Radial distribution functions are used to analyze structure and to benchmark the EFP method against experimental results. The effect of alcohol concentration and alcohol chain length on the local structure of water is investigated. Preliminary results indicate that the EFP method can potentially model bulk water-alcohol systems well as compared to experiment. Results on the effects of alcohol chain length are forthcoming.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

3-D Semantic Information Inference from Airborne Video. Final Report

We developed a full 3D modeling pipeline focusing on an important application scenario: city-scale 3D reconstruction from aerial imagery. We propose an approach to solve camera pose estimation and dense reconstruction from Wide Area Aerial Surveillance (WAAS) videos captured by an airborne platform. Our approach solves them in an online fashion: it incrementally updates a sparse 3D map and estimates the camera pose as each new frame arrives; depth maps of selected key frames are computed using a variational method and integrated to produce a full 3D model via volumetric reconstruction. In practice, aerial imagery is usually captured using a multicamera system. We propose an approach for camera pose estimation of multi-camera aerial imagery which is parallelized on multiple GPUs for efficiency. The approach is also extended for progressive 3D model acquisition with a hand-held camera. We also developed an offline approach since online approach is not a necessity and accuracy has higher priority over efficiency in many scenarios. We presented MeshRecon, a mesh-based offline system composed of three modules: a dense point cloud is generated using multi-resolution plane sweep method; an initial mesh model is extracted from the point cloud via global optimization considering visibility information of all images; the mesh model is then iteratively refined to capture structural details by optimizing the photometric consistency and spatial regularization. The major processes are parallelized on GPU for efficiency. For the aerial imagery case, we evaluate our system on several real-world multicamera aerial imagery datasets, each covering an urban scenario of several square kilometers. Quantitative result shows that the reconstructed geometric 3D model is highly accurate with error smaller than 1 meter over the entire city. Besides aerial imagery, we also evaluate its performance on general geometric 3D model acquisition of real-world objects. Result shows that the system is robust and flexible for various types of objects at different scales in both indoor and outdoor environments. Based on city 3D models reconstructed at different times, we present a system for city-scale geometry change detection by performing comparisons at the 3D geometry level. Our system is able to detect geometry changes at different scales, ranging from a building cluster to small-scale vegetation changes, with high accuracy.

97 MATHEMATICS AND COMPUTING↗

An X-ray Intensity Operations Monitor (AXIOM) (Final LDRD Project Report)

The Saturn accelerator has historically lacked the capability to measure time-resolved spectra for its 3-ring bremsstrahlung x-ray source. This project aimed to create a spectrometer called AXIOM to provide this capability. The project had three major development pillars: hardware, simulation, and unfold code. The hardware consists of a ring of 24 detectors around an existing x-ray pinhole camera. The diagnostic was fielded on two shots at Saturn and over 100 shots at the TriMeV accelerator at Idaho Accelerator Center. A new Saturn x-ray environment simulation was created using measured data to validate. This simulation allows for timeresolved spectra computation to compare the experimental results. The AXIOM-Unfold code is a new parametric unfold code using modern global optimizers and uncertainty quantification. The code was written in Python, uses Gitlab version control and issue tracking, and has been developed with long term code support and maintenance in mind.

43 PARTICLE ACCELERATORS↗

Open-source release of CGMF 1.1 and Integration into the MCNP6.3 ® Code [Slides]

As a result of a multi-year NA-22 project, CGMF was integrated into MCNP6.2 and publicly released. CGMF was open-sourced and publicly released and MCNP6.3 was updated to include the latest version and is in the process of being publicly released. Current and future plans include global optimization and uncertainty quantification within CGMF, model parameter fitting such that CGMF may be used in ENDF/B evaluations, and improving both standalone and MCNP-integrated CGM (non-fission) simulations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An Iterative Approach for Solving the SCOPF Problem Applying LP, SOCP, and NLP Subproblems

We propose to develop efficient algorithms and software for the SCOPF problem. We will employ an iterative approach that will: a) use linear subproblems and other active set filtering techniques to identify the most important contingencies and drastically reduce the SCOPF model size; b) solve SOCP relaxations of the reduced SCOPF to converge to the neighborhood of the global optimal solution and establish a lower bound on the solution, and; c) use a non-convex, nonlinear interior-point solver, Artelys Knitro, to converge quickly to the optimal solution. To identify the most effective approach, we will experiment with several techniques to identify the tradeoffs between contingency subproblem complexity and fast solvability.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Deep Generative Models for Materials Discovery and Machine Learning-Accelerated Innovation

Machine learning and artificial intelligence (AI/ML) methods are beginning to have significant impact in chemistry and condensed matter physics. For example, deep learning methods have demonstrated new capabilities for high-throughput virtual screening, and global optimization approaches for inverse design of materials. Recently, a relatively new branch of AI/ML, deep generative models (GMs), provide additional promise as they encode material structure and/or properties into a latent space, and through exploration and manipulation of the latent space can generate new materials. These approaches learn representations of a material structure and its corresponding chemistry or physics to accelerate materials discovery, which differs from traditional AI/ML methods that use statistical and combinatorial screening of existing materials via distinct structure-property relationships. However, application of GMs to inorganic materials has been notably harder than organic molecules because inorganic structure is often more complex to encode. In this work we review recent innovations that have enabled GMs to accelerate inorganic materials discovery. We focus on different representations of material structure, their impact on inverse design strategies using variational autoencoders or generative adversarial networks, and highlight the potential of these approaches for discovering materials with targeted properties needed for technological innovation.

36 MATERIALS SCIENCE↗

A Design Method for Low-Pressure Venturi Nozzles

The purpose of this work is to provide empirical design models for low-pressure, subsonic Venturi nozzles. Experimentally validated simulations were used to determine the effect of nozzle geometry and operating conditions on the suction ratio (ratio of suction mass flow rate to motive mass flow rate) of low-pressure, subsonic Venturi nozzles, over a wide range of geometries and operating conditions, through a parametric study. The results of the parametric study were used to develop seven empirical models, each with a different range of applicability or calculating a different indicator of nozzle performance (i.e., suction ratio, momentum ratio, or dynamic pressure ratio), of the Venturi nozzles using a constrained multi-variable global optimization method. Of the seven empirical models, the best models were found to be those for low- (less than one) and high-suction ratios (greater than one), with mean absolute percentage errors of 5% and 18%, respectively. These empirical models provide a design tool for subsonic, low-pressure Venturi nozzles that is more than an order of magnitude more accurate than a governing equation approach or conventional flow head calculations. These newly-developed empirical models can be applied for initial nozzle design when precise suction ratios are required.

O’Hern, Hannah↗

Convex Relaxations of Maximal Load Delivery for Multi-Contingency Analysis of Joint Electric Power and Natural Gas Transmission Networks

Recent increases in gas-fired power generation have engendered increased interdependencies between natural gas and power transmission systems. These interdependencies have amplified existing vulnerabilities in gas and power grids, where disruptions can require the curtailment of load in one or both systems. Although typically operated independently, coordination of these systems during severe disruptions can allow for targeted delivery to lifeline services, including gas delivery for residential heating and power delivery for critical facilities. To address the challenge of estimating maximum joint network capacities under such disruptions, we consider the task of determining feasible steady-state operating points for severely damaged systems while ensuring the maximal delivery of gas and power loads simultaneously, represented mathematically as the nonconvex joint Maximal Load Delivery (MLD) problem. To increase its tractability, we present a mixed-integer convex relaxation of the MLD problem. Then, to demonstrate the relaxation’s effectiveness in determining bounds on network capacities, exact and relaxed MLD formulations are compared across various multi-contingency scenarios on nine joint networks ranging in size from 25 to 1191 nodes. The relaxation-based methodology is observed to accurately and efficiently estimate the impacts of severe joint network disruptions, often converging to the relaxed MLD problem’s globally optimal solution within ten seconds.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A machine learning approach to emulation and biophysical parameter estimation with the Community Land Model, version 5

Abstract. Land models are essential tools for understanding and predicting terrestrial processes and climate–carbon feedbacks in the Earth system, but uncertainties in their future projections are poorly understood. Improvements in physical process realism and the representation of human influence arguably make models more comparable to reality but also increase the degrees of freedom in model configuration, leading to increased parametric uncertainty in projections. In this work we design and implement a machine learning approach to globally calibrate a subset of the parameters of the Community Land Model, version 5 (CLM5) to observations of carbon and water fluxes. We focus on parameters controlling biophysical features such as surface energy balance, hydrology, and carbon uptake. We first use parameter sensitivity simulations and a combination of objective metrics including ranked global mean sensitivity to multiple output variables and non-overlapping spatial pattern responses between parameters to narrow the parameter space and determine a subset of important CLM5 biophysical parameters for further analysis. Using a perturbed parameter ensemble, we then train a series of artificial feed-forward neural networks to emulate CLM5 output given parameter values as input. We use annual mean globally aggregated spatial variability in carbon and water fluxes as our emulation and calibration targets. Validation and out-of-sample tests are used to assess the predictive skill of the networks, and we utilize permutation feature importance and partial dependence methods to better interpret the results. The trained networks are then used to estimate global optimal parameter values with greater computational efficiency than achieved by hand tuning efforts and increased spatial scale relative to previous studies optimizing at a single site. By developing this methodology, our framework can help quantify the contribution of parameter uncertainty to overall uncertainty in land model projections.

54 ENVIRONMENTAL SCIENCES↗

Broadcasting satellite service synthesis using gradient and cyclic coordinate search procedures

Two search techniques are considered for solving satellite synthesis problems. Neither is likely to find a globally optimal solution. In order to determine which method performs better and what factors affect their performance, we design an experiment and solve the same problem under a variety of starting solution configuration-algorithm combinations. Since there is no randomization in the experiment, we present results of practical, rather than statistical, significance. Our implementation of a cyclic coordinate search procedure clearly finds better synthesis solutions than our implementation of a gradient search procedure does with our objective of maximizing the minimum C/I ratio computed at test points on the perimeters of the intended service areas. The length of the available orbital arc and the configuration of the starting solution are shown to affect the quality of the solutions found.

Reilly, C. H.↗

Broadcasting satellite service synthesis using gradient and cyclic coordinate search procedures

Two search techniques are considered for solving satellite synthesis problems. Neither is likely to find a globally optimal solution. In order to determine which method performs better and what factors affect their performance, an experiment is designed and the same problem is solved under a variety of starting solution configuration-algorithm combinations. Since there is no randomization in the experiment, results of practical, rather than statistical, significance are presented. Implementation of a cyclic coordinate search procedure clearly finds better synthesis solutions than implementation of a gradient search procedure does with the objective of maximizing the minimum C/I ratio computed at test points on the perimeters of the intended service areas. The length of the available orbital arc and the configuration of the starting solution are shown to affect the quality of the solutions found.

Reilly, C. H.↗

Neural-Network Processor Would Allocate Resources

Global optimization problems solved quickly. Neural-network processor optimizes allocation of M resources among N expenditures according to cost of pairing each resource with each expenditure and subject to limit on number of resources feeding into each expenditure and/or limit on number of expenditures to which each resource allocated. One cell performs several analog and digital functions. Potential applications include assignment of jobs, scheduling, dispatching, and planning of military maneuvers.

Eberhardt, Silvio P.↗

Neural Network Solves "Traveling-Salesman" Problem

Experimental electronic neural network solves "traveling-salesman" problem. Plans round trip of minimum distance among N cities, visiting every city once and only once (without backtracking). This problem is paradigm of many problems of global optimization (e.g., routing or allocation of resources) occuring in industry, business, and government. Applied to large number of cities (or resources), circuits of this kind expected to solve problem faster and more cheaply.

Thakoor, Anilkumar P.↗

Geometric programming prediction of design trends for OMV protective structures

The global optimization trends of protective honeycomb structural designs for spacecraft subject to hypervelocity meteroid and space debris are presented. This nonlinear problem is first formulated for weight minimization of the orbital maneuvering vehicle (OMV) using a generic monomial predictor. Five problem formulations are considered, each dependent on the selection of independent design variables. Each case is optimized by considering the dual geometric programming problem. The dual variables are solved for in terms of the generic estimated exponents of the monomial predictor. The primal variables are then solved for by conversion. Finally, parametric design trends are developed for ranges of the estimated regression parameters. Results specify nonmonotonic relationships for the optimal first and second sheet mass per unit areas in terms of the estimated exponents.

Mog, R. A.↗

Programmable synaptic devices for electronic neural nets

The architecture, design, and operational characteristics of custom VLSI and thin film synaptic devices are described. The devices include CMOS-based synaptic chips containing 1024 reprogrammable synapses with a 6-bit dynamic range, and nonvolatile, write-once, binary synaptic arrays based on memory switching in hydrogenated amorphous silicon films. Their suitability for embodiment of fully parallel and analog neural hardware is discussed. Specifically, a neural network solution to an assignment problem of combinatorial global optimization, implemented in fully parallel hardware using the synaptic chips, is described. The network's ability to provide optimal and near optimal solutions over a time scale of few neuron time constants has been demonstrated and suggests a speedup improvement of several orders of magnitude over conventional search methods.

Moopenn, A.↗