Abstract
One of the open problems in the numerical analysis of solutions to high-dimensional nonlinear integral equations with memory kernel and proportional delay is how to preserve the high-order accuracy for nonsmooth solutions. It is well-known that the solutions to these equations display a typical weak singularity at the initial time, which causes challenges in developing high-order and efficient numerical algorithms. The key idea of the proposed approach is to adopt a smoothing transformation for the multivariate spectral collocation method to circumvent the curse of singularity at the beginning of time. Therefore, the singularity of the approximate solution can be tailored to that of the exact one, resulting in high-order spectral collocation algorithms. Moreover, we provide a framework for studying the rate of convergence of the proposed algorithm. Finally, we give a numerical test example to show that the approach can preserve the nonsmooth solution to the underlying problems.