Search NASA⌕ Search

SEARCH · Search NASA

Results for “Code Robustness”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Transonic Navier-Stokes wing solutions using a zonal approach. Part 2: High angle-of-attack simulation

A computer code is under development whereby the thin-layer Reynolds-averaged Navier-Stokes equations are to be applied to realistic fighter aircraft configurations. This transonic Navier-Stokes code (TNS) utilizes a zonal approach in order to treat complex geometries and satisfy in-core computer memory constraints. The zonal approach was applied to isolated wing geometries in order to facilitate code development. The TNS finite difference algorithm, zonal methodology, and code validation with experimental data is addressed. Also addressed are some numerical issues such as code robustness, efficiency, and accuracy at high angles of attack. Special free-stream-preserving metrics proved an effective way to treat H-mesh singularities over a large range of severe flow conditions, including strong leading edge flow gradients, massive shock induced separation, and stall. Furthermore, lift and drag coefficients were computed for a wing up through CLmax. Numerical oil flow patterns and particle trajectories are presented both for subcritical and transonic flow. These flow simulations are rich with complex separated flow physics and demonstrate the efficiency and robustness of the zonal approach.

Chaderjian, Neal M.↗
NASA NTRS1989

Unsteady aerodynamic simulation of multiple bodies in relative motion

A prototype method for time-accurate simulation of multiple aerodynamic bodies in relative motion is presented. The method is general and features unsteady chimera domain decomposition techniques and an implicit approximately factored finite-difference procedure to solve the time-dependent thin-layer Navier-Stokes equations. The method is applied to a set of two- and three-dimensional test problems to establish spatial and temporal accuracy, quantify computational efficiency, and begin to test overall code robustness.

Meakin, Robert L.↗
NASA NTRS1989

Unsteady aerodynamic simulation of multiple bodies in relative motion: A prototype method

A prototype method for time-accurate simulation of multiple aerodynamic bodies in relative motion is presented. The method is general and features unsteady chimera domain decomposition techniques and an implicit approximately factored finite-difference procedure to solve the time-dependent thin-layer Navier-Stokes equations. The method is applied to a set of two- and three- dimensional test problems to establish spatial and temporal accuracy, quantify computational efficiency, and begin to test overall code robustness.

Meakin, Robert L.↗
NASA NTRS2008

The Adaptively-Refined MHD Solver (ARMS)

ARMS is a robust code for solving the single-fluid, fully compressible equations of magnetohydrodynamics. In this presentation I will describe how to access and run ARMS and how to use HelioSpace to analyze the results. The main features of the code are the following: 1. Equations are solved in either Cartesian or Spherical coordinates. For the latter, either a linear or a Log(r) coordinate can be used. 2. The latest flux-corrected-transport schemes developed at NRZ, are used to advance the convective equations. All waves and shocks are accurately captured. 3. A fully adaptive grid can be used. The code incorporates the PARAMESH technology for block-adaptation. Arbitrary adaptation criteria can be specified. 4. The code maintains a divergence-free magnetic field to machine accuracy throughout all refinement and de-refinement. 5. A uniform resistivity and thermal conduction can be included. Solution is either explicit or implicit. 6. Arbitrary boundary and initial conditions can be used in either Cartesian or spherical coordinates. 7. An accompanying visualization package, HelioSpace, is available for viewing and analyzing the native ARMS output, (without need for interpolating onto a structured grid).

Antichos, S. K.↗
NASA NTRS2015

Combined Structural and Compositional Evolution of Planetary Rings Due to Micrometeoroid Impacts and Ballistic Transport

We introduce improved numerical techniques for simulating the structural and compositional evolution of planetary rings due to micrometeoroid bombardment and subsequent ballistic transport of impact ejecta. Our current, robust code is capable of modeling structural changes and pollution transport simultaneously over long times on both local and global scales. In this paper, we describe the methodology based on the original structural code of Durisen et al. (1989, Icarus 80, 136-166) and on the pollution transport code of Cuzzi and Estrada (1998, Icarus 132, 1-35). We provide demonstrative simulations to compare with, and extend upon previous work, as well as examples of how ballistic transport can maintain the observed structure in Saturn's rings using available Cassini occultation optical depth data. In particular, we explicitly verify the claim that the inner B (and presumably A) ring edge can be maintained over long periods of time due to an ejecta distribution that is heavily biased in the prograde direction through a balance between the sharpening effects of ballistic transport and the broadening effects of viscosity. We also see that a "ramp"-like feature forms over time just inside that edge. However, it does not remain linear for the duration of the runs presented here unless a less steep ejecta velocity distribution is adopted. We also model the C ring plateaus and find that their outer edges can be maintained at their observed sharpness for long periods due to ballistic transport. We hypothesize that the addition of a significant component of a retrograde-biased ejecta distribution may help explain the linearity of the ramp and is probably essential for maintaining the sharpness of C ring plateau inner edges. This component would arise for the subset of micrometeoroid impacts which are destructive rather than merely cratering. Such a distribution will be introduced in future work.

