We present an abstract method for designing a multilevel preconditioner given a two-level preconditioner for an operator with positive definite symmetric part.
If we denote by
and
two discrete versions of a continuous
operator, then a two-level preconditioner
for
can be
described in general by a function
,
,
where it is assumed that the evaluation of
requires a level-independent number of applications of
and
applications of
(
or
). The natural
extension to a multilevel preconditioner, consisting in
replacing in
the call to
with a recursive call to
, is known to sometimes produce multilevel
preconditioners of lower quality (e.g., for certain types
of inverse problems). Based on the idea that inverting
essentially means to solve the
nonlinear equation
,
we define our multigrid preconditioner to be the first
Newton iterate of the map
starting at the ``natural'' multilevel
preconditioner. For
, the resulting algorithm has a
W-cycle structure, and differs only slightly from the
textbook version of the W-cycle. Moreover, the method
guarantees that the resulting preconditioner maintains the
approximation quality of the initial two-level
preconditioner. The quality of approximation is measured
using a certain distance function, which determines the
degree to which two operators with positive definite
symmetric parts are spectrally equivalent. We apply this
method to designing and analyzing a multigrid
preconditioner for a linear advection-diffusion-reaction
equation.