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 1,045 records · Page 58

Computational Nanoscience with NWChem

The NWChem software as been used to examine many nanoscale systems and their properties over the years. In this paper, an overiew of the general capabilities of NWChem is given as well as more specific details on the planewave and Gaussian based density functional codes usually used for nanoscale investigations. Examples are given of the scientific literature using NWChem, as well as two case studies: 1) Band gaps in oxides using exact-exchange based exchange-correlation functionals with the planewave DFT module, 2) Optical properties of chromophores using the Gaussian based DFT module.

36 MATERIALS SCIENCE↗

Braiding for the win: Harnessing braiding statistics in topological states to play quantum games

Nonlocal quantum games provide proof of principle that quantum resources can confer an advantage at certain tasks. They also provide a compelling way to explore the computational utility of phases of matter on quantum hardware. In a recent paper [O. Hart et al., Phys. Rev. Lett. 134, 130602 (2025)], we demonstrated that a toric code resource state conferred advantage at a certain nonlocal game, which remained robust to small deformations of the resource state. In this paper we demonstrate that this robust advantage is a generic property of resource states drawn from topological or fracton ordered phases of quantum matter. To this end, we illustrate how several other states from paradigmatic topological and fracton ordered phases can function as resources for suitably defined nonlocal games, notably the three-dimensional toric-code phase, the X-cube fracton phase, and the double-semion phase. The key in every case is to design a nonlocal game that harnesses the characteristic braiding processes of a quantum phase as a source of contextuality. We unify the strategies that take advantage of mutual statistics by relating the operators to be measured to order and disorder parameters of an underlying generalized symmetry-breaking phase transition. Additionally, by connecting the win probability to twist products, we show that success at the game serves as a many-body entanglement witness. Namely, if the players implement a perfect quantum strategy on large length scales, the quantum state they share cannot be connected to a trivial product state via a constant-depth local unitary circuit. Lastly, we massively generalize the family of games that admit perfect strategies when codewords of homological quantum error-correcting codes are used as resources.

Fractons↗

Hazma meets HERWIG4DM: precision gamma-ray, neutrino, and positron spectra for light dark matter

Herein we present a new open-source package, Hazma 2, that computes accurate spectra relevant for indirect dark matter searches for photon, neutrino, and positron production from vector-mediated dark matter annihilation and for spin-one dark matter decay. The tool bridges across the regimes of validity of two state of the art codes: Hazma 1, which provides an accurate description below hadronic resonances up to center-of-mass energies around 250 MeV, and Herwig4DM, which is based on vector meson dominance and measured form factors, and accurate well into the few GeV range. The applicability of the combined code extends to approximately 1.5 GeV, above which the number of final state hadrons off of which we individually compute the photon, neutrino, and positron yield grows exceedingly rapidly. We provide example branching ratios, particle spectra and conservative observational constraints from existing gamma-ray data for the well-motivated cases of decaying dark photon dark matter and vector-mediated fermionic dark matter annihilation. Finally, we compare our results to other existing codes at the boundaries of their respective ranges of applicability. Hazma 2 is freely available on GitHub athttps://github.com/LoganAMorrison/Hazma.

79 ASTRONOMY AND ASTROPHYSICS↗

Fully implicit 1D radiation hydrodynamics: Validation and verification

A fully implicit finite difference scheme has been developed to solve the hydrodynamic equations coupled with radiation transport. Solution of the time-dependent radiation transport equation is obtained using the discrete ordinates method and the energy flow into the Lagrangian meshes as a result of radiation interaction is fully accounted for. A tridiagonal matrix system is solved at each time step to determine the hydrodynamic variables implicitly. The results obtained from this fully implicit radiation hydrodynamics code in the planar geometry agrees well with the scaling law for radiation driven strong shock propagation in aluminium. For the point explosion problem the self similar solutions are compared with results for pure hydrodynamic case in spherical geometry. Results obtained when radiation interaction is also accounted agree with those of point explosion with heat conduction for lower input energies. Having, thus, benchmarked the code, self convergence of the method w.r.t. time step is studied in detail for both the planar and spherical problems. Spatial as well as temporal convergence rates are {approx_equal}1 as expected from the difference forms of mass, momentum and energy conservation equations. This shows that the asymptotic convergence rate of the code is realized properly.

97 MATHEMATICS AND COMPUTING↗

Numerical Uncertainties vs. Model Uncertainties in Two-phase Flow Simulations

