𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On preconditioners for mortar discretization of elliptic problems

✍ Scribed by M. Dryja; W. Proskurowski

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
147 KB
Volume
10
Category
Article
ISSN
1070-5325

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sine transform based preconditioners for
Sine transform based preconditioners for elliptic problems
✍ Raymond H. Chan; C. K. Wong πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 126 KB

We consider applying the preconditioned conjugate gradient (PCG) method to solving linear systems Ax = b where the matrix A comes from the discretization of second-order elliptic operators with Dirichlet boundary conditions. Let (L+ ) -1 (L t + ) denote the block Cholesky factorization of A with low

A Neumann–Neumann algorithm for a mortar
A Neumann–Neumann algorithm for a mortar finite element discretization of fourth-order elliptic problems in 2D
✍ Leszek Marcinkowski πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 168 KB

## Abstract Here we present and analyze a Neumann–Neumann algorithm for the mortar finite element discretization of elliptic fourth‐order problems with discontinuous coefficients. The fully parallel algorithm is analyzed using the abstract Schwarz framework, proving a convergence which is independe