The main goal of this paper is to present new robust and scalable preconditioned conjugate gradient algorithms for solving Stokes equations with large viscosity jumps across subregion interfaces and discretized on non-structured meshes. The proposed algorithms do not require the construction of a coarse mesh and avoid expensive communications between coarse and fine levels. The algorithms belong to the family of preconditioners based on non-overlapping decomposition of subregions known as balancing domain decomposition methods. The local problems employ two-level element-wise/ subdomain-wise direct factorizations to reduce the size and the cost of the local Dirichlet and Neumann Stokes solvers. The Stokes coarse problem is based on subdomain constant pressures and on connected subdomain interface flux functions and rigid body motions. This guarantees scalability and solvability of the local Neumann problems. Estimates on the condition numbers and numerical experiments based on a parallel implementation for unstructured meshes are also discussed. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Conceição, D., Goldfeld, P., & Sarkis, M. (2007). Robust two-level lower-order preconditioners for a higher-order stokes discretization with highly discontinuous viscosities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4395 LNCS, pp. 319–333). Springer Verlag. https://doi.org/10.1007/978-3-540-71351-7_25
Mendeley helps you to discover research relevant for your work.