In recent years, verification, validation and uncertainty quantification (VVUQ) have become a common practice in thermal-hydraulics analysis. In general, these activities deal with propagations of uncertainties in computer code simulations, e.g., through system analysis codes. However, most existing such activities in thermal-hydraulics analysis have been primarily focused on model uncertainties, while numerical uncertainties were largely overlooked. Numerical uncertainties (or numerical errors) can appear in many different forms, e.g., round-off error, statistical sampling error, and discretization error. As pointed out by Oberkampf and Roy, discretization error is usually the largest however the most difficult type of error to estimate reliably. In thermal-hydraulics analysis, especially two-phase flow simulations commonly encountered in reactor safety analysis, the lack of consideration on discretization error is mainly due to the difficulty in estimating them. Accurate estimations on discretization error require continuous mesh refinement and/or implementation of high-order numerical schemes in system analysis code, both of which are unfortunately difficult to achieve for existing codes. At first, it should be emphasized that mesh refinement (or mesh sensitivity study) is a well-understood concept in the thermal-hydraulics field. However, it is not commonly practiced for many reasons, e.g., lack of understanding on numerical errors by code users, consideration on computational cost, deteriorated numerical stability performance with refined meshes, and etc. Secondly, high-order (e.g., second-order) numerical schemes are simply unavailable in almost any existing system analysis code. Implementation of high-order numerical schemes in these codes is difficult, if not impossible, given the complexity of these codes. On the other hand, people tend to argue that numerical uncertainties (or discretization error as we have emphasized) are not as important as the commonly large uncertainties in two-phase flow models, e.g., closure correlations. As a result, nodalization is sometimes played unintentionally, or maybe intentionally, to match experimental data, which is referred as 'user effects' or 'compensating errors' in thermal-hydraulics community. Such a practice is highly criticized by Levy. In this work, we will at first build a computer code that incorporates both first-order and second-order numerical methods to solve the two-phase flow problems. The first-order method resembles the one used in many existing system analysis codes; and the second-order method works as the reference to estimate numerical errors. Numerical verifications on spatial discretization schemes will be presented in the form of mesh convergence study. It will also be demonstrated that, in practical scenarios, discretization errors can be as large as, or even larger than, model uncertainties via case studies.

42 ENGINEERING↗

Development of a Stiffness-Based Chemistry Load Balancing Scheme, and Optimization of Input/Output and Communication, to Enable Massively Parallel High-Fidelity Internal Combustion Engine Simulations

A closed-cycle gasoline compression ignition engine simulation near top dead center (TDC) was used to profile the performance of a parallel commercial engine computational fluid dynamics code, as it was scaled on up to 4096 cores of an IBM Blue Gene/Q supercomputer. The test case has 9 million cells near TDC, with a fixed mesh size of 0.15 mm, and was run on configurations ranging from 128 to 4096 cores. Profiling was done for a small duration of 0.11 crank angle degrees near TDC during ignition. Optimization of input/output performance resulted in a significant speedup in reading restart files, and in an over 100-times speedup in writing restart files and files for post-processing. Improvements to communication resulted in a 1400-times speedup in the mesh load balancing operation during initialization, on 4096 cores. An improved, “stiffness-based” algorithm for load balancing chemical kinetics calculations was developed, which results in an over 3-times faster run-time near ignition on 4096 cores relative to the original load balancing scheme. With this improvement to load balancing, the code achieves over 78% scaling efficiency on 2048 cores, and over 65% scaling efficiency on 4096 cores, relative to 256 cores.

CFD, Mira, Supercomputing, High Performance Comput↗

Monte Carlo simulations of a differential die-away instrument for determination of fissile content in spent fuel assemblies

The differential die-away (DDA) technique has been simulated by using the MCNPX code to quantify its capability to measure the fissile content in spent fuel assemblies, For 64 different spent fuel cases of various initial enrichment, burnup and cooling time, the count rate and signal to background ratios of the DDA system were obtained, where neutron backgrounds are mainly coming from the {sup 244}Cm of the spent fuel. To quantify the total fissile mass of spent fuel, a concept of the effective {sup 239}Pu mass was introduced by weighting the relative contribution to the signal of {sup 235}U and {sup 241}Pu compared to {sup 239}Pu and the calibration curves of DDA count rate vs. {sup 239}Pu{sub eff} were obtained by using the MCNPX code. With a deuterium-tritium (DT) neutron generator of 10{sup 9} n/s strength, signal to background ratios of sufficient magnitude are acquired for a DDA system with the spent fuel assembly in water.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Application of the TITAN Hybrid Deterministic Transport Code to Medical Physics - Paper 118

