{'fraction_non_alphanumeric': 0.014522821576763486, 'fraction_numerical': 0.0, 'mean_word_length': 5.03125, '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}}
Investigation of different matrix solver for spherical near-field to far-field transformation

The calculation of the spherical mode spectrum for the near-field to far-field transformation can be efficiently calculated by the use of the Fourier transform. However, this method requires an equiangular sampling over the sphere. This limitation can be overcome if the transmission equation is reformulated as a system of linear equations. The paper presents and compares different methods such as the least squares method and two iterative algorithms. It is shown that using a linear equation system does not reduce the accuracy of the calculated mode spectrum. Further it is pointed out that the flexibility can be used to apply arbitrary sampling grids and results for random sampling are presented. In conclusion it is motivated to replace the Fourier transform by a linear equation solver in order to improve the spherical near-field to far-field transformation.