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 523 records · Page 29

Machine Learning-Assisted Distribution System Network Reconfiguration Problem

High penetration from volatile renewable energy resources in the grid and the varying nature of loads raise the need for frequent line switching to ensure the efficient operation of electrical distribution networks. Operators must ensure maximum load delivery, reduced losses, and the operation between voltage limits. However, computations to decide the optimal feeder configuration are often computationally expensive and intractable, making it unfavorable for real-time operations. This is mainly due to the existence of binary variables in the network reconfiguration optimization problem. To tackle this issue, we have devised an approach that leverages machine learning techniques to reshape distribution networks featuring multiple substations. This involves predicting the substation responsible for serving each part of the network. Hence, it leaves simple and more tractable Optimal Power Flow problems to be solved. This method can produce accurate results in a significantly faster time, as demonstrated using the IEEE 37-bus distribution feeder. Compared to the traditional optimization-based approaches, a feasible solution is achieved approximately ten times faster for all the tested scenarios.

deep neural networks↗

Perspective: Reproducible Coherence Characterization of Superconducting Quantum Devices

As the field of superconducting quantum computing approaches maturity, optimization of single-device performance is proving to be a promising avenue towards large-scale quantum computers. However, this optimization is possible only if performance metrics can be accurately compared among measurements, devices, and laboratories. Currently such comparisons are inaccurate or impossible due to understudied errors from a plethora of sources. In this Perspective, we outline the current state of error analysis for qubits and resonators in superconducting quantum circuits, and discuss what future investigations are required before superconducting quantum device optimization can be realized.

McRae, Corey H.↗

Optimal Orbital Selection for Full Configuration Interaction (OptOrbFCI): Pursuing the Basis Set Limit under a Budget

Full configuration interaction (FCI) solvers are limited to small basis sets due to their expensive computational costs. An optimal orbital selection for FCI (OptOrbFCI) is proposed to boost the power of existing FCI solvers to pursue the basis set limit under a computational budget. The optimization problem coincides with that of the complete active space SCF method (CASSCF), while OptOrbFCI is algorithmically quite different. OptOrbFCI effectively finds an optimal rotation matrix via solving a constrained optimization problem directly to compress the orbitals of large basis sets to one with a manageable size, conducts FCI calculations only on rotated orbital sets, and produces a variational ground-state energy and its wave function. Coupled with coordinate descent full configuration interaction (CDFCI), we demonstrate the efficiency and accuracy of the method on the carbon dimer and nitrogen dimer under basis sets up to cc-pV5Z. We also benchmark the binding curve of the nitrogen dimer under the cc-pVQZ basis set with 28 selected orbitals, which provide consistently lower ground-state energies than the FCI results under the cc-pVDZ basis set. Furthermore, the dissociation energy in this case is found to be of higher accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SU-E-T-422: Fast Analytical Beamlet Optimization for Volumetric Intensity-Modulated Arc Therapy

Purpose: To implement a fast optimization algorithm on CPU/GPU heterogeneous computing platform and to obtain an optimal fluence for a given target dose distribution from the pre-calculated beamlets in an analytical approach. Methods: The 2D target dose distribution was modeled as an n-dimensional vector and estimated by a linear combination of independent basis vectors. The basis set was composed of the pre-calculated beamlet dose distributions at every 6 degrees of gantry angle and the cost function was set as the magnitude square of the vector difference between the target and the estimated dose distribution. The optimal weighting of the basis, which corresponds to the optimal fluence, was obtained analytically by the least square method. Those basis vectors with a positive weighting were selected for entering into the next level of optimization. Totally, 7 levels of optimization were implemented in the study.Ten head-and-neck and ten prostate carcinoma cases were selected for the study and mapped to a round water phantom with a diameter of 20cm. The Matlab computation was performed in a heterogeneous programming environment with Intel i7 CPU and NVIDIA Geforce 840M GPU. Results: In all selected cases, the estimated dose distribution was in a good agreement with the given target dose distribution and their correlation coefficients were found to be in the range of 0.9992 to 0.9997. Their root-mean-square error was monotonically decreasing and converging after 7 cycles of optimization. The computation took only about 10 seconds and the optimal fluence maps at each gantry angle throughout an arc were quickly obtained. Conclusion: An analytical approach is derived for finding the optimal fluence for a given target dose distribution and a fast optimization algorithm implemented on the CPU/GPU heterogeneous computing environment greatly reduces the optimization time.

60 APPLIED LIFE SCIENCES↗

Optimization Algorithms for Hierarchical Problems, with Application to Nanoporous Materials

