A fast algorithm for solving linear systems of the Pascal type

摘要

In this paper, we present a fast algorithm of the complexity O(n log n) for solving the linear systems with coefficient matrix of the Pascal type, which is faster than the algorithm of the complexity O(n2) given in the paper [M.E.A. El-Mikkawy, On solving linear systems of the Pascal type. Applied mathematics and computation 136 (2003) 195–202]. An application in solving non-homogeneous differential equation with constant coefficients is given.