{'fraction_non_alphanumeric': 0.01594896331738437, 'fraction_numerical': 0.003189792663476874, 'mean_word_length': 5.217821782178218, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A TABULAR ALGORITHM FOR TESTING THE ROBUST HURWITZ STABILITY OF CONVEX COMBINATIONS OF COMPLEX POLYNOMIALS

Abstract In this paper we present a tabular algorithm for testing the Hurwitz property of a segment of complex polynomials. The algorithm consists in constructing a parametric Routh-like array with polynomial entries and generating Sturm sequences for checking the absence of zeros of two real polynomials in the interval (0, 1). The presented algorithm is easy to implement. Moreover, it accomplishes the test in a finite number of arithmetic operations because it does not invoke any numerical root-finding procedure.