{'fraction_non_alphanumeric': 0.012658227848101266, 'fraction_numerical': 0.0, 'mean_word_length': 5.597222222222222, '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 algorithm for computing the extreme eigenvectors of a complex Hermitian matrix

This paper presents a novel algorithm for computing the eigenvector associated with either the largest or the smallest eigenvalue of a complex Hermitian matrix. This type of algorithm is required for direction of arrival (DOA) and frequency estimation. Necessary and sufficient conditions for convergence are proved, and simulations show the superior performance over traditional methods.