Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematical physics 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 1,711 records · Page 95
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Quantum Davidson algorithm for excited states

Abstract Excited state properties play a pivotal role in various chemical and physical phenomena, such as charge separation and light emission. However, the primary focus of most existing quantum algorithms has been the ground state, as seen in quantum phase estimation and the variational quantum eigensolver (VQE). Although VQE-type methods have been extended to explore excited states, these methods grapple with optimization challenges. In contrast, the quantum Krylov subspace (QKS) method has been introduced to address both ground and excited states, positioning itself as a cost-effective alternative to quantum phase estimation. However, conventional QKS methodologies depend on a pre-generated subspace through real or imaginary-time evolutions. This subspace is inherently expansive and can be plagued with issues like slow convergence or numerical instabilities, often leading to relatively deep circuits. Our research presents an economic QKS algorithm, which we term the quantum Davidson (QDavidson) algorithm. This innovation hinges on the iterative expansion of the Krylov subspace and the incorporation of a pre-conditioner within the Davidson framework. By using the residues of eigenstates to expand the Krylov subspace, we manage to formulate a compact subspace that aligns closely with the exact solutions. This iterative subspace expansion paves the way for a more rapid convergence in comparison to other QKS techniques, such as the quantum Lanczos. Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems, spanning from the Heisenberg spin model to real molecules. Compared to the existing QKS methods, the QDavidson algorithm not only converges swiftly but also demands a significantly shallower circuit. This efficiency establishes the QDavidson method as a pragmatic tool for elucidating both ground and excited state properties on quantum computing platforms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Informative and non-informative decomposition of turbulent flow fields

Not all the information in a turbulent field is relevant for understanding particular regions or variables in the flow. Here, we present a method for decomposing a source field into its informative Φ I (x, t) and residual Φ R (x, t) components relative to another target field. The method is referred to as informative and non-informative decomposition (IND). All the necessary information for physical understanding, reduced-order modelling and control of the target variable is contained in Φ I (x, t), whereas Φ R (x, t) offers no substantial utility in these contexts. The decomposition is formulated as an optimisation problem that seeks to maximise the time-lagged mutual information of the informative component with the target variable while minimising the mutual information with the residual component. The method is applied to extract the informative and residual components of the velocity field in a turbulent channel flow, using the wall shear stress as the target variable. We demonstrate the utility of IND in three scenarios: (i) physical insight into the effect of the velocity fluctuations on the wall shear stress; (ii) prediction of the wall shear stress using velocities far from the wall; and (iii) development of control strategies for drag reduction in a turbulent channel flow using opposition control. In case (i), IND reveals that the informative velocity related to wall shear stress consists of wall-attached high- and low-velocity streaks, collocated with regions of vertical motions and weak spanwise velocity. This informative structure is embedded within a larger-scale streak–roll structure of residual velocity, which bears no information about the wall shear stress. In case (ii), the best-performing model for predicting wall shear stress is a convolutional neural network that uses the informative component of the velocity as input, while the residual velocity component provides no predictive capabilities. Finally, in case (iii), we demonstrate that the informative component of the wall-normal velocity is closely linked to the observability of the target variable and holds the essential information needed to develop successful control strategies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Cybersecurity for Distance Relay Protection

