Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “code 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 487 records · Page 27

JavaGenes and Condor: Cycle-Scavenging Genetic Algorithms

A genetic algorithm code, JavaGenes, was written in Java and used to evolve pharmaceutical drug molecules and digital circuits. JavaGenes was run under the Condor cycle-scavenging batch system managing 100-170 desktop SGI workstations. Genetic algorithms mimic biological evolution by evolving solutions to problems using crossover and mutation. While most genetic algorithms evolve strings or trees, JavaGenes evolves graphs representing (currently) molecules and circuits. Java was chosen as the implementation language because the genetic algorithm requires random splitting and recombining of graphs, a complex data structure manipulation with ample opportunities for memory leaks, loose pointers, out-of-bound indices, and other hard to find bugs. Java garbage-collection memory management, lack of pointer arithmetic, and array-bounds index checking prevents these bugs from occurring, substantially reducing development time. While a run-time performance penalty must be paid, the only unacceptable performance we encountered was using standard Java serialization to checkpoint and restart the code. This was fixed by a two-day implementation of custom checkpointing. JavaGenes is minimally integrated with Condor; in other words, JavaGenes must do its own checkpointing and I/O redirection. A prototype Java-aware version of Condor was developed using standard Java serialization for checkpointing. For the prototype to be useful, standard Java serialization must be significantly optimized. JavaGenes is approximately 8700 lines of code and a few thousand JavaGenes jobs have been run. Most jobs ran for a few days. Results include proof that genetic algorithms can evolve directed and undirected graphs, development of a novel crossover operator for graphs, a paper in the journal Nanotechnology, and another paper in preparation.

Globus, Al↗

The Influences of Lamination Angles on the Interior Noise Levels of an Aircraft

The feasibility of reducing the interior noise levels of an aircraft passenger cabin through optimization of the composite lay up of the fuselage is investigated. MSC/NASTRAN, a commercially available finite element code, is used to perform the dynamic analysis and subsequent optimization of the fuselage. The numerical calculation of sensitivity of acoustic pressure to lamination angle is verified using a simple thin, cylindrical shell with point force excitations as noise sources. The thin shell used represents a geometry similar to the fuselage and analytic solutions are available for the cylindrical thin shell equations of motion. Optimization of lamination angle for the reduction of interior noise is performed using a finite element model of an actual aircraft fuselage. The aircraft modeled for this study is the Beech Starship. Point forces simulate the structure borne noise produced by the engines and are applied to the fuselage at the wing mounting locations. These forces are the noise source for the optimization problem. The acoustic pressure response is reduced at a number of points in the fuselage and over a number of frequencies. The objective function is minimized with the constraint that it be larger than the maximum sound pressure level at the response points in the passenger cabin for all excitation frequencies in the range of interest. Results from the study of the fuselage model indicate that a reduction in interior noise levels is possible over a finite frequency range through optimal configuration of the lamination angles in the fuselage. Noise reductions of roughly 4 dB were attained. For frequencies outside the optimization range, the acoustic pressure response may increase after optimization. The effects of changing lamination angle on the overall structural integrity of the airframe are not considered in this study.

Fernholz, Christian M.↗

ELISA: A Tool for Optimization of Rotor Hover Performance at Low Reynolds Number in the Mars Atmosphere

The Evolutionary aLgorithm for Iterative Studies of Aeromechanics (ELISA) was developed in support of the Rotorcraft Optimization for the Advancement of Mars eXploration (ROAMX) project. ELISA was developed to enable aerodynamic rotor hover optimization for low Reynolds number flows in the Mars atmosphere. The first objective of the algorithm allows for unconventional airfoil parameterization and multi-objective airfoil geometry optimization using OVERFLOW. The Pareto-optimal airfoil sets are converted to a set of Pareto-optimal airfoil decks, providing the lowest drag air foil geometry for each angle of attack, removing the need to arbitrarily select the airfoils to be used in the rotor optimization. The second objective allows for rotor geometry optimization with simultaneous maximization of blade loading and minimization of rotor power using the comprehensive analysis CAMRADII. The result is a Pareto-optimal rotor set, providing the lowest power rotor for each attainable blade loading, and one of the first tools for hover-optimized rotors for high-subsonic low Reynolds number conditions. The airfoil thickness can be modified after the airfoil optimization is complete, allowing for a post-airfoil-optimization adjustment of blade thickness to facilitate conforming to external structural analyses requirements. The relevance of the code is demonstrated with case studies for the ROAMX rotor optimization for Ingenuity-sized single rotors in the Mars atmosphere, a performance study optimizing the chord and twist of Ingenuity’s coaxial rotor resulting in the Sample Recovery Helicopters candidate rotor, and high-subsonic low Reynolds number airfoil optimization providing novel insights for higher-efficiency low Reynolds number airfoil geometries and flow physics.

