Search NASA⌕ Search

SEARCH · Search NASA

Results for “Theoretical, Mathematical and Computational Physics”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Probabilistic Evaluation of Geomechanical Risks in CO2 Storage: An Exploration of Caprock Integrity Metrics Using a Multilaminate Model

The probabilistic uncertainty assessment of geomechanical risk—specifically, caprock failure—attributable to CO2 injection, as presented in a simplified hypothetical geological model, was the focus of this study. Our approach amalgamates the implementation of a multilaminate model, the creation of a response surface model in conjunction with the Box–Behnken sampling design, the execution of associated numerical modeling experiments, and the utilization of Monte Carlo simulations. Probability distributions to encapsulate the inherent variability (elastic and mechanical properties of the caprock and reservoir) and uncertainty in prediction estimates (vertical displacement, total strain, and F value) were employed. Our findings reveal that the Young modulus of the caprock is a key factor controlling equivalent total strain but is insufficient as a stand-alone indicator of caprock integrity. It is confirmed that the caprock can accommodate significant deformation without failure, if it possesses a low Young’s modulus and high mechanical strength properties, such as the friction angle and uniaxial compressive strength. Similarly, vertical displacement was found to be an unreliable indicator for caprock integrity, as caprock failure can occur across a broad spectrum of vertical displacements, particularly when both the Young modulus and mechanical strength properties have wide ranges. This study introduces the F value as the most dependable indicator for caprock failure, although it is a theoretical attribute (the shortest distance between the Mohr circle and the nearest failure envelope used to measure the sensitivity to failure) and not physically measurable in the field. Deviatoric stress levels were found to vary based on stress regimes, with the maximum levels observed under extensive and compressive stress regimes. In conjunction with the use of the response surface method, this study demonstrates the efficacy of the multilaminate framework and the Mohr–Coulomb constitutive model in providing a simplified, yet effective, probabilistic model of the mechanical behavior of caprock failure, reducing mathematical and computational complexities.

Energy & Fuels↗
DOE OSTI2022

PyOECP: A flexible open-source software library for estimating and modeling the complex permittivity based on the open-ended coaxial probe (OECP) technique

Here, we present PyOECP, a Python-based flexible open-source software for estimating and modeling the complex permittivity obtained from the open-ended coaxial probe (OECP) technique. The transformation of the measured reflection coefficient to complex permittivity is performed based on three different methods. The software library contains the dielectric spectra of common reference liquids, which can be used to transform the reflection coefficient into the dielectric spectra. Several Python routines that are commonly employed (e.g., SciPy and NumPy) in the field of science and engineering are required only so that the users can alter the software structure depending on their needs. The modeling algorithm exploits the Markov Chain Monte Carlo method for the data regression. The discrete relaxation models can be built by a proper combination of well-known relaxation models. In addition to these models, electrode polarization, a typical measurement artifact for interpreting dielectric spectra, can be incorporated into the modeling algorithm. A continuous relaxation model, which solves the Fredholm integral equation of the first kind (a mathematically ill-posed problem), is also included. This open-source software enables users to freely adjust the physical parameters to obtain physical insight into their materials under test and will be consistently updated for more accurate measurement and interpretation of dielectric spectra in an automated manner. This work describes the theoretical and mathematical background of the software, lays out the workflow, and validates the software functionality based on both synthetic and empirical data included in the software.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

2022 Agnew and Metropolis Postdoc Fellow Showcase Event Book

Agnew National Security Postdoc Fellows pursue cutting-edge experimental, theoretical, computational science, and engineering research aligned with the national security mission. Metropolis Postdoc Fellows pursue cutting-edge research in the areas of computational and computer science, physics, and engineering. Computer simulation capabilities are developed in support of the stockpile stewardship program together with broader national nuclear security needs. Fellows have access to some of the most powerful supercomputers in the world to perform pioneering research.

42 ENGINEERING↗
DOE OSTI2020

Discontinuous Galerkin sparse grids methods for time domain Maxwell’s equations

