Optimal iterative refinement methods.

Domain decomposition methods, algorithms and theory

An extension theorem for finite element spaces with three applications

On the use of sparsity in the solution of finite element systems of equations by Gaussian elimination-type methods.

On the numerical solution of Helmholtz's equation by the capacitance matrix method.

Optimal iterative refinement method.

Domain Decomposition Methods in Science and Engineering XVI (Lecture Notes in Computational Science and Engineering)

Some domain decomposition and iterative refinement algorithms for elliptic finite element problems.

Iterative methods for elliptic problems on regions partitioned into substructures and the biharmonic Dirichlet problem.

Iterative substructuring methods: algorithms and theory for elliptic problems in the plane.

Iterative substructuring methods: the general elliptic case.