An algebraic multilevel iteration method for finite element matrices

6Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

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. © 1997 Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Axelsson, O., & Larin, M. (1998). An algebraic multilevel iteration method for finite element matrices. Journal of Computational and Applied Mathematics, 89(1), 135–153. https://doi.org/10.1016/S0377-0427(97)00241-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free