Parallel strategies for the step by step Tau method

摘要

We propose some computational strategies for a parallel implementation of the step by step Tau method of Ortiz. This type of piecewise polynomial approximation is an extension of the well-known Lanczos–Tau method.Preliminary numerical experimentation showed promising results with respect to CPU time and accuracy of the solution. In particular, we apply this approach in parallel to the order zero Airy’s generalized function. Significant improvements have been obtained when compared with the numerical results of the sequential version of the segmented approximation, which has been reported in previous research.