{'fraction_non_alphanumeric': 0.01620745542949757, 'fraction_numerical': 0.0, 'mean_word_length': 5.645161290322581, '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}}
A numerical algorithm for computing quasi-weierstrass form of descriptor systems

In this paper a numerical algorithm for computing quasi-Weierstrass form of descriptor systems is presented. A conventional algorithm depends on QZ algorithm that needs iterative computation until convergence. Since the proposed algorithm avoids QZ algorithm, the computational time will not be influenced even with repeated eigenvalues or close eigen-values whereas the conventional one will be. Furthermore, the proposed algorithm is numerically stable. Numerical examples are given to confirm the validity of the proposed algorithm.