{'fraction_non_alphanumeric': 0.012998266897746967, 'fraction_numerical': 0.0, 'mean_word_length': 5.2771739130434785, '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}}
Mata routines for solution of nonlinear systems using interval methods

Solution of nonlinear systems has become increasingly important as a step in many estimation problems, and is a problem of interest in its own right. I introduce a collection of Mata routines that can be used to find all solutions to nonlinear equation systems, and demonstrate their usage on a sequence of test problems. While specifically tailored to solving polynomial systems, the method can be applied to any continuous system with continuous Jacobian. The methods rely on interval Newton methods, a technique which combines Taylor expansion, bisection, and interval programming. The routines come equipped with an heuristic solver that allows for approximate solution of problems that are especially time consuming, or problems that do not require that all solutions be found. Support tools for the solver include functions for interval arithmetic and manipulation of series of matrices in parallel. I discuss an extended application of the solution tools to the problem of finding all equilibria of discrete action games, which in general requires solving polynomial systems.