作者: Xiang Wang , Linzhang Lu
DOI: 10.1016/J.AMC.2005.07.022
关键词: Pascal (programming language) 、 Pascal matrix 、 Fast Fourier transform 、 Toeplitz matrix 、 Linear system 、 Applied mathematics 、 Constant coefficients 、 Coefficient matrix 、 Algebra 、 Cholesky decomposition 、 Mathematics
摘要: In this paper, we present a fast algorithm of the complexity O (nlogn) 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 [MEA 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.