{'fraction_non_alphanumeric': 0.026923076923076925, 'fraction_numerical': 0.0, 'mean_word_length': 5.353658536585366, '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}}
New Stepsize Estimators for Linear Multistep Methods Department of Mathematics New Stepsize Estimators for Linear Multistep Methods

The selection of appropriate stepsizes for linear multistep methods requires in general the solution, or approximation, of a non-trivial polynomial root-nding problem. Here we show how this can be reduced to the integration of a simple ODE. Results are presented for Adams-Bashforth-Moulton and backward diierentiation formulae using both error-per-step and error-per-unit-step controls.