๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Overlapping Domain Decomposition Algorithms for General Sparse Matrices

โœ Scribed by Xiao-Chuan Cai; Yousef Saad

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
856 KB
Volume
3
Category
Article
ISSN
1070-5325

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 subproblems are created with an overlapping partition of the graph corresponding to the sparsity structure of the matrix. These algebraic domain decomposition methods are especially useful for unstructured mesh problems. We also discuss some difficulties encountered in the algebraic extension, particularly the issues related to the coarse solver.

๐Ÿ“œ SIMILAR VOLUMES

Robust domain decomposition algorithms f
Robust domain decomposition algorithms for multiscale PDEs
โœ 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

Overlap domain decomposition method for
Overlap domain decomposition method for bioluminescence tomography (BLT)
โœ Tao Wang; Shuping Gao; Ling Zhang; Yan Wu; Xiaowei He; Yanbin Hou; Heyu Huang; J ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 356 KB

## Abstract Bioluminescence tomography (BLT) allows __in vivo__ localization and quantification of bioluminescent sources inside a small animal to reveal various molecular and cellular activities. In this paper, the overlap domain decomposition method (ODDM) of BLT is proposed, which refers to divi

Numerical Algorithms Based on Characteri
Numerical Algorithms Based on Characteristic Domain Decomposition for Obstacle Problems
โœ 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