Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational frameworks”

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 739 records · Page 41

A Numerical Approximation Framework for the Stochastic Linear Quadratic Regulator on Hilbert Spaces

We present an approximation framework for computing the solution of the stochastic linear quadratic control problem on Hilbert spaces. We focus on the finite horizon case and the related differential Riccati equations (DREs). Our approximation framework is concerned with the so-called “singular estimate control systems” (Lasiecka in Optimal control problems and Riccati equations for systems with unbounded controls and partially analytic generators: applications to boundary and point control problems, 2004) which model certain coupled systems of parabolic/hyperbolic mixed partial differential equations with boundary or point control. We prove that the solutions of the approximate finite-dimensional DREs converge to the solution of the infinite-dimensional DRE. In addition, we prove that the optimal state and control of the approximate finite-dimensional problem converge to the optimal state and control of the corresponding infinite-dimensional problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Joint ptycho-tomography with deep generative priors

Abstract Joint ptycho-tomography is a powerful computational imaging framework to recover the refractive properties of a 3D object while relaxing the requirements for probe overlap that is common in conventional phase retrieval. We use an augmented Lagrangian scheme for formulating the constrained optimization problem and employ an alternating direction method of multipliers (ADMM) for the joint solution. ADMM allows the problem to be split into smaller and computationally more efficient subproblems: ptychographic phase retrieval, tomographic reconstruction, and regularization of the solution. We extend our ADMM framework with plug-and-play (PnP) denoisers by replacing the regularization subproblem with a general denoising operator based on machine learning. While the PnP framework enables integrating such learned priors as denoising operators, tuning of the denoiser prior remains challenging. To overcome this challenge, we propose a denoiser parameter to control the effect of the denoiser and to accelerate the solution. In our simulations, we demonstrate that our proposed framework with parameter tuning and learned priors generates high-quality reconstructions under limited and noisy measurement data.

97 MATHEMATICS AND COMPUTING↗

QDP-JIT/PTX: A QDP++ Implementation for CUDA-Enabled GPUs

These proceedings describe briefly the QDP-JIT/PTX framework for lattice field theory calcula- tions on the CUDA architecture. The framework generates compute kernels in the PTX assembler language which can be compiled to efficient GPU machine code by the NVIDIA JIT compiler. A comprehensive memory management was added to the framework so that applications, e.g. Chroma, can run unaltered on GPU clusters and supercomputers.

Winter, Frank T.↗

Configurational forces in electronic structure calculations using Kohn-Sham density functional theory

Here we derive the expressions for configurational forces in Kohn-Sham density functional theory, which correspond to the generalized variational force computed as the derivative of the Kohn-Sham energy functional with respect to the position of a material point x. These configurational forces that result from the inner variations of the Kohn-Sham energy functional provide a unified framework to compute atomic forces as well as stress tensor for geometry optimization. Importantly, owing to the variational nature of the formulation, these configurational forces inherently account for the Pulay corrections. The formulation presented in this work treats both pseudopotential and all-electron calculations in a single framework, and employs a local variational real-space formulation of Kohn-Sham density functional theory (DFT) expressed in terms of the nonorthogonal wave functions that is amenable to reduced-order scaling techniques. We demonstrate the accuracy and performance of the proposed configurational force approach on benchmark all-electron and pseudopotential calculations conducted using higher-order finite-element discretization. To this end, we examine the rates of convergence of the finite-element discretization in the computed forces and stresses for various materials systems, and, further, verify the accuracy from finite differencing the energy. Wherever applicable, we also compare the forces and stresses with those obtained from Kohn-Sham DFT calculations employing plane-wave basis (pseudopotential calculations) and Gaussian basis (all-electron calculations). Finally, we verify the accuracy of the forces on large materials systems involving a metallic aluminum nanocluster containing 666 atoms and an alkane chain containing 902 atoms, where the Kohn-Sham electronic ground state is computed using a reduced-order scaling subspace projection technique

36 MATERIALS SCIENCE↗

AI Improves the Accuracy, Reliability, and Economic Value of Continental‐Scale Flood Predictions

