A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computational Science and Engineering
Elliptic problems with multiscale coefficients have been studied to a great extent recently. Preconditioners based on standard domain decomposition methods often perform poorly when the variation of the coefficients inside the subdomains is large. In this paper we study the behaviour of domain decomposition methods based on linear coarsening for such problems and we also propose improved methods which use the notion of multiscale finite elements to define coarsening operators.doi:10.1007/978-3-540-34469-8_71 fatcat:zu6rpxsqzveihdre7ffaqw34xi