This project is a DOE follow-up effort on the CREDC workshop held on September 13, 2018 in Cambridge, MA to discuss cybersecurity of distance relays, which considered the benefits, vulnerabilities and risk mitigations for the use of communication systems in power system protection. The objectives of this project are to define the taxonomy of relay protection and associated communications; define use cases describing approaches to reduce the cyber-attack surface on those protective relays; and evaluate the loss of operational functional capability from changes to communication coverage. Mitigating controls will also be evaluated to understand if there are other approaches to reduce attack surfaces while maintaining communications or partial communications. Distance relays are used to protect transmission lines of approximately 10 to 300 miles in length, by detecting short circuits (i.e., faults) on the lines and then tripping circuit breakers in the substation. Such protection systems are a subset of the power system and they incorporate sensing, logic and communication functions. Protection system exposure to cyberattack could be drastically limited by disconnecting relays from all vulnerable communication systems, but this may adversely impact overall power system performance in the absence of cyberattack. This project began with a use case analysis of protection systems with communications, as summarized in this report. It continued with modeling, testing and evaluation in a miniature power system (MPS), located in the Western Area Power Administration (WAPA) Electric Power Training Center (EPTC). The project also incorporated feedback from two industry meetings held in February and September 2019. The suggested next steps account for and complement the work already underway with DOE/CESER funding: 1. Study the performance of LCD and PC vs. PUTT, which is less reliant on communication system performance and GPS timing references. The PUTT scheme could prove to be more resilient to cyberattack or communications-related disruption. It could also be more tolerant of message re-routing with SDN/SDR communication systems. On the other hand, it will be more vulnerable to false tripping during dynamic events or to loss of the voltage signal. The optimum choice of scheme may depend on the specific power system and risk assessment. This study could provide a new template for evaluation based on business functions. 2. Research and develop new methods to detect and monitor distributed physical attacks, possibly using drones, video sensors, thermal sensors, machine learning and other advanced techniques. This will help mitigate the impact of cyberattack on the protection system, and will also help mitigate the impact of wild fires. 3. Implement a scalable PKI for use in electric utility protection systems. This will encourage widespread adoption of secure authentication methods that are already available, but not widely used at present. This will help secure engineering access to the relays. 4. Investigate the use of SDN in combination with SDR to achieve better cybersecurity and electromagnetic security of the network, incorporating path variability. This would help secure both engineering access and peer-to-peer GOOSE messaging. 5. Perform additional testing, with operator evaluation of “red button” scenarios, PUTT vs. LCD, relay mis-operations, and other cyberattacks in the EPTC. This is an important advantage of testing in the EPTC rather than by computer simulation or even hardware-in-the-loop simulation; the EPTC is already dedicated to managing the situational awareness, operator response times and other human impacts. One of the project objectives was to settle on a common nomenclature for this problem space. We have concluded that the OSI layer model, supplemented by ANSI device numbers and other IEEE standards, is already well-accepted by the industry. The IEEE PSRC knowledge base provides a great deal of public information

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

ASGarD: Adaptive Sparse Grid Discretization

Many areas of science exhibit physical processes that are described by high dimensional partial differential equations (PDEs), e.g., the 4D, 5D and 6D models describing magnetized fusion plasmas, models describing quantum chemistry, or derivatives pricing. Such problems are affected by the so-called “curse of dimensionality” where the number of degrees of freedom (or unknowns) required to be solved for scales as N D where N is the number of grid points in any given dimension D. A simple, albeit naive, 6D example is demonstrated in the left panel of Figure 1. With N = 1000 grid points in each dimension, the memory required just to store the solution vector, not to mention forming the matrix required to advance such a system in time, would exceed an exabyte - and also the available memory on the largest of supercomputers available today. The right panel of Figure 1 demonstrates potential savings for a range of problem dimensionalities and grid resolution. While there are methods to simulate such high-dimensional systems, they are mostly based on Monte-Carlo methods, which rely on a statistical sampling such that the resulting solutions include noise. Since the noise in such methods can only be reduced at a rate proportional to $\sqrt{N_p}$ where N p is the number of Monte-Carlo samples, there is a need for continuum, or grid/mesh-based methods for high-dimensional problems, which both do not suffer from noise and bypass the curse of dimensionality. We present a simulation framework that provides such a method using adaptive sparse grids.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

A Pseudoreversible Normalizing Flow for Stochastic Dynamical Systems with Various Initial Distributions

Here, we present a pseudoreversible normalizing flow method for efficiently generating samples of the state of a stochastic differential equation (SDE) with various initial distributions. The primary objective is to construct an accurate and efficient sampler that can be used as a surrogate model for computationally expensive numerical integration of SDEs, such as those employed in particle simulation. After training, the normalizing flow model can directly generate samples of the SDE’s final state without simulating trajectories. The existing normalizing flow model for SDEs depends on the initial distribution, meaning the model needs to be retrained when the initial distribution changes. The main novelty of our normalizing flow model is that it can learn the conditional distribution of the state, i.e., the distribution of the final state conditional on any initial state, such that the model only needs to be trained once and the trained model can be used to handle various initial distributions. This feature can provide a significant computational saving in studies of how the final state varies with the initial distribution. Additionally, we propose to use a pseudoreversible network architecture to define the normalizing flow model, which has sufficient expressive power and training efficiency for a variety of SDEs in science and engineering, e.g., in particle physics. We provide a rigorous convergence analysis of the pseudoreversible normalizing flow model to the target probability density function in the Kullback–Leibler divergence metric. Numerical experiments are provided to demonstrate the effectiveness of the proposed normalizing flow model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

