.png){kind=icon}
Return
Algebraic two-level preconditioners for the Schur complement method
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827598340809.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The solution of elliptic problems is challenging on parallel distributed memory computers since their Green's functions are global. To address this issue, we present a set of preconditioners for the Schur complement domain decomposition method. They implement a global coupling mechanism, through coarse-space components, similar to the one proposed in [Bramble, Pasciak, and Shatz, Math. Comp., 47 (1986), pp. 103-134]. The definition of the coarse-space components is algebraic; they are defined using the mesh partitioning information and simple interpolation operators. These preconditioners are implemented on distributed memory computers without introducing any new global synchronization in the preconditioned conjugate gradient iteration. The numerical and parallel scalability of those preconditioners are illustrated on two-dimensional model examples that have anisotropy and/or discontinuity phenomena.
Keywords:
domain decomposition
two-level preconditioning
Schur complement
parallel distributed computing
elliptic partial differential equations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available
Cited Papers
Genes and proteins associated with ribeye area and meat tenderness in a commercial Nellore cattle population.png)
Genome
OAAI
GenomeIF0
OAAIShareSave
ShareSaveMathematical modelling of arsenic transport, distribution and detoxification processes in yeast
PREAI
ShareSave
View more