Search NASA⌕ Search

SEARCH · Search NASA

Results for “Code Cases”

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 379 records · Page 21

Calculation of two-dimensional inlet flow fields in a supersonic free stream: Program documentation and test cases

The use of a computer code for the calculation of two dimensional inlet flow fields in a supersonic free stream and a nonorthogonal mesh-generation code are illustrated by specific examples. Input, output, and program operation and use are given and explained for the case of supercritical inlet operation at a subdesign Mach number (M Mach free stream = 2.09) for an isentropic-compression, drooped-cowl inlet. Source listings of the computer codes are also provided.

Biringen, S. H.↗

2D axial-azimuthal particle-in-cell benchmark for low-temperature partially magnetized plasmas

The increasing need to demonstrate the correctness of computer simulations has highlighted the importance of benchmarks. We define in this paper a representative simulation case to study low-temperature partially-magnetized plasmas. Seven independently developed particle-in-cell codes have simulated this benchmark case, with the same specified conditions. The characteristics of the codes used, such as implementation details or computing times and resources, are given. First, we compare at steady-state the time-averaged axial profiles of three main discharge parameters (axial electric field, ion density and electron temperature). We show that the results obtained exhibit a very good agreement within 5% between all the codes. As E x B discharges are known to cause instabilities propagating in the direction of electron drift, an analysis of these instabilities is then performed and a similar behaviour is retrieved between all the codes. A particular attention has been paid to the numerical convergence by varying the number of macroparticles per cell and we show that the chosen benchmark case displays a good convergence. Detailed outputs are given in the supplementary data, to be used by other similar codes in the perspective of code verification.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computation of transonic separated wing flows using an Euler/Navier-Stokes zonal approach

A computer program called Transonic Navier Stokes (TNS) has been developed which solves the Euler/Navier-Stokes equations around wings using a zonal grid approach. In the present zonal scheme, the physical domain of interest is divided into several subdomains called zones and the governing equations are solved interactively. The advantages of the Zonal Grid approach are as follows: (1) the grid for any subdomain can be generated easily; (2) grids can be, in a sense, adapted to the solution; (3) different equation sets can be used in different zones; and, (4) this approach allows for a convenient data base organization scheme. Using this code, separated flows on a NACA 0012 section wing and on the NASA Ames WING C have been computed. First, the effects of turbulence and artificial dissipation models incorporated into the code are assessed by comparing the TNS results with other CFD codes and experiments. Then a series of flow cases is described where data are available. The computed results, including cases with shock-induced separation, are in good agreement with experimental data. Finally, some futuristic cases are presented to demonstrate the abilities of the code for massively separated cases which do not have experimental data.

Kaynak, Uenver↗

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↗

Performance analysis for the expanding search PN acquisition algorithm

An approach is described for approximating the cumulative probability distribution of the acquisition time of the serial pseudonoise (PN) search algorithm. The results are applicable to both variable and fixed dwell time systems. The theory is developed for the case where some a priori information is available on the PN code epoch (reacquisition problem or acquisition of very long codes). Also considered is the special case of a search over the whole code. The accuracy of the approximation is demonstrated by comparisons with published exact results for the fixed dwell time algorithm.

Braun, W. R.↗

Global Transformations for Legacy Parallel Applications via Structural Analysis and Rewriting

Performance and scalability optimization of large HPC applications is currently a labor-intensive, manual process with very low productivity. Major difficulties come from the disaggregated environment for HPC application development: the compiler is only involved in local decisions (core or multithreaded domain), while a library-based, communication-oriented programming model realizes whole-machine parallelism. Realizing any major global change in such a disaggregated environment is very difficult and involves changing large portions of the source code. We present semi-automated techniques, based on structural analysis and rewriting, for performing global transformations on an HPC application source code. We present two case studies using the Self-Consistent Field (SCF) standalone benchmark as well as the Coupled Cluster (CCSD) module (2.9 million lines of Fortran code), a key module of the NWChem computational chemistry application. We demonstrate how structural rewriting techniques can be used to automate transformations that affect multiple sections of the application's source code. We show that the transformations can be applied in a systematic fashion across the source code bases with minimal manual effort. These transformations improve the scalability of the SCF benchmark by more than two orders of magnitude and the performance of the full CCSD module by a factor of 4.0.

legacy parallel applications↗

LDPC Codes with Minimum Distance Proportional to Block Size

