Experience with the Solution of a Finite Difference Discretization on Sparse Grids

In a recent paper [10], we described and analyzed a finite difference discretization on adaptive sparse grids in three space dimensions. In this paper, we show how the discrete equations can be efficiently solved in an iterative process. Several alternatives have been studied before in Sprengel [16], where multigrid algorithms were used. Here, we report on our experience with BiCGStab iteration. It appears that, applied to the hierarchical representation and combined with Nested Iteration in a cascadic algorithm, BiCGStab shows fast convergence, although the convergence rate is not truly independent of the meshsize.