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 1,567 records · Page 87

Integrated structural-aerodynamic design optimization

This paper focuses on the processes of simultaneous aerodynamic and structural wing design as a prototype for design integration, with emphasis on the major difficulty associated with multidisciplinary design optimization processes, their enormous computational costs. Methods are presented for reducing this computational burden through the development of efficient methods for cross-sensitivity calculations and the implementation of approximate optimization procedures. Utilizing a modular sensitivity analysis approach, it is shown that the sensitivities can be computed without the expensive calculation of the derivatives of the aerodynamic influence coefficient matrix, and the derivatives of the structural flexibility matrix. The same process is used to efficiently evaluate the sensitivities of the wing divergence constraint, which should be particularly useful, not only in problems of complete integrated aircraft design, but also in aeroelastic tailoring applications.

Haftka, R. T.↗

Xenon Gas Separation and Storage using Metal-Organic Frameworks

The global demand for Xe, a noble gas with applications in electronics, lighting, and the medical industry, is expected to rise significantly over the coming decades. However, the low abundance of Xe in the earth’s atmosphere and the costly cryogenic distillation process that is used to obtain Xe commercially via air separation have limited the scale of applications of Xe. A physisorption-based separation using porous materials may be a viable and cost-effective alternative to cryogenic distillation. In particular, metal-organic frameworks (MOFs) have shown promise as highly Xe-selective, porous solids. In this review, we detail the recent advances of MOFs as adsorbents for noble gas adsorption/separation and the role of computer simulation in finding optimal materials for Xe adsorption.

MOFs, Xenon, Krypton↗

Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. Here we model this process as an binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of O(p log(p)), where p is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity’s better than 99.9%, in ≈ 25 trust-region iterations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Designing Critical Experiments Using Gaussian Process Optimization

New nuclear applications may lack similarity between the application and existing ICSBEP benchmarks. Without accurate benchmark data, predictive simulations will have high uncertainty in the estimate of a parameter of interest (such as k eff ). The design of critical experiments tuned for specific applications of interest is one solution to reducing uncertainty in the necessarily nuclear data. We propose an optimization technique to design critical experiments that match the cross-section sensitivities of an application model while minimizing the number of simulation runs in the optimization. The optimization of a critical experiment is slow because the potential design space covers many qualitative variables (types of material and geometries) and corresponding quantitative variables (e.g., material dimensions) and the evaluation of any specific design requires running an expensive code like MCNP1 and Whisper. The optimization of expensive black-box computer codes with quantitative variables has been extensively explored in the literature of design of computer experiments. We propose a modified version of standard Gaussian process (GP) optimization that optimizes over multiple discrete configurations of qualitative variables in parallel which reduces the computational cost of the entire optimization. The goal of this work is to minimize the number of MCNP evaluations while still exploring many different design configurations in parallel.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Compiler-Directed Transformation for Higher-Order Stencils

As the cost of data movement increasingly dominates performance, developers of finite-volume and finite-difference solutions for partial differential equations (PDEs) are exploring novel higher-order stencils that increase numerical accuracy and computational intensity. This paper describes a new compiler reordering transformation applied to stencil operators that performs partial sums in buffers, and reuses the partial sums in computing multiple results. This optimization has multiple effect son improving stencil performance that are particularly important to higher-order stencils: exploits data reuse, reduces floating-point operations, and exposes efficient SIMD parallelism to backend compilers. We study the benefit of this optimization in the context of Geometric Multigrid (GMG), a widely used method to solvePDEs, using four different Jacobi smoothers built from 7-, 13-, 27-and 125-point stencils. We quantify performance, speedup, andnumerical accuracy, and use the Roofline model to qualify our results. Ultimately, we obtain over 4× speedup on the smoothers themselves and up to a 3× speedup on the multigrid solver. Finally, we demonstrate that high-order multigrid solvers have the potential of reducing total data movement and energy by several orders of magnitude.

97 MATHEMATICS AND COMPUTING↗

Design sensitivity analysis of rotorcraft airframe structures for vibration reduction

