اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTwo-level a posteriori error estimation for adaptive multilevel stochastic Galerkin FEM
174
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The paper considers a class of parametric elliptic partial differential equations (PDEs), where the coefficients and the right-hand side function depend on infinitely many (uncertain) parameters. We introduce a two-level a posteriori estimator to control the energy error in multilevel stochastic Galerkin approximations for this class of PDE problems. We prove that the two-level estimator always provides a lower bound for the unknown approximation error, while the upper bound is equivalent to a saturation assumption. We propose and empirically compare three adaptive algorithms, where the structure of the estimator is exploited to perform spatial refinement as well as parametric enrichment. The paper also discusses implementation aspects of computing multilevel stochastic Galerkin approximations.
قيم البحث
اقرأ أيضاً
Partial differential equations (PDEs) with inputs that depend on infinitely many parameters pose serious theoretical and computational challenges. Sophisticated numerical algorithms that automatically determine which parameters need to be activated i
n the approximation space in order to estimate a quantity of interest to a prescribed error tolerance are needed. For elliptic PDEs with parameter-dependent coefficients, stochastic Galerkin finite element methods (SGFEMs) have been well studied. Under certain assumptions, it can be shown that there exists a sequence of SGFEM approximation spaces for which the energy norm of the error decays to zero at a rate that is independent of the number of input parameters. However, it is not clear how to adaptively construct these spaces in a practical and computationally efficient way. We present a new adaptive SGFEM algorithm that tackles elliptic PDEs with parameter-dependent coefficients quickly and efficiently. We consider approximation spaces with a multilevel structure---where each solution mode is associated with a finite element space on a potentially different mesh---and use an implicit a posteriori error estimation strategy to steer the adaptive enrichment of the space. At each step, the components of the error estimator are used to assess the potential benefits of a variety of enrichment strategies, including whether or not to activate more parameters. No marking or tuning parameters are required. Numerical experiments for a selection of test problems demonstrate that the new method performs optimally in that it generates a sequence of approximations for which the estimated energy error decays to zero at the same rate as the error for the underlying finite element method applied to the associated parameter-free problem.
We propose and analyze novel adaptive algorithms for the numerical solution of elliptic partial differential equations with parametric uncertainty. Four different marking strategies are employed for refinement of stochastic Galerkin finite element ap
proximations. The algorithms are driven by the energy error reduction estimates derived from two-level a posteriori error indicators for spatial approximations and hierarchical a posteriori error indicators for parametric approximations. The focus of this work is on the mathematical foundation of the adaptive algorithms in the sense of rigorous convergence analysis. In particular, we prove that the proposed algorithms drive the underlying energy error estimates to zero.
The focus of this work is a posteriori error estimation for stochastic Galerkin approximations of parameter-dependent linear elasticity equations. The starting point is a three-field PDE model in which the Youngs modulus is an affine function of a co
untable set of parameters. We analyse the weak formulation, its stability with respect to a weighted norm and discuss approximation using stochastic Galerkin mixed finite element methods (SG-MFEMs). We introduce a novel a posteriori error estimation scheme and establish upper and lower bounds for the SG-MFEM error. The constants in the bounds are independent of the Poisson ratio as well as the SG-MFEM discretisation parameters. In addition, we discuss proxies for the error reduction associated with certain enrichments of the SG-MFEM spaces and we use these to develop an adaptive algorithm that terminates when the estimated error falls below a user-prescribed tolerance. We prove that both the a posteriori error estimate and the error reduction proxies are reliable and efficient in the incompressible limit case. Numerical results are presented to validate the theory. All experiments were performed using open source (IFISS) software that is available online.
Hybrid quantum/molecular mechanics models (QM/MM methods) are widely used in material and molecular simulations when MM models do not provide sufficient accuracy but pure QM models are computationally prohibitive. Adaptive QM/MM coupling methods feat
ure on-the-fly classification of atoms during the simulation, allowing the QM and MM subsystems to be updated as needed. In this work, we propose such an adaptive QM/MM method for material defect simulations based on a new residual based it a posteriori error estimator, which provides both lower and upper bounds for the true error. We validate the analysis and illustrate the effectiveness of the new scheme on numerical simulations for material defects.
Stochastic Galerkin methods for non-affine coefficient representations are known to cause major difficulties from theoretical and numerical points of view. In this work, an adaptive Galerkin FE method for linear parametric PDEs with lognormal coeffic
ients discretized in Hermite chaos polynomials is derived. It employs problem-adapted function spaces to ensure solvability of the variational formulation. The inherently high computational complexity of the parametric operator is made tractable by using hierarchical tensor representations. For this, a new tensor train format of the lognormal coefficient is derived and verified numerically. The central novelty is the derivation of a reliable residual-based a posteriori error estimator. This can be regarded as a unique feature of stochastic Galerkin methods. It allows for an adaptive algorithm to steer the refinements of the physical mesh and the anisotropic Wiener chaos polynomial degrees. For the evaluation of the error estimator to become feasible, a numerically efficient tensor format discretization is developed. Benchmark examples with unbounded lognormal coefficient fields illustrate the performance of the proposed Galerkin discretization and the fully adaptive algorithm.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
