Based on two-grid discretizations, in this paper, some new local and parallel finite element algorithms are proposed and analyzed for the stationary incompressible Navier- Stokes problem. These algorithms are motivate...Based on two-grid discretizations, in this paper, some new local and parallel finite element algorithms are proposed and analyzed for the stationary incompressible Navier- Stokes problem. These algorithms are motivated by the observation that for a solution to the Navier-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 major technical tool for the analysis is some local a priori error estimates that are also obtained in this paper for the finite element solutions on general shape-regular grids.展开更多
Some new local and parallel finite element algorithms are proposed and analyzed in this paper for eigenvalue problems. With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced to the solu...Some new local and parallel finite element algorithms are proposed and analyzed in this paper for eigenvalue problems. With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced to the solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraic systems on fine grid by using some local and parallel procedure. A theoretical tool for analyzing these algorithms is some local error estimate that is also obtained in this paper for finite element approximations of eigenvectors on general shape-regular grids.展开更多
A new finite element method, which is the characteristic-based operator-splitting (CBOS) algorithm, is developed to solve Navier-Stokes (N-S) equations. In each time step, the equations are split into the diffusive pa...A new finite element method, which is the characteristic-based operator-splitting (CBOS) algorithm, is developed to solve Navier-Stokes (N-S) equations. In each time step, the equations are split into the diffusive part and the convective part by adopting the operator-splitting algorithm. For the diffusive part, the temporal discretization is performed by the backward difference method which yields an implicit scheme and the spatial discretization is performed by the standard Galerkin method. The convective part can be discretized using the characteristic Galerkin method and solved explicitly. The driven square flow and backward-facing step flow are conducted to validate the model. It is shown that the numerical results agree well with the standard solutions or existing experimental data, and the present model has high accuracy and good stability. It provides a prospective research method for solving N-S equations.展开更多
蚁群算法拥有良好的全局性、自组织性、鲁棒性,但传统蚁群算法存在许多不足之处。为此,针对算法在路径规划问题中的缺陷,在传统蚁群算法的状态转移公式中,引入目标点距离因素和引导素,加快算法收敛性和改善局部最优缺陷。在带时间窗的...蚁群算法拥有良好的全局性、自组织性、鲁棒性,但传统蚁群算法存在许多不足之处。为此,针对算法在路径规划问题中的缺陷,在传统蚁群算法的状态转移公式中,引入目标点距离因素和引导素,加快算法收敛性和改善局部最优缺陷。在带时间窗的车辆路径问题(vehicle routing problem with time windows,VRPTW)上,融合蚁群算法和遗传算法,并将顾客时间窗宽度以及机器人等待时间加入蚁群算法状态转移公式中,以及将蚁群算法的解作为遗传算法的初始种群,提高遗传算法的初始解质量,然后进行编码,设置违反时间窗约束和载重量的惩罚函数和适应度函数,在传统遗传算法的交叉、变异操作后加入了破坏-修复基因的操作来优化每一代新解的质量,在Solomon Benchmark算例上进行仿真,对比算法改进前后的最优解,验证算法可行性。最后在餐厅送餐问题中把带有障碍物的仿真环境路径规划问题和VRPTW问题结合,使用改进后的算法解决餐厅环境下送餐机器人对顾客服务配送问题。展开更多
The finite element solutions of elliptic equations are shown to have a multiparameter asymptotic error expansion. Based on this expansion and a multi-parametersplitting extrapolation technique, a parallel algorithm fo...The finite element solutions of elliptic equations are shown to have a multiparameter asymptotic error expansion. Based on this expansion and a multi-parametersplitting extrapolation technique, a parallel algorithm for solving multi-dimensional equations with high order accuracy is introduced.展开更多
基金The first author was partially subsidized by the NSF of China 10371095. The third author was partially supported by the National Science Foundation of China under the grant 10425105 and the National Basic Research Program under the grant 2005CB321704.
文摘Based on two-grid discretizations, in this paper, some new local and parallel finite element algorithms are proposed and analyzed for the stationary incompressible Navier- Stokes problem. These algorithms are motivated by the observation that for a solution to the Navier-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 major technical tool for the analysis is some local a priori error estimates that are also obtained in this paper for the finite element solutions on general shape-regular grids.
基金Partially supported by NSF DMS-0074299 through Penn State and Center for Computational Mathematics and Applications, The Pennsylvania State University.Subsidized by the Special Funds for Major State Basic Research Projects, and also partially supported
文摘Some new local and parallel finite element algorithms are proposed and analyzed in this paper for eigenvalue problems. With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced to the solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraic systems on fine grid by using some local and parallel procedure. A theoretical tool for analyzing these algorithms is some local error estimate that is also obtained in this paper for finite element approximations of eigenvectors on general shape-regular grids.
基金supported by the National Natural Science Foundation of China (Grant Nos. 41072235, 50809008)the Hong Kong Research Grants Council (Grant No. HKU 7171/06E)+1 种基金the National Basic Research Program of China ("973" Project) (Grant No. 2007CB209400)the Natural Science Foundation of LiaoNing Province of China (Grant No. 20102006)
文摘A new finite element method, which is the characteristic-based operator-splitting (CBOS) algorithm, is developed to solve Navier-Stokes (N-S) equations. In each time step, the equations are split into the diffusive part and the convective part by adopting the operator-splitting algorithm. For the diffusive part, the temporal discretization is performed by the backward difference method which yields an implicit scheme and the spatial discretization is performed by the standard Galerkin method. The convective part can be discretized using the characteristic Galerkin method and solved explicitly. The driven square flow and backward-facing step flow are conducted to validate the model. It is shown that the numerical results agree well with the standard solutions or existing experimental data, and the present model has high accuracy and good stability. It provides a prospective research method for solving N-S equations.
文摘蚁群算法拥有良好的全局性、自组织性、鲁棒性,但传统蚁群算法存在许多不足之处。为此,针对算法在路径规划问题中的缺陷,在传统蚁群算法的状态转移公式中,引入目标点距离因素和引导素,加快算法收敛性和改善局部最优缺陷。在带时间窗的车辆路径问题(vehicle routing problem with time windows,VRPTW)上,融合蚁群算法和遗传算法,并将顾客时间窗宽度以及机器人等待时间加入蚁群算法状态转移公式中,以及将蚁群算法的解作为遗传算法的初始种群,提高遗传算法的初始解质量,然后进行编码,设置违反时间窗约束和载重量的惩罚函数和适应度函数,在传统遗传算法的交叉、变异操作后加入了破坏-修复基因的操作来优化每一代新解的质量,在Solomon Benchmark算例上进行仿真,对比算法改进前后的最优解,验证算法可行性。最后在餐厅送餐问题中把带有障碍物的仿真环境路径规划问题和VRPTW问题结合,使用改进后的算法解决餐厅环境下送餐机器人对顾客服务配送问题。
文摘The finite element solutions of elliptic equations are shown to have a multiparameter asymptotic error expansion. Based on this expansion and a multi-parametersplitting extrapolation technique, a parallel algorithm for solving multi-dimensional equations with high order accuracy is introduced.