Low-density parity-check (LDPC) codes characterized by minimum Hamming distances proportional to block sizes have been demonstrated. Like the codes mentioned in the immediately preceding article, the present codes are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. The previously mentioned codes have low decoding thresholds and reasonably low error floors. However, the minimum Hamming distances of those codes do not grow linearly with code-block sizes. Codes that have this minimum-distance property exhibit very low error floors. Examples of such codes include regular LDPC codes with variable degrees of at least 3. Unfortunately, the decoding thresholds of regular LDPC codes are high. Hence, there is a need for LDPC codes characterized by both low decoding thresholds and, in order to obtain acceptably low error floors, minimum Hamming distances that are proportional to code-block sizes. The present codes were developed to satisfy this need. The minimum Hamming distances of the present codes have been shown, through consideration of ensemble-average weight enumerators, to be proportional to code block sizes. As in the cases of irregular ensembles, the properties of these codes are sensitive to the proportion of degree-2 variable nodes. A code having too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code having too many such nodes tends not to exhibit a minimum distance that is proportional to block size. Results of computational simulations have shown that the decoding thresholds of codes of the present type are lower than those of regular LDPC codes. Included in the simulations were a few examples from a family of codes characterized by rates ranging from low to high and by thresholds that adhere closely to their respective channel capacity thresholds; the simulation results from these examples showed that the codes in question have low error floors as well as low decoding thresholds. As an example, the illustration shows the protograph (which represents the blueprint for overall construction) of one proposed code family for code rates greater than or equal to 1.2. Any size LDPC code can be obtained by copying the protograph structure N times, then permuting the edges. The illustration also provides Field Programmable Gate Array (FPGA) hardware performance simulations for this code family. In addition, the illustration provides minimum signal-to-noise ratios (Eb/No) in decibels (decoding thresholds) to achieve zero error rates as the code block size goes to infinity for various code rates. In comparison with the codes mentioned in the preceding article, these codes have slightly higher decoding thresholds.

Divsalar, Dariush↗

Optimization of an Air Core Dual Halbach Array Axial Flux Rim Drive for Electric Aircraft

The anticipated development of the on-demand-mobility (ODM) market has accelerated the development of electric aircraft. Most proposed electric aircraft have propulsion systems that consist of fans directly driven by electric motors. The lower complexity of these propulsion systems opens the door to more custom propulsion system designs that are tailored to a given aircraft and its mission. This paper represents initial steps in the development of an electric propulsion system design code. A proof of concept version of the code is presented. The proof of concept version of the code is for the design of an axial flux rim driven propulsion system. NASA's all electric aircraft X-57, is used as a case study for this design code. The results of this case study are used to discuss the feasibility and potential benefits of using an axial flux rim driven propulsor on X-57. The final result of the case study shows a potential 4km increase in range over the current design.

Tallerico,Thomas F.↗

Cyclic unequal error protection codes constructed from cyclic codes of composite length

The distance structure of cyclic codes of composite length was investigated. A lower bound on the minimum distance for this class of codes is derived. In many cases, the lower bound gives the true minimum distance of a code. Then the distance structure of the direct sum of two cyclic codes of composite length were investigated. It was shown that, under certain conditions, the direct-sum code provides two levels of error correcting capability, and hence is a two-level unequal error protection (UEP) code. Finally, a class of two-level UEP cyclic direct-sum codes and a decoding algorithm for a subclass of these codes are presented.

Lin, Shu↗

Three Dimensional Atmospheric Radiative Transfer-Applications and Methods Comparison

We review applications of 3D radiative transfer in the atmosphere, emphasizing the wide spectrum of scales important to remote sensing and modeling of cloud fields, and the characteristic scales introduced into observed radiances and fluxes by the distribution of photon pathlengths at conservative and absorbing wavelengths. We define the "plane-parallel bias", which is a measure of the importance of 3D cloud structure in large-scale models, and the "independent pixel errors" that quantify the significance of 3D effects in remote sensing, and emphasize their relative magnitude and scale dependence. A variety of approaches in current use in 3D radiative transfer, and issues of speed, accuracy, and flexibility are summarized. We also describe a recently initiated "International Intercomparison of 3-Dimensional Radiation Codes", or I3RC. I3RC is a 3-phase effort that has as its goals to: (1) understand the errors and limits of 3D methods; (2) provide "baseline" cases for future 3D code development; (3) promote sharing of 3D tools; (4) derive guidelines for 3D tool selection; and (5) improve atmospheric science education in 3D radiative transfer. Selected results from Phases 1 and 2 of I3RC are discussed. These are taken from five cloud fields: a 1D field of bar clouds, a 2D radar-derived field, a 3D Landsat-derived field, a stratiform cloud from the model of C. Moeng, and a convective cloud from the model of B. Stevens. Computations have been carried out for three monochromatic wavelengths (one conservative, one absorptive, and one thermal) and two solar zenith angles (0, 60 degrees).

