Multigrid applied to singular perturbation problems

Abstract

The solution of the singular perturbation problem by a multigrid algorithm is considered. Theoretical and experimental results for a number of different discretizations are presented. The theoretical and observed rates agree with the results developed in an earlier work of Kamowitz and Parter. In addition, the rate of convergence of the algorithm when the coarse grid operator is the natural finite difference analog of the fine grid operator is presented. This is in contrast to the case in the previous work where the Galerkin choice (I sup H sub h L sub h,I sup h sub H) was used for the coarse grid operators.