微枝末节
发表于 2025-3-28 18:08:13
http://reply.papertrans.cn/16/1533/153220/153220_41.png
canonical
发表于 2025-3-28 20:04:58
https://doi.org/10.1007/978-3-662-06552-5iate composite size cases. The method is completely algebraic and results in composite size algorithms whose factors contain tensor products of prime size factors. However, these results are not totally appealing since complex permutations appear. A related problem is that tensor products are taken over direct sum factors.
PANIC
发表于 2025-3-29 02:14:27
http://reply.papertrans.cn/16/1533/153220/153220_43.png
Dendritic-Cells
发表于 2025-3-29 04:24:55
http://reply.papertrans.cn/16/1533/153220/153220_44.png
RAFF
发表于 2025-3-29 11:04:05
http://reply.papertrans.cn/16/1533/153220/153220_45.png
tenuous
发表于 2025-3-29 12:22:15
http://reply.papertrans.cn/16/1533/153220/153220_46.png
维持
发表于 2025-3-29 17:31:07
Linear and Cyclic Convolutions,onvolution by an FT of the corresponding size. In the last ten years, theoretically better convolution algorithms have been developed. The Winograd Small Convolution algorithm is the most efficient as measured by the number of multiplications.
Dictation
发表于 2025-3-29 22:55:25
http://reply.papertrans.cn/16/1533/153220/153220_48.png
有毒
发表于 2025-3-30 03:58:20
MFTA: The Prime Case,n theorem that returns the computation to an FT computation. Since the size (p-1) is a composite number, the (p-1)-point FT can be implemented by Cooley-Tukey FFT algorithms. The Winograd algorithm for small convolutions also can be applied to the skew-circulant action. (See problems 3, 4 and 5 for basic properties of skew-circulant matrices.)
谆谆教诲
发表于 2025-3-30 06:16:51
MFTA: Product of Two Distinct Primes,iate composite size cases. The method is completely algebraic and results in composite size algorithms whose factors contain tensor products of prime size factors. However, these results are not totally appealing since complex permutations appear. A related problem is that tensor products are taken over direct sum factors.