English

Synthesis of fast multiplication algorithms for arbitrary tensors

Data Structures and Algorithms 2016-02-24 v1

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.

Keywords

Cite

@article{arxiv.1602.07008,
  title  = {Synthesis of fast multiplication algorithms for arbitrary tensors},
  author = {Pavel Dourbal},
  journal= {arXiv preprint arXiv:1602.07008},
  year   = {2016}
}

Comments

79 pages

R2 v1 2026-06-22T12:55:37.040Z