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 73 records · Page 4

Active Mirror Predictive and Requirements Verification Software (AMP-ReVS)

This software is designed to predict large active mirror performance at various stages in the fabrication lifecycle of the mirror. It was developed for 1-meter class powered mirrors for astronomical purposes, but is extensible to other geometries. The package accepts finite element model (FEM) inputs and laboratory measured data for large optical-quality mirrors with active figure control. It computes phenomenological contributions to the surface figure error using several built-in optimization techniques. These phenomena include stresses induced in the mirror by the manufacturing process and the support structure, the test procedure, high spatial frequency errors introduced by the polishing process, and other process-dependent deleterious effects due to light-weighting of the mirror. Then, depending on the maturity of the mirror, it either predicts the best surface figure error that the mirror will attain, or it verifies that the requirements for the error sources have been met once the best surface figure error has been measured. The unique feature of this software is that it ties together physical phenomenology with wavefront sensing and control techniques and various optimization methods including convex optimization, Kalman filtering, and quadratic programming to both generate predictive models and to do requirements verification. This software combines three distinct disciplines: wavefront control, predictive models based on FEM, and requirements verification using measured data in a robust, reusable code that is applicable to any large optics for ground and space telescopes. The software also includes state-of-the-art wavefront control algorithms that allow closed-loop performance to be computed. It allows for quantitative trade studies to be performed for optical systems engineering, including computing the best surface figure error under various testing and operating conditions. After the mirror manufacturing process and testing have been completed, the software package can be used to verify that the underlying requirements have been met.

Basinger, Scott A.↗

3D Coded SUMMA: Communication-Efficient and Robust Parallel Matrix Multiplication

In this paper, we propose a novel fault-tolerant parallel matrix multiplication algorithm called 3D Coded SUMMA that achieves higher failure-tolerance than replication-based schemes for the same amount of redundancy. This work bridges the gap between recent developments in coded computing and fault-tolerance in high-performance computing (HPC). The core idea of coded computing is the same as algorithm-based fault-tolerance (ABFT), which is weaving redundancy in the computation using error-correcting codes. In particular, we show that MatDot codes, an innovative code construction for parallel matrix multiplications, can be integrated into three-dimensional SUMMA (Scalable Universal Matrix Multiplication Algorithm [30]) in a communication-avoiding manner. To tolerate any two node failures, the proposed 3D Coded SUMMA requires ~50% less redundancy than replication, while the overhead in execution time is only about 5–10%.

97 MATHEMATICS AND COMPUTING↗

Benchmark problems in computational aeroacoustics

A recent directive at NASA Langley is aimed at numerically predicting principal noise sources. During my summer stay, I worked with high-order ENO code, developed by Dr. Harold Atkins, for solving the unsteady compressible Navier-Stokes equations, as it applies to computational aeroacoustics (CAA). A CAA workshop, composed of six categories of benchmark problems, has been organized to test various numerical properties of code. My task was to determine the robustness of Atkins' code for these test problems. In one category, we tested the nonlinear wave propagation of the code for the one-dimensional Euler equations, with initial pressure, density, and velocity conditions. Using freestream boundary conditions, our results were plausible. In another category, we solved the linearized two-dimensional Euler equations to test the effectiveness of radiation boundary conditions. Here we utilized MAPLE to compute eigenvalues and eigenvectors of the Jacobian given variable and flux vectors. We experienced a minor problem with inflow and outflow boundary conditions. Next, we solved the quasi one dimensional unsteady flow equations with an incoming acoustic wave of amplitude 10(exp -6). The small amplitude sound wave was incident on a convergent-divergent nozzle. After finding a steady-state solution and then marching forward, our solution indicated that after 30 periods the acoustic wave had dissipated (a period is time required for sound wave to traverse one end of nozzle to other end).

Porter-Locklear, Freda↗

ARCS: Agentic Retrieval-Augmented Code Synthesis with Iterative Refinement

Agentic Retrieval-Augmented Code Synthesis with Iterative RefinementIn supercomputing, efficient and optimized code generation is essential to leverage high-performance systems effectively. We have developed Agentic Retrieval-Augmented Code Synthesis (ARCS), an advanced framework for accurate, robust, and efficient code generation, completion, and translation. ARCS integrates Retrieval-Augmented Generation (RAG) with Chain-of-Thought (CoT) reasoning to systematically break down and iteratively refine complex programming tasks. An agent-based RAG mechanism retrieves relevant code snippets, while real-time execution feedback drives the synthesis of candidate solutions. This process is formalized as a state-action search tree optimization, balancing code correctness with editing efficiency. Evaluations on the Geeks4Geeks and HumanEval benchmarks demonstrate that ARCS significantly outperforms traditional prompting methods in translation and generation quality. By enabling scalable and precise code synthesis, ARCS offers transformative potential for automating and optimizing code development in supercomputing applications, enhancing computational resource utilization

