Local and parallel finite element algorithms based on two-grid discretization for steady Navier-Stokes equations
- 69 Downloads
Local and parallel finite element algorithms based on two-grid discretization for Navier-Stokes equations in two dimension are presented. Its basis is a coarse finite element space on the global domain and a fine finite element space on the subdomain. The local algorithm consists of finding a solution for a given nonlinear problem in the coarse finite element space and a solution for a linear problem in the fine finite element space, then droping the coarse solution of the region near the boundary. By overlapping domain decomposition, the parallel algorithms are obtained. This paper analyzes the error of these algorithms and gets some error estimates which are better than those of the standard finite element method. The numerical experiments are given too. By analyzing and comparing these results, it is shown that these algorithms are correct and high efficient.
Key wordsNavier-Stokes equations finite element method two-grid local parallel
Chinese Library ClassificationO241.82
2000 Mathematics Subject Classification65N30 65N55
Unable to display preview. Download preview PDF.
- He Yinnian, Xu Jinchao, Zhou Aihui. Local and parallel finite element algorithms for the Stokes problem[J]. Numerische Mathematik, 2007, to be published.Google Scholar
- Adams R. Sobolev space[M]. New York: Academic Press Inc, 1975.Google Scholar
- Girault V, Raviart P A. Finite element methods for the Navier-Stokes equations: theory and algorithms[M]. Berlin: Springer-Verlag, 1986.Google Scholar