A stable fast algorithm for solving linear systems of the Pascal type
The author of the paper [1]gave a fast algorithm for solving linear systems with coefficient matrix of the Pascal type and the complexity of his algorithm is O(n(2)). In this current paper, we present a more fast and stable algorithm for solving linear systems with the coefficient matrix of the Pascal type. The complexity of our algorithm is O(nlogn).
fast algorithm pascal matrix cholesky factorization fft toeplitz matrix