Cahalan, Robert F.↗

Uncertainty quantification in machine learning for engineering design and health prognostics: A tutorial

On top of machine learning (ML) models, uncertainty quantification (UQ) functions as an essential layer of safety assurance that could lead to more principled decision making by enabling sound risk assessment and management. The safety and reliability improvement of ML models empowered by UQ has the potential to significantly facilitate the broad adoption of ML solutions in high-stakes decision settings, such as healthcare, manufacturing, and aviation, to name a few. In this tutorial, we aim to provide a holistic lens on emerging UQ methods for ML models with a particular focus on neural networks and the applications of these UQ methods in tackling engineering design as well as prognostics and health management problems. Towards this goal, we start with a comprehensive classification of uncertainty types, sources, and causes pertaining to UQ of ML models. Next, we provide a tutorial-style description of several state-of-the-art UQ methods: Gaussian process regression, Bayesian neural network, neural network ensemble, and deterministic UQ methods focusing on spectral-normalized neural Gaussian process. Established upon the mathematical formulations, we subsequently examine the soundness of these UQ methods quantitatively and qualitatively (by a toy regression example) to examine their strengths and shortcomings from different dimensions. Then, we review quantitative metrics commonly used to assess the quality of predictive uncertainty in classification and regression problems. Afterward, we discuss the increasingly important role of UQ of ML models in solving challenging problems in engineering design and health prognostics. In conclusion, two case studies with source codes available on GitHub are used to demonstrate these UQ methods and compare their performance in the life prediction of lithium-ion batteries at the early stage (case study 1) and the remaining useful life prediction of turbofan engines (case study 2).

97 MATHEMATICS AND COMPUTING↗

Fast transform decoding of nonsystematic Reed-Solomon codes

A Reed-Solomon (RS) code is considered to be a special case of a redundant residue polynomial (RRP) code, and a fast transform decoding algorithm to correct both errors and erasures is presented. This decoding scheme is an improvement of the decoding algorithm for the RRP code suggested by Shiozaki and Nishida, and can be realized readily on very large scale integration chips.

Truong, T. K.↗

Evaluation of the efficiency and reliability of software generated by code generators

There are numerous studies which show that CASE Tools greatly facilitate software development. As a result of these advantages, an increasing amount of software development is done with CASE Tools. As more software engineers become proficient with these tools, their experience and feedback lead to further development with the tools themselves. What has not been widely studied, however, is the reliability and efficiency of the actual code produced by the CASE Tools. This investigation considered these matters. Three segments of code generated by MATRIXx, one of many commercially available CASE Tools, were chosen for analysis: ETOFLIGHT, a portion of the Earth to Orbit Flight software, and ECLSS and PFMC, modules for Environmental Control and Life Support System and Pump Fan Motor Control, respectively.

Schreur, Barbara↗

Self-consistent solution of the Frank–Bilby equation for interfaces containing disconnections

The quantized Frank–Bilby equation can be used to identify interfacial line defect array configurations which relax the misorientation and/or misfit of a coherent crystalline interface. These line defect arrays may be comprised of dislocations and/or disconnections, which are interfacial steps with dislocation character. When an interface contains disconnections, solution of the quantized Frank–Bilby equation is complicated by the fact that the habit plane orientation is not known in advance because it depends on the unknown spacing of the disconnection array. We present a root-finding-based method for addressing this issue, enabling a self-consistent solution for arbitrary defect content. Our method has been implemented in an open-source code which enumerates all possible solutions given a list of candidate line defects. Two cases are presented employing the code: a misoriented FCC twin boundary and an FCC/BCC phase boundary with the Nishiyama-Wasserman orientation relationship. Both cases exhibit more than 10,000 solutions to the Frank–Bilby equation, with several hundred solutions categorized as ‘‘low energy’’ and thus plausible configurations for the actual interface. The resulting set of solutions can be utilized to predict and understand the properties of a given interface.

42 ENGINEERING↗

S/U Comparison Study with a Focus on USLs

