{'fraction_non_alphanumeric': 0.013245033112582781, 'fraction_numerical': 0.0, 'mean_word_length': 5.173469387755102, '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}}
On the application of displacement structure methods to obtain null-spaces of polynomial matrices

In this paper we present different algorithms to obtain the null-space of a polynomial matrix. These algorithms are based on the computation of the constant null-spaces of some associated block Toeplitz matrices. For the case of large block Toeplitz matrices we introduce two fast numerical methods to compute their constant null-spaces and we compare the performance of these fast methods with the classical orthogonal methods. We also discuss briefly the numerical stability of the developed algorithms.