Optimization of rotorcraft structures for vibration reduction was studied. The objective of this study is to develop practical computational procedures for structural optimization of airframes subject to steady-state vibration response constraints. One of the key elements of any such computational procedure is design sensitivity analysis. A method for design sensitivity analysis of airframes under vibration response constraints is presented. The mathematical formulation of the method and its implementation as a new solution sequence in MSC/NASTRAN are described. The results of the application of the method to a simple finite element stick model of the AH-1G helicopter airframe are presented and discussed. Selection of design variables that are most likely to bring about changes in the response at specified locations in the airframe is based on consideration of forced response strain energy. Sensitivity coefficients are determined for the selected design variable set. Constraints on the natural frequencies are also included in addition to the constraints on the steady-state response. Sensitivity coefficients for these constraints are determined. Results of the analysis and insights gained in applying the method to the airframe model are discussed. The general nature of future work to be conducted is described.

Murthy, T. Sreekanta↗

Development of a turbomachinery design optimization procedure using a multiple-parameter nonlinear perturbation method

An investigation was carried out to complete the preliminary development of a combined perturbation/optimization procedure and associated computational code for designing optimized blade-to-blade profiles of turbomachinery blades. The overall purpose of the procedures developed is to provide demonstration of a rapid nonlinear perturbation method for minimizing the computational requirements associated with parametric design studies of turbomachinery flows. The method combines the multiple parameter nonlinear perturbation method, successfully developed in previous phases of this study, with the NASA TSONIC blade-to-blade turbomachinery flow solver, and the COPES-CONMIN optimization procedure into a user's code for designing optimized blade-to-blade surface profiles of turbomachinery blades. Results of several design applications and a documented version of the code together with a user's manual are provided.

Stahara, S. S.↗

Computational Approach for Epitaxial Polymorph Stabilization through Substrate Selection

With the ultimate goal of finding new polymorphs through targeted synthesis conditions and techniques, we outline a computational framework to select optimal substrates for epitaxial growth using first principle calculations of formation energies, elastic strain energy, and topological information. To demonstrate the approach, we study the stabilization of metastable VO2 compounds which provides a rich chemical and structural polymorph space. We find that common polymorph statistics, lattice matching, and energy above hull considerations recommends homostructural growth on TiO2 substrates, where the VO2 brookite phase would be preferentially grown on the a-c TiO2 brookite plane while the columbite and anatase structures favor the a-b plane on the respective TiO2 phases. Overall, we find that a model which incorporates a geometric unit cell area matching between the substrate and the target film as well as the resulting strain energy density of the film provide qualitative agreement with experimental observations for the heterostructural growth of known VO2 polymorphs: rutile, A and B phases. The minimal interfacial geometry matching and estimated strain energy criteria provide several suggestions for substrates and substrate-film orientations for the heterostructural growth of the hitherto hypothetical anatase, brookite, and columbite polymorphs. These criteria serve as a preliminary guidance for the experimental efforts stabilizing new materials and/or polymorphs through epitaxy. The current screening algorithm is being integrated within the Materials Project online framework and data and hence publicly available.

36 MATERIALS SCIENCE↗

Integrating External Resources with a Task-Based Programming Model

Accessing external resources (e.g., loading input data, checkpointing snapshots, and out-of-core processing) can have a significant impact on the performance of supercomputer applications. However, no existing programming systems for high-performance computing directly manage and optimize these external accesses. As a result, users must explicitly manage external accesses alongside their computation at the application level, which can result in both correctness and performance issues. We address this limitation by introducing Iris, a task-based programming model with semantics for external resources. Iris allows applications to describe their access requirements to external resources and the relationship of those accesses to the computation. Iris incorporates external I/O into a deferred execution model, reschedules external I/O to overlap I/O with computation, and reduces external I/O when possible. We evaluate Iris on three microbenchmarks representative of important workloads in HPC and a full combustion simulation, S3D. We demonstrate that the Iris implementation of S3D reduces the external I/O overhead by up to 20×, compared to the Legion and the Fortran implementations.

97 MATHEMATICS AND COMPUTING↗

Targeted Adaptive Design

