{'fraction_non_alphanumeric': 0.028499580888516344, 'fraction_numerical': 0.002514668901927913, 'mean_word_length': 5.154639175257732, '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}}
Collocation methods for boundary value problems on “long” intervals

This paper deals with the numerical solution of boundary value problems of ordinary differential equations posed on infinite intervals. We cut the infinite interval at a finite, large enough point and insert additional, so-called asymptotic boundary conditions at the far (right) end and then solve the resulting two-point boundary value problem by an A-stable symmetric collocation method. Problems arise, because standard theory predicts the use of many grid points as the length of the interval increases. Using the exponential decay of the 'infinite' solution, an 'asymptotic' a priori mesh-size sequence which increases exponentially, and which therefore only employs a reasonable number of meshpoints, is developed and stability, as the length of the interval tends to infinity, is shown. We also show that the condition number of the collocation equations is asymptotically proportional to the number of meshpoints employed when using this exponentially graded mesh. Using k-stage collocation at Gaussian points and requiring an accuracy 0(E-) at the knots implies that the number of meshpoints is Q(g-i/2k) as E O 0.