Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational Complexity”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Testing convolutional neural network based deep learning systems: a statistical metamorphic approach

Machine learning technology spans many areas and today plays a significant role in addressing a wide range of problems in critical domains,i.e., healthcare, autonomous driving, finance, manufacturing, cybersecurity,etc. Metamorphic testing (MT) is considered a simple but very powerful approach in testing such computationally complex systems for which either an oracle is not available or is available but difficult to apply. Conventional metamorphic testing techniques have certain limitations in verifying deep learning-based models (i.e., convolutional neural networks (CNNs)) that have a stochastic nature (because of randomly initializing the network weights) in their training. In this article, we attempt to address this problem by using a statistical metamorphic testing (SMT) technique that does not require software testers to worry about fixing the random seeds (to get deterministic results) to verify the metamorphic relations (MRs). We propose seven MRs combined with different statistical methods to statistically verify whether the program under test adheres to the relation(s) specified in the MR(s). We further use mutation testing techniques to show the usefulness of the proposed approach in the healthcare space and test two CNN-based deep learning models (used for pneumonia detection among patients). The empirical results show that our proposed approach uncovers 85.71% of the implementation faults in the classifiers under test (CUT). Furthermore, we also propose an MRs minimization algorithm for the CUT, thus saving computational costs and organizational testing resources.

Computer Science↗
DOE OSTI2025

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1999

Computer Modeling of Sand Transport on Mars Using a Compart-Mentalized Fluids Algorithm (CFA)

It has been postulated that aeolian transport on Mars may be significantly different from that on Earth. From laboratory experiments simulating martian grain transport [2], it has been observed that (saltating) grains striking the bed can cause hundreds of secondary reptation trajectories when impact occurs at speeds postulated for Mars. Some of the ballistically induced trajectories "die ouf' and effectively join the ranks on the creep population that is merely nudged along by impact. Many of the induced reptation trajectories, however, are sufficiently high for the grains to become part of the saltation load (it is irrelevant to the boundary layer how a grain attained its initial lift force). When these grains, in turn, strike the surface, they too are capable of inducing more reptating grains. This cascading effect has been discussed in connection with terrestrial aeolian transport in an attempt to dispel the notion that sand motion is divisible only into creep and saltation loads. On Earth, only a few grains are splashed by impact. On Mars, it may be hundreds. We developed a computer model to address this phenomenon because there are some important ramifications: First, this ratio may mean that martian aeolian transport is dominated by reptation flux rather than saltation. On Earth, the flux would be a roughly balanced mixture between reptation/creep and saltation. On Venus, there would be no transport other than by saltation. In other words, an understanding of planetary aeolian processes may not be necessarily understood by extrapolating from the "Earth case", with only gravity and atmospheric density/viscosity being considered as variables. Second, the reptation flux on Mars may be self sustaining, so that little input is required by the wind once transport has been initiated. The number of grains saturating the boundary layer near the bed may mean that average grain speed on Mars might conceivably be less than that on Earth. This would say much for models of sand comminution on Mars. A multiple-grain transport model using just the equations of grain motion describing lift and drag is impossible to develop owing to stochastic effects --the very effects we wish to model. Also, unless we were to employ supercomputing techniques and extremely complex computer codes that could deal with millions of grains simultaneously, it would also be difficult to model grain transport if we attempted to consider every grain in motion. No existing computer models were found that satisfactorily used the equations of motion to arrive at transport flux numbers for the different populations of saltation and reptation. Modeling all the grains in a transport system was an intractable problem within our resources, and thus we developed what we believe to be a new modeling approach to simulating grain transport. The CFA deals with grain populations, but considers them to belong to various compartmentalized fluid units in the boundary layer. In this way, the model circumvents the multigrain problem by dealing primarily with the consequences of grain transport --momentum transfer between air and grains, which is the physical essence of a dynamic grain-fluid mixture. We thus chose to model the aeolian transport process as a superposition of fluids. These fluids include the air as well as particle populations of various properties. The prime property distinguishing these fluids is upward and downward grain motion. In a normal saltation trajectory, a grain's downwind velocity increases with time, so a rising grain will have a smaller downwind velocity than a failing grain. Because of this disparity in rising and falling grain proper-ties, it seemed appropriate to track these as two separate grain populations within the same physical space. The air itself can be considered a separate fluid superimposed within and interacting with the various grain-cloud "fluids". Additional informaiton is contained in the original.

