{'fraction_non_alphanumeric': 0.024864864864864864, 'fraction_numerical': 0.005405405405405406, 'mean_word_length': 4.935897435897436, '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}}
Coprime fraction of 2-D rational matrices

This paper presents a numerical method of computing a coprime fraction of a two-dimensional (2-D) rational matrix, not necessarily proper. It is achieved by searching the primary linearly dependent rows, in order from top to bottom, of the two generalized resultants. Although the procedure is an extension of the 2-D scalar and 1-D matrix cases, the extension is highly nontrivial and the ideas involved is drastically different. The result can also be used to compute greatest common divisor (GCD) of 2-D polynomial matrices without employing primitive factorizations. Since the primitive factorization does not exist in three or higher dimensional case, it may not be possible to extend the existing methods of computing GCD, which rely heavyly on the primitive factorization, to three or higher dimensional case. The procedure presented in this paper however can be so extended.