Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems

摘要: In this paper the problem of complexity multiplication a matrix with vector is studied for Toeplitz, Hankel, Vandermonde, and Cauchy matrices connected them (i.e., transpose, inverse, transpose to inverse matrices). The proposed algorithms have complexities at most O(n log2n) flops in number cases they improve known estimates. these algorithms, separate preprocessing phase, are singled out all actions on preparation given which aimed reduction second stage computations directly by an arbitrary vector. Effective computing Vandermonde determinant determination given.