Marshall, J.↗
DOE OSTI2025

Predicting nonequilibrium Green’s function dynamics and photoemission spectra via nonlinear integral operator learning

Understanding the dynamics of nonequilibrium quantum many-body systems is an important research topic in a wide range of fields across condensed matter physics, quantum optics, and high-energy physics. However, numerical studies of large-scale nonequilibrium phenomena in realistic materials face serious challenges due to intrinsic high-dimensionality of quantum many-body problems and the absence of time-invariance. The nonequilibrium properties of many-body systems can be described by the dynamics of the correlator, or the Green's function of the system, whose time evolution is given by a high-dimensional system of integro-differential equations, known as the Kadanoff–Baym equations (KBEs). The time-convolution term in KBEs, which needs to be recalculated at each time step, makes it difficult to perform long-time numerical simulation. In this paper, we develop an operator-learning framework based on recurrent neural networks (RNNs) to address this challenge. We utilize RNNs to learn the nonlinear mapping between Green's functions and convolution integrals in KBEs. By using the learned operators as a surrogate model in the KBE solver, we obtain a general machine-learning scheme for predicting the dynamics of nonequilibrium Green's functions. Besides significant savings per each time step, the new methodology reduces the temporal computational complexity from $O(N_t^3)$ to $O(N_t)$ where N t is the number of steps taken in a simulation, thereby making it possible to study large many-body problems which are currently infeasible with conventional KBE solvers. Through various numerical examples, we demonstrate the effectiveness of the operator-learning based approach in providing accurate predictions of physical observables such as the reduced density matrix and time-resolved photoemission spectra. Moreover, our framework exhibits clear numerical convergence and can be easily parallelized, thereby facilitating many possible further developments and applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

DeFault: DEep‐Learning‐Based FAULT Delineation Using the IBDP Passive Seismic Data at the Decatur CO2 Storage Site

Abstract The carbon capture, utilization, and storage (CCUS) framework is an essential component in reducing greenhouse gas emissions, with its success hinging on the comprehensive knowledge of subsurface geology and geomechanics. Passive seismic event relocation and fault detection offer vital insights into subsurface structures and the ability to monitor fluid migration pathways. Accurate identification and localization of seismic events, however, face significant challenges, including the necessity for high‐quality seismic data and advanced computational methods. To address these challenges, we introduce a novel deep learning method, , specifically designed for passive seismic source relocation and fault delineating for passive seismic monitoring projects. By leveraging data domain‐adaptation, allows us to train a neural network with labeled synthetic data and apply it directly to field data. Using , the passive seismic sources are automatically clustered based on their recording time and spatial locations, and subsequently, faults and fractures are delineated accordingly. We demonstrate the efficacy of on a field case study involving injection related microseismic data from Decatur, Illinois area. Our approach accurately and efficiently relocated passive seismic events, identified faults and could aid in potential damage induced by seismicity. Our results highlight the potential of as a valuable tool for passive seismic monitoring, emphasizing its role in ensuring CCUS project safety. This research bolsters the understanding of subsurface characterization in CCUS, illustrating machine learning’s capacity to refine these methods. Ultimately, our work has significant implications for CCUS technology deployment, an essential strategy in combating climate change. Plain Language Summary In our quest to tackle climate change, we use a strategy known as carbon capture, utilization, and storage (CCUS) to keep greenhouse gases out of the atmosphere. This strategy relies heavily on our ability to understand what's happening deep under the earth's surface. To make sure we store super critical safely, we need to accurately map out the geological structure, especially faults, but this is tough without high‐quality data and complex computer programs. We've developed a new tool called “DeFault,” which uses advanced machine learning to improve how we find and map these underground features. “DeFault” is smart enough to learn from numerically simulated data and then apply what it’s learned to real‐world situations. It groups together seismic activity—tiny tremors and shifts in the earth—based on when and where they happen, which helps us spot where there might be cracks or faults. We tested “DeFault” in Illinois, where CO 2 is injected underground, and it successfully pinpointed where these tremors occurred and mapped out the faults, helping to prevent accidents accurately in the future. Our study shows that “DeFault” will be a powerful ally in making CCUS safer and more effective, especially for the Illinois Basin Decatur Project. Key Points Faults and fractures introduced by carbon storage can be monitored by passive seismicity DeFault algorithm enables an automatic process for accurate and efficient passive seismic event locating and clustering

