Hierarchical bases for elliptic problems
W. D{örfler · Mathematics of Computation · 1992
Linear systems of equations with positive and symmetric matrices often occur in the numerical treatment of linear and nonlinear elliptic boundary value problems. If the CG algorithm is used to solve these equations, one is able to speed up the convergence by "preconditioning." The method of preconditioning with hierarchical basis has already been considered for the Laplace equation in two space dimensions and for linear conforming elements. In the present work this method is generalized to a large class of conforming and nonconforming elements.