Skip to main content

Analysis and comparison of relaxation schemes in robust multigrid and preconditioned conjugate gradient methods

  • Part II: Specific Contributions
  • Conference paper
  • First Online:
Multigrid Methods

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 960))

Abstract

A robust and efficient MG (Multigrid) method should incorporate both suitable transitions between fine and coarse grids and a good smoothing method.

In a recent paper, we presented an MG method based on incomplete Gauss elimination / continuity interpolation to cope with strong inhomogeneities and general domains. Further acceleration has been achieved by using the MG method as preconditioning for CG, the result being called MGCG. In addition, a robust smoothing method is required for problems with strong anisotropies.

In this paper, several Gauss-Seidel and incomplete LU relaxation schemes are more extensively compared with respect to their smoothing factors and efficiencies. Besides, the practical behaviour of some of these schemes is compared for three iterative methods (MG, MGCG and ICCG) and two difficult test problems (according to Stone and Kershaw).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alcouffe, R.E., Brandt, A., Dendy Jr., J.E. and Painter, J.W., The multi-grid method for the diffusion equation with strongly discontinuous coefficients, SIAM J. Sci. Stat. Comput. 2, pp. 430–454, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  2. Brandt, A., Multi-level adaptive solutions to boundary-value problems, Math. Comp. 31, pp. 333–390, 1977.

    Article  MathSciNet  MATH  Google Scholar 

  3. Brandt, A., Multigrid solvers on parallel computers, Elliptic Problem Solvers, Proceedings, M.H. Schultz, ed., Academic Press, New York, pp. 39–83, 1981.

    Google Scholar 

  4. Foerster, H., Stüben, K. and Trottenberg, U., Non-standard multigrid techniques using checkered relaxation and intermediate grids, Elliptic Problem Solvers, Proceedings, M.H. Schultz, ed., Academic Press, New York, pp. 285–300, 1981.

    Chapter  Google Scholar 

  5. Hackbusch, W., On the multi-grid method applied to difference equations, Computing 20, pp. 291–306, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  6. Kershaw, D.S., The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations, J. Comp. Phys. 26, pp. 43–65, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  7. Kettler, R. and Meijerink, J.A., A multigrid method and a combined multigrid-conjugate gradient method for elliptic problems with strongly discontinuous coefficients in general domains, Shell Publications 604, KSEPL, Rijswijk, The Netherlands, 1981. (submitted)

    Google Scholar 

  8. Meijerink, J.A. and Van der Vorst, H.A., An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp. 31, pp. 148–162, 1977.

    MathSciNet  MATH  Google Scholar 

  9. Meijerink, J.A. and Van der Vorst, H.A., Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems, J. Comp. Phys. 44, pp. 134–155, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  10. Meijerink, J.A., Incomplete block LU factorisations, publication in preparation.

    Google Scholar 

  11. Stone, H.L., Iterative solution of implicit approximations of multidimensional partial differential equations, SIAM J. Numer. Anal. 5, pp. 530–558, 1968.

    Article  MathSciNet  MATH  Google Scholar 

  12. Wesseling, P., A robust and efficient multigrid method, in this volume.

    Google Scholar 

  13. Wesseling, P. and Sonneveld, P., Numerical experiments with a multiple grid and a preconditioned Lanczos method, Approximation Methods for Navier-Stokes Problems, Proceedings, Paderborn 1979, R. Rautmann, ed., Lecture Notes in Math. 771, Springer-Verlag, Berlin, pp. 534–562, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

W. Hackbusch U. Trottenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag

About this paper

Cite this paper

Kettler, R. (1982). Analysis and comparison of relaxation schemes in robust multigrid and preconditioned conjugate gradient methods. In: Hackbusch, W., Trottenberg, U. (eds) Multigrid Methods. Lecture Notes in Mathematics, vol 960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0069941

Download citation

  • DOI: https://doi.org/10.1007/BFb0069941

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11955-5

  • Online ISBN: 978-3-540-39544-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics