Fast and High-order Accuracy Numerical Methods for Time-Dependent Nonlocal Problems in $\mathbb{R}^2
In this paper, we study the Crank-Nicolson method for temporal dimension and the piecewise quadratic polynomial collocation method for spatial dimensions of time-dependent nonlocal problems. The new theoretical results of such discretization are that the proposed numerical method is unconditionally stable and its global truncation error is of $\mathcal{O}\left(\tau^2+h^{4-\gamma}\right)$ with $0<\gamma<1$, where $\tau$ and $h$ are the discretization sizes in the temporal and spatial dimensions respectively. Also we develop the conjugate gradient squared method to solving the resulting discretized nonsymmetric and indefinite systems arising from time-dependent nonlocal problems including two-dimensional cases. By using additive and multiplicative Cauchy kernels in non-local problems, structured coefficient matrix-vector multiplication can be performed efficiently in the conjugate gradient squared iteration. Numerical examples are given to illustrate our theoretical results and demonstrate that the computational cost of the proposed method is of $O(M \log M)$ operations where $M$ is the number of collocation points.