A New Algorithm for Fast Generalized DFTs
A New Algorithm for Fast Generalized DFTs
复制标题
一种快速广义 DFT 的新算法
DOI:
10.1145/3301313
复制
发表时间:
2020
影响因子:
1.3
通讯作者:
Umans, Chris
中科院分区:
文献类型:
--
作者:
Hsu, Chloe Ching-Yun;Umans, Chris
We give an new arithmetic algorithm to compute the generalized Discrete Fourier Transform (DFT) over finite groupsG. The new algorithm usesO(∣G∣ω /2 +o(1)) operations to compute the generalized DFT over finite groups of Lie type, including the linear, orthogonal, and symplectic families and their variants, as well as all finite simple groups of Lie type. Here ω is the exponent of matrix multiplication, so the exponent ω/2 is optimal if ω = 2.Previously, “exponent one” algorithms were known for supersolvable groups and the symmetric and alternating groups. No exponent one algorithms were known, even under the assumption ω = 2, for families of linear groups of fixed dimension, and indeed the previous best-known algorithm for SL2(Fq) had exponent 4/3 despite being the focus of significant effort. We unconditionally achieve exponent at most 1.19 for this group and exponent one if ω = 2.Our algorithm also yields an improved exponent for computing the generalized DFT over general finite groupsG, which beats the longstanding previous best upper bound for any ω. In particular, assuming ω = 2, we achieve exponent √ 2, while the previous best was 3/2.
登录
查看更多内容
DOI:
--
发表时间:
1999
期刊:
影响因子:
--
作者:
D. Rockmore
通讯作者:
D. Rockmore
DOI:
10.1090/dimacs/028/19
发表时间:
1997
期刊:
Notes on the Brown-Douglas-Fillmore Theorem
影响因子:
--
作者:
D. Rockmore
通讯作者:
D. Rockmore
影响因子:
1.2
作者:
D. Maslen;D. Rockmore;Sarah Wolff
通讯作者:
Sarah Wolff
DOI:
--
发表时间:
1992
期刊:
影响因子:
--
作者:
A. Lev
通讯作者:
A. Lev
影响因子:
1.2
作者:
D. Maslen;D. Rockmore;Sarah Wolff
通讯作者:
Sarah Wolff