InterGraph-CPS: A Graph-Theoretic Approach to Characterize Cross-Domain Cyber-Physical Interdependencies and Uncertainties in Electric Grid Systems for Improved Decision-Making in Operation and Response

Critical infrastructure systems such as the electric grid are increasingly cyber-physical; yet, despite the cyber-physical characteristics of critical infrastructure systems, the physical process system and communication/control network system are traditionally analyzed in siloes. As these systems become more cyber-physical, it is crucial that models and methods are available to assess the cyber physical system (CPS) interdependencies, characteristics, and event propagation for improved planning, operation, and response. Thus, we proposed an integrated structural and temporal CPS interdependency analysis framework, InterGraph-CPS, that provides insight into the CPS function during normal operation as well as disturbances. This integrated structural and temporal interdependency framework is uniquely designed for assessing CPSs by account for the challenges of analyzing cyber and physical data streams together due to data availability, data type, and time scale differences. By leveraging both structural (e.g., graph analysis) and temporal (e.g., data analytics) techniques, different CPS behaviors and configurations can be accounted for.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Neutron Leakage Spectra Sensitivities for ICSBEP Benchmarks

Neutron leakage spectra have been measured, simulated, and investigated by many groups. These spectra have many uses, including determining shielding requirements and calculating dose for radiation protection purposes, validating nuclear data, and determining material composition. It has even been proposed to use measurements of neutron leakage spectra to determine the soil composition of Mars. As part of the Los Alamos National Laboratory (LANL) Experiments Underpinned by Computational Learning for Improvements in nuclear Data (EUCLID) Laboratory Directed Research Development (LDRD) project, the authors are working on developing methods to calculate sensitivities to neutron leakage spectra. This may allow nuclear data evaluators to better use neutron leakage spectra data to constrain or adjust nuclear data. This may also be particularly useful as many neutron leakage spectra measurements do not require fissile material and can be performed with well characterized neutron sources. Neutron leakage spectra measurements are usually performed by placing a detector at the outside of a nuclear system. This may be a reactor, a neutron generator, or a neutron source. Certain detection systems can use pulse height data to infer neutron energies, other detector systems rely on other ways of determining neutron energy (for example, a Bonner sphere with multiple moderator thicknesses can be used to measure neutron spectrum). These measurements typically rely on some unfolding of the measured results. For pulsed systems like the "Livermore Pulsed Spheres," time-of-flight information can also help to constrain the neutron energy spectra data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

A Projected Network Model of Online Disinformation Cascades

Within the past half-decade, it has become overwhelmingly clear that suppressing the spread of deliberate false and misleading information is of the utmost importance for protecting democratic institutions. Disinformation has been found to come from both foreign and domestic actors, but the effects from either can be disastrous. From the simple encouragement of unwarranted distrust to conspiracy theories promoting violence, the results of disinformation have put the functionality of American democracy under direct threat. Present scientific challenges posed by this problem include detecting disinformation, quantifying its potential impact, and preventing its amplification. We present a model on which we can experiment with possible strategies toward the third challenge: the prevention of amplification. This is a social contagion network model, which is decomposed into layers to represent physical, ''offline'', interactions as well as virtual interactions on a social media platform. Along with the topological modifications to the standard contagion model, we use state-transition rules designed specifically for disinformation, and distinguish between contagious and non-contagious infected nodes. We use this framework to explore the effect of grassroots social movements on the size of disinformation cascades by simulating these cascades in scenarios where a proportion of the agents remove themselves from the social platform. We also test the efficacy of strategies that could be implemented at the administrative level by the online platform to minimize such spread. These top-down strategies include banning agents who disseminate false information, or providing corrective information to individuals exposed to false information to decrease their probability of believing it. We find an abrupt transition to smaller cascades when a critical number of random agents are removed from the platform, as well as steady decreases in the size of cascades with increasingly more convincing corrective information. Finally, we compare simulated cascades on this framework with real cascades of disinformation recorded on Whatsapp surrounding the 2019 Indian election. We find a set of hyperparameter values that produces a distribution of cascades matching the scaling exponent of the distribution of actual cascades recorded in the dataset. We acknowledge the available future directions for improving the performance of the framework and validation methods, as well as ways to extend the model to capture additional features of social contagion.

