Based on the full domain partition, a parallel finite element algorithm for the stationary Stokes equations is proposed and analyzed. In this algorithm, each subproblem is defined in the entire domain. Majority of the...Based on the full domain partition, a parallel finite element algorithm for the stationary Stokes equations is proposed and analyzed. In this algorithm, each subproblem is defined in the entire domain. Majority of the degrees of freedom are associated with the relevant subdomain. Therefore, it can be solved in parallel with other subproblems using an existing sequential solver without extensive recoding. This allows the algorithm to be implemented easily with low communication costs. Numerical results are given showing the high efficiency of the parallel algorithm.展开更多
Based on domain decomposition, a parallel two-level finite element method for the stationary Navier-Stokes equations is proposed and analyzed. The basic idea of the method is first to solve the Navier-Stokes equations...Based on domain decomposition, a parallel two-level finite element method for the stationary Navier-Stokes equations is proposed and analyzed. The basic idea of the method is first to solve the Navier-Stokes equations on a coarse grid, then to solve the resulted residual equations in parallel on a fine grid. This method has low communication complexity. It can be implemented easily. By local a priori error estimate for finite element discretizations, error bounds of the approximate solution are derived. Numerical results are also given to illustrate the high efficiency of the method.展开更多
In this paper, we consider the mixed Navier-Stokes/Darcy model with BeaversJoseph interface conditions. Based on two-grid discretizations, a local and parallel finite element algorithm for this mixed model is proposed...In this paper, we consider the mixed Navier-Stokes/Darcy model with BeaversJoseph interface conditions. Based on two-grid discretizations, a local and parallel finite element algorithm for this mixed model is proposed and analyzed. Optimal errors are obtained and numerical experiments are presented to show the efficiency and effectiveness of the local and parallel finite element algorithm.展开更多
For the low-order finite element pair P1P1,based on full domain partition technique,a parallel pressure projection stabilized finite element algorithm for the Stokes equation with nonlinear slip boundary con...For the low-order finite element pair P1P1,based on full domain partition technique,a parallel pressure projection stabilized finite element algorithm for the Stokes equation with nonlinear slip boundary conditions is designed and analyzed.From the definition of the subdifferential,the variational formulation of this equation is the variational inequality problem of the second kind.Each subproblem is a global problem on the composite grid,which is easy to program and implement.The optimal error estimates of the approximate solutions are obtained by theoretical analysis since the appropriate stabilization parameter is chosen.Finally,some numerical results are given to demonstrate the hight efficiency of the parallel stabilized finite element algorithm.展开更多
Based on fully overlapping domain decomposition,a parallel finite element algorithm for the unsteady Oseen equations is proposed and analyzed.In this algorithm,each processor independently computes a finite element ap...Based on fully overlapping domain decomposition,a parallel finite element algorithm for the unsteady Oseen equations is proposed and analyzed.In this algorithm,each processor independently computes a finite element approximate solution in its own subdomain by using a locally refined multiscale mesh at each time step,where conforming finite element pairs are used for the spatial discretizations and backward Euler scheme is used for the temporal discretizations,respectively.Each subproblem is defined in the entire domain with vast majority of the degrees of freedom associated with the particular subdomain that it is responsible for and hence can be solved in parallel with other subproblems using an existing sequential solver without extensive recoding.The algorithm is easy to implement and has low communication cost.Error bounds of the parallel finite element approximate solutions are estimated.Numerical experiments are also given to demonstrate the effectiveness of the algorithm.展开更多
基金Project supported by the National Natural Science Foundation of China (No.10971166)the National Basic Research Program (No.2005CB321703)the Science and Technology Foundation of Guizhou Province of China (No.[2008]2123)
文摘Based on the full domain partition, a parallel finite element algorithm for the stationary Stokes equations is proposed and analyzed. In this algorithm, each subproblem is defined in the entire domain. Majority of the degrees of freedom are associated with the relevant subdomain. Therefore, it can be solved in parallel with other subproblems using an existing sequential solver without extensive recoding. This allows the algorithm to be implemented easily with low communication costs. Numerical results are given showing the high efficiency of the parallel algorithm.
基金Project supported by the National Natural Science Foundation of China(No.11001061)the Science and Technology Foundation of Guizhou Province of China(No.[2008]2123)
文摘Based on domain decomposition, a parallel two-level finite element method for the stationary Navier-Stokes equations is proposed and analyzed. The basic idea of the method is first to solve the Navier-Stokes equations on a coarse grid, then to solve the resulted residual equations in parallel on a fine grid. This method has low communication complexity. It can be implemented easily. By local a priori error estimate for finite element discretizations, error bounds of the approximate solution are derived. Numerical results are also given to illustrate the high efficiency of the method.
文摘In this paper, we consider the mixed Navier-Stokes/Darcy model with BeaversJoseph interface conditions. Based on two-grid discretizations, a local and parallel finite element algorithm for this mixed model is proposed and analyzed. Optimal errors are obtained and numerical experiments are presented to show the efficiency and effectiveness of the local and parallel finite element algorithm.
基金supported by the Natural Science Foundation of China(No.11361016)the Basic and Frontier Explore Program of Chongqing Municipality,China(No.cstc2018jcyjAX0305)Funds for the Central Universities(No.XDJK2018B032).
文摘For the low-order finite element pair P1P1,based on full domain partition technique,a parallel pressure projection stabilized finite element algorithm for the Stokes equation with nonlinear slip boundary conditions is designed and analyzed.From the definition of the subdifferential,the variational formulation of this equation is the variational inequality problem of the second kind.Each subproblem is a global problem on the composite grid,which is easy to program and implement.The optimal error estimates of the approximate solutions are obtained by theoretical analysis since the appropriate stabilization parameter is chosen.Finally,some numerical results are given to demonstrate the hight efficiency of the parallel stabilized finite element algorithm.
基金supported by the Natural Science Foundation of China(No.11361016)the Basic and Frontier Explore Program of Chongqing Municipality,China(No.cstc2018jcyjAX0305)Funds for the Central Universities(No.XDJK2018B032).
文摘Based on fully overlapping domain decomposition,a parallel finite element algorithm for the unsteady Oseen equations is proposed and analyzed.In this algorithm,each processor independently computes a finite element approximate solution in its own subdomain by using a locally refined multiscale mesh at each time step,where conforming finite element pairs are used for the spatial discretizations and backward Euler scheme is used for the temporal discretizations,respectively.Each subproblem is defined in the entire domain with vast majority of the degrees of freedom associated with the particular subdomain that it is responsible for and hence can be solved in parallel with other subproblems using an existing sequential solver without extensive recoding.The algorithm is easy to implement and has low communication cost.Error bounds of the parallel finite element approximate solutions are estimated.Numerical experiments are also given to demonstrate the effectiveness of the algorithm.
