Abstract
We present an algorithm based on the argument principle for computing all unstable characteristic roots of a class of neutral time delay systems. By consecutively subdividing a bounded rectangular or half circular region on the right half complex plane into smaller ones, initial approximate positions of all unstable roots can be located efficiently. With these approximate positions as starting points for Newton's method, approximations for all roots are refined iteratively. The performance of the algorithm is shown by an example.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
