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,027 records · Page 57

Optimal fabrication processes for unidirectional metal-matrix composites: A computational simulation

A method is proposed for optimizing the fabrication process of unidirectional metal matrix composites. The temperature and pressure histories are optimized such that the residual microstresses of the composite at the end of the fabrication process are minimized and the material integrity throughout the process is ensured. The response of the composite during the fabrication is simulated based on a nonlinear micromechanics theory. The optimal fabrication problem is formulated and solved with non-linear programming. Application cases regarding the optimization of the fabrication cool-down phases of unidirectional ultra-high modulus graphite/copper and silicon carbide/titanium composites are presented.

Saravanos, D. A.↗

Multi-disciplinary optimization of aeroservoelastic systems

Efficient analytical and computational tools for simultaneous optimal design of the structural and control components of aeroservoelastic systems are presented. The optimization objective is to achieve aircraft performance requirements and sufficient flutter and control stability margins with a minimal weight penalty and without violating the design constraints. Analytical sensitivity derivatives facilitate an efficient optimization process which allows a relatively large number of design variables. Standard finite element and unsteady aerodynamic routines are used to construct a modal data base. Minimum State aerodynamic approximations and dynamic residualization methods are used to construct a high accuracy, low order aeroservoelastic model. Sensitivity derivatives of flutter dynamic pressure, control stability margins and control effectiveness with respect to structural and control design variables are presented. The performance requirements are utilized by equality constraints which affect the sensitivity derivatives. A gradient-based optimization algorithm is used to minimize an overall cost function. A realistic numerical example of a composite wing with four controls is used to demonstrate the modeling technique, the optimization process, and their accuracy and efficiency.

Karpel, Mordechay↗

Optimal fabrication processes for unidirectional metal-matrix composites - A computational simulation

A method is proposed for optimizing the fabrication process of unidirectional metal matrix composites. The temperature and pressure histories are optimized such that the residual microstresses of the composite at the end of the fabrication process are minimized and the material integrity throughout the process is ensured. The response of the composite during the fabrication is simulated based on a nonlinear micromechanics theory. The optimal fabrication problem is formulated and solved with nonlinear programming. Application cases regarding the optimization of the fabrication cool-down phases of unidirectional ultra-high modulus graphite/copper and silicon carbide/titanium composites are presented.

Saravanos, D. A.↗

Optimal dynamic remapping of data parallel computations

A large class of data parallel computations is characterized by a sequence of phases, with phase changes occurring unpredictably. Dynamic remapping of the workload to processors may be required to maintain good performance. The problem considered, for which the utility of remapping and the future behavior of the workload are uncertain, arises when phases exhibit stable execution requirements during a given phase, but requirements change radically between phases. For these situations, a workload assignment generated for one phase may hinder performance during the next phase. This problem is treated formally for a probabilistic model of computation with at most two phases. The authors address the fundamental problem of balancing the expected remapping performance gain against the delay cost, and they derive the optimal remapping decision policy. The promise of the approach is shown by application to multiprocessor implementations of an adaptive gridding fluid dynamics program and to a battlefield simulation program.

Nicol, David M.↗

Software For Nearly Optimal Packing Of Cargo

PACKMAN computer program used to find nearly optimal arrangements of cargo items in storage containers, subject to such multiple packing objectives as utilization of volumes of containers, utilization of containers up to limits on weights, and other considerations. Automatic packing algorithm employed attempts to find best positioning of cargo items in container, such that volume and weight capacity of container both utilized to maximum extent possible. Written in Common LISP.

Fennel, Theron R.↗

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.↗

An overview of the current state of the art optimization used for trajectory design in the GTS system

The high cost of delivering payloads to orbit demands that launch vehicles be flown in an optimal and reliable manner. Thus, computer simulated trajectories are optimized to obtain maximum vehicle payload capability or a maximum amount of reserve fuel, subject to design constraints. The Generalized Trajectory Simulation (GTS) system developed at The Aerospace Corporation is capable of simulating and optimizing trajectories for a wide variety of boost and reentry problems. Optimization is an integral part of the GTS system. This has resulted in progressive use of optimization. Additionally, the flexibility of the GTS system allows optimum trade studies to be conducted and complicated missions to be designed. This paper describes the integrated and flexible nature of the optimization software in the GTS system. Special features of the NLP2 and NLP3 optimization codes are described. Post optimality, parameter sensitivity analysis and the automatic scaling capability in the GTS system are also described.

Beltracchi, Todd J.↗

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↗

Design of transonic airfoil sections using a similarity theory

A study of the available methods for transonic airfoil and wing design indicates that the most powerful technique is the numerical optimization procedure. However, the computer time for this method is relatively large because of the amount of computation required in the searches during optimization. The optimization method requires that base and calibration solutions be computed to determine a minimum drag direction. The design space is then computationally searched in this direction; it is these searches that dominate the computation time. A recent similarity theory allows certain transonic flows to be calculated rapidly from the base and calibration solutions. In this paper the application of the similarity theory to design problems is examined with the object of at least partially eliminating the costly searches of the design optimization method. An example of an airfoil design is presented.

Nixon, D.↗

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)↗

Open-loop control of noise amplification in a separated boundary layer flow

Linear optimal gains are computed for the subcritical two-dimensional separated boundary-layer flow past a bump. Very large optimal gain values are found, making it possible for small-amplitude noise to be strongly amplified and to destabilize the flow. The optimal forcing is located close to the summit of the bump, while the optimal response is the largest in the shear layer. The largest amplification occurs at frequencies corresponding to eigenvalues which first become unstable at higher Reynolds number. Nonlinear direct numerical simulations show that a low level of noise is indeed sufficient to trigger random flow unsteadiness, characterized here by large-scale vortex shedding. Next, a variational technique is used to compute efficiently the sensitivity of optimal gains to steady control (through source of momentum in the flow, or blowing/suction at the wall). A systematic analysis at several frequencies identifies the bump summit as the most sensitive region for control with wall actuation. Based on these results, a simple open-loop control strategy is designed, with steady wall suction at the bump summit. Linear calculations on controlled base flows confirm that optimal gains can be drastically reduced at all frequencies. Nonlinear direct numerical simulations also show that this control allows the flow to withstand a higher level of stochastic noise without becoming nonlinearly unstable, thereby postponing bypass transition. In the supercritical regime, sensitivity analysis of eigenvalues supports the choice of this control design. Full restabilization of the flow is obtained, as evidenced by direct numerical simulations and linear stability analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