An algebraic multilevel iteration method for finite element matrices
β Scribed by O. Axelsson; M. Larin
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 932 KB
- Volume
- 89
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
A deterrent to application of rational basis functions over algebraic elements has been the need to compute denominator polynomials (element adjoints) from multiple points of the element boundary. Dasgupta devised a simple algorithm for eliminating this problem for convex polygons. This algorithm is