{'fraction_non_alphanumeric': 0.011673151750972763, 'fraction_numerical': 0.0, 'mean_word_length': 5.487394957983193, '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}}
On The Computation Of Eigenvalue Assignment Problem

This note shows that in computing the feedback gain for eigenvalue assignment in multivariable systems, the reduction of the condition number of the closed loop eigenvector matrix (CLEM) is a necessary step to achieve some highly important and desirable technical and computational properties. This note also shows that the reduction of the condition number of other relevant matrix does not sufficiently imply the achievement of these properties. The only existing algorithm capable of reducing the condition number of CLEM computes the explicit CLEM. Fortunately, this computation is very efficient and numerically stable, and is completely different from the computation of the eigenvector matrix of a given matrix.