Inproceedings,

Block Preconditioners for the Incompressible Stokes Problem

, , and .
Large-Scale Scientific Computing, volume 5910 of Lecture Notes in Computer Science, page 829–836. Berlin, Springer, (2010)
DOI: 10.1007/978-3-642-12535-5_99

Abstract

This paper discusses the solution of the Stokes problem using block preconditioned iterative methods. Block preconditioners are based on the block factorization of the discretized problem. We focus on two specific types: SIMPLE-type preconditioners and the LSC preconditioner. Both methods use scaling to improve their performance. We test convergence of GCR in combination with these preconditioners both for a constant and a non-constant viscosity Stokes problem.

Tags

Users

  • @gdmcbain

Comments and Reviews