In this paper,we consider the high order method for solving the linear transport equations under diffusive scaling and with random inputs.To tackle the randomness in the problem,the stochastic Galerkin method of the g...In this paper,we consider the high order method for solving the linear transport equations under diffusive scaling and with random inputs.To tackle the randomness in the problem,the stochastic Galerkin method of the generalized polynomial chaos approach has been employed.Besides,the high order implicit-explicit scheme under the micro-macro decomposition framework and the discontinuous Galerkin method have been employed.We provide several numerical experiments to validate the accuracy and the stochastic asymptotic-preserving property.展开更多
An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalize...An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2' and the algorithm for computing the linear complexity of a binary sequence with period pn, where 2 is a primitive root modulo p2.展开更多
基金supported by the Simons Foundation:Collaboration Grantssupported by the AFOSR grant FA9550-18-1-0383.
文摘In this paper,we consider the high order method for solving the linear transport equations under diffusive scaling and with random inputs.To tackle the randomness in the problem,the stochastic Galerkin method of the generalized polynomial chaos approach has been employed.Besides,the high order implicit-explicit scheme under the micro-macro decomposition framework and the discontinuous Galerkin method have been employed.We provide several numerical experiments to validate the accuracy and the stochastic asymptotic-preserving property.
基金This work was supported in part by the National Natural Science Foundation of China ( Grant No.60073051) the Natural Science Foundation of Education Council of Anhui Province.
文摘An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2' and the algorithm for computing the linear complexity of a binary sequence with period pn, where 2 is a primitive root modulo p2.
