Repeated Red-Black ordering: a new approach |
| |
Authors: | P. Ciarlet Jr |
| |
Affiliation: | (1) Commissariat à l'Energie Atomique, Centre d'Etudes de Limeil-Valenton, 94195 Villeneuve-Saint-Georges Cedex, France |
| |
Abstract: | Hereafter, we describe and analyze, from both a theoretical and a numerical point of view, an iterative method for efficiently solving symmetric elliptic problems with possibly discontinuous coefficients. In the following, we use the Preconditioned Conjugate Gradient method to solve the symmetric positive definite linear systems which arise from the finite element discretization of the problems. We focus our interest on sparse and efficient preconditioners. In order to define the preconditioners, we perform two steps: first we reorder the unknowns and then we carry out a (modified) incomplete factorization of the original matrix. We study numerically and theoretically two preconditioners, the second preconditioner corresponding to the one investigated by Brand and Heinemann [2]. We prove convergence results about the Poisson equation with either Dirichlet or periodic boundary conditions. For a meshsizeh, Brand proved that the condition number of the preconditioned system is bounded byO(h–1/2) for Dirichlet boundary conditions. By slightly modifying the preconditioning process, we prove that the condition number is bounded byO(h–1/3). |
| |
Keywords: | Conjugate gradients sparse modified preconditioners ordering strategies |
本文献已被 SpringerLink 等数据库收录! |
|