ABSTRACT
The approaches for solving the large sparse linear systems can be distinguished into direct and iterative algorithms (Fox et al., 1948; Dietl, 2007). Direct algorithms, which are based on factorization of the coefficient matrix into easily invertible matrices, do not provide a solution until all steps of the algorithm are processed. By contrast, iterative algorithms produce an approximate solution at each iteration step, which is improved step by step.
