{'fraction_non_alphanumeric': 0.006535947712418301, 'fraction_numerical': 0.0, 'mean_word_length': 5.663043478260869, '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}}
Regularization of Linear Descriptor Systems with Variable Coefficients

We study linear descriptor control systems with rectangular variable coefficient matrices. We introduce condensed forms for such systems under equivalence transformations and use these forms to detect whether the system can be transformed to a uniquely solvable closed loop system via state or derivative feedback. We show that under some mild assumptions every such system consists of an underlying square subsystem that behaves essentially like a standard state space system, plus some solution components that are constrained to be zero.