Recursive fast algorithm and the role of the tensor product

Citations Over Time

Abstract

The use of the tensor product for modeling and designing FFT algorithms is addressed. The benefit of the tensor product approach lies in the strong connection between certain tensor product constructs and important computer architectures. The scope of the tensor product approach is generalized to include a much larger class of fast recursive algorithms. This greatly enhances the versatility of the tensor product technique and brings many different algorithms to the level of understanding and flexibility enjoyed by the FFT.>

Related Papers

• → Construction of the tensor product for the lattices of properties of physical entities(1984)32 cited
• → Tensor products of divisible effect algebras(2003)3 cited
• → Tensor products of regularly varying sequences(2017)2 cited
• → Tensor Products of Operator Algebras and Direct Integrals(1979)
• → Tensors(1978)