Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational methods”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Super Resolution for Renewable Energy Resource Data With Wind From Reanalysis Data (Sup3rWind) and Application to Ukraine [Slides]

In this work we present a novel deep learning-based downscaling method, using generative adversarial networks (GANs), for generating high-resolution wind resource data from ECMWF Reanalysis v5 data (ERA5). We show that by training a GAN model on ERA5, as opposed to coarsened high-resolution data, we achieve results that are competitive with conventional dynamical downscaling. This GAN-based downscaling method additionally reduces computational costs over dynamical downscaling by two orders of magnitude. All GANs are trained on data sampled from CONUS, selected to provide a diverse sampling of terrain conditions, and validated on observational data along with data held out from training. This cross-validation shows low error and high correlations with observations and excellent agreement with hold out data across physical distributions. Our approach is finally used to downscale 30km hourly ERA5 to 2-km 5-minute wind data, for January 2000 through December 2023, at multiple hub heights, over Ukraine, Moldova, and part of Romania. Comparisons against observational data from Meteorological Assimilation Data Ingest System (MADIS) and multiple wind farms show the same level of performance as for CONUS validation. This 24 year data record is the first member of the "super resolution for renewable energy resource data with wind from reanalysis data" dataset (Sup3rWind).

17 WIND ENERGY↗
DOE OSTI2024

In Vitro Evolution and Computational Approaches to Predict, Prevent and Control Future Pandemics

The natural tendency of virus to mutate and the under-sampling of the environment makes it difficult to become aware of the emergence of new viral strains with pandemic potential. Being able to predict what mutations make a virus more infective might allow to spot such strains with minimal sampling and potentially allow to predict/prevent the next pandemic. The team attempted to mimic natural viral mutations and recombination through computational and experimental methods producing a variety of mutants of a SARS-COV-2 protein (receptor binding domain, RBD, of spike protein) responsible for viral entry in mammalian cells. The library of mutants was then interrogated for ability and lack-there-of to interact with the host cell receptor ushering viral entry, Angiotensin-converting enzyme 2 (ACE2). The negative and positive data set is intended to “teach the rules” of virus-host receptor interaction. Additionally, the positive clones were used to screen a set of antibody mutants designed to widen the breadth of viral mutants recognition, to demonstrate that this kind of libraries could also be a tool to produce antibody therapeutics impervious to viral mutation, even before a pandemic strain is discovered.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Nuclear Requalification of the ATR Core

The Advanced Test Reactor (ATR) creates a unique, high neutron flux materials testing environment that subsequently causes neutron embrittlement damage to its beryllium reflector. The reflector is eventually required to be replaced during a reactor Outage. Concurrently, a piece-for-piece core replacement is conducted to maintain reactor functionality called a core internals changeout (CIC). Once changeout is complete, ATR Reactor Engineering utilizes previous CIC data, notably 1977-1994 CIC data, to conduct predictive criticality analysis on the new, unirradiated core. However, CIC data has been inconsistently reported over the years making it difficult, and in some cases impossible, to utilize. These inconsistencies arise in various forms of not using correct units, inconsistent diagram usage, and not portraying the same kind of data similarly across the reports. To work around this inconsistency issue, Reactor Engineering is implementing the use of several new neutronic modeling codes that utilize modern computation speeds and methods to model the new core in different criticality environments. Further validation is then conducted by nuclear testing and bringing the reactor critical and conducting various irradiation tests. Upon completion and certification that the reactor passed all testing requirements, ATR can once again re-start normal operations.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

Data-Driven Computation of Probabilistic Marching Cubes for Efficient Visualization of Level-Set Uncertainty

Uncertainty visualization is an important emerging research area. Being able to visualize data uncertainty can help scientists improve trust in analysis and decision-making. However, visualizing uncertainty can add computational overhead, which can hinder the efficiency of analysis. In this paper, we propose novel data-driven techniques to reduce the computational requirements of the probabilistic marching cubes (PMC) algorithm. PMC is an uncertainty visualization technique that studies how uncertainty in data affects level-set positions. However, the algorithm relies on expensive Monte Carlo (MC) sampling for the multivariate Gaussian uncertainty model because no closed-form solution exists for the integration of multivariate Gaussian. In this work, we propose the eigenvalue decomposition and adaptive probability model techniques that reduce the amount of MC sampling in the original PMC algorithm and hence speed up the computations. Our proposed methods produce results that show negligible differences compared with the original PMC algorithm demonstrated through metrics, including root mean squared error, maximum error, and difference images. We demonstrate the performance and accuracy evaluations of our data-driven methods through experiments on synthetic and real datasets.