This project investigated computational methods for optimizing the design of nanoporous materials. These materials hold promise in energy storage applications such as electrical supercapacitors and hydrogen storage systems. A significant issue for nanoporous storage devices is the design of the channel network within these materials to allow rapid diffusion while retaining storage capacity.

97 MATHEMATICS AND COMPUTING↗

An Efficient Algorithm for Automatic Structure Optimization in X-ray Standing-Wave Experiments

We present that x-ray standing-wave photoemission experiments involving multilayered samples are emerging as unique probes of the buried interfaces that are ubiquitous in current device and materials research. Such data require for their analysis a structure optimization process comparing experiment to theory that is not straightforward. In this work, we present a new computer program for optimizing the analysis of standing-wave data, called SWOPT, that automates this trial-and-error optimization process. The program includes an algorithm that has been developed for computationally expensive problems: so-called black-box simulation optimizations. It also includes a more efficient version of the Yang X-ray Optics Program (YXRO) [Yang, S.-H., Gray, A.X., Kaiser, A.M., Mun, B.S., Sell, B.C., Kortright, J.B., Fadley, C.S., J. Appl. Phys. 113, 1 (2013)] which is about an order of magnitude faster than the original version. Human interaction is not required during optimization. We tested our optimization algorithm on real and hypothetical problems and show that it finds better solutions significantly faster than a random search approach. The total optimization time ranges, depending on the sample structure, from minutes to a few hours on a modern laptop computer, and can be up to 100x faster than a corresponding manual optimization. Finally, these speeds make the SWOPT program a valuable tool for realtime analyses of data during synchrotron experiments.

36 MATERIALS SCIENCE↗

QuComm: Optimizing Collective Communication for Distributed Quantum Computing

Distributed quantum computing (DQC) is a scalable way to build a large-scale quantum computing system while the error-prone nonlocal communication between DQC nodes may heavily degrade the fidelity of the distributed quantum program and thus demands specific compiler optimizations. Previous compilers on DQC communication optimization either assumes unlimited communication resource or a few communication qubits due to the hardware limitation. The former compilers may not be efficient when interfacing with communication-resource-constrained DQC hardware while the latter compilers lose the opportunities of optimizing collective communication and routing concurrent communication as they unnecessarily couple limited communication qubits with the implementation of expensive inter-node operations. In this paper, we invent the communication buffer, a communication facility consisting of idle qubits in each compute node, to decouple the execution of inter-node quantum operations from communication qubits: communication qubits are devoted to generating inter-node entanglement while internode operations are conducted in the communication buffer. The communication buffer provides an intermediate layer for inter-node communication and paves the way for collective communication optimization. We then propose QuComm, a buffer-based compiler framework that first performs smart buffer allocation according to communication characteristics of the distributed quantum program and then optimizes and collectively routes inter-node quantum operations. Experimental results on a hierarchical DQC system show that the proposed QuComm can reduce the most expensive inter-node communication request and the latency of various distributed quantum programs by 50.4% and 47.6% on average, respectively.

Wu, Anbang↗

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗

A Parallel Computing Framework for Finding the Supported Solutions to a Biobjective Network Optimization Problem

Abstract Solving multi‐objective combinatorial optimization problems can quickly become computationally challenging when applied to large networks generated from big data. Present‐day first‐rate Mixed Integer Programming (MIP) solvers have parallelism built‐in to take advantage of multicore architectures; but specialized network optimization algorithms that can often solve graph problems more efficiently than a general MIP solver are typically programmed serially. Thus, these network algorithm implementations do not take full advantage of modern multicore computer capabilities. Many parallel computing languages include a fork/join framework into their concurrency packages that allow for simple conversion of recursive serial algorithms to operate in parallel without having to use complicated low‐level message‐passing interfaces. Fork/join is particularly well suited to divide and conquer algorithms such as Non‐Inferior Set Estimation (NISE) method for computing the supported Pareto front of a multi‐objective optimization problem. This work develops a simple general parallel NISE (pNISE) implementation using the Java 7 concurrency tools, and then offers results from a specific implementation of solving a bi‐objective shortest path problem. The results indicate that this method is capable of sizeable speed‐ups on both small‐scale personal computers as well as large‐scale shared memory supercomputers. Finally, other network problems suitable to this method are discussed, including multi‐objective variants of the minimum spanning tree problem, transportation problem, assignment problem, maximum flow problem, and the minimum‐cost flow problem. Copyright © 2015 John Wiley & Sons, Ltd.

Medrano, Fernando Antonio↗

