A Forward Elimination and Backward Substitution Algorithm for Large-scale Banded Linear Systems

Derives a forward elimination and backward substitution algorithm for lage-scale banded linear systems with any bandwidth,using ones with quinary diagonal linear systems.It is deduced theoretically that the operational level is O([2t2+5t+3]n) and the storage level is O[2(t+1)n] for a banded linear system with bandwidth 2t+1 and order n.It is shown that in the numerical experiments this algorithm has some advantages in computational cost and need memory evidently,compared to others.It improves largely the rate of computing for solving linear systems.