Modern advanced manufacturing and advanced materials design often require searches of relatively high-dimensional process control parameter spaces for settings that result in optimal structure, property, and performance parameters. The mapping from the former to the latter must be determined from noisy experiments or from expensive simulations. Here, we abstract this problem to a mathematical framework in which an unknown function from a control space to a design space must be ascertained by means of expensive noisy measurements, which locate control settings generating desired design features within specified tolerances, with quantified uncertainty. We describe targeted adaptive design (TAD), a new algorithm that performs this sampling task efficiently. TAD creates a Gaussian process surrogate model of the unknown mapping at each iterative stage, proposing a new batch of control settings to sample experimentally and optimizing the updated expected log-predictive probability density of the target design. TAD either stops upon locating a solution with uncertainties that fit inside the tolerance box or uses a measure of expected future information to determine that the search space has been exhausted with no solution. TAD thus embodies the exploration-exploitation tension in a manner that recalls, but is essentially different from, Bayesian optimization and optimal experimental design.

97 MATHEMATICS AND COMPUTING↗

Flutter-Constrained Optimization with the Linearized Frequency-Domain Approach

Due to the high computational cost associated with unsteady aeroelastic analysis, state-of-the-art aeroelastic optimizations based on computational fluid dynamics typically ignore critical constraints like flutter and aeroelastic gust response. The linearized frequency-domain method offers an approach for adding high-fidelity flutter constraints to multidisciplinary optimizations at relatively low cost compared to other unsteady computational fluid dynamics methods. In recent work, sensitivities have been implemented for the linearized frequency-domain method in FUN3D. In this work, the linearized frequency-domain method and associated sensitivities are applied to gradient-based aeroelastic optimization with flutter constraints based on computational fluid dynamics. An overview of the flutter constraint formulation and implementation is provided, and then two optimization problems are presented. The first optimization increases the flutter speed of a pitch and plunge airfoil at transonic conditions using the minimal amount of geometric changes. The second optimization minimizes the mass of the AGARD 445.6 wing subject to a flutter constraint.

Aeroelasticity↗

Flutter-Constrained Optimization with the Linearized Frequency-Domain Approach

Due to the high computational cost associated with unsteady aeroelastic analysis, state-of-the-art aeroelastic optimizations based on computational fluid dynamics typically ignore critical constraints like flutter and aeroelastic gust response. The linearized frequency-domain method offers an approach for adding high-fidelity flutter constraints to multidisciplinary optimizations at relatively low cost compared to other unsteady computational fluid dynamics methods. In recent work, sensitivities have been implemented for the linearized frequency-domain method in FUN3D. In this work, the linearized frequency-domain method and associated sensitivities are applied to gradient-based aeroelastic optimization with flutter constraints based on computational fluid dynamics. An overview of the flutter constraint formulation and implementation is provided, and then two optimization problems are presented. The first optimization increases the flutter speed of a pitch and plunge airfoil at transonic conditions using the minimal amount of geometric changes. The second optimization minimizes the mass of the AGARD 445.6 wing subject to a flutter constraint.

Aeroelasticity↗

GPU-Accelerated Drug Discovery with Docking on the Summit Supercomputer: Porting, Optimization, and Application to COVID-19 Research

Protein-ligand docking is an in silico tool used to screen potential drug compounds for their ability to bind to a given protein receptor within a drug-discovery campaign. Experimental drug screening is expensive and time consuming, and it is desirable to carry out large scale docking calculations in a high-throughput manner to narrow the experimental search space. Few of the existing computational docking tools were designed with high performance computing in mind. Therefore, optimizations to maximize use of high-performance computational resources available at leadership-class computing facilities enables these facilities to be leveraged for drug discovery. Here we present the porting, optimization, and validation of the AutoDock-GPU program for the Summit supercomputer, and its application to initial compound screening efforts to target proteins of the SARS-CoV-2 virus responsible for the current COVID-19 pandemic.

LeGrand, Scott↗

QSPIN: A High Level Java API for Quantum Computing Experimentation

