Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithm”

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 307 records · Page 17

A generalizable machine learning-assisted fast Fourier transform algorithm to simulate the large strain phenomena in polycrystalline materials

Machine learning methods have shown initial promise in constitutive modeling for single crystals or homogenized polycrystals, delivering notable computational efficiency. However, existing machine learning-based constitutive models often lack generalizability, limiting their application across diverse boundary value problems. This study introduces a thermodynamics-informed artificial neural network model to accelerate rate-tangent crystal plasticity fast Fourier transform simulations for cross-scale deformation behaviors of polycrystals under complex loading. Our model integrates microstructural variability and local interactions effectively. To address local effects in each grain, we employ K-means clustering to group Gauss points within the microstructure into clusters assumed to be in similar mechanical states. This approach, based on self-clustering analysis, extends model scope from macroscopic stress response to the granular level, capturing mechanical responses and orientation evolution across grains. This reduces the number of nonlinear problems to solve, with cluster responses propagated throughout each group. The thermodynamics-based artificial neural network-extracted features are further processed using local material state clusters to account for history-dependent deformation and evolving microstructures. Additionally, representative volume element simulations with rate-tangent crystal plasticity fast Fourier transform provide reliable datasets for model training. The proposed model demonstrates high efficiency, accuracy, self-consistency, and enhanced generalizability in predicting strain–stress responses and orientation evolution at both individual grain and aggregate scales under complex loading conditions, such as biaxial tension and arbitrary loading scenarios.

36 MATERIALS SCIENCE↗

Algorithms for coordinate reconstruction in position-sensitive virtual Frisch-grid detectors

Arrays of position-sensitive virtual Frisch-grid (VFG) CdZnTe (CZT) detectors provide a cost-effective solution for integrating large-area arrays for gamma-ray imaging and spectroscopy. These detectors employ high-aspect ratio CZT crystals (bars) with thicknesses up to 50 mm and cross-sections of up to 10 × 10 mm 2 . Despite the long drift distances of charge carriers in such crystals, the detectors have demonstrated excellent performance, achieving energy resolutions better than 1 % full width at half maximum (FWHM) at 662 keV and 3D position resolutions finer than 1 mm. The high spatial resolution is a critical feature of these detectors, as it enables correction of response non-uniformities caused by crystal defects, which remain present even in the highest-quality CZT material. Dislocations and dislocation walls are the primary defects responsible for variations in charge carrier losses as they drift from the interaction points toward the charge-collecting electrodes. The mechanism by which these defects affect carrier transport is generally well understood. Dislocations and sub-grain boundaries act as sinks for carrier-trapping centers, primarily impurities and secondary phases such as tellurium inclusions and precipitates. Here, these regions exhibit significantly higher carrier-trapping rates, leading to variations in the μτ-products. Because the locations of these micron-sized regions are fixed within the detector volume, fluctuations in the total collected charge arise from the random distribution of interaction sites. This results in non-uniform detector responses and degradation of energy resolution. However, by measuring the interaction-site locations with sufficient precision, charge-loss variations can be accurately corrected, allowing recovery of nearly intrinsic energy resolution.

47 OTHER INSTRUMENTATION↗

Comments on “Failure analysis of corroded hydrogen-blended natural gas pipelines based on finite element analysis and genetic algorithm-back propagation neural network” [262 (2025) 111174]

This is a brief commentary paper to highlight and discuss the determination of hydrogen concentration in pipeline steel, effect of hydrogen embrittlement (HE) on the mechanical properties of the material, burst strength of corroded pipelines using finite element analysis (FEA) simulations, and curve-fit models for assessing remaining strength of X80 corroded pipelines for transporting hydrogen blended natural gas. Recently, Xie et al. [1] proposed a methodology to quantify the impact of HE on material properties and numerically determined burst pressure of X80 corroded pipelines. However, their HE quantification overestimated the degradation of tensile strength for hydrogen blending ratios beyond the original data range, and their FEA results of burst pressure are nonconservative. This work thus recharacterized the hydrogen concentration in the steel pipeline and the effect of HE on tensile strength, and then redetermined burst pressures for a set of typical corrosion defect cases considered by Xie et al. [1] based on an experimentally validated FEA modelling method. With the new FEA results, two empirical corrosion models were proposed for X80 corroded pipelines for hydrogen service. At zero hydrogen blending ratio, the novel empirical models predict burst pressures to be consistent with the industry-accepted corrosion models. Furthermore, both the numerical simulation method and the novel corrosion models are significant contributions to the pipeline industry and the hydrogen community. Application of these results will enhance the safety, reliability, and integrity of natural gas pipelines when used to transport hydrogen.

