Fast Multiplication of a Recursive Block Toeplitz Matrix by a Vector and its Application
We present an algorithm for multiplying an NxN recursive block Toeplitz matrix by a vector with cost O(N log N).
We have limited content available for some countries. Find office information and country specific information through our country hub.
We have limited content available for some countries. Find office information and country specific information through our country hub.
We present an algorithm for multiplying an NxN recursive block Toeplitz matrix by a vector with cost O(N log N).