{'fraction_non_alphanumeric': 0.020026702269692925, 'fraction_numerical': 0.0026702269692923898, 'mean_word_length': 5.521739130434782, '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 Newton linearized compact finite difference scheme for one class of Sobolev equations

In this article, a Newton linearized compact finite difference scheme is proposed to numerically solve a class of Sobolev equations. The unique solvability, convergence, and stability of the proposed scheme are proved. It is shown that the proposed method is of order 2 in temporal direction and order 4 in spatial direction. Moreover, compare to the classical extrapolated Crank‐Nicolson method or the second‐order multistep implicit–explicit methods, the proposed scheme is easier to be implemented as it only requires one starting value. Finally, numerical experiments on one and two‐dimensional problems are presented to illustrate our theoretical results.