Athawale, Tushar↗
DOE OSTI2024

Blockchain-based decentralized computing

An exemplary blockchain-based decentralized computing system and method are disclosed for industrial analytics applications. The exemplary system and method leverage blockchain technology to deliver and execute privacy-preserving decentralized predictive analytics, machine learning, and optimization operations for various industrial applications using a set of self-contained analytics block smart contracts that can be readily utilized and in analytics applications to deploy across multiple sites.

Ramanan, Paritosh P.↗
DOE OSTI2024

Investigating Formal Methods Tools and their Applicability for Hardware Vulnerability Remediation

Formal methods use mathematical logic and equations to prove that a system or code is secure. In this poster, I examine existing formal methods tools and their application for projects working to remediate vulnerabilities in hardware and hardware description language. This poster is focused on the tools ReWire and AutoGenILA and I hope to evaluate their benefits and weaknesses with the intention of creating an internal report on the application and weaknesses of existing formal methods tools and identifying gaps for future formal methods tool creation.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Designing molecular qubits: computational insights into first-row and group 6 transition metal complexes

In the realm of optically addressable qubits, a previously synthesized and characterized Cr( IV ) pseudo-tetrahedral complex, featuring four strongly donating ligands surrounding the chromium center, has demonstrated potential as a qubit candidate. This study proposes analogs of this complex through a metal substitution strategy, extending the investigation to different complexes based on metal centers selected from first-row and Group 6 transition metals. Computational modeling based on multiconfigurational methods CASPT2 and MC-PDFT was utilized to calculate energy gaps between ground and excited electronic spin states, and zero-field splitting parameters. Simulations were applied to each equilibrium geometry and related deformations based on vibrational modes. All results align with previous experimental findings, but also show that qubits based on V and Ti centers could be more electronically stable than the Cr one, suggesting a lower electronic features dependency from their related geometry. In some cases geometrical deformations provide changes in relative energy gaps between triplet and singlet excited state, that could potentially swap, offering a different initialization process, and some inspiration for ligand design based on such deformations. Additionally, this study identifies an unsynthesized Ti( II ) compound as a promising candidate for molecular qubits. This finding highlights the role of computational multireference methods in the rational design of qubit systems.