ELISA↗

Optimizing tuning masses for helicopter rotor blade vibration reduction including computed airloads and comparison with test data

An optimization procedure is developed for locating tuning masses on a rotor blade so that vibratory loads are minimized and hub-shear harmonics are reduced without adding a large mass penalty. The airloads are computed by means of a helicopter analysis for the cases of three vs six tuning masses, with attention given to the prediction of changes in airloads. Frequencies, airloads, and hub loads are computed with the CAMRAD/JA helicopter analysis code and the Conmin general-purpose optimization program. The hub shear is found to be significantly reduced in both cases with the added mass, and the reduction of hub shear is demonstrated under three flight conditions. Comparisons with wind-tunnel data demonstrate that the correlation of mass location is good and the relationship between mass location and flight speed is predicted well by the model.

Pritchard, Jocelyn I.↗

Approach for Input Uncertainty Propagation and Robust Design in CFD Using Sensitivity Derivatives

An implementation of the approximate statistical moment method for uncertainty propagation and robust optimization for quasi 3-D Euler CFD code is presented. Given uncertainties in statistically independent, random, normally distributed input variables, first- and second-order statistical moment procedures are performed to approximate the uncertainty in the CFD output. Efficient calculation of both first- and second-order sensitivity derivatives is required. In order to assess the validity of the approximations, these moments are compared with statistical moments generated through Monte Carlo simulations. The uncertainties in the CFD input variables are also incorporated into a robust optimization procedure. For this optimization, statistical moments involving first-order sensitivity derivatives appear in the objective function and system constraints. Second-order sensitivity derivatives are used in a gradient-based search to successfully execute a robust optimization. The approximate methods used throughout the analyses are found to be valid when considering robustness about input parameter mean values.

Putko, Michele M.↗

Computational Infrastructure for Engine Structural Performance Simulation

Select computer codes developed over the years to simulate specific aspects of engine structures are described. These codes include blade impact integrated multidisciplinary analysis and optimization, progressive structural fracture, quantification of uncertainties for structural reliability and risk, benefits estimation of new technology insertion and hierarchical simulation of engine structures made from metal matrix and ceramic matrix composites. Collectively these codes constitute a unique infrastructure readiness to credibly evaluate new and future engine structural concepts throughout the development cycle from initial concept, to design and fabrication, to service performance and maintenance and repairs, and to retirement for cause and even to possible recycling. Stated differently, they provide 'virtual' concurrent engineering for engine structures total-life-cycle-cost.

Chamis, Christos C.↗

Integrated controls-structures optimization of a large space structure

General-purpose control and structural codes are applied to a large detailed structural model including objective and constraint functions derived from actual design specifications. The approach is to divide the problem into a controls optimization step, a structural optimization step, and a system level coordination step. The objective is to minimize mass and power consumption with constraints on vibration characteristics, strength, and damping. This decomposition and optimization approach significantly enhances the design of a structure based on the COFS-I Mast Flight System, which is selected as a demonstration problem.

Pasula, S. L.↗

Design of Optimum Ducts Using an Efficient 3-D Viscous Computational Flow Analysis

Design of fluid dynamically efficient ducts is addressed through the combination of an optimization analysis with a three-dimensional viscous fluid dynamic analysis code. For efficiency, a parabolic fluid dynamic analysis was used. Since each function evaluation in an optimization analysis is a full three-dimensional viscous flow analysis requiring 200,000 grid points, it is important to use both an efficient fluid dynamic analysis and an efficient optimization technique. Three optimization techniques are evaluated on a series of test functions. The Quasi-Newton (BFGS, eta = .9) technique was selected as the preferred technique. A series of basic duct design problems are performed. On a two-parameter optimization problem, the BFGS technique is demonstrated to require half as many function evaluations as a steepest descent technique.