58 GEOSCIENCES↗
DOE OSTI2024

S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models

While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Influence of initial conditions on data-driven model identification and information entropy for ideal mhd problems

Data-driven methods of model identification are able to discern governing dynamics of a system from data. Such methods are well suited to help us learn about systems with unpredictable evolution or systems with ambiguous governing dynamics given our current understanding. Many plasma problems of interest fall into these categories as there are a wide range of models that exist, however each model is only useful in a certain regime and often limited by computational complexity. To ensure data-driven methods align with theory, they must be consistent and predictable when acting on data whose governing dynamics are known. Weak Sparse Identification of Nonlinear Dynamics (WSINDy) is a recently developed data-driven method that has shown promise in learning governing dynamics from data with high noise levels [1]. This work examines how WSINDy acts on ideal MHD test problems as the initial conditions are varied and specifies limiting requirements for successful equation identification. Furthermore, it is hard to recover the governing dynamics from data that emphasize a single dominant behavior. In these low information cases, Shannon information entropy is able to pick up on the redundancies in the data that affect recoverability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

SigTime: Learning and Visually Explaining Time Series Signatures

Understanding and distinguishing temporal patterns in time series data is essential for scientific discovery and decision-making. For example, in biomedical research, uncovering meaningful patterns in physiological signals can improve diagnosis, risk assessment, and patient outcomes. However, existing methods for time series pattern discovery face major challenges, including high computational complexity, limited interpretability, and difficulty in capturing meaningful temporal structures. Here, to address these gaps, we introduce a novel learning framework that jointly trains two Transformer models using complementary time series representations: shapelet-based representations to capture localized temporal structures and traditional feature engineering to encode statistical properties. The learned shapelets serve as interpretable signatures that differentiate time series across classification labels. Additionally, we develop a visual analytics system—SigTime—with coordinated views to facilitate exploration of time series signatures from multiple perspectives, aiding in useful insights generation. We quantitatively evaluate our learning framework on eight publicly available datasets and one proprietary clinical dataset. Additionally, we demonstrate the effectiveness of our system through two usage scenarios along with the domain experts: one involving public ECG data and the other focused on preterm labor analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Improving the five-point bootstrap

We present a new algorithm for the numerical evaluation of five-point conformal blocks in d-dimensions, greatly improving the efficiency of their computation. To do this we use an appropriate ansatz for the blocks as a series expansion in radial coordinates, derive a set of recursion relations for the unknown coefficients in the ansatz, and evaluate the series using a Padé approximant to accelerate its convergence. We then study the 〈σσϵσσ〉 correlator in the 3d critical Ising model by truncating the operator product expansion (OPE) and only including operators with conformal dimension below a cutoff ∆ ⩽ ∆cutoff. We approximate the contributions of the operators above the cutoff by the corresponding contributions in a suitable disconnected five-point correlator. Using this approach, we compute a number of OPE coefficients with greater accuracy than previous methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Improving modular bootstrap bounds with integrality

We propose methods that efficiently impose integrality — i.e., the condition that the coefficients of characters in the partition function must be integers — into numerical modular bootstrap. We demonstrate the method with a number of examples where it can be used to strengthen modular bootstrap results. First, we show that, with a mild extra assumption, imposing integrality improves the bound on the maximal allowed gap in dimensions of operators in theories with a U(1) c symmetry at c = 3, and reduces it to the value saturated by the SU(4) 1 WZW model point of c = 3 Narain lattices moduli space. Second, we show that our method can be used to eliminate all but a discrete set of points saturating the bound from previous Virasoro modular bootstrap results. Finally, when central charge is close to 1, we can slightly improve the upper bound on the scaling dimension gap.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Scale-bridging Optimization Framework for Desalination Integrated Produced Water Networks

Produced water (PW) management poses a major challenge to U.S. oil and gas development. Due to freshwater scarcity and PW injection curtailments, desalination may become a necessity in some parts of the country. Integrating rigorous desalination process models within a produced water network for co-optimization of desalination design and network operation can be challenging to scale-up due to computational complexity. In this work we use the trust region filter framework to decompose the integrated optimization problem into an optimization master problem consisting of the network model and simplified surrogates for the desalination units and an optimization sub problem for the rigorous desalination unit model. The approach is demonstrated on a multiperiod produced water network from the PARETO library with thermal desalination units.