Bhattarai, Manish [Los Alamos National Labs]↗

Wall-function boundary conditions in the solution of the Navier-Stokes equations for complex compressible flows

To make computer codes for two-dimensional compressible flows more robust and economical, wall functions for these flows, under adiabatic conditions, have been developed and tested. These wall functions have been applied to three two-equation models of turbulence. The tests consist of comparisons of calculated and experimental results for transonic and supersonic flow over a flat plate and for two-dimensional and axisymmetrical transonic shock-wave/boundary-layer interaction flows with and without separation. The calculations are performed with an implicit algorithm that solves the Reynolds-averaged Navier-Stokes equations. It is shown that results obtained agree very well with the data for the complex compressible flows tested, provided criteria for use of the wall functions are followed. The expected savings in cost of the computations and improved robustness of the code were achieved.

Viegas, J. R.↗

Convergence acceleration of implicit schemes in the presence of high aspect ratio grid cells

The performance of Navier-Stokes codes are influenced by several phenomena. For example, the robustness of the code may be compromised by the lack of grid resolution, by a need for more precise initial conditions or because all or part of the flowfield lies outside the flow regime in which the algorithm converges efficiently. A primary example of the latter effect is the presence of extended low Mach number and/or low Reynolds number regions which cause convergence deterioration of time marching algorithms. Recent research into this problem by several workers including the present authors has largely negated this difficulty through the introduction of time-derivative preconditioning. In the present paper, we employ the preconditioned algorithm to address convergence difficulties arising from sensitivity to grid stretching and high aspect ratio grid cells. Strong grid stretching is particularly characteristic of turbulent flow calculations where the grid must be refined very tightly in the dimension normal to the wall, without a similar refinement in the tangential direction. High aspect ratio grid cells also arise in problems that involve high aspect ratio domains such as combustor coolant channels. In both situations, the high aspect ratio cells can lead to extreme deterioration in convergence. It is the purpose of the present paper to address the reasons for this adverse response to grid stretching and to suggest methods for enhancing convergence under such circumstances. Numerical algorithms typically possess a maximum allowable or optimum value for the time step size, expressed in non-dimensional terms as a CFL number or vonNeumann number (VNN). In the presence of high aspect ratio cells, the smallest dimension of the grid cell controls the time step size causing it to be extremely small, which in turn results in the deterioration of convergence behavior. For explicit schemes, this time step limitation cannot be exceeded without violating stability restrictions of the scheme. On the other hand, for implicit schemes, which are typically unconditionally stable, there appears to be room for improvement through careful tailoring of the time step definition based on results of linear stability analyses. In the present paper, we focus on the central-differenced alternating direction implicit (ADI) scheme. The understanding garnered from this analyses can then be applied to other implicit schemes. In order to systematically study the effects of aspect ratio and the methods of mitigating the associated problems, we use a two pronged approach. We use stability analyses as a tool for predicting numerical convergence behavior and numerical experiments on simple model problems to verify predicted trends. Based on these analyses, we determine that efficient convergence may be obtained at all aspect ratios by getting a combination of things right. Primary among these are the proper definition of the time step size, proper selection of viscous preconditioner and the precise treatment of boundary conditions. These algorithmic improvements are then applied to a variety of test cases to demonstrate uniform convergence at all aspect ratios.

Buelow, B. E. O.↗

Progress in Advanced Spray Combustion Code Integration

A multiyear project to assemble a robust, muitiphase spray combustion code is now underway and gradually building up to full speed. The overall effort involves several university and government research teams as well as Rocketdyne. The first part of this paper will give an overview of the respective roles of the different participants involved, the master strategy, the evolutionary milestones, and an assessment of the state-of-the-art of various key components. The second half of this paper will highlight the progress made to date in extending the baseline Navier-Stokes solver to handle multiphase, multispecies, chemically reactive sub- to supersonic flows. The major hurdles to overcome in order to achieve significant speed ups are delineated and the approaches to overcoming them will be discussed.

Liang, Pak-Yan↗

Adversarial Robustness Limits

This is the official code for the ICML 2024 paper "Adversarial Robustness Limits via Scaling-Law and Human-Alignment Studies". This code extends that of Wang et al. (2023) to facilitate state-of-the-art CIFAR-10 adversarial robustness, via training of WideResNet models on various large synthetic datasets. The code also facilitates derivation of the various scaling laws put forth in our ICML paper, which we use to compute efficient training settings.

Bartoldson, BrianR↗

Implementation of Chemistry in the Athena++ Code

