{'fraction_non_alphanumeric': 0.03546099290780142, 'fraction_numerical': 0.0006447453255963894, 'mean_word_length': 5.466666666666667, '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 generalized bisymmetric and skew-symmetric solutions of the system of generalized Sylvester matrix equations

A matrix P is called a symmetric orthogonal matrix if P = P T  = P −1. A matrix X is said to be a generalized bisymmetric with respect to P, if X = X T  = PXP. It is obvious that every symmetric matrix is a generalized bisymmetric matrix with respect to I (identity matrix). In this article, we establish two iterative algorithms for solving the system of generalized Sylvester matrix equations (including the Sylvester and Lyapunov matrix equations as special cases) over the generalized bisymmetric and skew-symmetric matrices, respectively. When this system is consistent over the generalized bisymmetric (skew-symmetric) matrix Y, firstly it is demonstrated that the first (second) algorithm can obtain a generalized bisymmetric (skew-symmetric) solution for any initial generalized bisymmetric (skew-symmetric) matrix. Secondly, by the first (second) algorithm, we can obtain the least Frobenius norm generalized bisymmetric (skew-symmetric) solution for special initial generalized bisymmetric (skew-symmetric) matrices. Moreover, it is shown that the optimal approximate generalized bisymmetric (skew-symmetric) solution of this system for a given generalized bisymmetric (skew-symmetric) matrix can be derived by finding the least Frobenius norm generalized bisymmetric (skew-symmetric) solution of a new system of generalized Sylvester matrix equations. Finally, the iterative methods are tested with some numerical examples.