Cassini↗
DOE OSTI2021

Robust verification of stochastic simulation codes

We introduce a robust verification tool for computational codes, which we call Stochastic Robust Extrapolation based Error Quantification (StREEQ). Unlike the prevalent Grid Convergence Index (GCI) [1] method, our approach is suitable for both stochastic and deterministic computational codes and is generalizable to any number of discretization variables. Building on ideas introduced in the Robust Verification [2] approach, we estimate the converged solution and orders of convergence with uncertainty using multiple fits of a discretization error model. In contrast to Robust Verification, we perform these fits to many bootstrap samples yielding a larger set of predictions with smoother statistics. Here, bootstrap resampling is performed on the lack-of-fit errors for deterministic code responses, and directly on the noisy data set for stochastic responses. This approach lends a degree of robustness to the overall results, capable of yielding precise verification results for sufficiently resolved data sets, and appropriately expanding the uncertainty when the data set does not support a precise result. For stochastic responses, a credibility assessment is also performed to give the analyst an indication of the trustworthiness of the results. Furthermore, this approach is suitable for both code and solution verification, and is particularly useful for solution verification of high-consequence simulations..

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

The impact of time step definition on code convergence and robustness

We have implemented preconditioning for multi-species reacting flows in two independent codes, an implicit (ADI) code developed in-house and the RPLUS code (developed at LeRC). The RPLUS code was modified to work on a four-stage Runge-Kutta scheme. The performance of both the codes was tested, and it was shown that preconditioning can improve convergence by a factor of two to a hundred depending on the problem. Our efforts are currently focused on evaluating the effect of chemical sources and on assessing how preconditioning may be applied to improve convergence and robustness in the calculation of reacting flows.

Venkateswaran, S.↗
NASA NTRS1987

Design applications for supercomputers

The complexity of codes for solutions of real aerodynamic problems has progressed from simple two-dimensional models to three-dimensional inviscid and viscous models. As the algorithms used in the codes increased in accuracy, speed and robustness, the codes were steadily incorporated into standard design processes. The highly sophisticated codes, which provide solutions to the truly complex flows, require computers with large memory and high computational speed. The advent of high-speed supercomputers, such that the solutions of these complex flows become more practical, permits the introduction of the codes into the design system at an earlier stage. The results of several codes which either were already introduced into the design process or are rapidly in the process of becoming so, are presented. The codes fall into the area of turbomachinery aerodynamics and hypersonic propulsion. In the former category, results are presented for three-dimensional inviscid and viscous flows through nozzle and unducted fan bladerows. In the latter category, results are presented for two-dimensional inviscid and viscous flows for hypersonic vehicle forebodies and engine inlets.

Studerus, C. J.↗
NASA NTRS1991

A robust low-rate coding scheme for packet video

Due to the rapidly evolving field of image processing and networking, video information promises to be an important part of telecommunication systems. Although up to now video transmission has been transported mainly over circuit-switched networks, it is likely that packet-switched networks will dominate the communication world in the near future. Asynchronous transfer mode (ATM) techniques in broadband-ISDN can provide a flexible, independent and high performance environment for video communication. For this paper, the network simulator was used only as a channel in this simulation. Mixture blocking coding with progressive transmission (MBCPT) has been investigated for use over packet networks and has been found to provide high compression rate with good visual performance, robustness to packet loss, tractable integration with network mechanics and simplicity in parallel implementation.

Chen, Y. C.↗
NASA NTRS1975

Robustly optimal rate one-half binary convolutional codes

Three optimality criteria for convolutional codes are considered in this correspondence: namely, free distance, minimum distance, and distance profile. Here we report the results of computer searches for rate one-half binary convolutional codes that are 'robustly optimal' in the sense of being optimal for one criterion and optimal or near-optimal for the other two criteria. Comparisons with previously known codes are made. The results of a computer simulation are reported to show the importance of the distance profile to computational performance with sequential decoding.