Chemistry plays a key role in many aspects of astrophysical fluids. Atoms and molecules are agents for heating and cooling, determine the ionization fraction, serve as observational tracers, and build the molecular foundation of life. We present the implementation of a chemistry module in the publicly available magnetohydrodynamic code Athena++ . We implement several chemical networks and heating and cooling processes suitable for simulating the interstellar medium (ISM). A general chemical network framework in the KIDA format is also included, allowing users to easily implement their own chemistry. Radiation transfer and cosmic-ray ionization are coupled with chemistry and solved with the simple six-ray approximation. The chemical and thermal processes are evolved as a system of coupled ordinary differential equations with an implicit solver from the CVODE library. We perform and present a series of tests to ensure the numerical accuracy and convergence of the code. Many tests combine chemistry with gas dynamics, including comparisons with analytic solutions, 1D problems of the photodissociation regions and shocks, and realistic 3D simulations of the turbulent ISM. We release the code with the new public version of Athena++ , aiming to provide a robust and flexible code for the astrochemical simulation community.

79 ASTRONOMY AND ASTROPHYSICS↗

Adopting Code Verification Methodology Based on Model Form

Code verification is an essential part of credibility analysis for computational models. It assesses whether the mathematical model is implemented correctly into the code and whether the numerical methods behave consistently, and is done before solution verification and validation. Robust guidance for code verification exists in the literature. However, there is no known, concise guide for selecting the approach based on the model form that also presents an overview of the common elements. This document was written to address this gap as an accessible reference for beginning a code-verification effort.

97 MATHEMATICS AND COMPUTING↗

Adapting Code Verification Methodology to Model Form

Code verification is an essential part of credibility analysis for computational models. It assesses whether the mathematical model is implemented correctly into the code and whether the numerical methods behave consistently, and is done before solution verification and validation. Robust guidance for code verification exists in the literature. However, there is no known, concise guide for selecting the approach based on the model form that also presents an overview of the common elements. This document was written to address this gap as an accessible reference for beginning a code-verification effort.

97 MATHEMATICS AND COMPUTING↗

Comparison of the full potential and Euler formulations for computing transonic airfoil flows

A quantitative comparison between the Euler and full potential formulations with respect to speed and accuracy is presented. The robustness of the codes used is tested by a number of transonic airfoil cases. The computed results are from four transonic airfoil computer codes. The full potential codes use fully implicit iteration algorithms. The first Euler code uses a fully implicit ADI iteration scheme. The second Euler code uses an explicit Runge Kutta time stepping algorithm which is enhanced by a multigrid convergence acceleration scheme. Quantitative comparisons are made using various plots of lift coefficient versus the average mesh spacing along the airfoil. Besides yielding an asymptotic limit to the lift coefficient, these results also demonstrate the truncation error behavior of the various codes. Quantitative conclusions regarding the full potential and Euler formulations with respect to accuracy, speed, and robustness can be presented.

Flores, J.↗

Calculating potential energy curves with fixed-node diffusion Monte Carlo: CO and N 2

This study reports on the prospect for the routine use of Quantum Monte Carlo (QMC) for the electronic structure problem, applying fixed-node Diffusion Monte Carlo (DMC) to generate highly accurate Born-Oppenheimer potential energy curves (PECs) for small molecular systems. The singlet ground electronic states of CO and N 2 were used as test cases. The PECs obtained by DMC employing multiconfigurational trial wavefunctions were compared with those obtained by conventional high-accuracy electronic structure methods such as multireference configuration interaction and/or the best available empirical spectroscopic curves. The goal was to test whether a straightforward procedure using available QMC codes could be applied robustly and reliably. Results obtained with DMC codes were found to be in close agreement with the benchmark PECs, and the n 3 scaling with the number of electrons (compared with n 7 or worse for conventional high-accuracy quantum chemistry) could be advantageous depending on the system size. Due to a large pre-factor in the scaling, for the small systems tested here, it is currently still much more computationally intensive to compute PECs with QMC. Nevertheless, QMC algorithms are particularly well-suited to large-scale parallelization and are therefore likely to become more relevant for future massively parallel hardware architectures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The international implications of national and local coordination on building energy codes: Case studies in six cities