Accurate flood early warnings are critical to minimize damage and loss of life. Current large‐scale operational forecasting systems, however, have limited accuracy, description of uncertainty, and computational efficiency. While Artificial intelligence (AI) can address these limitations in principle, the accuracy and reliability of AI forecasts have thus far proven insufficient. Here we present a novel hybrid framework that integrates AI‐based machinery termed Errorcastnet (ECN) with the National Water Model (NWM) to showcase the potential of ensemble AI flood forecasts over the contiguous U.S. ECN boosts prediction accuracy four‐ to six‐fold across lead times of 1–10 days, while providing uncertainty quantification. It also outperforms Google's state‐of‐the‐art global AI model. ECN‐based forecasts offer superior economic value (up to four‐fold) for decision‐making as compared to those from NWM alone. ECN performs well in varied ecoregions, physiography, and land management conditions. The framework is computationally efficient, enabling national‐scale ensemble forecasts in minutes.

artificial intelligence↗

Simulating 0+1 Dimensional Quantum Gravity on Quantum Computers: Mini-Superspace Quantum Cosmology and the World Line Approach in Quantum Field Theory

Quantum computers are promising candidates to radically expand the domain of computational science by their increased computing power and more effective algorithms. In particular, quantum computing could have a tremendous impact on the field of quantum cosmology. The goal of quantum cosmology is to describe the evolution of the universe through the Wheeler-DeWitt equation or path integral methods without having to first formulate a full theory of quantum gravity. The quantum computer provides an advantage in this endeavor because it can perform path integrals directly in Lorentzian space and does not require constructing contour integrations in Euclidean gravity. Also, quantum computers can provide advantages in systems with fermions which are difficult to simulate on classical computers. In this study, we first employed classical computational methods to analyze a Friedmann-Robertson-Walker mini-superspace with a scalar field and visualize the calculated wavefunction of the universe for a variety of different values of the curvature of the universe and the cosmological constant. We then used IBM’s Quantum Information Science Kit Python library and the variational quantum eigensolver algorithm to study the same systems on a quantum computer. The framework was extended to the world line approach to quantum field theory.

97 MATHEMATICS AND COMPUTING↗

Mesoscale modeling and semi-analytical approach for the microstructure-aware effective thermal conductivity of porous polygranular materials

Here we established a comprehensive modeling approach for investigating the microstructure-aware effective thermal conductivity ($κ_{eff}$) for porous microstructures containing solid particles and gaseous pores. Our approach combines the mesoscale computational modeling framework and the semi-analytical method, allowing for efficient prediction of $κ_{eff}$ for realistic porous microstructures, while considering complicated microstructural thermal conduction pathways effectively in the prediction. We used the diffuse-interface mesoscale computational model to generate extensive simulated $κ_{eff}$ data for realistic digital representations of microstructures with wide ranges of porosity ($f_p$), thermal conductivity of the gas phase ($κ_g$), and thermal conductivity of the solid phase ($κ_s$). From the simulated data, we identified two property variation regimes for $κ_{eff}$: (1) a slow $κ_{eff}$ increase for $κ_s ~ κ_g$; and (2) a faster $κ_{eff}$ increase for $κ_s \gg κ_g$. To capture the key features of the relationship between the microstructure and $κ_{eff}$, we derived a semi-analytical model by introducing structure and intensification factors. The two new factors incorporate the calibrated effective contribution of the solid volume with $κ_s$ and additional interfacial effects into the prediction of $κ_{eff}$, respectively, allowing for consideration of parallel, serial, and interfacial conduction mechanisms effectively. Using the selected simulation data, we quantified key model parameters within the semi-analytical model and verified that the parameterized model exhibits excellent agreement with simulated $κ_{eff}$ for the entire range of the parameter space.

36 MATERIALS SCIENCE↗

Simulation toolkit for digital material characterization of large image-based microstructures

