A framework for parallel algebraic multilevel preconditioning methods presented for solving large sparse systems of linear equstions with symmetric positive definite coefficient matrices,which arise in suitable finite...A framework for parallel algebraic multilevel preconditioning methods presented for solving large sparse systems of linear equstions with symmetric positive definite coefficient matrices,which arise in suitable finite element discretizations of many second-order self-adjoint elliptic boundary value problems. This framework not only covers all known parallel algebraic multilevel preconditioning methods, but also yields 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 relative condition numbers are bounded uniformly with respect to the numbers of both levels and nodes.展开更多
文摘A framework for parallel algebraic multilevel preconditioning methods presented for solving large sparse systems of linear equstions with symmetric positive definite coefficient matrices,which arise in suitable finite element discretizations of many second-order self-adjoint elliptic boundary value problems. This framework not only covers all known parallel algebraic multilevel preconditioning methods, but also yields 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 relative condition numbers are bounded uniformly with respect to the numbers of both levels and nodes.
