Displaying similar documents to “Multigrid for the Wilson mortar element method.”

A multilevel preconditioner for the mortar method for nonconforming finite element

Talal Rahman, Xuejun Xu (2009)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

A multilevel preconditioner based on the abstract framework of the auxiliary space method, is developed for the mortar method for the nonconforming finite element or the lowest order Crouzeix-Raviart finite element on nonmatching grids. It is shown that the proposed preconditioner is quasi-optimal in the sense that the condition number of the preconditioned system is independent of the mesh size, and depends only quadratically on the number of refinement levels. Some...

A finite element method for domain decomposition with non-matching grids

Roland Becker, Peter Hansbo, Rolf Stenberg (2003)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

In this note, we propose and analyse a method for handling interfaces between non-matching grids based on an approach suggested by Nitsche (1971) for the approximation of Dirichlet boundary conditions. The exposition is limited to self-adjoint elliptic problems, using Poisson’s equation as a model. A priori and a posteriori error estimates are given. Some numerical results are included.

A short philosophical note on the origin of smoothed aggregations

Fraňková, Pavla, Hanuš, Milan, Kopincová, Hana, Kužel, Roman, Vaněk, Petr, Vastl, Zbyněk

Similarity:

We derive the smoothed aggregation two-level method from the variational objective to minimize the final error after finishing the entire iteration. This contrasts to a standard variational two-level method, where the coarse-grid correction vector is chosen to minimize the error after coarse-grid correction procedure, which represents merely an intermediate stage of computing. Thus, we enforce the global minimization of the error. The method with smoothed prolongator is thus interpreted...

Convergence and quasi-optimal complexity of a simple adaptive finite element method

Roland Becker, Shipeng Mao (2009)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We prove convergence and quasi-optimal complexity of an adaptive finite element algorithm on triangular meshes with standard mesh refinement. Our algorithm is based on an adaptive marking strategy. In each iteration, a simple edge estimator is compared to an oscillation term and the marking of cells for refinement is done according to the dominant contribution only. In addition, we introduce an adaptive stopping criterion for iterative solution which compares an estimator for the iteration...

Algebraic domain decomposition solver for linear elasticity

Aleš Janka (1999)

Applications of Mathematics

Similarity:

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.