In this paper, an efficient image-based simulation toolkit for material characterization is presented, which is scalable to work from personal computers to workstations. The effective thermal conductivity, elasticity, and permeability are evaluated employing a computational homogenization framework based on the Finite Element Method (FEM). Two complementary open-source packages are presented: one developed in Python, which can convert digital images into voxel meshes (pyTomoviewer); the other developed in Julia, that can run numerical simulations to compute effective material properties (chpack). Also, a CUDA C version of chpack is provided (chfem_gpu). They were designed to deal with large multi-phase models, so strategies were devised to minimize their memory footprint, while avoiding a high toll on execution time. The voxel-based approach significantly simplifies the FEM meshes and allows efficient matrix-free implementations. In that sense, to handle large linear systems of equations, the element-by-element (EBE) technique is adopted, in conjunction with a low-memory implementation of the Preconditioned Conjugate Gradient (PCG) method. Finally, the code was thoroughly tested on an artificial geometry made of a square array of cylinders, for which analytical solutions exist, as well as on a real micro-tomographic reconstruction of FiberForm TM , a carbon preform commonly used in thermal protection systems.

36 MATERIALS SCIENCE↗

A Backend-agnostic, Quantum-classical Framework for Simulations of Chemistry in C ++

As quantum computing hardware systems continue to advance, the research and development of performant, scalable, and extensible software architectures, languages, models, and compilers is equally as important to bring this novel coprocessing capability to a diverse group of domain computational scientists. For the field of quantum chemistry, applications and frameworks exist for modeling and simulation tasks that scale on heterogeneous classical architectures, and we envision the need for similar frameworks on heterogeneous quantum-classical platforms. Furthermore, we present the XACC system-level quantum computing framework as a platform for prototyping, developing, and deploying quantum-classical software that specifically targets chemistry applications. We review the fundamental design features in XACC, with special attention to its extensibility and modularity for key quantum programming workflow interfaces and provide an overview of the interfaces most relevant to simulations of chemistry. A series of examples demonstrating some of the state-of-the-art chemistry algorithms currently implemented in XACC are presented, while also illustrating the various APIs that would enable the community to extend, modify, and devise new algorithms and applications in the realm of chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the dual advantage of placing observations through forward sensitivity analysis

The four-dimensional variational data assimilation methodology for assimilating noisy observations into a deterministic model has been the workhorse in forecasting centres for over three decades. While this method provides a computationally efficient framework for dynamic data assimilation, it is largely silent on the important question concerning the minimum number and placement of observations. To answer this question, we demonstrate the dual advantage of placing the observations where the square of the sensitivity of the model solution with respect to the unknown control variables, called forward sensitivities, attains its maximum. By following this approach, we can force the observability Gramian to be of full rank, which in turn guarantees efficient recovery of the optimal values of the control variables, which is the first of the two advantages of this strategy. We further show that the proposed strategy of placing observations has another inherent optimality: the square of the sensitivity of the optimal estimates of the control with respect to the observations (used to obtain these estimates) attains its minimum value, a second advantage that is a direct consequence of the above strategy for placing observations. Our analytical framework and numerical experiments on linear and nonlinear systems confirm the effectiveness of our proposed strategy.

97 MATHEMATICS AND COMPUTING↗

Tandem Aromatization of Oxygenated Furans by Framework Zinc In Zeolites. A Computational Study