Under a DOE Nuclear Criticality Safety Program (NCSP) task involving Analytical Methods, three Laboratories collaborated in a comparison of results obtained from Sensitivity/Uncertainty (S/U) packages relevant to validation of transport codes. The task involves Institut de Radioprotection et de Sûreté Nucléaire (IRSN), Los Alamos National Laboratory (LANL), and Oak Ridge National Laboratory (ORNL) comparing results of MORET 5/MACSENS V3.0, MCNP6.2/Whisper-1.1, and SCALE 6.2.3/TSUNAMI/USLSTATS respectively. All Monte Carlo transport code results utilize ENDF/B-VII.1. Four cases from the International Handbook of Evaluated Criticality Safety Benchmark Experiments (ICSBEP Handbook) were selected as application models: HEU-MET-FAST-013-001, HEU-SOL-THERM 001-008, PU-MET-FAST-022-001, and PU-SOL-THERM 001-001. Ultimately, comparison is made between Upper Subcritical Limits (USLs) obtained using each code package for each application case. Since differences exist in whether packages take into account margin of subcriticality (MOS), the USL may be computed using bias and bias uncertainty, also known as the calculational margin (CM) in ANSI/ANS 8.24. Application of portions of MOS to the USL for nuclear data uncertainty of and potential code margin is referred to as USL herein. In either case, additional MOS is considered for actual application cases.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

High Temperature Composite Analyzer (HITCAN) demonstration manual, version 1.0

This manual comprises a variety of demonstration cases for the HITCAN (HIgh Temperature Composite ANalyzer) code. HITCAN is a general purpose computer program for predicting nonlinear global structural and local stress-strain response of arbitrarily oriented, multilayered high temperature metal matrix composite structures. HITCAN is written in FORTRAN 77 computer language and has been configured and executed on the NASA Lewis Research Center CRAY XMP and YMP computers. Detailed description of all program variables and terms used in this manual may be found in the User's Manual. The demonstration includes various cases to illustrate the features and analysis capabilities of the HITCAN computer code. These cases include: (1) static analysis, (2) nonlinear quasi-static (incremental) analysis, (3) modal analysis, (4) buckling analysis, (5) fiber degradation effects, (6) fabrication-induced stresses for a variety of structures; namely, beam, plate, ring, shell, and built-up structures. A brief discussion of each demonstration case with the associated input data file is provided. Sample results taken from the actual computer output are also included.

Singhal, S. N↗

WISE-CASING: Containment and Monitoring Institute (CaMI), Calgary, Canada FEM-DC Model

For the model calculation we applied EM3D using completion diagram of CaMI site and a background resistivity consistent with the borehole logs. It was also important to use the accurate position of the return electrode. We note that for the data fit the code also incorporated well casings for well INJ and the other observation well, either OB1 or OB2, in the calculation. In summary, we demonstrate here, for this particular case, that the DC results may be a reasonable approximation to the low frequency EM data collected at CaMI. If this approximation continues to hold, then the extreme computational efficiency offered by the hierarchical modeling used in the DC simulations will permit us to explore far more model complexity, especially the pervasive and troublesome data artifacts that arise when doing EM surveys in mature, culturally developed sites. In Brief, both the low frequency and DC simulation codes provided very consistent results that match the field data really well, indicating their capability to help monitoring borehole integrity with the low frequency EM method.

15 GEOTHERMAL ENERGY↗

MCNP5 Criticality Validation and Bias for Intermediate Enriched Uranium Systems

The purpose of this analysis is to validate the Monte Carlo N-Particle 5 (MCNP5) code Version 1.40 (LA-UR-03-1987, 2005) and its cross-section database for k-code calculations of intermediate enriched uranium systems on INTEL ® processor based PC's running any version of the WINDOWS operating system. Configurations with intermediate enriched uranium were modeled with the moderator range of 39≤HlFissile≤1438. See Table 2-1 for brief descriptions of selected cases and Table 3-1 for the range of applicability for this validation. A total of 167 input cases were evaluated including bare and reflected systems in a single body or arrays. The 167 cases were taken directly from the previous (Version 4C [Lan 2005]) validation database. Section 2.0 list data used to calculate k-effective (k eff ) for the 167 experimental criticality benchmark cases using the MCNP5 code v1.40 and its cross-section database. Appendix B lists the MCNP cross-section database entries validated for use in evaluating the intermediate enriched uranium systems for criticality safety. The dimensions and atom densities for the intermediate enriched uranium experiments were taken from NEA/NSC/DOC(95)03, September 2005, which will be referred to as the benchmark handbook throughout the report. For these input values, the experimental benchmark k eff is approximately 1.0. The MCNP validation computer runs ran to an accuracy of approximately ±0.001. For the cases where the reported benchmark k eff was not equal to 1.0000 the MCNP calculational results were normalized. The difference between the MCNP validation computer runs and the experimentally measured k eff is the MCNP5 v1.40 bias. The USLSTATS code (ORNL 1998) was utilized to perform the statistical analysis and generate an acceptable maximum k eff limit for calculations of the intermediate enriched uranium type systems.

42 ENGINEERING↗