Sauza-de la Vega, Arturo [Univ. of Chicago, IL (Un↗
DOE OSTI2024

Computing with a Chemical Reservoir

Contemporary computation is expensive, with large language models and artificial intelligence becoming more common in daily life. However, high-performance computing is reaching the limits in speed and energy expenditure, and domain science requires ever-increasing computational capacity, with simulations and data analysis pipelines ever-growing in complexity. As we progress towards post-exascale computation, with the associated high energy costs, new methods of energy-conscious computation are required. Novel analog and hybrid digital-analog systems can overcome these challenges, and chemical reactions offer a promising avenue. Computers based on chemistry can provide compact desktop devices with immense computational power. These devices are readily scalable by considering greater reaction systems or vessels, meeting the high-performance requirements for scientific workflows. In this article, we present ChemComp, a compilation pipeline for the conversion of ordinary differential equations into implementable chemical reactions. We then demonstrate the solving capabilities of ChemComp by emulating a potential chemical reservoir device. We leverage the multi-layer intermediate representation (MLIR) compiler framework to implement an expressive chemical reaction abstraction and propose a path for chemical reaction networks (CRNs) to represent mathematical problems effectively. Combined, we demonstrate a potential workflow that can harness chemistry’s computing power to create energy-efficient, high-performance computation systems for contemporary computing needs.

artificial intelligence↗
DOE OSTI2024

SCALE 6.3 Validation: Radiation Shielding

Safe and reliable use of scientific and engineering computer codes requires validation for the types of applications in which they will be used. An example in the nuclear reactor engineering and licensing field is radiation transport employed in shielding analyses. The validity of computer codes for shielding applications is demonstrated in this report for SCALE version 6.3.0. Representative benchmarks corresponding to shielding analyses are selected for the validation study. Typical measurement results analyzed from these benchmarks include neutron fluxes, detector count rates, detector energy response functions, neutron and gamma dose rates, neutron activation rates and activities, neutron leakage fluxes, and skyshine dose rates. Thousands of points of comparison between measurement and calculation are presented in this work. Other than rare outliers typically explained by either a lack of information or large uncertainties in the experiment conditions, material, or dimensions, the Monaco with Automated Variance Reduction using Importance Calculations (MAVRIC) radiation transport computer code with built-in variance reduction methods distributed with the SCALE computer code system agrees well with the measurement results. In selected benchmarks, MAVRIC is also compared to Monte Carlo N- Particle® (MCNP® ) 1 calculations. Both computer codes generally agree well within the estimated uncertainties. With the release of SCALE 6.3.0, Shift was integrated as an alternative transport solver in MAVRIC, denoted MAVRIC-Shift. Although the traditional MAVRIC using Monaco was used primarily in this validation study, many results have also been generated using MAVRIC-Shift. Agreement between MAVRIC-Monaco and MAVRIC-Shift is generally very good. The benchmarks presented in this report were obtained from reliable sources such as the International Criticality Safety Benchmark Evaluation Project Handbook, the Shielding Integral Benchmark Archive & Database, and other shielding validation work found in the literature. Additional datapoints and benchmarks will be added to future versions of this report to expand the shielding validation suite.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2024

Multilevel Parareal Algorithm with Averaging for Oscillatory Problems

The present study is an extension of the work done by Peddle, Haut, and Wingate and Haut and Wingate, where a two-level Parareal method with mapping and averaging is examined. The method proposed in this paper is a multilevel Parareal method with arbitrarily many levels, which is not restricted to the two-level case. We give an asymptotic error estimate which reduces to the two-level estimate for the case when only two levels are considered. Introducing more than two levels has important consequences for the averaging procedure, as we choose separate averaging windows for each of the different levels, which is an additional new feature of the present study. The different averaging windows make the proposed method especially appropriate for nonlinear multiscale problems, because we can introduce a level for each intrinsic scale of the problem and adapt the averaging procedure such that we reproduce the behavior of the model on the particular scale resolved by the level. The method is applied to nonlinear differential equations. The nonlinearities can generate a range of frequencies in the problem. The computational cost of the new method is investigated and studied on several examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Evaluating the Importance of Conformers for Understanding the Vacuum-Ultraviolet Spectra of Oxiranes: Experiment and Theory

Vacuum-ultraviolet (VUV) absorption spectroscopy enables electronic transitions that offer the unambiguous identification of molecules. As target molecules become more complex, multifunctional species present a great challenge to both experimental and computational spectroscopy. This research reports both experimental and theoretical studies of oxiranes. Computationally, the nuclear ensemble approach has been used to accurately predict experimental spectra for a variety of molecules. However, this approach incurs great computational cost, as ensembles generally consist of thousands of geometries. The present study aims to drastically reduce the ensemble by evaluating the significance of the conformers to the predicted spectra. This approach was applied to 11 substituted oxiranes using the Conformer Rotamer Ensemble Sampling Tool (CREST) of Grimme to generate an ensemble of unique conformers determined by their Boltzmann populations. Five TD-DFT functionals (BMK, CAM-B3LYP, M06-2X, MN15, ωB97X-D) and EOM-CCSD were used to simulate the spectrum of each substituted oxirane ensemble. Computed spectra were then compared to the experiment using both qualitative and quantitative metrics. Based on these metrics, it was observed that certain conformers may not be necessary to characterize this set of oxiranes despite the temperature (323 K) of the experiment. A single conformer can then be used with TD-DFT and EOM-CCSD to replicate the experimental spectra of these medium-sized combustion species.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Advancing density functional tight-binding method for large organic molecules through equivariant neural networks

Semi-empirical quantum-mechanical (QM) methods have become valuable tools for studying complex (bio)molecular systems due to their balance between computational efficiency and accuracy. A key aspect of these methods is their parameterization, which not only governs the reliability of the results but also provides an opportunity to enhance their overall performance. In our previous work [J. Phys. Chem. Lett., 2021, 11, 16], we advanced the third-order semi-empirical density functional tight-binding (DFTB3) method for computing multiple properties of small molecules by developing the machine learning (ML) potential NN rep to bridge the gap between DFTB3 electronic components and those of the hybrid DFT-PBE0 functional. To overcome the limitations of NN rep , we introduce the EquiDTB framework, which leverages physics-inspired equivariant neural networks (NN) to parameterize scalable and transferable many-body Δ TB potentials, replacing the standard pairwise DFTB repulsive potential. This advancement extends the applicability of our ML-corrected DFTB approach to larger molecules and non-covalent systems (including only C, N, O, and H atoms), going beyond the chemical space represented in the training QM datasets. The enhanced performance of EquiDTB over the standard TB methods is demonstrated by the accurate computation of the atomic forces of S66x8 molecular dimers, as well as their interaction energies. Moreover, EquiDTB can be effectively employed to explore the potential energy surfaces of large and flexible drug-like molecules—for example, to determine the minimum energy path between isomers, analyze structural transitions during dynamical simulations, compute vibrational modes, and investigate energetic rankings. The performance for single molecules slightly decreases when the DFTB electronic energy is reduced to first-order but remains superior to standard TB methods. Our work thus demonstrates that an optimal integration of an equivariant NN with QM datasets can advance the DFTB method while maintaining high efficiency, paving the way for reliable (bio)molecular simulations.

Medrano Sandonas, Leonardo [Technische Universität↗
DOE OSTI2025

The Remarkable I 2 O 3 Molecule: A New View from Theory

Atmospheric iodine chemistry has garnered increasing attention as a result of increased iodine emissions. A key subset of this chemistry involves iodine oxides (I 2 O 2–5 ), which serve as precursors to particle formation. Among these, I 2 O 3 is the simplest iodine oxide involved in particle formation, but it has remained undetected in the atmosphere. Previous theoretical studies have characterized this peculiar molecule, primarily using energies to refine geometries obtained at low levels of theory. Due to the reemerging interest in I 2 O 3 , this study presents geometries optimized at the CCSD(T)/aug-cc-pwCVTZ-PP level of theory─marking the first instance, to the best of our knowledge, where this system has been studied exclusively with CCSD(T). Harmonic vibrational frequencies were computed at the same level of theory. Final energetics were obtained using the very high level CCSDT(Q) method with basis sets up to quintuple-zeta cardinality (aug-cc-pwCV5Z-PP) and extrapolated to the CBS limit to yield CCSDT(Q)/CBS//CCSD(T)/aug-cc-pwCVTZ-PP energies. These energies include harmonic zero-point vibrational energy corrections and scalar relativistic energy corrections. Additionally, this study discovers new isomers along the I 2 O 3 potential energy surface, a novel contribution to the field. The performance of different computational methods and DFT functionals commonly used in atmospheric chemistry is also assessed relative to high-level theoretical methods.

basis sets↗
DOE OSTI2024

Classical and quantum computing of shear viscosity for ( 2 + 1 ) D SU(2) gauge theory

We perform a nonperturbative calculation of the shear viscosity for ( 2 + 1 )-dimensional SU(2) gauge theory by using the lattice Hamiltonian formulation. The retarded Green’s function of the stress-energy tensor is calculated from real time evolution via exact diagonalization of the lattice Hamiltonian with a local Hilbert space truncation, and the shear viscosity is obtained via the Kubo formula. When taking the continuum limit, we account for the renormalization group flow of the coupling but no additional operator renormalization. We find the ratio of the shear viscosity and the entropy density η s is consistent with a well-known holographic result 1 4 π at several temperatures on a 4 × 4 honeycomb lattice with the local electric representation truncated at j max = 1 2 . We also find the ratio of the spectral function and frequency ρ x y ( ω ) ω exhibits a peak structure when the frequency is small. Both the exact diagonalization method and simple matrix product state classical simulation method beyond j max = 1 2 on bigger lattices require exponentially growing resources. So we develop a quantum computing method to calculate the retarded Green’s function and analyze various systematics of the calculation including j max truncation and finite size effects, Trotter errors and the thermal state preparation efficiency. Our thermal state preparation method still requires resources that grow exponentially with the lattice size, but with a very small prefactor at high temperature. We test our quantum circuit on both the Quantinuum emulator and the IBM simulator for a small lattice and obtain results consistent with the classical computing ones. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Unleashed from constrained optimization: quantum computing for quantum chemistry employing generator coordinate inspired method

Hybrid quantum-classical approaches offer potential solutions to quantum chemistry problems, yet they often manifest as constrained optimization problems. Here, we explore the interconnection between constrained optimization and generalized eigenvalue problems through the Unitary Coupled Cluster (UCC) excitation generators. Inspired by the generator coordinate method, we employ these UCC excitation generators to construct non-orthogonal, overcomplete many-body bases, projecting the system Hamiltonian into an effective Hamiltonian, which bypasses issues such as barren plateaus that heuristic numerical minimizers often encountered in standard variational quantum eigensolver (VQE). Diverging from conventional quantum subspace expansion methods, we introduce an adaptive scheme that robustly constructs the many-body basis sets from a pool of the UCC excitation generators. This scheme supports the development of a hierarchical ADAPT quantum-classical strategy, enabling a balanced interplay between subspace expansion and ansatz optimization to address complex, strongly correlated quantum chemical systems cost-effectively, setting the stage for more advanced quantum simulations in chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Improving the efficiency of learning-based error mitigation

Error mitigation will play an important role in practical applications of near-term noisy quantum computers. Current error mitigation methods typically concentrate on correction quality at the expense of frugality (as measured by the number of additional calls to quantum hardware). To fill the need for highly accurate, yet inexpensive techniques, we introduce an error mitigation scheme that builds on Clifford data regression (CDR). The scheme improves the frugality by carefully choosing the training data and exploiting the symmetries of the problem. We test our approach by correcting long range correlators of the ground state of XY Hamiltonian on IBM Toronto quantum computer. We find that our method is an order of magnitude cheaper while maintaining the same accuracy as the original CDR approach. The efficiency gain enables us to obtain a factor of 10 improvement on the unmitigated results with the total budget as small as 2 ⋅ 10 5 shots. Furthermore, we demonstrate orders of magnitude improvements in frugality for mitigation of energy of the LiH ground state simulated with IBM's Ourense-derived noise model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

FY24 Progress Report on Viscosity and Thermal Conductivity Measurements of Nuclear Industry Relevant Chloride Salts: An Experimental and Computational Study

As presented in this report, experimental and computational techniques were performed to assess the viscosity and thermal conductivity of key alkali and actinide chloride mixtures for molten salt reactor developers. These mixtures were pure LiCl, NaCl-KCl, LiCl-NaCl, LiCl-KCl, LiCl-NaCl-KCl, and NaCl-UCl 3 . Experimental measurements of viscosity were performed with a rolling ball viscometer, whereas experimental measurements of thermal conductivity were performed with a variable gap apparatus. Additional benchmarking work was performed using both property measurement systems to prepare for x-ray radiography in stainless-steel crucibles for viscosity and to ensure that calibration methods were accurate for thermal conductivity before assessing the NaCl-UCl 3 system. Validation data for the NaCl-UCl 3 in literature are minimal. Details on the calibration methods, salt measurement processes, and sources of error and uncertainty are discussed in detail for both property measurements. The computational methods described herein involved ab-initio molecular dynamics (AIMD) calculations using CP2K. The calculations were performed for the LiCl-KCl-NaCl and NaCl-UCl 3 systems. These calculations not only provided thermophysical property estimations for comparison to experimental data, but they also allowed for the determination of diffusion coefficients, coordination numbers, and radial distribution functions to provide insight into ion mobility and local coordination environments, which is linked to macroscopic property trends.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