摘要
Calculation of a variation of discrete Fourier transform.Chrestenson spectraof functions of n indeterminates over integer modulo m(composite integer),is con-sidered.Based on sparse matrix decomposition,two fast algorithms with complexityO(mnn∑ri=1pi)are given to calculate the Chrestenson spectra,where p1p2…p2 is theprime factor decomposition of m.
本文研究离散Fourier变换的一类变型-整数模合数m剩余类环上n元函数的Chrestenson谱的快速计算,基于稀疏矩阵分解,给出了两种复杂度为O(mnn∑ir=1pi)的计算Chrestenson谱的快速算法,其中p1p2…pr是m的素因子分解.
基金
Supported by the National Natural Science Foundation of China(90104034)
the 863 Program(2002AA141020)
the Guangdong Provincial Natural Science Foundation(990336)
