{'fraction_non_alphanumeric': 0.028368794326241134, 'fraction_numerical': 0.004728132387706856, 'mean_word_length': 5.465648854961832, '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}}
Equation-Free, Effective Computation for Discrete Systems: a Time stepper Based Approach

We propose a computer-assisted approach to studying the effective continuum behavior of spatially discrete evolution equations. The advantage of the approach is that the "coarse model" (the continuum, effective equation) need not be explicitly constructed. The method only uses a time-integration code for the discrete problem and judicious choices of initial data and integration times; our bifurcation computations are based on the so-called Recursive Projection Method (RPM) with arc-length continuation [Shroff & Keller, 1993]. The technique is used to monitor features of the genuinely discrete problem such as the pinning of coherent structures and its results are compared to quasi-continuum approaches such as the ones based on Pade approximations.