Name
Abstract | ||
|---|---|---|
We consider saddle point problems that result from the finite element discretization of stationary and nonstationary Stokes equations. Three efficient iterative solvers for these problems are treated, namely, the preconditioned conjugate gradient method introduced by Bramble and Pasciak, the preconditioned MINRES method, and a method due to Bank et al. We give a detailed overview of algorithmic aspects and theoretical convergence results. For the method of Bank et al. a new convergence analysis is presented. A comparative study of the three methods for a three-dimensional Stokes problem discretized by the Hood--Taylor P2-P1 finite element pair is given. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1137/040606028 | SIAM J. Scientific Computing |
Keywords | Field | DocType |
stokes equations,preconditioned conjugate gradient method,multigrid,fast iterative solvers,discrete stokes equations,new convergence analysis,algorithmic aspect,preconditioned minres,finite element discretization,comparative study,theoretical convergence result,three-dimensional stokes problem,nonstationary stokes equation,inexact uzawa methods,finite element pair,preconditioned minres method,stokes equation | Conjugate gradient method,Discretization,Mathematical optimization,Saddle point,Mathematical analysis,Iterative method,Finite element method,Numerical analysis,Multigrid method,Stokes flow,Mathematics | Journal |
Volume | Issue | ISSN |
27 | 2 | 1064-8275 |
Citations | PageRank | References |
18 | 2.20 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jörg Peters | 1 | 36 | 4.82 |
| Volker Reichelt | 2 | 29 | 3.47 |
| Arnold Reusken | 3 | 305 | 44.91 |