We present a new version of the method of local corrections (MLC) of McCorquodale,
Colella, Balls, and Baden (2007), a multilevel, low-communication, noniterative domain
decomposition algorithm for the numerical solution of the free space Poisson’s equation
in three dimensions on locally structured grids. In this method, the field is computed
as a linear superposition of local fields induced by charges on rectangular patches of
size
mesh points, with the global coupling represented by a coarse-grid solution
using a right-hand side computed from the local solutions. In the present
method, the local convolutions are further decomposed into a short-range
contribution computed by convolution with the discrete Green’s function for a
-th-order
accurate finite difference approximation to the Laplacian with the full right-hand side on the
patch, combined with a longer-range component that is the field induced by the terms up
to order
of the Legendre expansion of the charge over the patch. This leads
to a method with a solution error that has an asymptotic bound of
, where
is the mesh
spacing and
is the max norm of the charge times a rapidly decaying function
of the radius of the support of the local solutions scaled by
. The
bound
is
essentially the error of the global potential computed on the coarsest grid in the hierarchy.
Thus, we have eliminated the low-order accuracy of the original method (which corresponds
to
in
the present method) for smooth solutions, while keeping the computational cost per
patch nearly the same as that of the original method. Specifically, in addition to the
local solves of the original method we only have to compute and communicate the
expansion coefficients of local expansions (that is, for instance, 20 scalars per patch
for
).
Several numerical examples are presented to illustrate the new method and
demonstrate its convergence properties.
Keywords
Poisson solver, method of local corrections, Mehrstellen
stencils, domain decomposition, parallel solvers