Block preconditioners for the incompressible stokes problem

Authors:
M. ur Rehman;C. Vuik;G. Segal
Affiliations:
Faculty of Electrical Engineering, Mathematics and Computer Science, Delft Institute of Applied Mathematics, Delft University of Technology, CD Delft, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Science, Delft Institute of Applied Mathematics, Delft University of Technology, CD Delft, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Science, Delft Institute of Applied Mathematics, Delft University of Technology, CD Delft, The Netherlands
Venue:
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
Year:
2009

Citing 2
Cited 0

Efficient management of parallelism in object-oriented numerical software libraries

Modern software tools for scientific computing
Block Preconditioners Based on Approximate Commutators

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

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.