Search NASA⌕ Search

SEARCH · Search NASA

Results for “Code Case”

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 253 records · Page 14

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↗

Synchronization of Reed-Solomon codes

The synchronization capabilities of Reed-Solomon codes when an appropriate coset of the code is used instead of the code itself are examined. In this case an E-error correcting Reed-Solomon code is transformed into a code capable of determining that there are m symbols out of sync, if e symbol errors occurred, whenever m + e E. In the event that m = 0, i.e., the word is in sync, then decoder will correct any pattern of E - 1 on fewer symbol errors.

Miller, R. L.↗

Volume 2: Explicit, multistage upwind schemes for Euler and Navier-Stokes equations

The objective of this study was to develop a high-resolution-explicit-multi-block numerical algorithm, suitable for efficient computation of the three-dimensional, time-dependent Euler and Navier-Stokes equations. The resulting algorithm has employed a finite volume approach, using monotonic upstream schemes for conservation laws (MUSCL)-type differencing to obtain state variables at cell interface. Variable interpolations were written in the k-scheme formulation. Inviscid fluxes were calculated via Roe's flux-difference splitting, and van Leer's flux-vector splitting techniques, which are considered state of the art. The viscous terms were discretized using a second-order, central-difference operator. Two classes of explicit time integration has been investigated for solving the compressible inviscid/viscous flow problems--two-state predictor-corrector schemes, and multistage time-stepping schemes. The coefficients of the multistage time-stepping schemes have been modified successfully to achieve better performance with upwind differencing. A technique was developed to optimize the coefficients for good high-frequency damping at relatively high CFL numbers. Local time-stepping, implicit residual smoothing, and multigrid procedure were added to the explicit time stepping scheme to accelerate convergence to steady-state. The developed algorithm was implemented successfully in a multi-block code, which provides complete topological and geometric flexibility. The only requirement is C degree continuity of the grid across the block interface. The algorithm has been validated on a diverse set of three-dimensional test cases of increasing complexity. The cases studied were: (1) supersonic corner flow; (2) supersonic plume flow; (3) laminar and turbulent flow over a flat plate; (4) transonic flow over an ONERA M6 wing; and (5) unsteady flow of a compressible jet impinging on a ground plane (with and without cross flow). The emphasis of the test cases was validation of code, and assessment of performance, as well as demonstration of flexibility.

Elmiligui, Alaa↗

A method for simulating 3-D aircraft flow fields with jet plume effects

The objective is to develop, demonstrate, and document a coupled flow analysis procedure for computing 3D aircraft flow fields with deflected subsonic and supersonic jet exhaust plumes. The PNS plume code was transferred to the Ames computer facility for execution on the Cray computer. No problems were encountered when installing this code. The Bower's test case is currently being run. This case is being used to fine tune the procedure for coupling the plume code to PANAIR.

Source record↗

Further Investigation of Acoustic Propagation Codes for Three-Dimensional Geometries

The ability to predict fan noise within complex three-dimensional aircraft engine nacelle geometries is a valuable tool in designing and assessing low-noise concepts. This work begins a systematic study to identify the areas of the design space in which propagation codes of varying fidelity may be used effectively to provide efficient design and assessment. An efficient lower-fidelity code is used in conjunction with two higher-fidelity, more computationally intensive methods to solve benchmark problems of increasing complexity. The codes represent a small sampling of the current propagation codes available or under development. Results of this initial study indicate that the lower-fidelity code provides satisfactory results for cases involving low to moderate attenuation rates, whereas, the two higher-fidelity codes perform well across the range of problems.

Nark, Douglas M.↗

Code-verification techniques for the method-of-moments implementation of the magnetic-field integral equation

For computational physics simulations, code verification plays a major role in establishing the credibility of the results by assessing the correctness of the implementation of the underlying numerical methods. In computational electromagnetics, surface integral equations, such as the method-of-moments implementation of the magnetic-field integral equation, are frequently used to solve Maxwell's equations on the surfaces of electromagnetic scatterers. These electromagnetic surface integral equations yield many code-verification challenges due to the various sources of numerical error and their possible interactions. In this paper, we provide approaches to separately measure the numerical errors arising from these different error sources. We demonstrate the effectiveness of these approaches for cases with and without coding errors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Code-verification techniques for the method-of-moments implementation of the combined-field integral equation

Code verification plays an important role in establishing the credibility of computational simulations by assessing the correctness of the implementation of the underlying numerical methods. In computational electromagnetics, the numerical solution to integral equations incurs multiple interacting sources of numerical error, as well as other challenges, which render traditional code-verification approaches ineffective. In this paper, we provide approaches to separately measure the numerical errors arising from these different error sources for the method-of-moments implementation of the combined-field integral equation. Here, we demonstrate the effectiveness of these approaches for cases with and without coding errors.

97 MATHEMATICS AND COMPUTING↗

An Immersed Finite Element Lagrangian-Eulerian Code-Coupling Framework

This report presents an assessment of immersed Eulerian-Lagrangian code-coupling techniques suitable for use in a broad range of mechanics applications. The coupling algorithm is based on an immersed finite element method that considers the Lagrangian and Eulerian overlap regions in the overall variational formulation. In this report the basic formulation details are presented followed by various aspects of the code-coupling algorithm using OpenIFEM as the Lagrangian/coupling framework. A series of representative test cases that illustrate the code-coupling algorithm are discussed. The current work provides an in-depth investigation into the immersed finite element method for the purposes of providing a rigorous coupling technique that is minimally invasive in the respective Eulerian and Lagrangian codes. A number of extensions to the base immersed finite element method have been examined. These extension include nodal and quadrature-based indicator functions, a Lagrangian volume-fraction calculation in regions of overlap, and the use of penalty constraints between the Lagrangian and Eulerian domains. A unique MPI-based coupling strategy that retains the independent MPI structure of each code has been demonstrated.

