Numerical solution of linear Volterra integral equations of the second kind with sharp gradients

  • Authors:

  • Samuel A. Isaacson;Robert M. Kirby

  • Affiliations:

  • Department of Mathematics and Statistics, Boston University, 111 Cummington St., Boston, MA 02215, USA;School of Computing, University of Utah, 72 S. Central Campus Drive, 3750 Warnock Engineering Building, Salt Lake City, UT 84112, USA

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2011

Quantified Score

Hi-index 7.31

Visualization

Abstract

Collocation methods are a well-developed approach for the numerical solution of smooth and weakly singular Volterra integral equations. In this paper, we extend these methods through the use of partitioned quadrature based on the qualocation framework, to allow the efficient numerical solution of linear, scalar Volterra integral equations of the second kind with smooth kernels containing sharp gradients. In this case, the standard collocation methods may lose computational efficiency despite the smoothness of the kernel. We illustrate how the qualocation framework can allow one to focus computational effort where necessary through improved quadrature approximations, while keeping the solution approximation fixed. The computational performance improvement introduced by our new method is examined through several test examples. The final example we consider is the original problem that motivated this work: the problem of calculating the probability density associated with a continuous-time random walk in three dimensions that may be killed at a fixed lattice site. To demonstrate how separating the solution approximation from quadrature approximation may improve computational performance, we also compare our new method to several existing Gregory, Sinc, and global spectral methods, where quadrature approximation and solution approximation are coupled.