42 ENGINEERING↗
DOE OSTI2023

Sensitivity analysis of a layered piezoelectric system using ZFEM

The complex variable finite element method (ZFEM) is a numerical technique which aims to find the partial derivatives of the independent variables with respect to variation in dependent parameters declared in the physics. This is done by combining the complex Taylor series expansion within the weak formulation of the governing equation in a coupled system of linear equations forming a complex valued block matrix given by the Cauchy–Riemann matrix representation. In this work, two-dimensional linear first-order elements have been implemented in ZFEM to predict the design derivatives of the mechanical displacement field and the voltage potential field for a layered piezoelectric system in a steady-state study with Dirichlet boundary condition applied at the top and bottom edges of the geometry. This approach allows the standard FEM solution to quantify the sensitivity of the mechanical displacement and voltage potential fields with respect to small variations in the material properties through the information obtained from the computation of the derivatives. The domain is formed by a layered body with PZT-4 and PZT-5 stacked together. For result verification, the numerical solution obtained with ZFEM was compared to results from a commercial FEM package and the solution from the imaginary part was compared to the exact solution of a well-known benchmark problem. In conclusion, comparison of the results showed good agreement for both the real and imaginary parts of the solution and the largest sensitivities were found in PZT-5 specifically in C 13 , C 33 , and ε 33 .

42 ENGINEERING↗
DOE OSTI2024

The Method of Finite Averages: A rigorous upscaling methodology for heterogeneous porous media

Rigorous upscaling techniques offer accurate and computationally-efficient strategies for modeling the average behaviors of multi-physical, multiscale phenomena in geological porous media. However, such techniques often rely on a variety of methodological assumptions that prohibit their rigorous application to practical systems (e.g., systems involving heterogeneous porous media, system-scale boundary conditions, and fine-scale dynamics that are not diffusion-dominant). In this work, we aim to formulate an upscaling methodology with few methodological assumptions to provide high levels of model generality and foster the utilization of rigorously-derived upscaled models in practice. In particular, we introduce the Method of Finite Averages (MoFA), a novel upscaling methodology for rigorously modeling heterogeneous porous media and system-scale boundary conditions. We then detail MoFA’s implementation for the advective–diffusive transport of a single species and compare the methodology with classic numerical techniques, as well as other rigorous upscaling techniques, to highlight MoFA’s unique combination of rigor and generality. We then validate the derived model while demonstrating its benefits in three numerical experiments. The results suggest that (1.) the applicability and a priori error guarantees of MoFA models do not directly depend on system geometry, (2.) a model’s applicability and error guarantees can be can arbitrarily expanded and reduced, respectively, with further computational expense, and (3.) downscaling with MoFA provides an efficient strategy for generating accurate pore-scale solutions from upscaled results. Ultimately, the results evidence that upscaled models can be rigorously derived for heterogeneous porous media systems and resolved in a fraction of the time it takes to perform the equivalent pore-scale simulations.

58 GEOSCIENCES↗
DOE OSTI2023

Spatially quasi-periodic bifurcations from periodic traveling water waves and a method for detecting bifurcations using signed singular values

