{'fraction_non_alphanumeric': 0.015580736543909348, 'fraction_numerical': 0.0, 'mean_word_length': 5.669811320754717, '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}}
The relaxation modulus-based matrix splitting iteration method for solving a class of nonlinear complementarity problems

ABSTRACT In this paper, by the relaxation technique, the relaxation modulus-based matrix splitting iteration method is presented for solving a class of nonlinear complementarity problems. The convergence conditions are given when the system matrix is a positive definite matrix or an H-matrix. The strategy of the choice of the relaxation parameters is discussed. Numerical examples show that the proposed method is efficient and accelerates the convergence performance of the modulus-based matrix splitting iteration method and the projection-based matrix splitting iteration method.