Synthesis of fast multiplication algorithms for arbitrary tensors
classification
💻 cs.DS
keywords
fasttensorarbitrarymethodmultiplicationsynthesisvectoralgorithm
read the original abstract
A method of fast linear transform algorithm synthesis for an arbitrary tensor, matrix, or vector is proposed. The method is based on factorization of a tensor and using the factors for building computational structures performing fast tensor - vector multiplication on a computer or dedicated hardware platform.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.