## Fast and high accuracy multigrid solution of the three dimensional Poisson equation.(English)Zbl 0927.65141

Multigrid methods for solving the Poisson equation in three-dimensional domains are studied. For the discretization a fourth-order compact difference scheme (19-point scheme) and the usual second-order central difference scheme (7-point scheme) are considered.
Using a Fourier analysis it is shown that the smoothing factor of the lexicographic Gauss-Seidel method is smaller in the case of the 19-point scheme than in the case of the 7-point scheme. Furthermore, a new method of Fourier smoothing analysis to study a partially decoupled red-black Gauss-Seidel relaxation with the 19-point scheme is proposed. This analysis shows that the smoothing factor of the red-black Gauss-Seidel smoother is smaller than that of the lexicographic Gauss-Seidel method. The numerical experiments presented confirm these theoretical results.
The influence of several grid transfer operators on the convergence behaviour and the efficiency of the multigrid method is studied by numerical experiments.
Reviewer: M.Jung (Chemnitz)

### MSC:

 65N55 Multigrid methods; domain decomposition for boundary value problems involving PDEs 65N06 Finite difference methods for boundary value problems involving PDEs 65F10 Iterative numerical methods for linear systems 35J05 Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation 65N12 Stability and convergence of numerical methods for boundary value problems involving PDEs

Wesseling
Full Text:

### References:

 [1] Ananthakrishnaiah, U.; Manohar, R.; Stephenson, J. W., Fourth-order finite difference methods for three-dimensional general linear elliptic problems with variable coefficients, Numer. Methods Partial Differential Equations, 3, 229 (1987) · Zbl 0651.65068 [2] Behie, A.; Forsyth, P. A., Multi-grid solution of three dimensional problems with discontinuous coefficients, Appl. Math. Comput., 13, 229 (1983) · Zbl 0534.65064 [3] Brandt, A., Multi-level adaptive solution to boundary-value problems, Math. Comp., 31, 333 (1977) · Zbl 0373.65054 [4] Briggs, W. L., A Multigrid Tutorial (1987) [5] Gary, J.; McCormick, S.; Sweet, R., Successive overrelaxation, multigrid, and pre-conditioned conjugate gradients algorithms for solving a diffusion problem on a vector computer, Appl. Math. Comput., 13, 285 (1983) · Zbl 0527.65071 [6] Gupta, M. M.; Kouatchou, J.; Zhang, J., Comparison of second and fourth order discretizations for multigrid Poisson solver, J. Comput. Phys., 132, 226 (1997) · Zbl 0881.65120 [7] Holter, W. H., A vectorized multigrid solver for the three-dimensional Poisson equation, Supercomputer Applications, 17 (1985) · Zbl 0587.65065 [9] Kwon, Y.; Stephenson, J. W., Single cell finite difference approximations for Poisson’s equation in three variables, Appl. Math. Notes, 2, 13 (1982) · Zbl 0511.65068 [10] Schaffer, S., High order multi-grid methods, Math. Comp., 43, 89 (1984) · Zbl 0557.65065 [12] Thole, C.-A.; Trottenberg, U., A short note on standard parallel multigrid algorithms for 3D problems, Appl. Math. Comput., 27, 101 (1988) · Zbl 0655.65115 [13] Spotz, W. F.; Carey, G. F., A high-order compact formulation for the 3D Poisson equation, Numer. Methods Partial Differential Equations, 12, 235 (1996) · Zbl 0866.65066 [15] Wesseling, P., An Introduction to Multigrid Methods (1992) · Zbl 0760.65092 [16] Zhang, J., A cost-effective multigrid projection operator, J. Comput. Appl. Math., 76, 325 (1996) · Zbl 0873.65106 [17] Zhang, J., Residual scaling techniques in multigrid. II. Practical applications, Appl. Math. Comput., 90, 229 (1998) · Zbl 0905.65114 [18] Zlámal, M., Superconvergence and reduced integration in the finite element method, Math. Comp., 32, 663 (1978) · Zbl 0448.65068
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.