Abstract
We present a preconditioned conjugate residual algorithm for a mixed finite element discretization of the Stokes problem
in a plane polygonal domain Ω. The preconditioning relies on the idea of hierarchical basis functions for finite elements (cf.[7, 8]). The algorithm has a quasi optimal convergence rate of 1-0(|logh|).
Chapter PDF
Similar content being viewed by others
References
Ph. G. Ciarlet: “The finite element method for elliptic problems”. North Holland, Amsterdam, 1978.
V. Girault, P.A. Raviart: “The finite element approximation of the Navier-Stokes equations”. Springer, Berlin. 1979.
R. Verfürth: “Error estimates for a mixed finite element approximation of the Stokes equations”. RAIRO 18, 175–182 (1984).
R. Verfürth: “A combined conjugate gradient-multigrid algorithm for the numerical solution of the Stokes problem”. IMA J. Numer. Anal. 4, 441–455 (1984).
R. Verfürth: “A Multi-Level algorithm for mixed problems”. SIAM J. Numer. Anal. 21, 264–271 (1984).
R. Verfürth: “Iterative methods for the numerical solution of mixed finite element approximations of the Stokes problem”. Report INRIA, 1985.
H. Yserentant: “On the multi-Level splitting of finite element spaces”. Bericht Nr. 21 RWTH Aachen, 1983.
H. Yserentant: “Über die Aufspaltung von finite Element Räumen in Teilräume verschiedener Verfeinerungsstufen”. Habilitationsschrift, RWTH Aachen, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Verfürth, R. (1985). A Preconditioned Conjugate Residual Algorithm for the Stokes Problem. In: Braess, D., Hackbusch, W., Trottenberg, U. (eds) Advances in Multi-Grid Methods. Notes on Numerical Fluid Mechanics, vol 11. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-663-14245-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-663-14245-4_11
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-528-08085-3
Online ISBN: 978-3-663-14245-4
eBook Packages: Springer Book Archive