An iterative method for the numerical inversion of Laplace transforms
Mathematics of Computation
ACM Transactions on Mathematical Software (TOMS)
Mathematics of Computation
Applied Numerical Mathematics
SIAM Journal on Numerical Analysis
Domain reconstruction using photothermal techniques
Journal of Computational Physics
Journal of Computational and Applied Mathematics
Generalized exponential time differencing methods for fractional order problems
Computers & Mathematics with Applications
A Contour Integral Method for the Black-Scholes and Heston Equations
SIAM Journal on Scientific Computing
A Bootstrap Method for Sum-of-Poles Approximations
Journal of Scientific Computing
Evaluation of generalized Mittag---Leffler functions on the real line
Advances in Computational Mathematics
Fast convolution quadrature based impedance boundary conditions
Journal of Computational and Applied Mathematics
Hi-index | 0.01 |
The paper considers the numerical inversion by means of a quadrature formula based on the sinc function, of the Laplace transform of an original mapping which is analytic in some sector containing the half axis x≥0. It is shown that the classical estimate O(e-c√n) improves to O(e-cn/lnn, where n stands for the number of nodes used in the quadrature. The method is illustrated in the context of an evolutionary equation with memory.