{'fraction_non_alphanumeric': 0.019815059445178335, 'fraction_numerical': 0.001321003963011889, 'mean_word_length': 4.968503937007874, '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}}
AN ITERATIVE METHOD FOR THE HERMITIAN-GENERALIZED HAMILTONIAN SOLUTIONS TO THE INVERSE PROBLEM AX=B WITH A SUBMATRIX CONSTRAINT

In this paper, an iterative method is proposed for solving the matrix inverse problem AX = B for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix A0, a solution A ∗ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of initial matrix. Furthermore, in the solution set of the above problem, the unique optimal approximation solution to a given matrix can also be obtained. A numerical example is presented to show the efficiency of the proposed algorithm.