Abstract
A framework for algebraic multilevel preconditioning methods is presented for solving large sparse systems of linear equations with symmetric positive definite coefficient matrices, which arise in the discretization of second order elliptic boundary value problems by the finite element method. This framework covers not only all known algebraic multilevel preconditioning methods, but yields also new ones. It is shown that all preconditioners within this framework have optimal orders of complexities for problems in two-dimensional(2-D) and three-dimensional(3-D) problem domains, and their relatives condition numbers are bounded uniformly with respect to the numbers of both the levels and the nodes.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