Madabhushi, Ravi K.↗

Computational aerodynamic design methodology

The transonic wing design process has been vastly improved at Lockheed-Georgia. The revised design procedure enhances useability and reliability by combining numerical optimization and inverse design into a single wing design code with transonic analysis provided by a modified version of FLO22. A more versatile set of geometric decision variables has been integrated into the optimization portion for geometry perturbations. An automatic restart feature permits the interchangeability of solutions between optimization and inverse design as the design progresses. In combination, these improvements enable practical utilization of a VAX 11/780 computer and significantly reduce the elapsed time required to complete a transonic wing design.

Burris, C. B.↗

Aerodynamic design using numerical optimization

The procedure of using numerical optimization methods coupled with computational fluid dynamic (CFD) codes for the development of an aerodynamic design is examined. Several approaches that replace wind tunnel tests, develop pressure distributions and derive designs, or fulfill preset design criteria are presented. The method of Aerodynamic Design by Numerical Optimization (ADNO) is described and illustrated with examples.

Murman, E. M.↗

Genetic Algorithm Optimization of a Cost Competitive Hybrid Rocket Booster

Performance, reliability and cost have always been drivers in the rocket business. Hybrid rockets have been late entries into the launch business due to substantial early development work on liquid rockets and later on solid rockets. Slowly the technology readiness level of hybrids has been increasing due to various large scale testing and flight tests of hybrid rockets. A remaining issue is the cost of hybrids vs the existing launch propulsion systems. This paper will review the known state of the art hybrid development work to date and incorporate it into a genetic algorithm to optimize the configuration based on various parameters. A cost module will be incorporated to the code based on the weights of the components. The design will be optimized on meeting the performance requirements at the lowest cost.

Story, George↗

Genetic Algorithm Optimization of a Cost Competitive Hybrid Rocket Booster

Performance, reliability and cost have always been drivers in the rocket business. Hybrid rockets have been late entries into the launch business due to substantial early development work on liquid rockets and solid rockets. Slowly the technology readiness level of hybrids has been increasing due to various large scale testing and flight tests of hybrid rockets. One remaining issue is the cost of hybrids versus the existing launch propulsion systems. This paper will review the known state-of-the-art hybrid development work to date and incorporate it into a genetic algorithm to optimize the configuration based on various parameters. A cost module will be incorporated to the code based on the weights of the components. The design will be optimized on meeting the performance requirements at the lowest cost.

Story, George↗

Development of the Tensoral Computer Language

The research scientist or engineer wishing to perform large scale simulations or to extract useful information from existing databases is required to have expertise in the details of the particular database, the numerical methods and the computer architecture to be used. This poses a significant practical barrier to the use of simulation data. The goal of this research was to develop a high-level computer language called Tensoral, designed to remove this barrier. The Tensoral language provides a framework in which efficient generic data manipulations can be easily coded and implemented. First of all, Tensoral is general. The fundamental objects in Tensoral represent tensor fields and the operators that act on them. The numerical implementation of these tensors and operators is completely and flexibly programmable. New mathematical constructs and operators can be easily added to the Tensoral system. Tensoral is compatible with existing languages. Tensoral tensor operations co-exist in a natural way with a host language, which may be any sufficiently powerful computer language such as Fortran, C, or Vectoral. Tensoral is very-high-level. Tensor operations in Tensoral typically act on entire databases (i.e., arrays) at one time and may, therefore, correspond to many lines of code in a conventional language. Tensoral is efficient. Tensoral is a compiled language. Database manipulations are simplified optimized and scheduled by the compiler eventually resulting in efficient machine code to implement them.

Ferziger, Joel↗

Stimulus information contaminates summation tests of independent neural representations of features

Many models of visual processing assume that visual information is analyzed into separable and independent neural codes, or features. A common psychophysical test of independent features is known as a summation study, which measures performance in a detection, discrimination, or visual search task as the number of proposed features increases. Improvement in human performance with increasing number of available features is typically attributed to the summation, or combination, of information across independent neural coding of the features. In many instances, however, increasing the number of available features also increases the stimulus information in the task, as assessed by an optimal observer that does not include the independent neural codes. In a visual search task with spatial frequency and orientation as the component features, a particular set of stimuli were chosen so that all searches had equivalent stimulus information, regardless of the number of features. In this case, human performance did not improve with increasing number of features, implying that the improvement observed with additional features may be due to stimulus information and not the combination across independent features.

