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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Iterative optimal subcritical aerodynamic design code including profile drag

A subcritical aerodynamic design computer code has been developed, which uses linearized aerodynamics along with sweep theory and airfoil data to obtain minimum total drag preliminary designs for multiple planform configurations. These optimum designs consist of incidence distributions yielding minimum total drag at design values of Mach number and lift and pitching moment coefficients. Linear lofting is used between airfoil stations. Solutions for isolated transport wings have shown that the solution is unique, and that including profile drag effects decreases tip loading and incidence relative to values obtained for minimum induced drag solutions. Further, including effects of variation of profile drag with Reynolds number can cause appreciable changes in the optimal design for tapered wings. Example solutions are also discussed for multiple planform configurations.

Kuhlman, J. M.↗
DOE OSTI2019

Multi-solution nature of topology optimization and its application in design for additive manufacturing

The purpose of this paper is to introduce the multi-solution nature of topology optimization (TO) as a design tool for additive manufacturing (AM). The sensitivity of topologically optimized parts and manufacturing constraints to the initial starting point of the optimization process leading to structures with equivalent performance is explored. A modified bi-directional evolutionary structural optimization (BESO) code was used as the numerical approach to optimize a cantilever beam problem and reduce the mass by 50 per cent. Several optimized structures with relatively equivalent mechanical performance were generated by changing the initial starting point of the TO algorithm. These optimized structures were manufactured using fused deposition modeling (FDM). The equivalence of strain distribution in FDM parts was tested with the digital image correlation (DIC) technique and compared with that from the modified BESO code.The results confirm that TO could lead to a wide variety of non-unique solutions based on loading and manufacturability constraints. The modified BESO code was able to reduce the support structure needed to build the simple two-dimensional cantilever beam by 15 per cent while keeping the mechanical performance at the same level. Finally, the originality of this paper lies in introduction and application of the multi-solution nature of TO for AM as a design tool for optimizing structures with minimized features in the overhang condition and the need for support structures.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Lattice Optimization for Porous Electrode

This code performs an optimization over the structure of a porous electrode formed from a lattice of unit cells. This is a steepest descent version of the code used in: V. A. Beck, J. J. Wong, C. F. Jekel, D. A. Tortorelli, S. E. Baker, E. B. Duoss and M. A. Worsley, Computational design of microarchitected porous electrodes for redox flow batteries, J. Power Sources, 2021, 512, 230453.

Wong, JonathanJ↗
DOE OSTI2015

Towards a high performance geometry library for particle-detector simulations

Thread-parallelization and single-instruction multiple data (SIMD) ”vectorisation” of software components in HEP computing has become a necessity to fully benefit from current and future computing hardware. In this context, the Geant-Vector/GPU simulation project aims to re-engineer current software for the simulation of the passage of particles through detectors in order to increase the overall event throughput. As one of the core modules in this area, the geometry library plays a central role and vectorising its algorithms will be one of the cornerstones towards achieving good CPU performance. Here, we report on the progress made in vectorising the shape primitives, as well as in applying new C++ template based optimizations of existing code available in the Geant4, ROOT or USolids geometry libraries. We will focus on a presentation of our software development approach that aims to provide optimized code for all use cases of the library (e.g., single particle and many-particle APIs) and to support different architectures (CPU and GPU) while keeping the code base small, manageable and maintainable. We report on a generic and templated C++ geometry library as a continuation of the AIDA USolids project. As a result, the experience gained with these developments will be beneficial to other parts of the simulation software, such as for the optimization of the physics library, and possibly to other parts of the experiment software stack, such as reconstruction and analysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Using the Stix finite element RF code to investigate operation optimization of the ICRF antenna on Alcator C-Mod

