{'fraction_non_alphanumeric': 0.014492753623188406, 'fraction_numerical': 0.0, 'mean_word_length': 6.0, '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}}
Computation of system balancing transformations

An algorithm is presented in this paper for computing state space balancing transformations directly from a state space realization. The algorithm requires no "squaring up." Various algorithmic aspects are discussed in detail. Applications to numerous other closely-related problems are also mentioned. The key idea throughout involves determining a contragredient transformation through computing the singular value decomposition of a certain product of matrices without explicitly forming the product.