{'fraction_non_alphanumeric': 0.03951890034364261, 'fraction_numerical': 0.018900343642611683, 'mean_word_length': 4.3, '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}}
A Linear Complementarity Problem with a P-Matrix

In this paper, we present an application of a linear complementarity problem where M is a P-matrix but, in general, is neither an H-matrix nor a positive definite matrix. This application occurs originally in [J. Rohn, Linear Algebra Appl., 126 (1989), pp. 39--78], which is less known to the LCP community. Its focus is in computing the exact interval enclosures of the components of the solution set of an interval linear system. We extend the idea such that the calculations can be done by a computer with rigorous error control.