{'fraction_non_alphanumeric': 0.05081081081081081, 'fraction_numerical': 0.002162162162162162, 'mean_word_length': 5.173333333333333, '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}}
Canonical piecewise-linear analysis

Any continuous resistive nonlinear circuit can be approximated to any desired accuracy by a global piecewise-linear equation in the canonical form a + B x + \sum_{i=1}^{p}c_{i} |\langle \alpha_{i}, x \rangle - \beta_{i}|= 0 . All conventional circuit analysis methods (nodal, mesh, cut set, loop, hybrid, modified nodal, tableau) are shown to always yield an equation of this form, provided the only nonlinear elements are two-terminal resistors and controlled sources, each modeled by a one-dimensional piecewise-linear function. The well-known Katzenelson algorithm when applied to this equation yields an efficient algorithm which requires only a minimal computer storage. In the important special case when the canonical equation has a lattice structure (which always occur in the hybrid analysis), the algorithm is further refined to achieve a dramatic reduction in computation time.