We have performed electronic structure calculations to characterize the active site of the zeolite CIT-6 (isomorphically substituted Zn-Beta) and to study the Diels–Alder dehydrative aromatization of methyl-5-(methoxymethyl)-furoate (MMFC) and of the dimethyl ester of 2,5-furan-dicarboxylic acid (DMFDC) with ethylene. Three types of active sites have been investigated: a site where the framework charge was balanced by two protons (Z0); a site with an H + and a Li + as counter-cations (Z 1 ); and an active site with two Li + counter-cations (Z 2 ). Using NBO and Bader analysis, we conclude that Zn incorporation into the zeolite framework is not through covalent bonding to framework oxygen atoms but rather is through ionic bonding. Despite the ionic character of the active site and the generally strong Lewis acidic nature of Zn(II) cations, we find no catalysis of the Diels–Alder reaction for the two furans tested. On the other hand, the dehydration of the Diels–Alder cycloadduct can be either Brønsted or Lewis acid catalyzed depending on the active site type. The Z 0 -type sites are found to be more active than the Z 1 - and Z 2 -type sites. Furthermore, the Z 0 -type sites exhibit both Lewis and Brønsted acid characters with similar catalytic activities. In full agreement with experiment, we find that the conversion of MMFC to (4-methoxymethyl) benzenecarboxylate via Diels–Alder dehydrative aromatization is easier than the conversion of DMFDC to dimethyl terephthalate as the two electron withdrawing groups in DMFDC stabilize the corresponding cycloadduct against dehydration.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Faster than Real-Time Dynamic Simulation for Large-Size Power System with Detailed Dynamic Models using High-Performance Computing Platform

This paper presents a faster-than-real-time dynamic simulation software package that is designed for large-size power system dynamic simulation. It was developed on the GridPACKTM high-performance computing (HPC) framework. The key features of the developed software package include (1) faster-than-real-time dynamic simulation for a WECC system (17,000 buses) with different types of detailed generator, controller, and relay dynamic models, (2) a decoupled parallel dynamic simulation algorithm with optimized computation architecture to better leverage HPC resources and technologies, (3) options for HPC-based linear and iterative solvers, (4) hidden HPC details, such as data communication and distribution, to enable development centered on mathematical models and algorithms rather than on computational details for power system researchers, and (5) easy integration of new dynamic models and related algorithms into the software package.

Huang, Renke↗

Computing chemical potentials with machine-learning-accelerated simulations to accurately predict thermodynamic properties of molten salts

The successful design and deployment of next-generation nuclear technologies heavily rely on thermodynamic data for relevant molten salt systems. However, the lack of accurate force fields and efficient methods has limited the quality of thermodynamic predictions from atomistic simulations. Here we propose an efficient free energy framework for computing chemical potentials, which is the central free energy quantity behind many thermodynamic properties. We accelerate our simulations without sacrificing accuracy by using machine learning interatomic potentials trained on density functional theory (DFT) data. Using lithium chloride as our model system, we compute chemical potentials with DFT-accuracy for solid and liquid phases by transmuting ions into noninteracting particles. Notably, in the liquid phase, we demonstrate consistency whether we transmute one ion pair or the entire system into ideal gas particles. By locating the temperature where the chemical potential of solid and liquid phases cross, we predict a melting point of 880 ± 18 K for lithium chloride, which is remarkably close to the experimental value of 883 K. With this successful demonstration, we lay the foundation for high-throughput thermodynamic predictions of many properties that can be derived from the chemical potentials of the minority and majority components in molten salts.

