摘要
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.
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.
基金
Project supported by the National Natural Science Foundation of China (No. 10371096)
