𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Schur complement domain decomposition algorithms for spectral methods

✍ Scribed by Tony F. Chan; Danny Goovaerts


Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
702 KB
Volume
6
Category
Article
ISSN
0168-9274

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Robust domain decomposition algorithms f
✍ I.G. Graham; R. Scheichl πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 313 KB

## Abstract In this article, we describe a new class of domain decomposition preconditioners suitable for solving elliptic PDEs in highly fractured or heterogeneous media, such as arise in groundwater flow or oil recovery applications. Our methods employ novel coarsening operators, which are adapte

Robust Schur complement method for stron
✍ Boris N. Khoromskij; Gabriel Wittum πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 214 KB πŸ‘ 1 views

We present robust and asymptotically optimal iterative methods for solving 2D anisotropic elliptic equations with strongly jumping coefficients, where the direction of anisotropy may change sharply between adjacent subdomains. The idea of a stable preconditioning for the Schur complement matrix is b

Projected Schur complement method for so
✍ J. Haslinger; T. Kozubek; R. Kučera; G. Peichl πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 577 KB

## Abstract This paper deals with a fast method for solving large‐scale algebraic saddle‐point systems arising from fictitious domain formulations of elliptic boundary value problems. A new variant of the fictitious domain approach is analyzed. Boundary conditions are enforced by control variables