{'fraction_non_alphanumeric': 0.012057272042200452, 'fraction_numerical': 0.0, 'mean_word_length': 5.176744186046512, '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}}
Unitary matrix pencils in signal processing

The problem of retrieving harmonics of a measured signal can be solved via solving an eigenvalue problem for a unitary Hessenberg matrix H built from the first Schurparameters of the Toeplitz matrix of the signal's autocorrelation coefficients. From the eigenvalues eιθk· we get the approximated frequencies θk and from the first components of the corresponding eigenvectors we get the amplitudes. The eigenvalue problem for H is equivalent to the eigenvalue problem for the unitary matrix pencil Go - λGe, called the Schurparameter pencil, the eigenvalues being the same for both problems. The advantage of working with this generalized eigenvalue problem instead of solving the standard eigenvalue problem for H lies in the sparsity of the matrix pencil Go - λGe, the only nonzero entries being in fact the Schurparameters. Solving the retrieval of harmonics problem as a unitary eigenvalue problem also has the advantage that we can make use of the mathematically rich eigenvalue structure of unitary matrices. This allows in particular to give bounds on the distance of the computed approximations to the frequencies to the "actual” frequencies. We present such results and numerical examples showing the accuracy of the method and the effectiveness of the perturbation results.