Abstract As the Ion Cyclotron Radio Frequency range (ICRF) heating becomes more favorable in fusion devices, the urgency of predicting and mitigating impurity generation that arises from it becomes more pressing. In the ICRF regime, rectified Radio Frequency (RF) sheaths are known to form at antenna and material edges that influence negative effects like sputtering and a decrease in heating efficiency. Methods to mitigate the formation of these RF sheaths through RF image currents cancellation have been experimentally studied. A power-phasing scan done on Alcator C-Mod in which the amount of power on the two inner straps ( P in ) versus the total 4 straps ( P tot ) was varied showed a minimization of enhanced potentials between P in / P tot ∼ 0.7–0.9 while impurities were minimized for P in / P tot ∼ 0.5–0.8. New capabilities in the realm of representing the RF sheath numerically now allow for these experiments to be simulated. Given the size of the sheath relative to the scale of the device, it can be approximated as a Boundary Condition (BC). A new parallelized cold-plasma wave equation solver called Stix implements a non-linear sheath impedance model BC formulated by Myra et al (2015 Phys. Plasmas 22 062507) through the method of finite elements using the MFEM library [ http://mfem.org ]. It is seen that Stix shows qualitative agreement with the measured C-Mod enhanced potentials.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1994

Comparison of transform coding methods with an optimal predictor for the data compression of digital elevation models

Statistical encoding techniques enable the reduction of the number of bits required to encode a set of symbols, and are derived from their probabilities. Huffman encoding is an example of statistical encoding that has been used for error-free data compression. The degree of compression given by Huffman encoding in this application can be improved by the use of prediction methods. These replace the set of elevations by a set of corrections that have a more advantageous probability distribution. In particular, the method of Lagrange Multipliers for minimization of the mean square error has been applied to local geometrical predictors. Using this technique, an 8-point predictor achieved about a 7 percent improvement over an existing simple triangular predictor.

Lewis, Michael↗
NASA NTRS2004

Spectroscopic Determination of the Physical Conditions in Hot Optically Thin Sources

Astrophysical Plasma Emission Database - APED consists of atomic data, primarily theoretical, needed to calculate X-ray through optical emission spectra of hot thermal plasmas. These data are supplemented by experimental values, such as laboratory plasma wave- lengths, and are validated by experiment only rarely. Thus the comparison of predicted spectra to astrophysical spectra serves as invaluable feedback on the quality of the models. Following up on unfavorable comparisons, we have communicated atomic data needs to atomic theorists and experimental plasma physicists so that improvements can be made to the database. The database is now reasonably complete from approx. 1 to 30 A, and from - 90 to 180 A, with significant gaps remaining in the range 30 to 90 A. Astrophysical Plasma Emission Code - APEC uses the APED data as inputs and computes level populations and line emissivities using a rate matrix solver. Tabulated models for a fine grid of temperatures and densities can be applied to observational data. The current public version of APEC output uses an input ionization balance model, assuming CIE; however, we have a working version to calculate the ionization state of the gas. We will begin testing non-equilibrium ionization (NEI) models over the next year - we are now finalizing the atomic database needed to perform the ionization state calculations. At that time, the code will be made public. We have developed optimized error codes, additional testing protocols and substantial documentation, in preparation for this public release. Secondarily, we have begun to investigate the use of APED and APEC for X-ray photoionized plasma, beginning with opacity modeling (e.g. warm absorbers). Application to bright AGN Chandra grating spectra suggests that the accurate wavelengths in APED are of great importance to fitting the data. We are exploring additional subroutines to APEC to extend its usefulness for X-ray photoionized plasma, e.g. to include collisional or photo-excitation of metastable levels for absorption.

Oliversen, Ronald J.↗
DOE OSTI2013

Decoding and optimized implementation of SECDED codes over GF(q)

A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Design, decoding and optimized implementation of SECDED codes over GF(q)

A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Decoding and optimized implementation of SECDED codes over GF(q)

A plurality of columns for a check matrix that implements a distance d linear error correcting code are populated by providing a set of vectors from which to populate the columns, and applying to the set of vectors a filter operation that reduces the set by eliminating therefrom all vectors that would, if used to populate the columns, prevent the check matrix from satisfying a column-wise linear independence requirement associated with check matrices of distance d linear codes. One of the vectors from the reduced set may then be selected to populate one of the columns. The filtering and selecting repeats iteratively until either all of the columns are populated or the number of currently unpopulated columns exceeds the number of vectors in the reduced set. Columns for the check matrix may be processed to reduce the amount of logic needed to implement the check matrix in circuit logic.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

Combined trellis coding with asymmetric modulations

The use of asymmetric signal constellations combined with optimized trellis coding to improve the performance of coded systems without increasing the average or peak power, or changing the bandwidth constraints of a system is discussed. The trellis code, asymmetric signal set, and Viterbi decoder of the system model are examined. The procedures for assigning signals to state transitions of the trellis code are described; the performance of the trellis coding system is evaluated. Examples of AM, QAM, and MPSK modulations with short memory trellis codes are presented.

Divsalar, D.↗
DOE OSTI2013

Novel Visual and Analytical Methods in Repurposing Legacy Scientific Code - A Case Study

Scientific computing is dominated by team-authored legacy code that has evolved over decades with the purpose of capturing the evolving understanding of a scientific discipline. Accumulated deprecated code, various optimization techniques, and evolving algorithms lead to convoluted source code that is impractical to reverse engineer using mainstream methods. This prevents codes from being truly repeatable or understandable, which are two of the most essential needs in scientific computing. We refactored a long-standing implementation of a common biosequence alignment algorithm in an effort to reproduce its salient behaviors in usable form. Because of the sheer size and complexity of this code base, we developed custom tools to visualize and manipulate the source code behavior under a variety of conditions. We present a case study of extracting and refactoring the algorithmic core and a novel process of discovery/prototyping/testing using a combination of openly available and custom-built tools. The result is a reduction in code size of over 2 orders of magnitude while reconstructing the key protein alignment function in BLAST

bioinformatics, scientific computing↗
DOE OSTI2011

TRACKING CODE DEVELOPMENT FOR BEAM DYNAMICS OPTIMIZATION

Dynamic aperture (DA) optimization with direct particle tracking is a straight forward approach when the computing power is permitted. It can have various realistic errors included and is more close than theoretical estimations. In this approach, a fast and parallel tracking code could be very helpful. In this presentation, we describe an implementation of storage ring particle tracking code TESLA for beam dynamics optimization. It supports MPI based parallel computing and is robust as DA calculation engine. This code has been used in the NSLS-II dynamics optimizations and obtained promising performance.

43 PARTICLE ACCELERATORS↗
DOE OSTI2016

Panda: A Compiler Framework for Concurrent CPU $+$ GPU Execution of 3D Stencil Computations on GPU-accelerated Supercomputers

We present a new compiler framework for truly heterogeneous 3D stencil computation on GPU clusters. Our framework consists of a simple directive-based programming model and a tightly integrated source-to-source compiler. Annotated with a small number of directives, sequential stencil C codes can be automatically parallelized for large-scale GPU clusters. The most distinctive feature of the compiler is its capability to generate hybrid MPI$+$ CUDA$+$ OpenMP code that uses concurrent CPU$+$ GPU computing to unleash the full potential of powerful GPU clusters. The auto-generated hybrid codes hide the overhead of various data motion by overlapping them with computation. Test results on the Titan supercomputer and the Wilkes cluster show that auto-translated codes can achieve about 90 % of the performance of highly optimized handwritten codes, for both a simple stencil benchmark and a real-world application in cardiac modeling. The user-friendliness and performance of our domain-specific compiler framework allow harnessing the full power of GPU-accelerated supercomputing without painstaking coding effort.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

MPQC: Performance Analysis and Optimization

MPQC (Massively Parallel Quantum Chemistry) is a widely used computational quantum chemistry code. It is capable of performing a number of computations commonly occurring in quantum chemistry. In order to achieve better performance of MPQC, in this report we present a detailed performance analysis of this code. We then perform loop and memory access optimizations, and measure performance improvements by comparing the performance of the optimized code with that of the original MPQC code. We observe that the optimized MPQC code achieves a significant improvement in the performance through a better utilization of vector processing and memory hierarchies.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2000

Cascade Optimization for Aircraft Engines With Regression and Neural Network Analysis - Approximators

The NASA Engine Performance Program (NEPP) can configure and analyze almost any type of gas turbine engine that can be generated through the interconnection of a set of standard physical components. In addition, the code can optimize engine performance by changing adjustable variables under a set of constraints. However, for engine cycle problems at certain operating points, the NEPP code can encounter difficulties: nonconvergence in the currently implemented Powell's optimization algorithm and deficiencies in the Newton-Raphson solver during engine balancing. A project was undertaken to correct these deficiencies. Nonconvergence was avoided through a cascade optimization strategy, and deficiencies associated with engine balancing were eliminated through neural network and linear regression methods. An approximation-interspersed cascade strategy was used to optimize the engine's operation over its flight envelope. Replacement of Powell's algorithm by the cascade strategy improved the optimization segment of the NEPP code. The performance of the linear regression and neural network methods as alternative engine analyzers was found to be satisfactory. This report considers two examples-a supersonic mixed-flow turbofan engine and a subsonic waverotor-topped engine-to illustrate the results, and it discusses insights gained from the improved version of the NEPP code.

Patnaik, Surya N.↗
DOE OSTI2018

Cyclic codes over the ring F{sub 2}+uF{sub 2}+vF{sub 2}

In this paper, we study linear and cyclic codes over the ring F{sub 2}+uF{sub 2}+vF{sub 2}. The ring F{sub 2}+uF{sub 2}+vF{sub 2} is the smallest non-Frobenius ring. We characterize the structure of cyclic codes over the ring R=F{sub 2}+uF{sub 2}+vF{sub 2} using of the work Abualrub and Saip (Des Codes Cryptogr 42:273–287, 2007). We study the rank and dual of cyclic codes of odd length over this ring. Specially, we show that the equation |C||C{sup ⊥}|=|R|{sup n} does not hold in general for a cyclic code C of length n over this ring. We also obtain some optimal binary codes as the images of cyclic codes over the ring F{sub 2}+uF{sub 2}+vF{sub 2} under a Gray map, which maps Lee weights to Hamming weights. Finally, we give a condition for cyclic codes over R that contains its dual and find quantum codes over F{sub 2} from cyclic codes over the ring F{sub 2}+uF{sub 2}+vF{sub 2}.

97 MATHEMATICS AND COMPUTING↗