摘要

Circulant pentadiagonal (CP) systems of linear equations arise in many application areas and have been thoroughly studied in the past decades. In the current paper, a novel algorithm is presented for solving CP linear systems based upon a structure-preserving factorization for the coefficient matrix. Meanwhile, we show that the proposed algorithm is competitive with some already existing algorithms in terms of arithmetic operations. In addition, a symmetric case of the CP linear systems is also considered. Finally, two examples are provided in order to demonstrate the validity and efficiency of our algorithm and its competitiveness with other algorithms. All of the numerical experiments are performed on a computer with the aid of programs written in Matlab.