In this paper, we present a time-explicit sparse grid discontinuous Galerkin method for solving the three-dimensional time-domain Maxwell equations. The conservation properties and convergence rates are established for different choices of numerical fluxes. The convergence rates are proved theoretically and then verified by several numerical examples. Even though our scheme does not preserve the divergence, but by implying the higher order polynomial, one can observe the same convergence rate as numerical solution. Several numerical tests are presented to validate these conclusions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Analysis of Compressibility Effects and Nonlinear Property Variations in a Supercritical CO2 Mixing Layer

Calculations are performed using the large eddy simulation technique to qualitatively assess the effects of fluid compressibility and thermodynamic nonlinearities on the dynamics of a supercritical flow field. Resulting data are also used to interrogate instantaneous subfilter-scale fields, as modeled by the mixed-dynamic Smagorinsky closure and gradient diffusion model. A three-dimensional wall-resolved calculation of a spatially evolving mixing layer composed solely of carbon dioxide is performed. This is followed by a coarse grid calculation to examine model performance as a function of resolution. Theoretical analysis indicates that the partial derivatives of density with respect to pressure and temperature are important modulators of the temperature and pressure field evolution, respectively. Results pertaining to subfilter velocity-velocity and velocity-temperature fields indicate that the models are most stressed in the regions where compressibility and thermo-fluid nonlinearities dominate the physics.

42 ENGINEERING↗
DOE OSTI2021

A consistent, Bayesian, approach to the cross section probability distribution in the unresolved resonance region

The cross sections of neutron-induced reactions can be divided into three energy ranges: the resolved resonance region (RRR), the unresolved resonance region (URR), and the fast region. In general, the cross sections in the URR show significant fluctuations that cannot be predicted and cannot be experimentally resolved, thus, it is commonly assumed that the cross section at a specific energy is given by a probability distribution function (PDF) over a range of values that can span several orders of magnitude. The current methodology used to describe such behavior is to construct the PDF by stochastically generating resonance ladders and numerically measuring the PDF. The resonance ladders are sampled using known resonance statistical properties and average resonance widths and spacings extrapolated from the RRR. Although this is a standard and widely used technique, it is computationally very expensive, therefore, an alternative, analytical, approach would be preferable due to the considerable speed up of the computational time in real life applications. Moreover, the current methodology does not take into account existing experimental data, such for total and capture cross sections, that are available for many nuclei. Finally, this approach was developed to be used in reactor-scale applications and it is not suited for use in single-event applications. In this work we will rethink the entire approach to the PDF construction using a Bayesian mindset. This will allow us to provide a different definition of the PDF that allows a much faster calculation of the higher-temperature PDFs and a proper combination of theoretical and experimental PDFs following the probability theory. We will also show that our definition is well suited for single-event applications and we will make an explicit connection between our method and the standard approach. We do this by showing that the central limit theorem applies and our method leads to the same PDF obtained with the standard methodology, for a large number of events per history.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Numerical schemes for a multi-species BGK model with velocity-dependent collision frequency

Here, we consider a kinetic description of multi-species gas mixture modeled with Bhatnagar-Gross-Krook (BGK) collision operators, in which the collision frequency varies not only in time and space but also with the microscopic velocity. In this model, the Maxwellians typically used in standard BGK operators are replaced by a generalization of such target functions, which are defined by a variational procedure. In this paper we present a numerical method for simulating this model, which uses an Implicit-Explicit (IMEX) scheme to minimize a certain potential function, mimicking the Lagrange functional that appears in the theoretical derivation. We show that theoretical properties such as conservation of mass, total momentum and total energy as well as positivity of the distribution functions are preserved by the numerical method, and illustrate its usefulness and effectiveness with numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems

Quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to minimize the energy of a quantum state. Which is more effective has remained unclear. Here we analytically apply the framework of optimal control theory to show that generically, given a fixed amount of time, the optimal procedure has the pulsed (or “bang-bang”) structure of QAOA at the beginning and end but can have a smooth annealing structure in between. This is in contrast to previous works which have suggested that bang-bang (i.e., QAOA) protocols are ideal. To support this theoretical work, we carry out simulations of various transverse field Ising models, demonstrating that bang-anneal-bang protocols are more common. Futher, the general features identified here provide guideposts for the nascent experimental implementations of quantum optimization algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Stochastic Reduced-Order Model for Statistical Microstructure Descriptors Evolution

