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

Boonen, T. , Van lent, J. and Vandewalle, S. (2008) An algebraic multigrid method for high order time-discretizations of the div-grad and the curl-curl equations. Applied Numerical Mathematics, 59 (3-4). 507 - 521. ISSN 0168-9274

[img]
Preview
 PDF - Accepted Version
205Kb

Publisher's URL: http://dx.doi.org/10.1016/j.apnum.2008.03.004

Abstract

We present an 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 as a function of the number of variables.

Item Type:Article
Additional Information:Selected Papers from NUMDIFF-11
Uncontrolled Keywords:algebraic multigrid, high order time-discretization
Faculty/Department:Faculty of Environment and Technology > Department of Engineering Design and Mathematics
~Pre-2010 Faculty Structure > Environment and Technology > Bristol Institute of Technology > Applied Mathematics Group
~Pre-2012 Faculty Structure > Faculty of Environment and Technology > Department of Engineering Design and Mathematics
ID Code:12794
Deposited By: J. Van Lent
Deposited On:07 Dec 2010 12:58
Last Modified:23 Nov 2012 02:34

Repository Staff Only: item control page

Total Document Downloads in Past 12 Months

Document Downloads

Total Document Downloads

More statistics for this item...
Copyright 2013 © UWE better together