{'fraction_non_alphanumeric': 0.011695906432748537, 'fraction_numerical': 0.0, 'mean_word_length': 5.846666666666667, '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}}
Optimal Convolution SOR Acceleration of Waveform Relaxation with Application to Parallel Simulation of Semiconductor Devices

In this paper we describe a novel generalized successive overrelaxation (SOR) algorithm for accelerating the convergence of the dynamic iteration method known as waveform relaxation. A new waveform convolution SOR algorithm is presented, along with a theorem for determining the optimal convolution SOR parameter. Both analytic and experimental results are given to demonstrate that the convergence of the waveform convolution SOR algorithm is substantially faster than that of the more obvious ordinary waveform SOR algorithm. Finally, to demonstrate the general applicability of this new method, it is used to solve the differential-algebraic system generated by spatial discretization of the time-dependent semiconductor device equations. Results from experiments on serial and parallel machines are presented to indicate a dramatic speedup over a more conventional method such as pointwise GMRES.