QSPIN is a high level Java language API for experimentation in QC models used in the calculation of Ising spin glass ground states and related quadratic unconstrained binary optimization (QUBO) problems. The Java API is intended to facilitate research in advanced QC algorithms such as hybrid quantum-classical solvers, automatic selection of constraint and optimization parameters, and techniques for the correction and mitigation of model and solution errors. QSPIN includes high level solver objects tailored to the D-Wave quantum annealing architecture that implement hybrid quantum-classical algorithms [Booth et al.] for solving large problems on small quantum devices, elimination of variables via roof duality, and classical computing optimization methods such as GPU accelerated simulated annealing and tabu search for comparison. A test suite of documented NP-complete applications ranging from graph coloring, covering, and partitioning to integer programming and scheduling are provided to demonstrate current capabilities.

Quantu↗

Measuring Low-Order Aberrations in a Segmented Telescope

The in-focus PSF optimizer (IPO) is an algorithm for use in monitoring and controlling the alignment of the segments of a segmented-mirror astronomical telescope. IPO is so named because it computes wave-front aberrations of the telescope from digitized pointspread functions (PSFs) measured in infocus images. Inasmuch as distant astronomical objects that behave optically as point sources can typically be seen in almost any astronomical image, the main benefit afforded by IPO may be to enable maintenance of mirror-segment alignments without detracting from valuable scientific-observation time. IPO evolved from prescription-retrieval type algorithms. Prescription retrieval uses in-focus and out-of-focus PSFs to infer the state of an imaging optical system. The state, in this context, refers to the positions, orientations, and low-order figure errors of the optical elements in the system. Both prescription- retrieval and IPO use an iterative, nonlinear, least-squares optimizer to compute the optimal state parameters such that a digital computer-generated model image matches the digitized image acquired from the real system. The difference between IPO and prescription- retrieval algorithms is that IPO is specifically designed to utilize infocus images only. Although the restriction to in-focus images limits IPO to calculating only the lowest-order wave front aberrations, it also causes the resulting computation to take much less time because fewer degrees of freedom are included in the optimization process. In the prescription retrieval software developed at JPL, the model images are generated using the ray-trace/physical optics program, MACOS. IPO, on the other hand, uses a linear sensitivity matrix to compute the exit-pupil wave front from the system parameters; the wave front is then converted into a complex pupil field, which is then propagated to the image plane via a fast Fourier transform. This approach is computationally faster and requires less computer memory than is needed for prescription retrieval.

Ohara, Catherine↗

Optimal calibration of gates in trapped-ion quantum computers

Abstract To harness the power of quantum computing, it is essential that a quantum computer provide maximal possible fidelity for a quantum circuit. To this end, much work has been done in the context of qubit routing or embedding, i.e., mapping circuit qubits to physical qubits based on gate performance metrics to optimize the fidelity of execution. Here, we take an alternative approach that leverages a unique capability of a trapped-ion quantum computer, i.e., the all-to-all qubit connectivity. We develop a method to determine a fixed number (budget) of quantum gates that, when calibrated, will maximize the fidelity of a batch of input quantum programs. This dynamic allocation of calibration resources on randomly accessible gates, determined using our heuristics, increases, for a wide range of calibration budget, the average fidelity from 70% or lower to 90% or higher for a typical batch of jobs on an 11-qubit device, in which the fidelity of calibrated and uncalibrated gates are taken to be 99% and 90%, respectively. Our heuristics are scalable, more than 2.5 orders of magnitude faster than a randomized method for synthetic benchmark circuits generated based on real-world use cases.

Maksymov, Andrii (ORCID:0000000282442851)↗

A quasi-analytical method for non-iterative computation of nonlinear controls

An optimal control solution process was developed for a general class of nonlinear dynamical systems. The method combines control theory, perturbation methods, and Van Loan's recent matrix exponential results. A variety of applications support the practical utility of this method. Nonlinear rigid body optimal maneuvers are routinely solved. Flexible body dynamical systems of an order greater than 40 were solved. The method fails occasionally due to poor convergence of the perturbation expansion or numerical difficulties associated with computing the matrix exponential. The method is attractive because it appears to be a good candidate for semi-automation; no initial guess is required, and it usually converges at 2nd or 3rd order in minutes of machine time.

Junkins, J. L.↗