{'fraction_non_alphanumeric': 0.034375, 'fraction_numerical': 0.004166666666666667, 'mean_word_length': 7.07563025210084, '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}}
Polynomials‐based summation inequalities and their applications to discrete‐time systems with time‐varying delays

This paper proposes a novel summation inequality, say a polynomials‐based summation inequality, which contains well‐known summation inequalities as special cases. By specially choosing slack matrices, polynomial functions, and an arbitrary vector, it reduces to Moon's inequality, a discrete‐time counterpart of Wirtinger‐based integral inequality, auxiliary function‐based summation inequalities employing the same‐order orthogonal polynomial functions. Thus, the proposed summation inequality is more general than other summation inequalities. Additionally, this paper derives the polynomials‐based summation inequality employing first‐order and second‐order orthogonal polynomial functions, which contributes to obtaining improved stability criteria for discrete‐time systems with time‐varying delays. Copyright © 2017 John Wiley & Sons, Ltd.