Integrated computational materials engineering (ICME) models have been a crucial building block for modern materials development, relieving heavy reliance on experiments and significantly accelerating the materials design process. However, ICME models are also computationally expensive, particularly with respect to time integration for dynamics, which hinders the ability to study statistical ensembles and thermodynamic properties of large systems for long time scales. To alleviate the computational bottleneck, we propose to model the evolution of statistical microstructure descriptors as a continuous-time stochastic process using a non-linear Langevin equation, where the probability density function (PDF) of the statistical microstructure descriptors, which are also the quantities of interests (QoIs), is modeled by the Fokker–Planck equation. In this work, we discuss how to calibrate the drift and diffusion terms of the Fokker–Planck equation from the theoretical and computational perspectives. The calibrated Fokker–Planck equation can be used as a stochastic reduced-order model to simulate the microstructure evolution of statistical microstructure descriptors PDF. Considering statistical microstructure descriptors in the microstructure evolution as QoIs, we demonstrate our proposed methodology in three integrated computational materials engineering (ICME) models: kinetic Monte Carlo, phase field, and molecular dynamics simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Investigation of finite-volume methods to capture shocks and turbulence spectra in compressible flows

The aim of the present paper is to provide a comparison between several finite-volume methods of different numerical accuracy: the second-order Godunov method with PPM interpolation and the high-order finite-volume WENO method. In this work, the results show that while on a smooth problem the high-order method performs better than the second-order one, when the solution contains a shock all the methods collapse to first-order accuracy. In the context of the decay of compressible homogeneous isotropic turbulence with shocklets, the actual overall order of accuracy of the methods reduces to second-order, despite the use of fifth-order reconstruction schemes at cell interfaces. Most important, results in terms of turbulent spectra are similar regardless of the numerical methods employed, except that the PPM method fails to provide an accurate representation in the high-frequency range of the spectra. It is found that this specific issue comes from the slope-limiting procedure and a novel hybrid PPM/WENO method is developed that has the ability to capture the turbulent spectra with the accuracy of a high-order method, but at the cost of the second-order Godunov method. Overall, it is shown that virtually the same physical solution can be obtained much faster by refining a simulation with the second-order method and carefully chosen numerical procedures, rather than running a coarse high-order simulation. Our results demonstrate the importance of evaluating the accuracy of a numerical method in terms of its actual spectral dissipation and dispersion properties on mixed smooth/shock cases, rather than by the theoretical formal order of convergence rate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Construction of a Code Verification Matrix for Heat Conduction With Finite Element Code Applications

When establishing the pedigree of a simulation tool, code verification is used to ensure that the implemented numerical algorithm is a faithful representation of its underlying mathematical model. During this process, numerical results on various meshes are systematically compared to a reference analytic solution. The selection of analytic solutions can be a laborious process, as it is difficult to establish adequate code confidence without performing redundant work. In this report we address this issue by applying a physics-based process that establishes a set of reference problems. In this process, code simulation options are categorized and systematically tested, which ensures that gaps in testing are easily identified and addressed. The resulting problems are primarily intended for code verification analysis but may also be useful for comparison to other simulation codes, troubleshooting activities, or training exercises. The process is used to select fifteen code verification problems relevant for the one-dimensional steady-state heat conduction equation. These problems are applicable to a wide variety of simulation tools, but, in this work, a demonstration is performed using the finite element-based nuclear fuel performance code BISON. Convergence to the analytic solution at the theoretical rate is quantified for a selection of the problems, which establishes a baseline pedigree for the code. Not only can this standard set of conduction solutions be used for verification of other codes, but also the physics-based process for selecting problems can be utilized to quantify and expand testing for any simulation tool.

42 ENGINEERING↗
DOE OSTI2021

Turbulence theories and statistical closure approaches

