Fast Solvers for Mixed Finite Element Methods
Discretizations of partial differential equations by mixed finite element methods result in large saddle point systems that require efficient solvers. In this chapter we present two classes of iterative methods for such problems: the (preconditioned) Uzawa algorithm and the (preconditioned) minimum residual algorithm. The implementations of these algorithms require either efficient preconditioners for the discrete Laplace operator and/or the efficient solution of the discrete Poisson problem. Towards this end we provide brief introductions to additive Schwarz (domain decomposition/multilevel) preconditioners and multigrid algorithms, after a discussion on block diagonal preconditioners for saddle point problems.
Unable to display preview. Download preview PDF.
- J.H. Bramble and X. Zhang. The Analysis of Multigrid Methods. In P.G. Ciarlet and J.L. Lions, editors, Handbook of Numerical Analysis, VII, pages 173–415. North-Holland, Amsterdam, 2000.Google Scholar
- S.C. Brenner. Lower bounds in domain decomposition. Proceedings of the 16th International Conference on Domain Decomposition Methods (to appear), 2006.Google Scholar
- W.L. Briggs, V.E. Henson, and S.F. McCormick. A Multigrid Tutorial. SIAM, Philadelphia, 2001.Google Scholar
- M. Dryja and O.B. Widlund. An additive variant of the Schwarz alternating method in the case of many subregions. Technical Report 339, Department of Computer Science, Courant Institute, 1987.Google Scholar
- J.W. Ruge and K. Stüben. Algebraic multigrid. In S.F. McCormick, editor, Multigrid Methods, pages 73–130. SIAM, Philadelphia, 1987.Google Scholar
- A. Toselli and O.B. Widlund. Domain Decomposition Methods — Algorithms and Theory. Springer, New York, 2004.Google Scholar