Naik, Sakshi↗
DOE OSTI2024

A Vehicle-to-Grid planning framework incorporating electric vehicle user equilibrium and distribution network flexibility enhancement

The rapid surge in electric vehicle (EV) adoption, coupled with advancements in charging technologies, emphasizes the critical necessity for expanding EV recharging infrastructure. Simultaneously, the Distribution Network (DN) encounters escalating challenges in meeting charging demand during peak traffic periods. Consequently, there is a mounting demand for the deployment of innovative Vehicle-to-Grid (V2G) technologies to augment the DN’s flexibility in power dispatch and alleviate travel costs for EV users. Hence, this paper proposes an EV-user-equilibrium-(UE)-constrained V2G planning framework that enhances flexibility in the DN. The framework aims to ascertain the optimal placement and capacity of EV charging stations (EVCSs) and V2G charging piles within the Transportation Network (TN). It takes into account the equilibrium condition stemming from competitive EV charging and routing behaviors alongside the optimal expansion of DN energy resources to accommodate the electricity supplied by the V2G piles. This study commences by analyzing EV drivers’ travel decisions, considering the influence of charging and V2G pile locations and sizes. Subsequently, we tackle the Traffic Assignment Problem with User Equilibrium (TAP-UE) model to characterize the steady-state traffic flow distribution of EVs. Following this, we formulate the optimization model for the Coordinated Power and Transportation Network (CPTN), which encompasses the optimal expansion of DN facilities and traffic flow regulation under UE conditions. To mitigate the computational complexity associated with the V2G planning model, we introduce a series of linearization methods to obtain a manageable Mixed-Integer Linear Programming (MILP) solution. Finally, to validate the efficacy of our proposed planning framework, we apply it to two test systems, including a real-world case study. Through these case studies, we explore the necessity and potential benefits of V2G technologies.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Speeding up and reducing memory usage for scientific machine learning via mixed precision

Scientific machine learning (SciML) has emerged as a versatile approach to address complex computational science and engineering problems. Within this field, physics-informed neural networks (PINNs) and deep operator networks (DeepONets) stand out as the leading techniques for solving partial differential equations by incorporating both physical equations and experimental data. However, training PINNs and DeepONets require significant computational resources, including long computational times and large amounts of memory. In search of computational efficiency, training neural networks using half precision (float16) rather than the conventional single (float32) or double (float64) precision has gained substantial interest, given the inherent benefits of reduced computational time and memory consumed. However, we find that float16 cannot be applied to SciML methods, because of gradient divergence at the start of training, weight updates going to zero, and the inability to converge to a local minima. To overcome these limitations, we explore mixed precision, which is an approach that combines the float16 and float32 numerical formats to reduce memory usage and increase computational speed. Our experiments showcase that mixed precision training not only substantially decreases training times and memory demands but also maintains model accuracy. Here, we also reinforce our empirical observations with a theoretical analysis. The research has broad implications for SciML in various computational applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Surrogate construction via weight parameterization of residual neural networks

Surrogate model development is a critical step for uncertainty quantification or other sample-intensive tasks for complex computational models. Here, in this work, we develop a multi-output surrogate form using a class of neural networks (NNs) that employ shortcut connections, namely Residual NNs (ResNets). ResNets are known to regularize the surrogate learning problem and improve the efficiency and accuracy of the resulting surrogate. Inspired by the continuous, Neural ODE analogy, we augment ResNets with weight parameterization strategy with respect to ResNet depth. Weight-parameterized ResNets regularize the NN surrogate learning problem and allow better generalization with a drastically reduced number of learnable parameters. We demonstrate that weight-parameterized ResNets are more accurate and efficient than conventional feed-forward multi-layer perceptron networks. We also compare various options for parameterization of the weights as functions of ResNet depth. We demonstrate the results on both synthetic examples and a large scale earth system model of interest.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A discontinuous Galerkin spectral element method for compressible reacting flows

