Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAcceleration of Uncertainty Updating in the Description of Transport Processes in Heterogeneous Materials
75
0
0.0
(
0
)
Added by
Jan Sykora
Publication date
2011
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The prediction of thermo-mechanical behaviour of heterogeneous materials such as heat and moisture transport is strongly influenced by the uncertainty in parameters. Such materials occur e.g. in historic buildings, and the durability assessment of these therefore needs a reliable and probabilistic simulation of transport processes, which is related to the suitable identification of material parameters. In order to include expert knowledge as well as experimental results, one can employ an updating procedure such as Bayesian inference. The classical probabilistic setting of the identification process in Bayess form requires the solution of a stochastic forward problem via computationally expensive sampling techniques, which makes the method almost impractical. In this paper novel stochastic computational techniques such as the stochastic Galerkin method are applied in order to accelerate the updating procedure. The idea is to replace the computationally expensive forward simulation via the conventional finite element (FE) method by the evaluation of a polynomial chaos expansion (PCE). Such an approximation of the FE model for the forward simulation perfectly suits the Bayesian updating. The presented uncertainty updating techniques are applied to the numerical model of coupled heat and moisture transport in heterogeneous materials with spatially varying coefficients defined by random fields.
rate research
Read More
We present a new methodology for calculating the electromagnetic radiation from accelerated charged particles. Our formulation --- the `endpoint formulation --- combines numerous results developed in the literature in relation to radiation arising from particle acceleration using a complete, and completely general, treatment. We do this by describing particle motion via a series of discrete, instantaneous acceleration events, or `endpoints, with each such event being treated as a source of emission. This method implicitly allows for particle creation/destruction, and is suited to direct numerical implementation in either the time- or frequency-domains. In this paper, we demonstrate the complete generality of our method for calculating the radiated field from charged particle acceleration, and show how it reduces to the classical named radiation processes such as synchrotron, Tamms description of Vavilov-Cherenkov, and transition radiation under appropriate limits. Using this formulation, we are immediately able to answer outstanding questions regarding the phenomenology of radio emission from ultra-high-energy particle interactions in both the Earths atmosphere and the Moon. In particular, our formulation makes it apparent that the dominant emission component of the Askaryan Effect (coherent radio-wave radiation from high-energy particle cascades in dense media) comes from coherent `bremsstrahlung from particle acceleration, rather than coherent Vavilov-Cherenkov radiation.
This paper describes the model updating procedure implemented in NOSA-ITACA, a finite-element code for the structural analysis of masonry constructions of historical interest. The procedure, aimed at matching experimental frequencies and mode shapes, allows fine-tuning calculation of the free parameters in the model. The numerical method is briefly described, and some issues related to its robustness are addressed. The procedure is then applied to a simple case study and two historical structures in Tuscany, the Clock Tower in Lucca and the Maddalena bridge in Borgo a Mozzano.
This article presents numerical investigations on accuracy and convergence properties of several numerical approaches for simulating steady state flows in heterogeneous aquifers. Finite difference, finite element, discontinuous Galerkin, spectral, and random walk methods are tested on one- and two-dimensional benchmark flow problems. Realizations of log-normal hydraulic conductivity fields are generated by Kraichnan algorithms in closed form as finite sums of random periodic modes, which allow direct code verification by comparisons with manufactured reference solutions. The quality of the methods is assessed for increasing number of random modes and for increasing variance of the log-hydraulic conductivity fields with Gaussian and exponential correlation. Experimental orders of convergence are calculated from successive refinements of the grid. The numerical methods are further validated by comparisons between statistical inferences obtained from Monte Carlo ensembles of numerical solutions and theoretical first-order perturbation results. It is found that while for Gaussian correlation of the log-conductivity field all the methods perform well, in the exponential case their accuracy deteriorates and, for large variance and number of modes, the benchmark problems are practically not tractable with reasonably large computing resources, for all the methods considered in this study.
Neurons exhibit complex geometry in their branched networks of neurites which is essential to the function of individual neuron but also brings challenges to transport a wide variety of essential materials throughout their neurite networks for their survival and function. While numerical methods like isogeometric analysis (IGA) have been used for modeling the material transport process via solving partial differential equations (PDEs), they require long computation time and huge computation resources to ensure accurate geometry representation and solution, thus limit their biomedical application. Here we present a graph neural network (GNN)-based deep learning model to learn the IGA-based material transport simulation and provide fast material concentration prediction within neurite networks of any topology. Given input boundary conditions and geometry configurations, the well-trained model can predict the dynamical concentration change during the transport process with an average error less than 10% and 120~330 times faster compared to IGA simulations. The effectiveness of the proposed model is demonstrated within several complex neurite networks.
In brittle fracture applications, failure paths, regions where the failure occurs and damage statistics, are some of the key quantities of interest (QoI). High-fidelity models for brittle failure that accurately predict these QoI exist but are highly computationally intensive, making them infeasible to incorporate in upscaling and uncertainty quantification frameworks. The goal of this paper is to provide a fast heuristic to reasonably estimate quantities such as failure path and damage in the process of brittle failure. Towards this goal, we first present a method to predict failure paths under tensile loading conditions and low-strain rates. The method uses a $k$-nearest neighbors algorithm built on fracture process zone theory, and identifies the set of all possible pre-existing cracks that are likely to join early to form a large crack. The method then identifies zone of failure and failure paths using weighted graphs algorithms. We compare these failure paths to those computed with a high-fidelity model called the Hybrid Optimization Software Simulation Suite (HOSS). A probabilistic evolution model for average damage in a system is also developed that is trained using 150 HOSS simulations and tested on 40 simulations. A non-parametric approach based on confidence intervals is used to determine the damage evolution over time along the dominant failure path. For upscaling, damage is the key QoI needed as an input by the continuum models. This needs to be informed accurately by the surrogate models for calculating effective modulii at continuum-scale. We show that for the proposed average damage evolution model, the prediction accuracy on the test data is more than 90%. In terms of the computational time, the proposed models are $approx mathcal{O}(10^6)$ times faster compared to high-fidelity HOSS.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
