For some applications, numerical solutions of Poisson's equation are needed with a source term that is concentrated on a small part of the computational domain. Uniform-grid Poisson solvers are inefficient for these problems.A grid adaptation procedure with nested grids is described here, that uses an existing uniform-grid solver for the computation on each grid. The new aspect of this method is the error-based refinement criterion that allows the calculation of an upper bound for the total error. With this error bound, the solution can be computed up to any desired accuracy. This computation is direct: the solution on each grid is computed only once, no iteration is needed.Numerical results for two test problems show that the extra error caused by the nested-grid approach can indeed be made arbitrarily small, if desired. Significant reductions in CPU time, compared to solutions on uniform grids, are found.
[1]
W. Hundsdorfer,et al.
Branching of negative streamers in free flight.
,
2002,
Physical review. E, Statistical, nonlinear, and soft matter physics.
[2]
Cornelis Vuik,et al.
How fast the Laplace equation was solved in 1995
,
1997
.
[3]
Gene H. Golub,et al.
Matrix computations
,
1983
.
[4]
J. Stoer,et al.
Introduction to Numerical Analysis
,
2002
.
[5]
Roland A. Sweet,et al.
A direct method for the solution of poisson's equation with neumann boundary conditions on a staggered grid of arbitrary size
,
1976
.
[6]
B Spagnolo,et al.
Noise-enhanced stability of periodically driven metastable states.
,
2001,
Physical review. E, Statistical, nonlinear, and soft matter physics.