SearcharxivSearch

arXiv · 2009.00354

Non-intrusive and semi-intrusive uncertainty quantification of a multiscale in-stent restenosis model

Abstract

Uncertainty estimations are presented of the response of a multiscale in-stent restenosis model, as obtained by both non-intrusive and semi-intrusive uncertainty quantification. The in-stent restenosis model is a fully coupled multiscale simulation of post-stenting tissue growth, in which the most costly submodel is the blood flow simulation. Surrogate modeling for non-intrusive uncertainty quantification takes the whole model as a black-box and maps directly from the three uncertain inputs to the quantity of interest, the neointimal area. The corresponding uncertain estimates matched the results from quasi-Monte Carlo simulations well. In the semi-intrusive uncertainty quantification, the most expensive submodel is replaced with a surrogate model. We developed a surrogate model for the blood flow simulation by using a convolutional neural network. The semi-intrusive method with the new surrogate model offered efficient estimates of uncertainty and sensitivity while keeping relatively high accuracy. It outperformed the result obtained with earlier surrogate models. It also achieved the estimates comparable to the non-intrusive method with similar efficiency. Presented results on uncertainty propagation with non-intrusive and semi-intrusive metamodeling methods allow us to draw some conclusions on the advantages and limitations of these methods.

Explore related subjects

Keep this discovery

BibTeXRIS

Dongwei Ye, Anna Nikishova, Lourens Veen, Pavel Zun, Alfons G. Hoekstra. 2020-09-01. Non-intrusive and semi-intrusive uncertainty quantification of a multiscale in-stent restenosis model. https://doi.org/10.1016/j.ress.2021.107734

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO