𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Robust domain decomposition algorithms for multiscale PDEs

✍ Scribed by I.G. Graham; R. Scheichl


Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
313 KB
Volume
23
Category
Article
ISSN
0749-159X

No coin nor oath required. For personal study only.

✦ Synopsis


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 adapted to the heterogeneity of the media. In contrast to standard methods (based on piecewise polynomial coarsening), the new methods can achieve robustness with respect to coefficient discontinuities even when these are not resolved by a coarse mesh. This situation arises often in practical flow computation, in both the deterministic and (Monte‐Carlo simulated) stochastic cases. An example of a suitable coarsener is provided by multiscale finite elements. In this article, we explore the linear algebraic aspects of the multiscale algorithm, showing that it involves a blend of both classical overlapping Schwarz methods and nonoverlapping Schur methods. We also extend the algorithm and the theory from its additive variant to obtain new hybrid and deflation variants. Finally, we give extensive numerical experiments on a range of heterogeneous media problems illustrating the properties of the methods. Β© 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 23: 859–878, 2007


πŸ“œ SIMILAR VOLUMES


Robust multiscale algorithms for gradien
✍ Qing-Hua Lu; Xian-Min Zhang πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 367 KB

Gradient-based techniques represent a very popular class of approaches to estimate motions. A robust multiscale algorithm of hierarchical estimation for gradient-based motion estimation is proposed in this article using a combination of robust statistical method and multiscale technique. In such a m

Overlapping Domain Decomposition Algorit
✍ Xiao-Chuan Cai; Yousef Saad πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 856 KB

Domain decomposition methods for finite element problems using a partition based on the underlying finite element mesh have been extensively studied. In this paper, we discuss algebraic extensions of the class of overlapping domain decomposition algorithms for general sparse matrices. The subproblem

Numerical Algorithms Based on Characteri
✍ Tarvainen, P. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 148 KB

A new numerical solution algorithm for obstacle problems is proposed, where the characteristic domain decomposition into active and inactive subdomains separated by the free boundary is approximated by a Schwarz method. Such an approach gives an opportunity to apply fast linear system solvers to gen