NASA Discipline Space Human Factors↗

High-Performance Computing Optimization for Aladyn – Adaptive Neural Network Molecular Dynamics Mini-Application

This report provides a description and performance evaluation of the optimization techniques for high performance computing (HPC) implementation of the open source Computational Materials mini-application Aladyn (https://github.com/nasa/aladyn). Aladyn is a basic molecular dynamics code written in FORTRAN 2003, which is designed to demonstrate the use of adaptive neural networks (ANNs) in atomistic simulations. The role of ANNs is to efficiently reproduce the very complex energy landscape resulting from the atomic interactions in materials with the accuracy of the more expensive quantum mechanics-based calculations. The ANN is trained on a large set of atomic structures calculated using the density functional theory (DFT) method. While achieving orders of magnitude faster computational performance than DFT, the ANN-based approach was still very computationally demanding compared to the conventional approach of using empirically fitted energy functions. After its initial development, Aladyn was evaluated and optimized by experts at the NASA Advanced Supercomputing (NAS) division to exploit modern supercomputer architectures. The code has been optimized for execution on multicore central processing units (CPUs), including Intel® Skylake microarchitecture, and on graphic accelerators, such as Nvidia® V100 graphic processing units (GPUs), using Open Multi-Processing (OpenMP) and Open Accelerators (OpenACC) programming interfaces. The optimization achieved a speedup of 4.7 times the baseline version on CPU performance and an additional 2.4 times on CPU+GPU performance. Atomistic computer simulations are a fundamental tool in materials research to model material properties form physics-based first principles. Atomic interaction, governed by Quantum Mechanics (QM) require sophisticated and highly computationally demanding mathematical models to calculate [1]. Classical methods use approximate functional forms, empirically fitted through a set of variable parameters to emulate atomic energies as direct functions of atomic coordinates [2]. While empirical potentials are computationally much simpler, allowing simulations of large-scale systems of up to a trillion (1012) atoms [3], they are substantially less accurate compared to quantum calculations and applicable only to very specific atomic configurations or predefined crystallographic phases. A recently suggested approach is to use heuristic machine learning methods [4], such as those based on Adaptive Neural Networks (ANNs) to predict atomic energies, after being trained on a sufficiently large database of QM-calculated structures [5,6]. This approach reduces significantly the computational complexity, allowing for simulations of orders of magnitude larger systems compared to QM-based methods without compromising accuracy. Still, compared to classical methods using empirical energy functions, ANN methods remain two- to three orders of magnitude more computationally demanding. Hence, the computational cost of simulations, together with the need for extensive training of ANNs, still makes the practical implementation of ANN-based methods quite challenging. The purpose of the Aladyn mini-application software [7], available as open source at https://github.com/nasa/aladyn, is to be a testbed for exploring possible optimization strategies to develop highly scalable parallel algorithms for ANN-based atomistic simulations. Aladyn is aimed at utilizing the architecture of the high-end modern highperformance computing (HPC) hardware based on multicore central processing units (CPUs) equipped with graphic processing unit (GPU) accelerators. Specifically, the goal is to optimize the performance on a single HPC compute node, before implementing scaling to multi-node parallelization using message passing interface (MPI). At the same time, the open source code of Aladyn can serve as a training model for students and professors in academia.

Yamakov, Vesselin I.↗

Neural-Based Compression Scheme for Solar Image Data

Studying the solar system and especially the Sun relies on the data gathered daily from space missions. These missions are data-intensive and compressing this data to make them efficiently transferable to the ground station is a twofold decision to make. Stronger compression methods, by distorting the data, can increase data throughput at the cost of accuracy which could affect scientific analysis of the data. On the other hand, preserving subtle details in the compressed data requires a high amount of data to be transferred, reducing the desired gains from compression. In this work, we propose a neural network-based lossy compression method to be used in NASA’s data-intensive imagery missions. We chose NASA’s Solar Dynamics Observatory (SDO) mission which transmits 1.4 terabytes of data each day as a proof of concept for the proposed algorithm. In this work, we propose an adversarially trained neural network, equipped with local and non-local attention modules to capture both the local and global structure of the image resulting in a better trade-off in rate-distortion (RD) compared to conventional hand-engineered codecs. The RD variational autoencoder used in this work is jointly trained with a channel-dependent entropy model as a shared prior between the analysis and synthesis transforms to make the entropy coding of the latent code more effective. We also studied how optimizing perceptual losses could help our neural compressor to preserve high-frequency details of the data in the reconstructed compressed image. Our neural image compression algorithm outperforms currently-in-use and state-of-the-art codecs such as JPEG and JPEG-2000 in terms of the RD performance when compressing extreme-ultraviolet (EUV) data. As a proof of concept for use of this algorithm in SDO data analysis, we have performed coronal hole (CH) detection using our compressed images, and generated consistent segmentations, even at a compression rate of ∼ 0.1 bits per pixel (compared to 8 bits per pixel on the original data) using EUV data from SDO.

Image coding↗

Wing-section optimization for supersonic viscous flows

The recent interest in High Speed Civil Transport (HSCT) has resulted in renewed research studies of optimized supersonic cruise transport configurations. Incorporation of flow viscosity effects in the design process of such a supersonic wing is currently under investigation. This may lead to more accurate problem formulations and, in turn, greater aerodynamic efficiency than can be obtained by the traditional, inviscid, linear theories. In this context, for a design code to be a candidate for a complex optimization problem, such as three-dimensional viscous supersonic wing design, it should be validated using simpler building-block shapes. To optimize the shape of a supersonic wing, an automated method that also includes higher fidelity to the flow physics is desirable. With this impetus, an aerodynamic optimization methodology incorporating Navier-Stokes equations and sensitivity analysis had been previously developed. Prior to embarking upon the wing design task, the present investigation concentrated on testing the flexibility of the methodology, and the identification of adequate problem formulations, by defining two-dimensional, cost-effective test cases. Starting with two distinctly different initial airfoils, two independent shape optimizations resulted in shapes with very similar features. Secondly, the normal section to the subsonic portion of the leading edge, which had a high normal angle-of-attack, was considered. The optimization resulted in a shape with twist and camber, which eliminated the adverse pressure gradient, hence, exploiting the leading-edge thrust. The wing section shapes obtained in all the test cases had the features predicted by previous studies. Therefore, it was concluded that the flowfield analyses and the sensitivity coefficients were computed and fed to the present gradient-based optimizer correctly. Also, as a result of the present two-dimensional study, suggestions were made for problem formulations which should contribute to an effective wing shape optimization.

Item, Cem C.↗

Overview of Rotor Hover Performance Capabilities at Low Reynolds Number for Mars Exploration

The Evolutionary aLgorithm for Iterative Studies of Aeromechanics (ELISA) software was developed in support of the Rotorcraft Optimization for the Advancement of Mars eXploration (ROAMX) project. ELISA was developed to enable aerodynamic rotor hover optimization for low Reynolds number flows in the Mars atmosphere. ELISA comprises two modules. The first module is dedicated to airfoil optimization and allows for the creation of multi-objective Pareto optimal (PO) airfoil sets with the airfoil performance evaluation performed using OVERFLOW. The second module is dedicated to rotor hover performance optimization and generates multi-objective PO rotor sets with the rotor performance evaluation performed using the comprehensive analysis code CAMRAD II. This paper presents recent updates to the ELISA optimization toolset. The airfoil module now includes variation in section Reynolds number, alongside simultaneous maximization of section lift and minimization of section drag. Consequently, the rotor optimization module can query PO airfoil sets (as a function of section lift, drag, and Reynolds number) and generate PO C81 decks tailored to specific Reynolds numbers, eliminating the need for adequate initial chord guesses and allowing for arbitrary rotor solidities to be studied. Furthermore, the rotor optimization has been extended to incorporate a third dimension, alongside maximization of blade loading and minimization of rotor power. This enables optimization across a relevant density range on Mars, presenting the lowest power rotor hover geometry, for each attainable blade loading, for each density. The goal of this work is to present the relevance of recent updates to the ELISA optimization toolset, by showing full rotor hover optimization using unconventional airfoils across a practical Mars density range, and by presenting various optimizations for changing blade numbers with unconstrained solidity in the Mars atmosphere.

Rotor↗