On Optimal Computational Algorithm and Transition Cardinalities for Solution Matrices Of Single–Delaylinear Neutral Scalar Differential Equations.

Abstract

This paper established an optimal computationalalgorithm for solution matrices of single–delay autonomous linear neutral equations based on the established expressions of such matrices on a horizon of length equal to five times the delay. The development of the solution matrices exploited the continuity of these matrices for positive time periods, the method of steps, change of variables and theory of linear difference equations to obtain these matrices on successive intervals of length equal to the delay h.