The fast direct methods for solving five- and nine-point systems of linear algebraic equations are considered. Algorithms are based on the electro-technical triangular-star and star-triangular transformations which preserve the original sparse matrix structure. The algebraic properties of the methods are investigated. The estimates of computational complexity and the results of the numerical experiments are presented.
|Russian Journal of Numerical Analysis and Mathematical Modelling
|Published - 2000