Acceleration of convergence of a two-level algorithm by smoothing transfer operators
The technique for accelerating the convergence of the algebraic multigrid method is proposed.
The technique for accelerating the convergence of the algebraic multigrid method is proposed.
This paper provides an accelerated two-grid stabilized mixed finite element scheme for the Stokes eigenvalue problem based on the pressure projection. With the scheme, the solution of the Stokes eigenvalue problem on a fine grid is reduced to the solution of the Stokes eigenvalue problem on a much coarser grid and the solution of a linear algebraic system on the fine grid. By solving a slightly different linear problem on the fine grid, the new algorithm significantly improves the theoretical error...
The reduced basis method is a model reduction technique yielding substantial savings of computational time when a solution to a parametrized equation has to be computed for many values of the parameter. Certification of the approximation is possible by means of an a posteriori error bound. Under appropriate assumptions, this error bound is computed with an algorithm of complexity independent of the size of the full problem. In practice, the evaluation of the error bound can become very sensitive...
We introduce a new tool for obtaining efficient a posteriori estimates of errors of approximate solutions of differential equations the data of which depend linearly on random parameters. The solution method is the stochastic Galerkin method. Polynomial chaos expansion of the solution is considered and the approximation spaces are tensor products of univariate polynomials in random variables and of finite element basis functions. We derive a uniform upper bound to the strengthened Cauchy-Bunyakowski-Schwarz...
We consider a general abstract framework of a continuous elliptic problem set on a Hilbert space V that is approximated by a family of (discrete) problems set on a finite-dimensional space of finite dimension not necessarily included into V. We give a series of realistic conditions on an error estimator that allows to conclude that the marking strategy of bulk type leads to the geometric convergence of the adaptive algorithm. These conditions are then verified for different concrete problems...
In this paper we propose and analyze stable variational formulations for convection diffusion problems starting from concepts introduced by Sangalli. We derive efficient and reliable a posteriori error estimators that are based on these formulations. The analysis of resulting adaptive solution concepts, when specialized to the setting suggested by Sangalli’s work, reveals partly unexpected phenomena related to the specific nature of the norms induced by the variational formulation. Several remedies,...
In this paper we propose and analyze stable variational formulations for convection diffusion problems starting from concepts introduced by Sangalli. We derive efficient and reliable a posteriori error estimators that are based on these formulations. The analysis of resulting adaptive solution concepts, when specialized to the setting suggested by Sangalli’s work, reveals partly unexpected phenomena related to the specific nature of the norms induced by the variational formulation. Several remedies,...
An iterative procedure containing two parameters for solving linear algebraic systems originating from the domain decomposition technique is proposed. The optimization of the parameters is investigated. A numerical example is given as an illustration.
We generalize the overlapping Schwarz domain decomposition method to problems of linear elasticity. The convergence rate independent of the mesh size, coarse-space size, Korn’s constant and essential boundary conditions is proved here. Abstract convergence bounds developed here can be used for an analysis of the method applied to singular perturbations of other elliptic problems.