Fast multiplication of a recursive block Toeplitz matrix by a vector and its application (Q578851): Difference between revisions

To multiply an \(N\times N\) matrix by a vector costs O(N log N) operations using FFT. In this paper an algorithm for multiplying an \(N\times N\) k- level recursive block Toeplitz matrix by a vector is studied, which costs O(N log N) operations as well. As an application the spline interpolation based on reproducing kernels is considered.