97 MATHEMATICS AND COMPUTING↗

(U) A General-Purpose Code for Correlated Sampling Using Batch Statistics with MCNP6 for Fixed-Source Problems

Correlated sampling can be used to reduce the uncertainty of a difference of tallies by taking advantage of the negative covariance term in the sandwich formula. Booth first showed how correlated sampling can be applied with batch statistics using MCNP’s tally fluctuation chart (TFC) to reduce the uncertainty of a difference of tallies in fixed-source problems. Booth presented a problem in which a 1273% uncertainty in a difference was reduced to 8% by accounting for correlations. Researchers He and Su recently studied correlated sampling using the TFC in MCNP version 5. They determined that the code did not print enough digits in the TFC tally means for accurate batch statistics in some cases. After modifying the source code, they concluded that “correlated sampling can yield a standard deviation of about one magnitude smaller than that predicted by the direct, un-correlated simulation when the changes in system response are small (say about 1%), which is equivalent to saving in CPU time by a factor of 100. Such saving [sic] becomes less significant as the change in system response becomes larger.” He and Su provided the formulas needed to apply batch statistics to compute the correlated uncertainty of a difference of tallies. In this report, we follow up on their work by providing the formulas needed to apply batch statistics to compute the correlated uncertainty of a ratio of tallies and of a difference of two tallies divided by a third tally. We extend these formulas to differences and ratios of ratios. These formulas are applied to reduce the uncertainty associated with calculating a relative sensitivity. He and Su did not investigate the accuracy of their correlated sampling uncertainty estimates. We use their test problems and evaluate the accuracy of the uncertainty estimates by comparing with results obtained from random sampling, and, in simple cases, with theoretical values of the “exact” uncertainties. We find that the uncertainties obtained from batch statistics are accurate as long as at least 100 batches are used. We present a new computer code, COSUBS (COrrelated Sampling Using Batch Statistics), that reads MCNP6 TFCs and applies correlated sampling using batch statistics for the tally combinations that the user specifies. COSUBS is a very general tool that compares all TFCs for a base case and one or two perturbed cases. It computes uncertainties for ratios if given only a base case. This report is organized as follows. The equations to apply batch statistics to the difference of random tallies are reviewed in Sec. II. Section III presents the equations for applying batch statistics to a ratio of random tallies; this is useful for computing relative sensitivities using a one-sided finite difference and the relative sensitivity using the differential operator method. Section IV presents the equations for applying batch statistics to a difference of two random tallies divided by a third; this is useful for computing a relative sensitivities using a central difference. Section V presents the equations for applying batch statistics to a difference of two ratios with four random tallies. Section VI presents the equations for applying batch statistics to a one-sided finite difference estimate of the relative sensitivity of a ratio (this uses four random tallies). Section VII presents the equations for applying batch statistics to a central difference estimate of the relative sensitivity of a ratio (this uses six random tallies). Section VIII presents the equations for applying batch statistics to a sum of random tallies. Section IX discusses how to apply batch statistics using MCNP6. Section X presents COSUBS, describing its command-line options and logic. Sections XI through XVI present numerical results for various test problems. Section XVII is a summary and conclusions. Appendix A derives the theoretical Monte Carlo tally variance given certain assumptions; these variances are used to verify the batch statistics for some of the problems. Appendix B lists the MCNP6 input for the unperturbed example problem. Appendix C presents modifications made to MCNP6.3 to support this work.

97 MATHEMATICS AND COMPUTING↗

Application of a Full Reynolds Stress Model to High Lift Flows

A recently developed second-moment Reynolds stress model was applied to two challenging high-lift flows: (1) transonic flow over the ONERA M6 wing, and (2) subsonic flow over the DLR-F11 wing-body configuration from the second AIAA High Lift Prediction Workshop. In this study, the Reynolds stress model results were contrasted with those obtained from one- and two{equation turbulence models, and were found to be competitive in terms of the prediction of shock location and separation. For an ONERA M6 case, results from multiple codes, grids, and models were compared, with the Reynolds stress model tending to yield a slightly smaller shock-induced separation bubble near the wing tip than the simpler models, but all models were fairly close to the limited experimental surface pressure data. For a series of high-lift DLR{F11 cases, the range of results was more limited, but there was indication that the Reynolds stress model yielded less-separated results than the one-equation model near maximum lift. These less-separated results were similar to results from the one-equation model with a quadratic constitutive relation. Additional computations need to be performed before a more definitive assessment of the Reynolds stress model can be made.

Lee-Rausch, E. M.↗

Manual for obscuration code with space station applications

The Obscuration Code, referred to as SHADOW, is a user-oriented computer code to determine the case shadow of an antenna in a complex environment onto the far zone sphere. The surrounding structure can be composed of multiple composite cone frustums and multiply sided flat plates. These structural pieces are ideal for modeling space station configurations. The means of describing the geometry input is compatible with the NEC-BASIC Scattering Code. In addition, an interactive mode of operation has been provided for DEC VAX computers. The first part of this document is a user's manual designed to give a description of the method used to obtain the shadow map, to provide an overall view of the operation of the computer code, to instruct a user in how to model structures, and to give examples of inputs and outputs. The second part is a code manual that details how to set up the interactive and non-interactive modes of the code and provides a listing and brief description of each of the subroutines.

Marhefka, R. J.↗