We present a method of detecting bifurcations by locating zeros of a signed version of the smallest singular value of the Jacobian. This enables the use of quadratically convergent root-bracketing techniques or Chebyshev interpolation to locate bifurcation points. Only positive singular values have to be computed, though the method relies on the existence of an analytic or smooth singular value decomposition (SVD). The sign of the determinant of the Jacobian, computed as part of the bidiagonal reduction in the SVD algorithm, eliminates slope discontinuities at the zeros of the smallest singular value. We use the method to search for spatially quasi-periodic traveling water waves that bifurcate from large-amplitude periodic waves. The water wave equations are formulated in a conformal mapping framework to facilitate the computation of the quasi-periodic Dirichlet-Neumann operator. We find examples of pure gravity waves with zero surface tension and overhanging gravity-capillary waves. In both cases, the waves have two spatial quasi-periods whose ratio is irrational. We follow the secondary branches via numerical continuation beyond the realm of linearization about solutions on the primary branch to obtain traveling water waves that extend over the real line with no two crests or troughs of exactly the same shape. The pure gravity wave problem is of relevance to ocean waves, where capillary effects can be neglected. Such waves can only exist through secondary bifurcation as they do not persist to zero amplitude. The gravity-capillary wave problem demonstrates the effectiveness of using the signed smallest singular value as a test function for multi-parameter bifurcation problems. This test function becomes mesh independent once the mesh is fine enough.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2020

Description of Sensor Assignment Optimization Method as Deployed on a Multi-Node Cluster

Data analytic methods are being developed to address the problem of how to assign a sensor set in a nuclear facility such that a requisite level of process monitoring capability is realized and that the sensor set is sufficiently rich to determine the status of the individual sensors with respect to need for calibration. There is an awareness in the nuclear industry that data analytics combined with rich sensor sets represent a means to improve operations and reduce costs. In the industry the calibration problem has been previously approached as an empirical data-driven problem with several methods having been developed. However, the experience of the utilities over the past ten years with these methods indicates that the absence of physics-based information renders the data-driven approach less reliable. Complicating factors such as the inherent variability of operation (both equipment alignment and operating condition) can confound a pure data-driven approach while there are no rigorous guidelines for determining what constitutes an adequate sensor set. The solution under development to overcome these shortcomings supplements the data analytic method with process information in a so-called process-constrained data-analytic approach. Simple balance equations are written for generic components (e.g., mechanical pump, valve, and heat exchanger). These do not require a priori knowledge of process parameters, such as heat transfer coefficients or friction factors. All that is needed on the part of the utility user is to identify the components and how they are connected. This report describes the development of a parallel computing capability for determining the optimal sensor set. The optimal sensor set problem suffers from the curse of dimensionality. Computation time increases exponentially as the size of the system grows. To overcome this difficulty a pre-conditioner algorithm is developed to find an approximate solution close the actual solution. This serves as a seed for the full-blown algorithm and acts to constrain the space that must searched. The optimization algorithms are described and the implementation on a parallel computing platform is described. The application of the method to a use case we are solving in collaboration with our utility partner served to illustrate how the default sensor set in a nuclear plant may not provide sufficient coverage to infer sensor calibration status.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Continuum Description of the Role of Negative Transference Numbers on Ion Motion in Polymer Electrolytes

New experimental techniques such as electrophoretic NMR (eNMR) are emerging as powerful methods for directly measuring ion velocities in electrolytes under applied electric fields. The aim of this theoretical study is to predict the spatial- and temporal-dependence of these velocities of ions as a function of the magnitude of the applied field and salt concentration. It has recently been shown that mixtures of poly(ethylene oxide)-based (PEO) and lithium bis(trifluoromethanesulfonyl) imide (LiTFSI) electrolytes exhibit negative cation transference numbers in a certain salt concentration range. In this range, the cation motion at early times is directed to the positive electrode at all locations in the cell; ion migration dominates in this regime. As time progresses, the cation velocity in finite zones near both the electrodes changes sign. These zones grow rapidly with time, reflecting the increasing importance of diffusion, and a point in time is reached beyond which the cation velocity in the entire cell is directed toward the negative electrode. Overall, our work reveals the limited time window over which the results of eNMR can be used to determine the transference number. More importantly, it shows how to account for the effect of diffusional flux in such experiments.

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

Uncertainty quantification for equations of state: copper as an example