Comparison of Shape Optimization Methods for Heat Exchanger Fins Using Computational Fluid Dynamics

Inverse design techniques are one way to leverage advances in 3D printing, artificial intelligence, and computational resources to achieve increased performance of heat exchangers. Two optimization techniques (genetic algorithm and particle swarm) and three geometry representations (binary level set, composite Bézier, and free form deformation) are used to increase the heat transfer and reduce the pressure drop of a heat exchanger fin. After running 210,810 OpenFOAM simulations, results indicate that a significant performance increase of the fin can be realized in less than 48 hrs, allowing for such a process to be integrated in traditional design processes. The best design increased the performance of the objective function, compared to the baseline rectangular geometry by 75%. A custom distributed infrastructure was built, allowing for all methods to reach 95% of the final objective values in a little over 4 hrs, handling 1674 OpenFoam simulations per hour.

42 ENGINEERING↗

System, methods and apparatus for program optimization for multi-threaded processor architectures

Methods, apparatus and computer software product for source code optimization are provided. In an exemplary embodiment, a first custom computing apparatus is used to optimize the execution of source code on a second computing apparatus. In this embodiment, the first custom computing apparatus contains a memory, a storage medium and at least one processor with at least one multi-stage execution unit. The second computing apparatus contains at least two multi-stage execution units that allow for parallel execution of tasks. The first custom computing apparatus optimizes the code for parallelism, locality of operations and contiguity of memory accesses on the second computing apparatus. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

42 ENGINEERING↗

Application of an automated machine learning-genetic algorithm (AutoML-GA) coupled with computational fluid dynamics simulations for rapid engine design optimization

In recent years, the use of machine learning-based surrogate models for computational fluid dynamics (CFD) simulations has emerged as a promising technique for reducing the computational cost associated with engine design optimization. However, such methods still suffer from drawbacks. One main disadvantage is that the default machine learning (ML) hyperparameters are often severely suboptimal for a given problem. This has often been addressed by manually trying out different hyperparameter settings, but this solution is ineffective in case of a high-dimensional hyperparameter space. Besides this problem, the amount of data needed for training is also not known a priori. In response to these issues that need to be addressed, the present work describes and validates an automated active learning approach, AutoML-GA, for surrogate-based optimization of internal combustion engines. In this approach, a Bayesian optimization technique is used to find the best machine learning hyperparameters based on an initial dataset obtained from a small number of CFD simulations. Subsequently, a genetic algorithm is employed to locate the design optimum on the ML surrogate surface. In the vicinity of the design optimum, the solution is refined by repeatedly running CFD simulations at the projected optima and adding the newly obtained data to the training dataset. It is demonstrated that AutoML-GA leads to a better optimum with a lower number of CFD simulations, compared to the use of default hyperparameters. The proposed framework offers the advantage of being a more hands-off approach that can be readily utilized by researchers and engineers in industry who do not have extensive machine learning expertise.

Owoyele, Opeoluwa↗

AADL: Anderson Accelerated Deep Learning

We propose a stable, distributed approach to perform AA that accelerates the convergence rate of stochastic first-order optimizers to train neural networks. Differently from previous works, we do not alter neither the scheme to perform AA nor the loss function minimized during the training. To improve robustness against stagnation, we customize general guidelines that suggest to relax the frequency of AA corrections by performing AA only at the end of an entire training epoch. To improve robustness of AA against the stochastic oscillations of first-order optimizers, we average the gradients computed on consecutive stochastic optimization updates. The improved regularity of the converging sequence and the reduced amplitude of stochastic oscillations across consecutive optimization steps allows AA to efficiently extrapolate an improved converging sequence, thereby overcoming limitations of existing approaches to perform AA on stochastic optimization.

