{'fraction_non_alphanumeric': 0.010494752623688156, 'fraction_numerical': 0.0, 'mean_word_length': 5.423076923076923, '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}}
Weighted Harmonic Projection Method for Computing the Eigenvalues of Nonsymmetric Matrix

The harmonic projection method can be used to find interior eigenpairs of large matrices. Given a target point or shift t to which the needed interior eigenvalues are close, the desired interior eigenpairs are the eigenvalues nearest t and the associated eigenvectors. In this paper, we present a new algorithm, which is called weighted harmonic projection algorithm for computing the eigenvalues of a nonsymmetric matrix. The implementation of the algorithm has been tested by numerical examples, the results show that the algorithm converges fast and works with high accuracy