{'fraction_non_alphanumeric': 0.015240328253223915, 'fraction_numerical': 0.0, 'mean_word_length': 5.832, '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}}
Double iterative algorithm for solving different constrained solutions of multivariate quadratic matrix equations

Constrained solutions are required in some practical problems. This paper studies the problem of different constrained solutions for a class of multivariate quadratic matrix equations, which has rarely been studied before. First, the quadratic matrix equations are transformed into linear matrix equations by Newton's method. Second, the different constrained solutions of the linear matrix equations are solved by the modified conjugate gradient method, and then the different constrained solutions of the multivariate quadratic matrix equations are obtained. Finally, the convergence of the algorithm is proved. The algorithm can be well performed on the computers, and the effectiveness of the method is verified by numerical examples.