Lupo Pasini, Massimiliano [Oak Ridge National Lab.↗

Computation-Efficient Algorithm for Distributed Feedback Optimization of Distribution Grids

Feedback-based optimization algorithms use real-time measurements to update the optimal control for the underlying system which may not be fully identified. Recently, we have developed a distributed feedback-based algorithm [1] that avoids the requirement of fast communication between central computing and local actuator/sensor agents. This paper extends the work by greatly reducing the number of copies of variables involved in the distributed feedback-based algorithm, which results in faster convergence and lower communication requirement. The main idea is to leverage the specific structural properties of the admittance matrix for distribution systems with tree network topology. We also show the effectiveness of the proposed algorithm in simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Harnessing High‐Throughput Computational Methods to Accelerate the Discovery of Optimal Proton Conductors for High‐Performance and Durable Protonic Ceramic Electrochemical Cells

Abstract The pursuit of high‐performance and long‐lasting protonic ceramic electrochemical cells (PCECs) is impeded by the lack of efficient and enduring proton conductors. Conventional research approaches, predominantly based on a trial‐and‐error methodology, have proven to be demanding of resources and time‐consuming. Here, this work reports the findings in harnessing high‐throughput computational methods to expedite the discovery of optimal electrolytes for PCECs. This work methodically computes the oxygen vacancy formation energy (E V ), hydration energy (E H ), and the adsorption energies of H 2 O and CO 2 for a set of 932 oxide candidates. Notably, these findings highlight BaSn x Ce 0.8‐x Yb 0.2 O 3‐δ (BSCYb) as a prospective game‐changing contender, displaying superior proton conductivity and chemical resilience when compared to the well‐regarded BaZr x Ce 0.8‐x Y 0.1 Yb 0.1 O 3‐δ (BZCYYb) series. Experimental validations substantiate the computational predictions; PCECs incorporating BSCYb as the electrolyte achieved extraordinary peak power densities in the fuel cell mode (0.52 and 1.57 W cm −2 at 450 and 600 °C, respectively), a current density of 2.62 A cm −2 at 1.3 V and 600 °C in the electrolysis mode while demonstrating exceptional durability for over 1000‐h when exposed to 50% H 2 O. This research underscores the transformative potential of high‐throughput computational techniques in advancing the field of proton‐conducting oxides for sustainable power generation and hydrogen production.

08 HYDROGEN↗

Space-filling designs for computer experiments: A review

Improving the quality of a product/process using a computer simulator is a much less expensive option than the real physical testing. However, simulation using computationally intensive computer models can be time consuming and therefore, directly doing the optimization on the computer simulator can be infeasible. Experimental design and statistical modeling techniques can be used for overcoming this problem. This article reviews experimental designs known as space-filling designs that are suitable for computer simulations. In the review, a special emphasis is given for a recently developed space-filling design called maximum projection design. Furthermore, its advantages are illustrated using a simulation conducted for optimizing a milling process.

97 MATHEMATICS AND COMPUTING↗

Parametrization of textural patterns in {sup 123}I-ioflupane imaging for the automatic detection of Parkinsonism

Purpose: A novel approach to a computer aided diagnosis system for the Parkinson's disease is proposed. This tool is intended as a supporting tool for physicians, based on fully automated methods that lead to the classification of{sup 123}I-ioflupane SPECT images. Methods: {sup 123}I-ioflupane images from three different databases are used to train the system. The images are intensity and spatially normalized, then subimages are extracted and a 3D gray-level co-occurrence matrix is computed over these subimages, allowing the characterization of the texture using Haralick texture features. Finally, different discrimination estimation methods are used to select a feature vector that can be used to train and test the classifier. Results: Using the leave-one-out cross-validation technique over these three databases, the system achieves results up to a 97.4% of accuracy, and 99.1% of sensitivity, with positive likelihood ratios over 27. Conclusions: The system presents a robust feature extraction method that helps physicians in the diagnosis task by providing objective, operator-independent textural information about{sup 123}I-ioflupane images, commonly used in the diagnosis of the Parkinson's disease. Textural features computation has been optimized by using a subimage selection algorithm, and the discrimination estimation methods used here makes the system feature-independent, allowing us to extend it to other databases and diseases.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Inverse design for waveguide dispersion with a differentiable mode solver

Inverse design of optical components based on adjoint sensitivity analysis has the potential to address the most challenging photonic engineering problems. However, existing inverse design tools based on finite-difference-time-domain (FDTD) models are poorly suited for optimizing waveguide modes for adiabatic transformation or perturbative coupling, which lies at the heart of many important photonic devices. Among these, dispersion engineering of optical waveguides is especially challenging in ultrafast and nonlinear optical applications involving broad optical bandwidths and frequency-dependent anisotropic dielectric material response. In this work, we develop gradient back-propagation through a general-purpose electromagnetic eigenmode solver and use it to demonstrate waveguide dispersion optimization for second harmonic generation with maximized phase-matching bandwidth. This optimization of three design parameters converges in eight steps, reducing the computational cost of optimization by ∼100x compared to exhaustive search and identifying new designs for broadband optical frequency doubling of laser sources in the 1.3–1.4 µm wavelength range. Furthermore, we demonstrate that the computational cost of gradient back-propagation is independent of the number of parameters, as required for optimization of complex geometries. This technique enables practical inverse design for a broad range of previously intractable photonic devices.

Gray, Dodd (ORCID:000000030469599X)↗