{'fraction_non_alphanumeric': 0.01444043321299639, 'fraction_numerical': 0.0, 'mean_word_length': 5.607142857142857, '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}}
On the implementation of interior point methods for dual-core platforms

Computers with CPUs of multiple computing cores are now widely available. In the paper, we investigate how these modern architectures perform in the practice of interior point methods. In our study, we shall focus on the implementation of the Cholesky factorization of large-scale and sparse symmetric positive semidefinite matrices. Our numerical experiments will demonstrate that capabilities of modern processors can be efficiently utilized by special implementation techniques.