Burst pressure prediction↗

gRASPA

GPU Monte Carlo Simulation Code with a taste of RASPA We present enhancements in Monte Carlo simulation speed and functionality within an open-source code, gRASPA, which uses graphical processing units (GPUs) to achieve significant performance improvements compared to serial, CPU implementations of Monte Carlo. The code supports a wide range of Monte Carlo simulations, including canonical ensemble (NVT), grand canonical, NVT Gibbs, Widom test particle insertions, and continuous-fractional component Monte Carlo. Implementation of grand canonical transition matrix Monte Carlo (GC-TMMC) and a novel feature to allow different moves for the different components of metal-organic framework (MOF) structures exemplify the capabilities of gRASPA for precise free energy calculations and enhanced adsorption studies, respectively. The introduction of a High-Throughput Computing (HTC) mode permits many Monte Carlo simulations on a single GPU device for accelerated materials discovery. The code can incorporate machine learning (ML) potentials. The open-source nature of gRASPA promotes reproducibility and openness in science, and users may add features to the code and optimize it for their own purposes. The code is written in CUDA/C++ and SYCL/C++ to support different GPU vendors. The gRASPA code is publicly available at https://github.com/snurr-group/gRASPA.

Li, Zhao [Purdue/Northwestern/Notre Dame Universit↗

An Algorithm for Atom-Centered Lossy Compression of the Atomic Orbital Basis in Density Functional Theory Calculations

Large atomic-orbital (AO) basis sets of at least triple and preferably quadruple-ζ (QZ) size are required to adequately converge Kohn–Sham density functional theory (DFT) calculations toward the complete basis set limit. However, incrementing the cardinal number by one nearly doubles the AO basis dimension, and the computational cost scales as the cube of the AO dimension, so this is very computationally demanding. Here, in this work, we develop and test a threshold-based natural atomic orbital (NAO) scheme in which ϵ-NAOs are obtained as eigenfunctions of atomic blocks of the density matrix in a one-center orthogonalized representation. This enables compression of the AO basis that is optimal for a given threshold, 10 –ϵ , by discarding NAOs with occupation numbers below that threshold. Extensive pilot test calculations using the Hartree–Fock functional and taking the converged density matrix as input suggest that a threshold of 10 –5 can yield a compression factor (ratio of AO to compressed ϵ-NAO dimension) between 2.5 and 4.5 for the QZ pc-3 basis. The errors in relative energies are typically less than 0.1 kcal/mol when the compressed basis is used instead of the uncompressed basis. Between 10 and 100 times smaller errors (i.e., usually less than 0.01 kcal/mol) can be obtained with a threshold 10 –7 , while the compression factor is typically between 2 and 2.5.

basis sets↗

Implementation of McMurchie–Davidson Algorithm for Gaussian AO Integrals Suited for SIMD Processors

We report an implementation of the McMurchie− Davidson evaluation scheme for 1- and 2-particle Gaussian AO integrals designed for processors with Single Instruction Multiple Data (SIMD) instruction sets. Like in our recent MD implementation for graphical processing units (GPUs) [Asadchev, A.; Valeev, E. F.. J. Chem. Phys. 2024, 160, 244109.], variable-sized batches of shellsets of integrals are evaluated at a time. By optimizing for the floating point instruction throughput rather than minimizing the number of operations, this approach achieves up to 50% of the theoretical hardware peak FP64 performance for many common SIMD-equipped platforms (AVX2, AVX512, NEON), which translates to speedups of up to 30 over the state-of-the-art one-shellset-at-a-time implementation of Obara−Saika-type schemes in Libint for a variety of primitive and contracted integrals. As with our previous work, we rely on the standard C++ programming language such as the std::simd standard library feature to be included in the 2026 ISO C++ standard without any explicit code generation to keep the code base small and portable. The implementation is part of the open source LibintX library freely available at https://github.com/ValeevGroup/libintx.

Basis sets↗