In this paper,we exhibit a free monoid containing all prefix codes in connection with the sets of i-th powers of primitive words for all i≥2.This extends two results given by Shyr and Tsai in 1998 at the same time.
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.展开更多
基金Supported by the National Natural Science Foundation of China(11861071).
文摘In this paper,we exhibit a free monoid containing all prefix codes in connection with the sets of i-th powers of primitive words for all i≥2.This extends two results given by Shyr and Tsai in 1998 at the same time.
基金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.
