{'fraction_non_alphanumeric': 0.030042918454935622, 'fraction_numerical': 0.02575107296137339, 'mean_word_length': 5.064935064935065, '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 new error bound for linear complementarity problems of weakly chained diagonally dominant B-matrices

ABSTRACT A new error bound for the linear complementarity problem with the involved matrix being a weakly chained diagonally dominant B-matrix is presented. It is proved that the new bound is an improvement of that in [Li CQ, Li YT. Weakly chained diagonally dominant B-matrices and error bounds for linear complementarity problems. Numer Algor.2016;73:985–998].