Algorithms for Computation of Quasi-polynomial Zeros
Quasi-Polynomial Mapping Based Rootfinder (QPmR)
The QPmR is a root-finding algorithm developed for computing the spectrum of both Retarded and Neutral Time Delay Systems.
Vyhlídal, T. and Zítek, P., (2003), Quasipolynomial mapping based rootfinder for analysis of time delay systems, Time Delay Systems 2003 – A Proceedings volume from the 4th IFAC workshop, Rocquencourt, France, Elsevier: Oxford, pp. 227-232.
Advanced Quasi-Polynomial Mapping Based Rootfinder utilizing Asymptotic root distribution features (aQPmR)
The aQPmR is a root-finding algorithm developed for large-scale efficient computing the spectrum of Retarded Time Delay Systems.
Vyhlídal, T. and Zítek, P., (2006), Mapping the spectrum of a retarded time delay system utilizing root distribution features, In Proc of IFAC Workshop on Time-Delay Systems, TDS’06, L'Aquila
Vyhlídal T., P. Zítek, Mapping based algorithm for large-scale computation of quasi-polynomial zeros, IEEE Transactions on Automatic Control, Accepted 2008
Created by Tomas Vyhlidal