Non-multiplying Construction for Faure Sequence
- 数学科学－已发表论文 
介绍一种利用逻辑运算构造Faure序列的方法,尤其是当模2时的该序列的构造。该方法无须具体计算相关矩阵元素,只涉及该矩阵元素的奇偶性,设计的算法较常规方法拥有较少的时间和较低的空间复杂度。文中给出理论证明、相应算法和数值实例。In this paper we construct Faure sequence with modulus 2 through Boolean operation. This method replaces computing the related matrix elements by only using the matrix elements parity. Therefore the algorithm is of less complexity and the load is largely decreased compared to the classical one. Some theorems and numerical experiment are also presented.