科研之友
微信
新浪微博
Facebook
分享链接
摘要
An effective fast algorithm of [Fu-Rong Lin et al, Theoretical Computer and Science, 315(2004),511-523] computes the inverse of a lower triangular Toeplitz matrix with computational complexity O(nlogn). In this paper, we present a modified fast algorithm for inversion of lower triangular Toeplitz matrices, using both fast sine transform and fast cosine transform. Our algorithm requires two fast Fourier transforms and one fast sine transform and one fast cosine transform, and so the complexity of our algorithm is O(nlogn). As the theoretical results and the numerical experiments show, the modified version of fast algorithm has more accuracy than Lin's fast algorithm.