Equations of state are essential for providing a fundamental description of materials properties in thermodynamic equilibrium and are used to provide closure relations for hydrodynamics simulations. Generally, equations of state rely on simple physics-based parameterized materials models to inform on the free energy of a material through out a given thermodynamic state space. Historically the parameters of these models have been tuned by hand to fit various experimental data. However, modern optimization and uncertainty quantification techniques allow us to quickly test thousands of parameter combinations and obtain meaningful uncertainty estimates on the parameters, opening opportunities for assessing systematic uncertainties in experiments, assessing model adequacy, and more. In this report, we use Bayesian inference to fit the solid (fcc) equation of state of copper. We focus on fitting five different experimental datasets, including the isobaric density, isobaric heat capacity, room temperature isotherm, principal isentrope, and principal Hugoniot. We fit all five data types simultaneously, and then explore the extent to which combinations of 2 subsets of the 5 datasets can constrain the EOS parameters, as compared to the fit to all 5. This information is useful for investigating the extent to which different datasets can con strain EOS models and thereby help guide experimental investigations in order to best constrain the EOS. We also discuss ways that the methodologies can be used to investigate systematic discrepancies between experiments, as well as how the methods can be used to assess model uncertainty. The framework we develop is general, in that it can be used with a variety of optimization or uncertainty quantification techniques and with a variety of data sources, including both experimental and ab-inito data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A rheological model for loose sands with insights from DEM

A rheological model for loose granular media is developed to capture both solid-like and fluid-like responses during shearing. The proposed model is built by following the mathematical structure of an extended Kelvin–Voigt model, where an elastic spring and plastic slider act in parallel to a viscous damper. This arrangement requires the partition of the total stress into rate-independent and rate-dependent stress components. To model the solid-like behavior, a simple frictional plasticity model is adopted without modifications, thus contributing to the rate-independent stress. Instead, the fluid-like or rate-dependent stress is further decomposed into deviatoric and volumetric parts, by proposing a new formulation based on a combination of the μ(I) relation, originally developed under pressure-controlled shear, with a pressure-shear rate relation derived under volume-controlled shear. The proposed formulation allows the model to capture both the increase in the friction coefficient and the enhanced dilation at high shear rates. High-fidelity simulation data, obtained from discrete element method and multiscale modelling, are used to evaluate the performance of the proposed constitutive model. The model provides accurate results under both drained and undrained simple shear paths across a wide range of shear rates. Furthermore, it successfully reproduces at much lower computational cost the flowslide mobility computed through multiscale simulations, which is primarily regulated by the shear rate dependence of the material properties during the dynamic runout stage.

Elasticity↗
DOE OSTI2022

Sequential Decision Making (SDM) for Mesh Refinement and Model Selection in Multiscale, Multi-Physics Applications

Intelligent automation and decision support are needed to enhance computational efficiency and robustness in multiscale and multi-physics problems, including materials science, manufacturing, and climate and weather modeling. Current scientific computing approaches for enabling decisions by scientists fail to explore the role of learning, reasoning, and probabilistic planning. Often these decisions are not performed in real-time during the computation but are made prior to the start of the computation, which must be interrupted in order to make changes to the prior choices. Such interruptions at different stages of the computation increase the total computing time and the need for a human expert to frequently monitor the results. State of art scientific computing methods consist of rule-based algorithms that cannot automatically adapt to a dynamically changing computing environment. The development of a Sequential Decision Making (SDM) framework will automate scientific computing by optimizing the policies for mesh refinement, time-stepping, model and algorithm selection, resource allocation, and pre and post-processing. Our agent SDM framework for scientific computing will consist of data-driven learning (Classifier), automated reasoning (contextual knowledge), and probabilistic planning (Reinforcement Learning). In this project, we focused on three problems to demonstrate our SDM framework on a set of ordinary and partial differential equations. Classification of Lorenz system regions using Feed-Forward Neural Networks examined learning in the SDM framework. On the other hand, reasoning and planning in the SDM framework were used in two problems: adaptive time-stepping for nonlinear ODEs using on-policy RL algorithms, and adaptive mesh refinement for 2-D PDEs using off-policy RL algorithms.

97 MATHEMATICS AND COMPUTING↗