{'fraction_non_alphanumeric': 0.00850546780072904, 'fraction_numerical': 0.0, 'mean_word_length': 5.195488721804511, '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}}
Recursive trigonometric interpolation algorithms

Abstract Two new recursive algorithms for the calculation of the coefficients of the trigonometric polynomial that is fitted to measured data in the least-squares sense in a window of a sufficiently large size that is moving in time are proposed. Both algorithms use the strictly diagonally dominant property of the information matrix for a sufficiently large window size. The first one is based on a recursive inversion of the information matrix and the second one uses a priori estimate of the coefficients of the polynomial obtained from the Kaczmarz projection method. The algorithms are computationally suitable for selection of the order of a trigonometric polynomial in each step of a moving window in real-time applications. The results are verified by simulations.