Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 415-434 |
| Number of pages | 20 |
| Journal | Numerische Mathematik |
| Volume | 109 |
| Issue number | 3 |
| DOIs | |
| State | Published - May 1 2008 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Applied Mathematics
Cite this
}
Local and parallel finite element algorithms for the stokes problem. / He, Yinnian; Xu, Jinchao; Zhou, Aihui; Li, Jian.
In: Numerische Mathematik, Vol. 109, No. 3, 01.05.2008, p. 415-434.Research output: Contribution to journal › Article
TY - JOUR
T1 - Local and parallel finite element algorithms for the stokes problem
AU - He, Yinnian
AU - Xu, Jinchao
AU - Zhou, Aihui
AU - Li, Jian
PY - 2008/5/1
Y1 - 2008/5/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=43149109076&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=43149109076&partnerID=8YFLogxK
U2 - 10.1007/s00211-008-0141-2
DO - 10.1007/s00211-008-0141-2
M3 - Article
AN - SCOPUS:43149109076
VL - 109
SP - 415
EP - 434
JO - Numerische Mathematik
JF - Numerische Mathematik
SN - 0029-599X
IS - 3
ER -