High-order methods have recently been shown to be an effective tool for high-fidelity flow computations like direct numerical simulations and large-eddy simulations because of their strong balance between accuracy and computational cost. In this work, a high-order discontinuous Galerkin spectral element method (DGSEM) is developed to solve the chemically reacting Navier-Stokes equations. To handle the disparate length and time scales associated with these equations, we develop a novel method which combines the spectral accuracy of the SEM with the flexibility of the DG approach. The framework, implemented in the spectral element code Nek5000, is well suited to capture turbulence in smooth regions of the flow, while maintaining numerical stability in the presence of shocks. An entropy-residual based artificial viscosity is added to smooth shocked regions of flow, and a positivity-preserving limiter is implemented to suppress non-physical oscillations. These enhancements support the numerical stability of the hydrodynamic sub-step, which is decoupled from the chemistry integration through a second-order operator splitting method. Here, a series of smooth and discontinuous validation cases are presented in increasing physical and computational complexity for both inviscid and viscous flows. In particular, simulations of canonical one-dimensional and two-dimensional detonations are performed, and the high-order numerical results are validated against available literature data. Additional validation studies are carried out for classical three-dimensional numerical simulations of incompressible and compressible turbulent flows.

Compressible reacting flows↗
DOE OSTI2026

Comparative Analysis of Model Predictive Control and MPC-Informed Rule-Based Control for Thermal Storage Operation in Ultra-Low Temperature 4th Generation District Heating Networks

The integration of thermal storage and heat pumps in district heating networks (DHNs) can significantly enhance operational flexibility and energy efficiency; however, the practical deployment of advanced control strategies is often hindered by forecasting requirements and computational complexity. This study presents a comparative analysis of thermal storage control strategies in an ultra-low-temperature fourth-generation DHN, focusing on the development of a simplified rule-based control (RBC) explicitly informed by Model Predictive Control (MPC) behavior. The proposed methodology systematically analyzes the charging and discharging decisions of an MPC-controlled system under ideal forecasting conditions and extracts recurrent control patterns as a function of key system variables, including outdoor temperature, thermal demand, and electricity price. These patterns are translated into a set of structured time- and condition-based rules, resulting in an MPC-informed RBC that embeds predictive insights while preserving implementation simplicity and operational transparency. The approach is validated on a realistic mixed-use urban district in Denver, Colorado, USA, equipped with a centralized air-source heat pump, distributed water-to-water heat pumps, and a central thermal storage unit. Results show that the tuned RBC attains approximately 96% of ideal MPC economic performance (-27% of costs), preserves values of technical and environmental indicators (reduction only of 2-3%), and substantially reduces complexity. Sensitivity analyses further demonstrate the robustness of the RBC under varying operational conditions (i.e., ambient temperature, electricity price). Overall, the study demonstrates that MPC-informed rule-based control represents an effective trade-off between control performance and real-world applicability, enabling the integration of additional system components while maintaining simplicity, robustness, and ease of implementation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

Bayesian calibration and uncertainty quantification of a rate-dependent cohesive zone model for polymer interfaces

In this work we present a rate-dependent cohesive zone model for the fracture of polymeric interfaces and performs a Bayesian calibration, an uncertainty quantification, and a sensitivity analysis for the model. The proposed cohesive zone model accounts for both reversible elastic and irreversible rate-dependent separation sliding deformation at the interface. The viscous dissipation due to the irreversible opening at the interface is modeled using elastic-viscoplastic kinematics that incorporates the effects of strain rate. Inverse calibration of parameters for such complex models through trial and error is challenging due to the large number of parameters of the model. Moreover, the calibrated parameter values are often non-unique and uncertain when the available experimental data is limited. To tackle this challenge, we employ a Bayesian calibration approach to identify parameters from experimental data, the resulting parameters significantly enhance the accuracy of the model. To quantify the uncertainty associated with the inverse parameter estimation, a modular Bayesian approach is employed to calibrate the unknown model parameters, accounting for the parameter uncertainty of the cohesive zone model. The advantages of the Bayesian calibration over a deterministic parameter fit are demonstrated. Further, to quantify the model uncertainties, such as incorrect assumptions or missing physics, a discrepancy function is introduced, which significantly improves the model’s prediction. Finally, the total uncertainty of the model is quantified in a predictive setting. A sensitivity analysis is performed to assess how changes in the input variables of the model affect the peak load, facilitating the identification of a concise set of highly influential parameters. The present approach can be used for calibration and uncertainty quantification for other complex computational mechanics models. It should also facilitate the designing of interface materials under uncertainty.

42 ENGINEERING↗