The TITAN code is a 3-dimensional parallel deterministic transport code that solves the linear Boltzmann equation. The TITAN code has hybrid algorithms that are ideal for medical physics applications: i) SN and characteristics method and ii) SN with a fictitious quadrature set and ray-tracing. These hybrid algorithms have been used in the simulation of computed tomography (CT) and single photon emission computed tomography (SPECT) In this paper, the hybrid algorithms developed for medical physics applications in the TITAN code are discussed. First, the TITAN code's block-oriented approach for utilizing SN and characteristic solvers for CT is presented and results for a simple test case are given. Second, the paper describes a hybrid formulation for SPECT with an SN solver in the phantom, a fictitious quadrature set for directions from the phantom surface passing through the collimator, and a simplified ray-tracing algorithm for particle transport to the detector. Finally, ongoing work is described and concluding remarks are given. The TITAN code's hybrid algorithms allow it to efficiently solve problems with low-scatter regions, which are frequently found in medical physics applications. The TITAN code has been used to solve a simplified CT problem and generate projection images for SPECT simulations. The WCOS technique was developed to improve the TITAN code's collimator representation. For these applications, the TITAN code was shown to require significantly less computation time than MCNP5. Work is currently underway to implement an iterative image reconstruction algorithm in the TITAN code. A script that calls the TITAN code to complete the forward projection step in SPECT has already been used to reconstruction a 2-dimensional phantom. The ability of TITAN to fully model particle transport in the patient in short computation times is expected to be a great advantage to iterative reconstruction. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Compiler-Directed Soft Error Detection and Recovery to Avoid DUE and SDC via Tail-DMR

This article presents Clover, a compiler-directed soft error detection and recovery scheme for lightweight soft error resilience. The compiler carefully generates soft-error-tolerant code based on idempotent processing without explicit checkpoints. During program execution, Clover relies on a small number of acoustic wave detectors deployed in the processor to identify soft errors by sensing the wave made by a particle strike. To cope with DUEs (detected unrecoverable errors) caused by the sensing latency of error detection, Clover leverages a novel selective instruction duplication technique called tail-DMR (dual modular redundancy) that provides a region-level error containment. Once a soft error is detected by either the sensors or the tail-DMR, Clover takes care of the error as in the case of exception handling. To recover from the error, Clover simply redirects program control to the beginning of the code region where the error is detected. The experimental results demonstrate that the average runtime overhead is only 26%, which is a 75% reduction compared to that of the state-of-the-art soft error resilience technique. In addition, this article evaluates an alternative technique called tail-wait, comparing it to Clover. According to the evaluation with the different processor configurations and the various error detection latencies, Clover turns out to be a superior technique, achieving 1.06 to 3.49× speedup over the tail-wait.

Computer Science↗

Extended Forward Sensitivity Analysis for Uncertainty Quantification

This report presents the forward sensitivity analysis method as a means for quantification of uncertainty in system analysis. The traditional approach to uncertainty quantification is based on a “black box” approach. The simulation tool is treated as an unknown signal generator, a distribution of inputs according to assumed probability density functions is sent in and the distribution of the outputs is measured and correlated back to the original input distribution. This approach requires large number of simulation runs and therefore has high computational cost. Contrary to the “black box” method, a more efficient sensitivity approach can take advantage of intimate knowledge of the simulation code. In this approach equations for the propagation of uncertainty are constructed and the sensitivity is solved for as variables in the same simulation. This “glass box” method can generate similar sensitivity information as the above “black box” approach with couples of runs to cover a large uncertainty region. Because only small numbers of runs are required, those runs can be done with a high accuracy in space and time ensuring that the uncertainty of the physical model is being measured and not simply the numerical error caused by the coarse discretization. In the forward sensitivity method, the model is differentiated with respect to each parameter to yield an additional system of the same size as the original one, the result of which is the solution sensitivity. The sensitivity of any output variable can then be directly obtained from these sensitivities by applying the chain rule of differentiation. We extend the forward sensitivity method to include time and spatial steps as special parameters so that the numerical errors can be quantified against other physical parameters. This extension makes the forward sensitivity method a much more powerful tool to help uncertainty analysis. By knowing the relative sensitivity of time and space steps with other interested physical parameters, the simulation can be run at appropriate time and space steps that ensure numerical sensitivities will not affect the confidence of the physical parameter sensitivity results. Two well defined benchmark problems, thermal wave and nonlinear diffusion, are utilized to demonstrate the extended forward sensitivity analysis method. All the physical solutions, parameter sensitivity solutions, even time step sensitivity in one case, have analytical forms, which allows the verification to be done in the strictest sense. A pilot code, Extended Forward sensitivity Analysis pilot code (EFA), has been developed to implement the above work.

97 MATHEMATICS AND COMPUTING↗

