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., 2009. An algebraic multigrid method for high order time-discretizations of the div-grad and the curl-curl equations. Applied Numerical Mathematics, 59 (3-4), pp. 507-521.
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below. (Contact Author)
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. (
|Creators||Boonen, T., Van Lent, J. and Vandewalle, S.|
|Editors||Wirtschaftsforde Stadt Halle, I. G.|
|Uncontrolled Keywords||algebraic multigrid, high order time-discretization|
|Departments||Faculty of Science > Mathematical Sciences|
|Additional Information||Special Issue of selected papers from NUMDIFF-11: 11th Seminar on Numerical Solution of Differential and Differential-Algebraic Equations, Halle, Germany, 4-8 September 2006|
Actions (login required)