اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGoal-oriented error estimation and adaptivity for elliptic PDEs with parametric or uncertain inputs
217
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We use the ideas of goal-oriented error estimation and adaptivity to design and implement an efficient adaptive algorithm for approximating linear quantities of interest derived from solutions to elliptic partial differential equations (PDEs) with parametric or uncertain inputs. In the algorithm, the stochastic Galerkin finite element method (sGFEM) is used to approximate the solutions to primal and dual problems that depend on a countably infinite number of uncertain parameters. Adaptive refinement is guided by an innovative strategy that combines the error reduction indicators computed for spatial and parametric components of the primal and dual solutions. The key theoretical ingredient is a novel two-level a posteriori estimate of the energy error in sGFEM approximations. We prove that this error estimate is reliable and efficient. The effectiveness of the goal-oriented error estimation strategy and the performance of the goal-oriented adaptive algorithm are tested numerically for three representative model problems with parametric coefficients and for three quantities of interest (including the approximation of pointwise values).
قيم البحث
اقرأ أيضاً
This paper introduces a new computational methodology for determining a-posteriori multi-objective error estimates for finite-element approximations, and for constructing corresponding (quasi-)optimal adaptive refinements of finite-element spaces. As
opposed to the classical goal-oriented approaches, which consider only a single objective functional, the presented methodology applies to general closed convex subsets of the dual space and constructs a worst-case error estimate of the finite-element approximation error. This worst-case multi-objective error estimate conforms to a dual-weighted residual, in which the dual solution is associated with an approximate supporting functional of the objective set at the approximation error. We regard both standard approximation errors and data-incompatibility errors associated with incompatibility of boundary data with the trace of the finite-element space. Numerical experiments are presented to demonstrate the efficacy of applying the proposed worst-case multi-objective error in adaptive refinement procedures.
We consider adaptive approximations of the parameter-to-solution map for elliptic operator equations depending on a large or infinite number of parameters, comparing approximation strategies of different degrees of nonlinearity: sparse polynomial exp
ansions, general low-rank approximations separating spatial and parametric variables, and hierarchical tensor decompositions separating all variables. We describe corresponding adaptive algorithms based on a common generic template and show their near-optimality with respect to natural approximability assumptions for each type of approximation. A central ingredient in the resulting bounds for the total computational complexity are new operator compression results for the case of infinitely many parameters. We conclude with a comparison of the complexity estimates based on the actual approximability properties of classes of parametric model problems, which shows that the computational costs of optimized low-rank expansions can be significantly lower or higher than those of sparse polynomial expansions, depending on the particular type of parametric problem.
A general adaptive refinement strategy for solving linear elliptic partial differential equation with random data is proposed and analysed herein. The adaptive strategy extends the a posteriori error estimation framework introduced by Guignard and No
bile in 2018 (SIAM J. Numer. Anal., 56, 3121--3143) to cover problems with a nonaffine parametric coefficient dependence. A suboptimal, but nonetheless reliable and convenient implementation of the strategy involves approximation of the decoupled PDE problems with a common finite element approximation space. Computational results obtained using such a single-level strategy are presented in this paper (part I). Results obtained using a potentially more efficient multilevel approximation strategy, where meshes are individually tailored, will be discussed in part II of this work. The codes used to generate the numerical results are available online.
Linear poroelasticity models have a number of important applications in biology and geophysics. In particular, Biots consolidation model is a well-known model that describes the coupled interaction between the linear response of a porous elastic medi
um and a diffusive fluid flow within it, assuming small deformations. Although deterministic linear poroelasticity models and finite element methods for solving them numerically have been well studied, there is little work to date on robust algorithms for solving poroelasticity models with uncertain inputs and for performing uncertainty quantification (UQ). The Biot model has a number of important physical parameters and inputs whose precise values are often uncertain in real world scenarios. In this work, we introduce and analyse the well-posedness of a new five-field model with uncertain and spatially varying Youngs modulus and hydraulic conductivity field. By working with a properly weighted norm, we establish that the weak solution is stable with respect to variations in key physical parameters, including the Poisson ratio. We then introduce a novel locking-free stochastic Galerkin mixed finite element method that is robust in the incompressible limit. Armed with the `right norm, we construct a parameter-robust preconditioner for the associated discrete systems. Our new method facilitates forward UQ, allowing efficient calculation of statistical quantities of interest and is provably robust with respect to variations in the Poisson ratio, the Biot--Willis constant and the storage coefficient, as well as the discretization parameters.
This paper studies numerical methods for the approximation of elliptic PDEs with lognormal coefficients of the form $-{rm div}(a abla u)=f$ where $a=exp(b)$ and $b$ is a Gaussian random field. The approximant of the solution $u$ is an $n$-term polyno
mial expansion in the scalar Gaussian random variables that parametrize $b$. We present a general convergence analysis of weighted least-squares approximants for smooth and arbitrarily rough random field, using a suitable random design, for which we prove optimality in the following sense: their convergence rate matches exactly or closely the rate that has been established in cite{BCDM} for best $n$-term approximation by Hermite polynomials, under the same minimial assumptions on the Gaussian random field. This is in contrast with the current state of the art results for the stochastic Galerkin method that suffers the lack of coercivity due to the lognormal nature of the diffusion field. Numerical tests with $b$ as the Brownian bridge confirm our theoretical findings.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