Characterization of microsatellites in the coding regions

With the development of high-throughput sequencing techniques, transcriptome sequencing projects which provide valuable resources for designing simple sequence repeat (SSR) primers have been carried out for many plants. However, the utility of SSRs for molecular breeding depends on genomewide distribution and coverage, as well as moderately high allelic variability, in the available SSR library. In this study, we characterized the exonic SSRs developed from the publicly available Populus genome as a case study to determine their value for molecular breeding. As expected, our results confirmed that microsatellites occurred approximately three times less often in coding regions than in non-coding regions. Mutability test also showed that exonic SSRs contained less allelic variability than intronic SSRs. More importantly, exonic SSRs were unevenly distributed both among and within chromosomes. Large exonic SSRs deserts were observed on several chromosomes. Differential selection between paralogous chromosomes, at the gene level, appears to be responsible for these SSR deserts, though the mechanisms that cause chromosome-specific SSR deserts are not known. This work provides ample evidence that the candidate gene approach based on unigenes identified from transcribed sequences may not be the best strategy to identify highly polymorphic SSRs.

59 BASIC BIOLOGICAL SCIENCES↗

Computer Modeling and Simulation: Increasing Reliability by Disentangling Verification and Validation

Verification and validation (V&V) of computer codes and models used in simulations are two aspects of the scientific practice of high importance that recently have been discussed widely by philosophers of science. While verification is predominantly associated with the correctness of the way a model is represented by a computer code or algorithm, validation more often refers to the model’s relation to the real world and its intended use. Because complex simulations are generally opaque to a practitioner, the Duhem problem can arise with verification and validation due to their entanglement; such an entanglement makes it impossible to distinguish whether a coding error or the model’s general inadequacy to its target should be blamed in the case of a failure. I argue that a clear distinction between computer modeling and simulation has to be made to disentangle verification and validation. Drawing on that distinction, I suggest to associate modeling with verification and simulation, which shares common epistemic strategies with experimentation, with validation. To explain the reasons for their entanglement in practice, I propose a Weberian ideal–typical model of modeling and simulation as roles in practice. I examine an approach to mitigate the Duhem problem for verification and validation that is generally applicable in practice and is based on differences in epistemic strategies and scopes. Based on this analysis, I suggest two strategies to increase the reliability of simulation results, namely, avoiding alterations of verified models at the validation stage as well as performing simulations of the same target system using two or more different models. In response to Winsberg’s claim that verification and validation are entangled I argue that deploying the methodology proposed in this work it is possible to mitigate inseparability of V&V in many if not all domains where modeling and simulation are used.

97 MATHEMATICS AND COMPUTING↗

Enhanced accuracy through ensembling of randomly initialized auto-regressive models for dynamical systems

