An algebraic multilevel iteration method for finite element matrices

To solve a sparse linear system of equations resulting from the finite element approximation of elliptic self-adjoint second-order boundary-value problems an algebraic multilevel iteration method is presented. The new method can be considered as an extension of methods, which have been defined by Axelsson and Eijkhout (1991) for nine-point matrices and later generalized by Axelsson and Neytcheva (1994) for the Stieltjes matrices, on a more wider class of sparse symmetric positive-definite matrices. The rate of convergence and the computational complexity of the method are analyzed. Experimental results on some standard test problems are presented and discussed.