Multigrid waveform relaxation for the time-fractional heat equation

In this work, we propose an efficient and robust multigrid method for solving the time-fractional heat equation. Due to the nonlocal property of fractional differential operators, numerical methods usually generate systems of equations for which the coefficient matrix is dense. Therefore, the design of efficient solvers for the numerical simulation of these problems is a difficult task. We develop a parallel-in-time multigrid algorithm based on the waveform relaxation approach, whose application to time-fractional problems seems very natural due to the fact that the fractional derivative at each spatial point depends on the values of the function at this point at all earlier times. Exploiting the Toeplitz-like structure of the coefficient matrix, the proposed multigrid waveform relaxation method has a computational cost of $O(N M \log(M))$ operations, where $M$ is the number of time steps and $N$ is the number of spatial grid points. A semi-algebraic mode analysis is also developed to theoretically confirm the good results obtained. Several numerical experiments, including examples with non-smooth solutions and a nonlinear problem with applications in porous media, are presented

A multigrid continuation method for elliptic problems with folds

We introduce a new multigrid continuation method for computing solutions of nonlinear elliptic eigenvalue problems which contain limit points (also called turning points or folds). Our method combines the frozen tau technique of Brandt with pseudo-arc length continuation and correction of the parameter on the coarsest grid. This produces considerable storage savings over direct continuation methods,as well as better initial coarse grid approximations, and avoids complicated algorithms for determining the parameter on finer grids. We provide numerical results for second, fourth and sixth order approximations to the two-parameter, two-dimensional stationary reaction-diffusion problem: Δu+λ exp(u/(1+au)) = 0. For the higher order interpolations we use bicubic and biquintic splines. The convergence rate is observed to be independent of the occurrence of limit points

High order operator splitting methods based on an integral deferred correction framework

Integral deferred correction (IDC) methods have been shown to be an efficient way to achieve arbitrary high order accuracy and possess good stability properties. In this paper, we construct high order operator splitting schemes using the IDC procedure to solve initial value problems (IVPs). We present analysis to show that the IDC methods can correct for both the splitting and numerical errors, lifting the order of accuracy by $r$ with each correction, where $r$ is the order of accuracy of the method used to solve the correction equation. We further apply this framework to solve partial differential equations (PDEs). Numerical examples in two dimensions of linear and nonlinear initial-boundary value problems are presented to demonstrate the performance of the proposed IDC approach.Comment: 33 pages, 22 figure