The construction of preconditioners for elliptic problems by substructuring. I
Mathematics of Computation
A domain decomposition preconditioner based on a change to a multilevel nodal basis
SIAM Journal on Scientific and Statistical Computing
Tutorial on Elliptic PDE Solvers and Their Parallelization
Tutorial on Elliptic PDE Solvers and Their Parallelization
Hi-index | 0.00 |
In this paper a new cyclic matrix representation of the Sobolev norms Ha, a ε (−1, 0) are presented. The matrix-vector multiplication by these matrices requires only O(N . log(N)) arithmetic operations, where N is the number of unknowns. The application of the new H−−1/2 norm representation as Schur complement preconditioning matrix requires only matrix-vector multiplication. The efficiency of the construction to elliptic problems has been verified by numerical tests.