Numerische Mathematik

, Volume 109, Issue 3, pp 415–434

Local and parallel finite element algorithms for the stokes problem


DOI: 10.1007/s00211-008-0141-2

Cite this article as:
He, Y., Xu, J., Zhou, A. et al. Numer. Math. (2008) 109: 415. doi:10.1007/s00211-008-0141-2


Based on two-grid discretizations, some local and parallel finite element algorithms for the Stokes problem are proposed and analyzed in this paper. These algorithms are motivated by the observation that for a solution to the Stokes problem, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel procedure. One technical tool for the analysis is some local a priori estimates that are also obtained in this paper for the finite element solutions on general shape-regular grids.

Mathematics Subject Classification (2000)


Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  1. 1.Faculty of ScienceXi’an Jiaotong UniversityXi’anPeople’s Republic of China
  2. 2.Laboratory of Pure and Applied Mathematics, School of Mathematical SciencesPeking UniversityBeijingPeople’s Republic of China
  3. 3.Department of MathematicsPennsylvania State UniversityUniversity ParkUSA
  4. 4.LSEC, Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijingPeople’s Republic of China