Algorithm 682: Talbot's method of the Laplace inversion problems
ACM Transactions on Mathematical Software (TOMS)
Parallel Talbot's algorithm for distributed memory machines
Parallel Computing
Parallel programming in OpenMP
Parallel programming in OpenMP
Solving Linear Systems on Vector and Shared Memory Computers
Solving Linear Systems on Vector and Shared Memory Computers
A New Message Passing Algorithm for Solving Linear Recurrence Systems
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Fast Parallel Algorithms for Computing Trigonometric Sums
PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
| Hi-index | 0.00 |
The aim of this paper is to show that the recently developed high performance divide and conquer algorithm for finding trigonometric sums can be applied to improve the performance of the Talbot's method for the numerical inversion of the Laplace Transform on modern computer architectures including shared memory parallel computers. We also show how to vectorize the first stage of the Talbot's method, namely computing all coefficients of the trigonometric sums used by the method. Numerical tests show that the improved method gives the same accuracy as the standard algorithm and it allows to utilize parallel processors.