{'fraction_non_alphanumeric': 0.017123287671232876, 'fraction_numerical': 0.0, 'mean_word_length': 6.188524590163935, '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}}
Approximated structured pseudospectra

Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and structured pseudospectra, based on determining the spectra of many suitably chosen rank‐one or projected rank‐one perturbations of the given matrix is proposed. The choice of rank‐one or projected rank‐one perturbations is inspired by Wilkinson's analysis of eigenvalue sensitivity. Numerical examples illustrate that the proposed approach gives much better insight into the pseudospectra and structured pseudospectra than random or structured random rank‐one perturbations with lower computational burden. The latter approach is presently commonly used for the determination of structured pseudospectra.