{'fraction_non_alphanumeric': 0.016453382084095063, 'fraction_numerical': 0.003656307129798903, 'mean_word_length': 5.186440677966102, '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 class of efficient high‐order iterative methods with memory for nonlinear equations and their dynamics

In this paper we obtain some theoretical results about iterative methods with memory for nonlinear equations. The class of algorithms we consider focus on incorporating memory without increasing the computational cost of the algorithm. This class uses for the predictor step of each iteration a quantity that has already been calculated in the previous iteration, typically the quantity governing the slope from the previous corrector step. In this way we do not introduce any extra computation, and more importantly, we avoid new function evaluations, allowing us to obtain high‐order iterative methods in a simple way. A specific class of methods of this type is introduced, and we prove the convergence order is 2n+2n−2 with n+1 function evaluations. An exhaustive efficiency study is performed to show the competitiveness of these methods. Finally, we test some specific examples and explore the effect that this predictor may have on the convergence set by setting a dynamical study.