Computational mechanics simulations using traditional finite element methods (FEM) require prohibitively expensive computational resources for real-time engineering applications, design optimization, and digital twin implementations. While machine learning (ML) surrogate models offer significant computational speedups, autoregressive ML models for time-dependent mechanical systems suffer from error accumulation that compromises long-term prediction reliability - a critical concern for engineering applications where accuracy over extended time horizons is essential for safety and performance assessments. Here, we propose a deep ensemble framework specifically designed to address this challenge in computational mechanics applications, where multiple ML surrogate models with random weight initializations are trained in parallel and their predictions aggregated during inference. This approach leverages statistical diversity to maximize information gain from a fixed set of training data and to mitigate error propagation, while maintaining the computational efficiency that makes ML surrogates attractive for engineering practice. We validate the framework on three representative problems spanning critical areas of computational mechanics: stress field evolution in heterogeneous microstructures under complex loading (relevant to advanced materials design and composite analysis), planetary-scale shallow water dynamics (applicable to environmental and geotechnical engineering), and Gray-Scott reaction-diffusion systems (relevant to mass transport and chemical process engineering). Across all test cases, the ensemble approach demonstrates consistent error reduction of 15-33% compared to individual models. The codes for this work are available on GitHub (https://github.com/Graham-Brady-Research-Group/AutoregressiveEnsemble_SpatioTemporal_Evolution).

autoregressive prediction↗

Quantum Graphical Models and Belief Propagation

Belief Propagation algorithms acting on Graphical Models of classical probability distributions, such as Markov Networks, Factor Graphs and Bayesian Networks, are amongst the most powerful known methods for deriving probabilistic inferences amongst large numbers of random variables. This paper presents a generalization of these concepts and methods to the quantum case, based on the idea that quantum theory can be thought of as a noncommutative, operator-valued, generalization of classical probability theory. Some novel characterizations of quantum conditional independence are derived, and definitions of Quantum n-Bifactor Networks, Markov Networks, Factor Graphs and Bayesian Networks are proposed. The structure of Quantum Markov Networks is investigated and some partial characterization results are obtained, along the lines of the Hammersley-Clifford theorem. A Quantum Belief Propagation algorithm is presented and is shown to converge on 1-Bifactor Networks and Markov Networks when the underlying graph is a tree. The use of Quantum Belief Propagation as a heuristic algorithm in cases where it is not known to converge is discussed. Applications to decoding quantum error correcting codes and to the simulation of many-body quantum systems are described.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Magnetic well and Mercier stability of stellarators near the magnetic axis

We have recently demonstrated that by expanding in small distance from the magnetic axis compared with the major radius, stellarator shapes with low neoclassical transport can be generated efficiently. To extend the utility of this new design approach, here we evaluate measures of magnetohydrodynamic interchange stability within the same expansion. In particular, we evaluate the magnetic well, Mercier's criterion, and resistive interchange stability near a magnetic axis of arbitrary shape. In contrast to previous work on interchange stability near the magnetic axis, which used an expansion of the flux coordinates, here we use the ‘inverse expansion’ in which the flux coordinates are the independent variables. Reduced expressions are presented for the magnetic well and stability criterion in the case of quasisymmetry. The analytic results are shown to agree with calculations from the VMEC equilibrium code. Finally, we show that near the axis, Glasser, Greene and Johnson's stability criterion for resistive modes approximately coincides with Mercier's ideal condition.

Physics↗

Design and analysis of the warm-to-cold suspension links for Jefferson Lab's 11-GEV/C super high momentum spectrometer

This paper describes design and analysis performed for the warm-to-cold suspension links of the warm iron yoke superconducting quadrupole magnets, and superconducting dipole magnet. The results of investigation of titanium Ti-6Al-4V and Nitronic 50 stainless steel for the suspension links to support the cold mass, preloads, forces due to cryogenic temperature, and imbalanced magnetic forces from misalignments are presented. Allowable stresses at normal-case scenarios and worst-case scenarios, space constraints, and heat leak considerations are discussed. Principles of the ASME Pressure Vessel Code were used to determine allowable stresses. Optimal angles of the suspension links were obtained by calculation and finite element methods. The stress levels of suspension links at multiple scenarios are presented, discussed, and compared with the allowable stresses.

36 MATERIALS SCIENCE↗

Eulerian simulations of collisional effects on electrostatic plasma waves

The problem of collisions in a plasma is a wide subject with a huge historical literature. In fact, the description of realistic plasmas is a tough problem to attack, both from the theoretical and the numerical point of view. In this paper, a Eulerian time-splitting algorithm for the study of the propagation of electrostatic waves in collisional plasmas is presented. Collisions are modeled through one-dimensional operators of the Fokker-Planck type, both in linear and nonlinear forms. The accuracy of the numerical code is discussed by comparing the numerical results to the analytical predictions obtained in some limit cases when trying to evaluate the effects of collisions in the phenomenon of wave plasma echo and collisional dissipation of Bernstein-Greene-Kruskal waves. Particular attention is devoted to the study of the nonlinear Dougherty collisional operator, recently used to describe the collisional dissipation of electron plasma waves in a pure electron plasma column [M. W. Anderson and T. M. O'Neil, Phys. Plasmas 14, 112110 (2007)]. Finally, for the study of collisional plasmas, a recipe to set the simulation parameters in order to prevent the filamentation problem can be provided, by exploiting the property of velocity diffusion operators to smooth out small velocity scales.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A new time dependent density functional algorithm for large systems and plasmons in metal clusters

A new algorithm to solve the Time Dependent Density Functional Theory (TDDFT) equations in the space of the density fitting auxiliary basis set has been developed and implemented. The method extracts the spectrum from the imaginary part of the polarizability at any given photon energy, avoiding the bottleneck of Davidson diagonalization. The original idea which made the present scheme very efficient consists in the simplification of the double sum over occupied-virtual pairs in the definition of the dielectric susceptibility, allowing an easy calculation of such matrix as a linear combination of constant matrices with photon energy dependent coefficients. The method has been applied to very different systems in nature and size (from H{sub 2} to [Au{sub 147}]{sup −}). In all cases, the maximum deviations found for the excitation energies with respect to the Amsterdam density functional code are below 0.2 eV. The new algorithm has the merit not only to calculate the spectrum at whichever photon energy but also to allow a deep analysis of the results, in terms of transition contribution maps, Jacob plasmon scaling factor, and induced density analysis, which have been all implemented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