EQUATIONS WITH INFINITE DELAY: PSEUDOSPECTRAL DISCRETIZATION FOR NUMERICAL STABILITY AND BIFURCATION IN AN ABSTRACT FRAMEWORK

We consider nonlinear delay differential and renewal equations with infinite delay. We extend the work of Gyllenberg et al. [Appl. Math. Comput., 333 (2018), pp. 490-505] by introducing a unifying abstract framework, and we derive a finite-dimensional approximating system via pseudospectral discretization. For renewal equations, we consider a reformulation in the space of absolutely continuous functions via integration. We prove the one-to-one correspondence of equilibria between the original equation and its approximation, and that linearization and discretization commute. Our most important result is the proof of convergence of the characteristic roots of the pseudospectral approximation of the linear(ized) equations when the collocation nodes are chosen as the family of scaled zeros or extrema of Laguerre polynomials. This ensures that the finite-dimensional system correctly reproduces the stability properties of the original linear equation if the dimension of the approximation is large enough. The result is illustrated with several numerical tests, which also demonstrate the effectiveness of the approach for the bifurcation analysis of equilibria of nonlinear equations. The new approach used to prove convergence also provides the exact location of the spectrum of the differentiation matrices for the Laguerre zeros and extrema, adding new insights into properties that are important in the numerical solution of differential equations by pseudospectral methods.