اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAdditive average Schwarz with adaptive coarse spaces: scalable algorithms for multiscale problems
150
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present an analysis of the additive average Schwarz preconditioner with two newly proposed adaptively enriched coarse spaces which was presented at the 23rd International conference on domain decomposition methods in Korea, for solving second order elliptic problems with highly varying and discontinuous coefficients. It is shown that the condition number of the preconditioned system is bounded independently of the variations and the jumps in the coefficient, and depends linearly on the mesh parameter ratio H/h, that is the ratio between the subdomain size and the mesh size, thereby retaining the same optimality and scalablity of the original additive average Schwarz preconditioner.
قيم البحث
اقرأ أيضاً
The goal of this work is to construct and study hybrid and multiplicative two-level overlapping Schwarz algorithms with standard coarse spaces for the almost incompressible linear elasticity and Stokes systems, discretized by mixed finite and spectra
l element methods with discontinuous pressures. Two different approaches are considered to solve the resulting saddle point systems: a) a preconditioned conjugate gradient (PCG) method applied to the symmetric positive definite reformulation of the almost incompressible linear elasticity system obtained by eliminating the pressure unknowns; b) a GMRES method with indefinite overlapping Schwarz preconditioner applied directly to the saddle point formulation of both the elasticity and Stokes systems. Condition number estimates and convergence properties of the proposed hybrid and multiplicative overlapping Schwarz algorithms are proven for the positive definite reformulation of almost incompressible elasticity. These results are based on our previous study [8] where only additive Schwarz preconditioners were considered for almost incompressible elasticity. Extensive numerical experiments with both finite and spectral elements show that the proposed overlapping Schwarz preconditioners are scalable, quasi-optimal in the number of unknowns across individual subdomains and robust with respect to discontinuities of the material parameters across subdomains interfaces. The results indicate that the proposed preconditioners retain a good performance also when the quasi-monotonicity assumption, required by the available theory, does not hold.
In this paper, we study temporal splitting algorithms for multiscale problems. The exact fine-grid spatial problems typically require some reduction in degrees of freedom. Multiscale algorithms are designed to represent the fine-scale details on a co
arse grid and, thus, reduce the problems size. When solving time-dependent problems, one can take advantage of the multiscale decomposition of the solution and perform temporal splitting by solving smaller-dimensional problems, which is studied in the paper. In the proposed approach, we consider the temporal splitting based on various low dimensional spatial approximations. Because a multiscale spatial splitting gives a good decomposition of the solution space, one can achieve an efficient implicit-explicit temporal discretization. We present a recently developed theoretical result in our earlier work and adopt it in this paper for multiscale problems. Numerical results are presented to demonstrate the efficiency of the proposed splitting algorithm.
A symmetric and a nonsymmetric variant of the additive Schwarz preconditioner are proposed for the solution of a nonsymmetric system of algebraic equations arising from a general finite volume element discretization of symmetric elliptic problems wit
h large jumps in the entries of the coefficient matrices across subdomains. It is shown in the analysis, that the convergence of the preconditioned GMRES iteration with the proposed preconditioners, depends polylogarithmically on the mesh parameters, in other words, the convergence is only weakly dependent on the mesh parameters, and it is robust with respect to the jumps in the coefficients.
Based on an observation that additive Schwarz methods for general convex optimization can be interpreted as gradient methods, we propose an acceleration scheme for additive Schwarz methods. Adopting acceleration techniques developed for gradient meth
ods such as momentum and adaptive restarting, the convergence rate of additive Schwarz methods is greatly improved. The proposed acceleration scheme does not require any a priori information on the levels of smoothness and sharpness of a target energy functional, so that it can be applied to various convex optimization problems. Numerical results for linear elliptic problems, nonlinear elliptic problems, nonsmooth problems, and nonsharp problems are provided to highlight the superiority and the broad applicability of the proposed scheme.
In this paper we design and analyze a uniform preconditioner for a class of high order Discontinuous Galerkin schemes. The preconditioner is based on a space splitting involving the high order conforming subspace and results from the interpretation o
f the problem as a nearly-singular problem. We show that the proposed preconditioner exhibits spectral bounds that are uniform with respect to the discretization parameters, i.e., the mesh size, the polynomial degree and the penalization coefficient. The theoretical estimates obtained are supported by several numerical simulations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
