{'fraction_non_alphanumeric': 0.014705882352941176, 'fraction_numerical': 0.0021008403361344537, 'mean_word_length': 5.194805194805195, '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 new block algorithm for solving the Sylvester-observer equation

A new block algorithm for computing a full rank solution of the Sylvester-observer equation is proposed. The algorithm is structure preserving and rich in BLAS-3 computations and thus suitable for high performance computing. Furthermore, the results on numerical experiments on benchmark examples show that the algorithm has better accuracy than that of some of the existing block algorithms for this problem.