{'fraction_non_alphanumeric': 0.014893617021276596, 'fraction_numerical': 0.002127659574468085, 'mean_word_length': 5.4520547945205475, '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}}
Parallel Computation of Eigenvalues of Real Matrices

Abstract : The paper describes the implementation of three standard matrix eigenvalue computation methods on an array machine with high efficiency. A brief description of the ILLIAC 4 computer is provided as background material. Three major sections follow--the first two describe Jacobi and Householder algorithms for real symmetric matrices, and the third describes the QR algorithm for real nonsymmetric matrices.