When discussing research in physics and in science more generally, it is common to ascribe equal importance to the three components of the scientific trinity: theoretical, experimental, and computational studies. This review will explore the future of modern turbulence theory by tracing its history, which began in earnest with Kolmogorov’s 1941 analysis of turbulence cascade and inertial range [A.N. Kolmogorov, Dokl. Akad. Nauk SSSR, 30, 299, (1941); 32, 19, (1941)]. The 80th Anniversary of Kolmogorov’s landmark study is a welcome opportunity to survey the achievements and evaluate the future of the theoretical approach of turbulence research. Over the years, turbulence theories have been critically important in laying the foundation of our understanding of the nature of turbulent flows. In particular, the Direct Interaction Approximation (DIA) [R.H. Kraichnan, J. Fluid Mech., 5, 497 (1959)] and its subsequent development, known as the statistical closure approach, can be identified as perhaps the most profound single advancement. The remarkable success of the statistical closure has furnished a platform to study such essential concepts as the energy transfer process and interacting scales, and the roles of the straining and sweeping motions. More recently, the quasi-Lagrangian formulation of V. L’vov & I. Procaccia and Kraichnan’s solvable passive scalar model provided powerful ways to explore another fundamental aspect of turbulent flows, the phenomena of intermittency, and the associated anomalous scaling exponents. In the meantime, the theory of fluid equilibria has been developed to describe the large-scale structures that can emerge from turbulent cascades of two-dimensional and geophysical flows at a later time. And yet, despite all these successes, analytical treatments suffer from mathematical complexities. As a result, the utility of theoretical approaches has been limited to relatively idealized flows. On the other hand, in recent decades, computational abilities and experimental facilities have reached an unprecedented scale. Looking beyond the horizon, the imminent deployment of exascale supercomputers will generate complete datasets of the entire flow field of key benchmark flows, allowing researchers to extract additional measurements concerning fully developed, complex turbulent flow fields far beyond those available from the statistical closure theories. Some other developments that could potentially influence the future course of turbulence theories include the advancement of machine learning, artificial intelligence, and data science; likely disruptions arising from the advent of quantum computation; and the increasingly prominent role of turbulence research in providing more accurate climate scientific data. Finally, turbulence theorists can leverage these developments by asking the right questions and developing advanced, sophisticated frameworks that will be able to predict and correlate vast amounts of data from the other two components of the trinity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Locally adaptive activation functions with slope recovery for deep and physics-informed neural networks

Here we propose two approaches of locally adaptive activation functions namely, layer-wise and neuron-wise locally adaptive activation functions, which improve the performance of deep and physics-informed neural networks. The local adaptation of activation function is achieved by introducing a scalable parameter in each layer (layer-wise) and for every neuron (neuron-wise) separately, and then optimizing it using a variant of stochastic gradient descent algorithm. In order to further increase the training speed, an activation slope-based slope recovery term is added in the loss function, which further accelerates convergence, thereby reducing the training cost. On the theoretical side, we prove that in the proposed method, the gradient descent algorithms are not attracted to sub-optimal critical points or local minima under practical conditions on the initialization and learning rate, and that the gradient dynamics of the proposed method is not achievable by base methods with any (adaptive) learning rates. We further show that the adaptive activation methods accelerate the convergence by implicitly multiplying conditioning matrices to the gradient of the base method without any explicit computation of the conditioning matrix and the matrix–vector product. The different adaptive activation functions are shown to induce different implicit conditioning matrices. Furthermore, the proposed methods with the slope recovery are shown to accelerate the training process.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Annual IC Progress Report

The goal of this project is to computationally investigate the progenitors of astrophysical gamma-ray bursts (GRB), the most extreme explosions in the universe across length and time scales. We have developed a cutting-edge, code-bridging approach to exploring the physics behind these luminous events to test the hypothesis that GRBs with electromagnetic radio emission originate from massive star (MS) and black hole (BH) binary systems. Our multi-scale, multi-physics theoretical framework for GRBs is based on solving well-defined and testable hydrodynamics problems associated with the dynamical evolution of the system. We solve stages of the evolution in a tractable way with a suite of well-developed state-of-the-art computational tools that include the stellar evolution code MESA, the general relativistic magnetohydrodynamics (GRMHD) code Athena++, and the binary black hole (BBH) population synthesis code COSMIC, as well as a number of self-written python post-processing tools.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Side-channel Leakage Assessment Metrics: A Case Study of GIFT Block Ciphers