Johannesson, R.↗
DOE OSTI2025

Lost in OCR Translation? Vision-Based Approaches to Robust Document Retrieval

Code for ‘Lost in OCR Translation?’: robust document retrieval under degradation. Compares OCR-based, vision-only, and hybrid pipelines; includes SambaNova LLaMA Vision OCR, Nougat, and ViDoRe baselines. Provides QA data generation, RAG evaluation, and metrics (Levenshtein, nDCG@k, Recall@k, EM/F1) with reproducible scripts. Includes dataset guides

Bhattarai, Manish [Los Alamos National Labs]↗
DOE OSTI2018

EStokTP: Electronic Structure to Temperature- and Pressure-Dependent Rate Constants—A Code for Automatically Predicting the Thermal Kinetics of Reactions

A priori rate predictions for gas phase reactions have undergone a gradual but dramatic transformation, with current predictions often rivaling the accuracy of the best available experimental data. The utility of such kinetic predictions would be greatly magnified if they could more readily be implemented for large numbers of systems. Here, we report the development of a new computational environment, namely, EStokTP, that reduces the human effort involved in the rate prediction for single channel reactions essentially to the specification of the methodology to be employed. The code can also be used to obtain all the necessary master equation building blocks for more complex reactions. In general, the prediction of rate constants involves two steps, with the first consisting of a set of electronic structure calculations and the second in the application of some form of kinetic solver, such as a transition state theory (TST)-based master equation solver. EStokTP provides a fully integrated treatment of both steps through calls to external codes to perform first the electronic structure and then the master equation calculations. It focuses on generating, extracting, and organizing the necessary structural properties from a sequence of calls to electronic structure codes, with robust automatic failure recovery options to limit human intervention. The code implements one or multidimensional hindered rotor treatments of internal torsional modes (with automated projection from the Hessian and with optional vibrationally adiabatic corrections), Eckart and multidimensional tunneling models (such as small curvature theory), and variational treatments (based on intrinsic reaction coordinate following). This focus on a robust implementation of high-level TST methods allows the code to be used in high accuracy studies of large sets of reactions, as illustrated here through sample studies of a few hundred reactions. At present, the following reaction types are implemented in EStokTP: abstraction, addition, isomerization, and beta-decomposition. Finally, preliminary protocols for treating barrierless reactions and multiple-well and/or multiple-channel potential energy surfaces are also illustrated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1995

A Robust Model-Based Coding Technique for Ultrasound Video

This paper introduces a new approach to coding ultrasound video, the intended application being very low bit rate coding for transmission over low cost phone lines. The method exploits both the characteristic noise and the quasi-periodic nature of the signal. Data compression ratios between 250:1 and 1000:1 are shown to be possible, which is sufficient for transmission over ISDN and conventional phone lines. Preliminary results show this approach to be promising for remote ultrasound examinations.

Docef, Alen↗
DOE OSTI2019

Decoy States and Low-Density Parity-Check Error-Correcting Codes in Quantum Cryptography with Phase–Time Coding

The cryptographic robustness of quantum key distribution (QKD) with phase–time coding against a photon number splitting (PNS) attack is analyzed. The line length up to which a secret key distribution is guaranteed is determined both by the protocol itself and by the efficiency of error correction in raw keys. The effect of different parameters of avalanche single-photon detectors on the length of the secret key distribution line is investigated. To correct errors, various versions of low-density parity-check (LDPC) codes are considered whose efficiency today is the closest to the Shannon theoretical limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1993

Error control techniques for satellite and space communications

The results included in the Ph.D. dissertation of Dr. Fu Quan Wang, who was supported by the grant as a Research Assistant from January 1989 through December 1992 are discussed. The sections contain a brief summary of the important aspects of this dissertation, which include: (1) erasurefree sequential decoding of trellis codes; (2) probabilistic construction of trellis codes; (3) construction of robustly good trellis codes; and (4) the separability of shaping and coding.

Costello, Daniel J., Jr.↗
DOE OSTI2024

Double Visual Defense

This is the official code for the paper "Double Visual Defense: Adversarial Pre-training and Instruction Tuning for Improving Vision-Language Model Robustness". This code can be used to produce vision language models (VLMs), like LLaVA, with enhanced robustness to adversarial attacks (e.g. jailbreaks).

Bartoldson, Brian [Lawrence Livermore National Lab↗