An algebraic multigrid method for high order time-discretizations of the div-grad and the curl-curl equations

T Boonen, Jan Van Lent, S Vandewalle, Intec GmbH Wirtschaftsforde Stadt Halle (Editor)

Research output: Contribution to journalArticle

Abstract

We present in algebraic multigrid algorithm for fully Coupled implicit Runge-Kutta and Boundary Value Method time-discretizations of the div-grad and curl-curl equations. The algorithm uses a blocksmoother and a multigrid hierarchy derived from the hierarchy built by any algebraic multigrid algorithm for the stationary version of the problem. By a theoretical analysis and numerical experiments, we show that the convergence is similar to or better than the convergence of the scalar algebraic multigrid algorithm on which it is based. The algorithm benefits from several possibilities for implementation optimization. This results in a Computational complexity which, for a modest number of stages, scales almost linearly its a function of the munber of variables. (
Original languageEnglish
Pages (from-to)507-521
Number of pages15
JournalApplied Numerical Mathematics
Volume59
Issue number3-4
DOIs
Publication statusPublished - Mar 2009

Keywords

  • Algebraic multigrid
  • High order time-discretization

Fingerprint Dive into the research topics of 'An algebraic multigrid method for high order time-discretizations of the div-grad and the curl-curl equations'. Together they form a unique fingerprint.

  • Cite this