Determination of an adequate level of security and providing subsequent mechanisms to achieve it, is one of the most pressing problems regarding embedded computing devices. While there are some solutions available for resource-rich computer systems, direct application of these solutions to resource-constrained environments are often unfeasible. The fundamental problem for such resource-constrained systems is the fact that current cryptographic algorithms utilize significant energy consumption and storage overhead. Both the cryptographic algorithm and its physical implementation affect the resilience of a cryptosystem against side-channel attacks. A side-channel attack represents a process that exploits leakages in order to extract sensitive information such as the key. This paper focuses on Correlation Power Analysis (CPA) which is side-channel attack based on the power consumption leakage. In 2016 the U.S. Commerce Department’s National Institute of Standards and Technology (NIST) initiated the call for proposals of new cryptographic algorithms to strengthen the cryptographic defense of networked devices against cyberattacks and to protect the data created by those innumerable device. This work evaluates S-boxes used by NIST candidates PICCOLO, GIFT, and PRESENT, as well as several S-box variants that demonstrated sufficient weaknesses against classical cryptanalysis, for a quantitative comparison in terms of resiliency to CPA attack. Three well-known theoretical metrics are evaluated: transparency order (TO and RTO), nonlinearity, and signal-to-noise (SNR) ratio, aiming to characterize the resistance of these S-boxes against adversaries exploiting physical leakages. Experimental results from attacks on an 8- bit XMEGA were obtained via the ChipWhisperer platform and of all the S-boxes evaluated, GIFT64 with a PICCOLO S-box was found to be the most susceptible to CPA. Results showed that variations in TO and RTO were not sufficient to ensure practical CPA resistance and that among S-boxes with equal non-linearity there were no significant differences in the TO and SNR variants.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Side-channel Leakage Assessment Metrics: A Case Study of GIFT Block Ciphers

Determination of an adequate level of security and providing subsequent mechanisms to achieve it, is one of the most pressing problems regarding embedded computing devices. While there are some solutions available for resource-rich computer systems, direct application of these solutions to resource-constrained environments are often unfeasible. The fundamental problem for such resource-constrained systems is the fact that current cryptographic algorithms utilize significant energy consumption and storage overhead. Both the cryptographic algorithm and its physical implementation affect the resilience of a cryptosystem against side-channel attacks. A side-channel attack represents a process that exploits leakages in order to extract sensitive information such as the key. This paper focuses on Correlation Power Analysis (CPA) which is side-channel attack based on the power consumption leakage. In 2016 the U.S. Commerce Department’s National Institute of Standards and Technology (NIST) initiated the call for proposals of new cryptographic algorithms to strengthen the cryptographic defense of networked devices against cyberattacks and to protect the data created by those innumerable device. This work evaluates S-boxes used by NIST candidates PICCOLO, GIFT, and PRESENT, as well as several S-box variants that demonstrated sufficient weaknesses against classical cryptanalysis, for a quantitative comparison in terms of resiliency to CPA attack. Three well-known theoretical metrics are evaluated: transparency order (TO and RTO), nonlinearity, and signal-to-noise (SNR) ratio, aiming to characterize the resistance of these S-boxes against adversaries exploiting physical leakages. Experimental results from attacks on an 8- bit XMEGA were obtained via the ChipWhisperer platform and of all the S-boxes evaluated, GIFT64 with a PICCOLO S-box was found to be the most susceptible to CPA. Results showed that variations in TO and RTO were not sufficient to ensure practical CPA resistance and that among S-boxes with equal non-linearity there were no significant differences in the TO and SNR variants.

97 MATHEMATICS AND COMPUTING↗