Gibson, Luke D. [Oak Ridge National Laboratory (OR↗

Bottomonium suppression from the three-loop QCD potential

We compute the suppression of bottomonium in the quark-gluon plasma using the three-loop QCD static potential. The potential describes the spin-averaged bottomonium spectrum below threshold with a less than 1% error. Within potential nonrelativistic quantum chromodynamics and an open quantum systems framework, we compute the evolution of the bottomonium density matrix. The values of the quarkonium transport coefficients are obtained from lattice QCD measurements of the bottomonium in-medium width and thermal mass shift; we additionally include for the first time a vacuum contribution to the dispersive coefficient γ . Using the three-loop potential and the values of the heavy quarkonium transport coefficients, we find that the resulting bottomonium nuclear modification factor is consistent with experimental observations, while at the same time reproducing the lattice measurements of the in-medium width. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Advancing the Theory of Nuclear Data Evaluations [Slides]

This presentation covers a few key topics in relation to advancing the theory of nuclear data evaluations. First it targets and highlights the NCSP mission and vision along with the five-year plan. This lecture focuses upon the uncertainty quantification and SAMMY modernization. This presentation covers theory, and a framework is provided. The presentation concludes with goals, outlooks, and accomplishments.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

QES-Plume v1.0: a Lagrangian dispersion model

Low-cost simulations providing accurate predictions of transport of airborne material in urban areas, vegetative canopies, and complex terrain are demanding because of the small-scale heterogeneity of the features influencing the mean flow and turbulence fields. Common models used to predict turbulent transport of passive scalars are based on the Lagrangian stochastic dispersion model. The Quick Environmental Simulation (QES) tool is a low-computational-cost framework developed to provide high-resolution wind and concentration fields in a variety of complex atmospheric-boundary-layer environments. Part of the framework, QES-Plume, is a Lagrangian dispersion code that uses a time-implicit integration scheme to solve the generalized Langevin equations which require mean flow and turbulence fields. Here, QES-Plume is driven by QES-Winds, a 3D fast-response model that computes mass-consistent wind fields around buildings, vegetation, and hills using empirical parameterizations, and QES-Turb, a local-mixing-length turbulence model. In this paper, the particle dispersion model is presented and validated against analytical solutions to examine QES-Plume’s performance under idealized conditions. In particular, QES-Plume is evaluated against a classical Gaussian plume model for an elevated continuous point-source release in uniform flow, the Lagrangian scaling of dispersion in isotropic turbulence, and a non-Gaussian plume model for an elevated continuous point-source release in a power-law boundary-layer flow. In these cases, QES-Plume yields a maximum relative error below 6 % when compared with analytical solutions. In addition, the model is tested against wind-tunnel data for a uniform array of cubical buildings. QES-Plume exhibits good agreement with the experiment with 99 % of matched zeros and 59 % of the predicted concentrations falling within a factor of 2 of the experimental concentrations. Furthermore, results also emphasize the importance of using high-quality turbulence models for particle dispersion in complex environments. Finally, QES-Plume demonstrates excellent computational performance.

58 GEOSCIENCES↗

Multiscale Mathematics for Biomass Conversion to Renewable Hydrogen

Our two key accomplishments in the first three years were towards the development of, (1) a mathematically rigorous and at the same time computationally flexible framework for parallelization of Kinetic Monte Carlo methods, and its implementation on GPUs, and (2) spatial multilevel coarse-graining methods for Monte Carlo sampling and molecular simulation. A common underlying theme in both these lines of our work is the development of numerical methods which are at the same time both computationally efficient and reliable, the latter in the sense that they provide controlled-error approximations for coarse observables of the simulated molecular systems. Finally, our key accomplishment in the last year of the grant is that we started developing (3) pathwise information theory-based and goal-oriented sensitivity analysis and parameter identification methods for complex high-dimensional dynamics and in particular of nonequilibrium extended (high-dimensional) systems. We discuss these three research directions in some detail below, along with the related publications.

97 MATHEMATICS AND COMPUTING↗

A continuous analogue of the tensor-train decomposition

We develop new approximation algorithms and data structures for representing and computing with multivariate functions using the functional tensor-train (FT), a continuous extension of the tensor-train (TT) decomposition. The FT represents functions using a tensor-train ansatz by replacing the three-dimensional TT cores with univariate matrix-valued functions. The main contribution of this paper is a framework to compute the FT that employs adaptive approximations of univariate fibers, and that is not connected to any tensorized discretization. The algorithm can be coupled with any univariate linear or nonlinear approximation procedure. We demonstrate that this approach can generate multivariate function approximations that are several orders of magnitude more accurate, for the same cost, than those based on the conventional approach of compressing the coefficient tensor of a tensor-product basis. Our approach is in the spirit of other continuous computation packages such as Chebfun, and yields an algorithm which requires the computation of “continuous” matrix factorizations such as the LU and QR decompositions of vector-valued functions. To support these developments, we describe continuous versions of an approximate maximum-volume cross approximation algorithm and of a rounding algorithm that re-approximates an FT by one of lower ranks. We demonstrate that our technique improves accuracy and robustness, compared to TT and quantics-TT approaches with fixed parameterizations, of high-dimensional integration, differentiation, and approximation of functions with local features such as discontinuities and other nonlinearities.

42 ENGINEERING↗