A scalable approach to compute delay margin of a class of neutral-type time delay systems

An approach is presented to approximate the delay margin of a class of linear time-invariant neutral-type time delay systems. The approach is based on frequency sweeping tools and factorization of the corresponding characteristic function of the system, without any assumptions on the structure of system matrices. Different from published work, it enables the approximation of the delay margin on a scalable framework by means of a suitable numerical search of roots crossing the imaginary axis, hence it allows to substantially reduce computation times through parallel processing. Effectiveness of the approach is demonstrated on various problems.