Building energy efficiency is an important strategy for reducing greenhouse gas emissions globally. In fact, 55 countries have included building energy efficiency in their Nationally Determined Contributions (NDCs) under the Paris Agreement. This research uses building energy code implementation in six cities across different continents as case studies to assess what it may take for countries to implement the ambitions of their energy efficiency goals. Specifically, we look at the cases of Bogota, Colombia; Da Nang, Vietnam; Eskisehir, Turkey; Mexico City, Mexico; Rajkot, India; and Tshwane, South Africa, all of which are “deep dive” cities under the Sustainable Energy for All's Building Efficiency Accelerator. The research focuses on understanding the baseline with existing gaps in implementation and coordination. The methodology used a combination of surveys on code status and interviews with stakeholders at the local and national level, as well as review of published documents. We looked at code development, implementation, and evaluation. The cities are all working to improve implementation, however, the challenges they currently face include gaps in resources, capacity, tools, and institutions to check for compliance. Better coordination between national and local governments could help improve implementation, but that coordination is not yet well established. For example, all six of the cities reported that there was little to no involvement of local stakeholders in development of the national code; only one city reported that it had access to national funding to support code implementation. More robust coordination could better link cities with capacity building and funding for compliance, and ensure that the code reflects local priorities. By understanding gaps in implementation, it can also help in designing more targeted interventions to scale up energy savings.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Fitting Nonlinear Curves by use of Optimization Techniques

MULTIVAR is a FORTRAN 77 computer program that fits one of the members of a set of six multivariable mathematical models (five of which are nonlinear) to a multivariable set of data. The inputs to MULTIVAR include the data for the independent and dependent variables plus the user s choice of one of the models, one of the three optimization engines, and convergence criteria. By use of the chosen optimization engine, MULTIVAR finds values for the parameters of the chosen model so as to minimize the sum of squares of the residuals. One of the optimization engines implements a routine, developed in 1982, that utilizes the Broydon-Fletcher-Goldfarb-Shanno (BFGS) variable-metric method for unconstrained minimization in conjunction with a one-dimensional search technique that finds the minimum of an unconstrained function by polynomial interpolation and extrapolation without first finding bounds on the solution. The second optimization engine is a faster and more robust commercially available code, denoted Design Optimization Tool, that also uses the BFGS method. The third optimization engine is a robust and relatively fast routine that implements the Levenberg-Marquardt algorithm.

Hill, Scott A.↗

NEXUS Qubit Analysis: Jump Rates and Efciencies

Correlated qubit errors are a hinderance to quantum computing, but when using quantum chips as a particle detector, they can be a sign of energy deposits. Using a four transmon qubit chip in the NEXUS fridge at Fermilab, we have taken data to better understand the impact ionizing radiation has on the correlated errors. To analyze this data, we need a jump detection code that is robustly tested with understood efficiencies. In this work, we describe the process of getting these efficiencies using a rolling $\chi^2$ jump detection code.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multi-zonal Navier-Stokes code with the LU-SGS scheme

The LU-SGS (lower upper symmetric Gauss Seidel) algorithm has been implemented into the Compressible Navier-Stokes, Finite Volume (CNSFV) code and validated with a multizonal Navier-Stokes simulation of a transonic turbulent flow around an Onera M6 transport wing. The convergence rate and robustness of the code have been improved and the computational cost has been reduced by at least a factor of 2 over the diagonal Beam-Warming scheme.

Klopfer, G. H.↗

Enhancement of PyARC for Westinghouse Electric Company’s Lead Fast Reactor Design and Modeling (Final TCF Report)

Westinghouse Electric Company is a nuclear reactor vendor headquartered in the U.S. that is developing advanced reactor technology for the U.S. and global markets. Westinghouse has been relying on the neutronics Argonne Reactor Codes (ARC) executed through the NEAMS Workbench and its PyARC module that are developed under the DOE-NE Nuclear Energy Advanced Modeling and Simulation (NEAMS) and Advanced Reactor Technology (ART) – Fast Reactor programs. Through this user experience, Westinghouse identified several enhancements that would benefit the ARC codes’ usability by the US industry and therefore its commercialization potential. The enhancements were proposed to deliver both improvements in workflow and analysis capabilities to better support effective fast reactor core design and analysis to the nuclear industry. The PyARC workflow was extended in this project by integrating non-neutronic ARC codes DASSH and NUBOW-3D. The Ducted Assembly Steady-State Heat equation (DASSH) code is developed at ANL to perform steady-state thermal hydraulic sub-channel analysis in liquid metal fast reactor assemblies to determine optimized coolant flow and temperature distributions, which in this project was updated and validated for lead fast reactor (LFR) applications. The interface between REBUS and NUBOW-3D were improved in this project to assess the impact of the core restraint design and thermal induced expansion effects on the reactivity of the core, and to model the deformations of the fuel assemblies induced by temperature and irradiation. Finally, the ARC models that were extensively verified and validated through various SFR-based modeling benchmarks are extended in this project through code-to-code comparison on relevant LFR-specific neutronics benchmarks against Monte-Carlo neutronic solutions. Overall, this work enables verification of the capability of the ARC codes for a wide range of Generation-IV reactor designs. The outcome of this project is the release of a comprehensive modeling toolkit of validated, robust and efficient codes, as well as their user interface, that enables industry to perform a wide range of fast reactor analyses for design and licensing of their concepts.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