Algorithms for structured matrix-vector product of optimal bilinear complexity
Numerical Analysis
2016-03-23 v1
Abstract
We present explicit algorithms for computing structured matrix-vector products that are optimal in the sense of Strassen, i.e., using a provably minimum number of multiplications. These structures include Toeplitz/Hankel/circulant, symmetric, Toeplitz-plus-Hankel, sparse, and multilevel structures. The last category include \textsc{bttb}, \textsc{bhhb}, \textsc{bccb} but also any arbitrarily complicated nested structures built out of other structures.
Cite
@article{arxiv.1603.06658,
title = {Algorithms for structured matrix-vector product of optimal bilinear complexity},
author = {Ke Ye and Lek-Heng Lim},
journal= {arXiv preprint arXiv:1603.06658},
year = {2016}
}
Comments
5 pages