Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-13T04:07:25.948Z Has data issue: false hasContentIssue false

Numerical inversion for Laplace transforms of functions with discontinuities

Published online by Cambridge University Press:  01 July 2016

T. Sakurai*
Affiliation:
University of Melbourne
*
Postal address: ARC Special Research Centre for Ultra-Broadband Information Networks, Department of Electrical and Electronic Engineering, University of Melbourne, Melbourne, VIC 3010, Australia. Email address: t.sakurai@ee.mu.oz.au

Abstract

We analyse the role of Euler summation in a numerical inversion algorithm for Laplace transforms due to Abate and Whitt called the EULER algorithm. Euler summation is shown to accelerate convergence of a slowly converging truncated Fourier series; an explicit bound for the approximation error is derived that generalizes a result given by O'Cinneide. An enhanced inversion algorithm called EULER-GPS is developed using a new variant of Euler summation. The algorithm EULER-GPS makes it possible to accurately invert transforms of functions with discontinuities at arbitrary locations. The effectiveness of the algorithm is verified through numerical experiments. Besides numerical transform inversion, the enhanced algorithm is applicable to a wide range of other problems where the goal is to recover point values of a piecewise-smooth function from the Fourier series.

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 2004 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Abate, J. and Whitt, W. (1992). The Fourier-series method for inverting transforms of probability distributions. Queueing Systems 10, 588.CrossRefGoogle Scholar
[2] Abate, J., Choudhury, G. L. and Whitt, W. (1996). On the Laguerre method for numerically inverting Laplace transforms. INFORMS J. Comput. 8, 413427.Google Scholar
[3] Abate, J., Choudhury, G. L. and Whitt, W. (2000). An introduction to numerical transform inversion and its application to probability models. In Computational Probability, ed. Grassman, W. K., Kluwer, Norwell, MA, pp. 257323.Google Scholar
[4] Bleistein, N. and Handelsman, R. A. (1986). Asymptotic Expansion of Integrals, 2nd edn. Dover, New York.Google Scholar
[5] Boyd, J. P. (1995). A lag-averaged generalization of Euler's method for accelerating series. Appl. Math. Comput. 72, 143166.Google Scholar
[6] Boyd, J. P. (1996). The Erfc-Log filter and asymptotics of the Vandeven and Euler sequence accelerations. In Proc. Third Internat. Conf. Spectral High Order Meth., Houston Journal of Mathematics, Houston, TX, pp. 267276.Google Scholar
[7] Briggs, W. L. and Henson, V. E. (1995). The DFT: An Owner's Manual for the Discrete Fourier Transform. SIAM, Philadelphia, PA.Google Scholar
[8] Butzer, P. L. and Nessel, R. J. (1971). Fourier Analysis and Approximation. Birkhäuser, Basel.Google Scholar
[9] Carslaw, H. S. (1930). Introduction to the Theory of Fourier's Series and Integrals, 3rd edn. Dover, New York.Google Scholar
[10] Chen, W. L. and O'Cinneide, C. A. (2002). The generalized Euler summation method to invert transforms. Preprint.Google Scholar
[11] Choudhury, G. L., Lucantoni, D. M. and Whitt, W. (1994). Multidimensional transform inversion with applications to the transient M/G/1 queue. Ann. Appl. Prob. 4, 719740.Google Scholar
[12] Cooley, J. W., Lewis, P. A. W. and Welch, P. D. (1967). Application of the fast Fourier transform to computation of Fourier integrals, Fourier series, and convolution integrals. IEEE Trans. Audio Electroacoust. 15, 7984.Google Scholar
[13] Crump, K. S. (1976). Numerical inversion of Laplace transforms using a Fourier series approximation. J. Assoc. Comput. Mach. 23, 8996.CrossRefGoogle Scholar
[14] D'Amore, L., Laccetti, G. and Murli, A. (1999). An implementation of a Fourier series method for the numerical inversion of the Laplace transform. ACM Trans. Math. Software 25, 279305.Google Scholar
[15] Davies, B. (2002). Integral Transforms and Their Applications, 3rd edn. Springer, New York.Google Scholar
[16] Davies, B. and Martin, B. (1979). Numerical inversion of the Laplace transform: a survey and comparison of methods. J. Comput. Phys. 33, 132.Google Scholar
[17] De Hoog, F. R., Knight, J. H. and Stokes, A. N. (1982). An improved method for numerical inversion of Laplace transforms. SIAM J. Sci. Statist. Comput. 3, 357366.Google Scholar
[18] Duffy, D. G. (1993). On the numerical inversion of Laplace transforms: comparison of three new methods on characteristic problems from applications. ACM Trans. Math. Software 19, 333359.Google Scholar
[19] Eckhoff, K. S. (1995). Accurate reconstructions of functions of finite regularity from truncated Fourier series expansions. Math. Comput. 64, 671690.Google Scholar
[20] Eckhoff, K. S. (1998). On a high order numerical method for functions with singularities. Math. Comput. 67, 10631087.Google Scholar
[21] Gelb, A. (2000). A hybrid approach to spectral reconstruction of piecewise smooth functions. J. Sci. Comput. 15, 293322.Google Scholar
[22] Gelb, A. and Tadmor, E. (1999). Detection of edges in spectral data. Appl. Comput. Harmonic Anal. 7, 101135.CrossRefGoogle Scholar
[23] Gottlieb, D. and Orszag, S. A. (1977). Numerical Analysis of Spectral Methods: Theory and Applications. SIAM, Philadelphia, PA.Google Scholar
[24] Gottlieb, D. and Shu, C. W. (1997). On the Gibbs phenomenon and its resolution. SIAM Rev. 39, 644668.CrossRefGoogle Scholar
[25] Hardy, G. H. (1963). Divergent Series. Oxford University Press.Google Scholar
[26] Hewitt, E. and Hewitt, R. E. (1979). The Gibbs–Wilbraham phenomenon: an episode in Fourier analysis. Hist. Exact Sci. 21, 129160.Google Scholar
[27] Honig, G. and Hirdes, U. (1984). A method for numerical inversion of Laplace transforms. J. Comput. Appl. Math. 10, 113132.Google Scholar
[28] Hosono, T. (1984). Fast Inversion of Laplace Transforms by BASIC. Kyoritsu, Tokyo (in Japanese).Google Scholar
[29] Jackson, D. (1930). The Theory of Approximation. American Mathematical Society, New York.Google Scholar
[30] Johnson, N. L., Kotz, S. and Balakrishnan, N. (1994). Continuous Univariate Distributions, Vol. 1, 2nd edn. John Wiley, New York.Google Scholar
[31] Johnsonbaugh, R. (1979). Summing an alternating series. Amer. Math. Monthly 86, 637648.Google Scholar
[32] Kao, E. P. C. (1997). An Introduction to Stochastic Processes. Duxbury Press, New York.Google Scholar
[33] Knopp, K. (1944). Theory and Application of Infinite Series. Blackie, London.Google Scholar
[34] Natanson, I. P. (1964). Constructive Function Theory, Vol. 1. Frederick Ungar, New York.Google Scholar
[35] O'Cinneide, C. A. (1997). Euler summation for Fourier series and Laplace transform inversion. Stoch. Models 13, 315337.Google Scholar
[36] Rolski, T., Schmidli, H., Schmidt, V. and Teugels, J. (1999). Stochastic Processes for Insurance and Finance. John Wiley, Chichester.Google Scholar
[37] Simon, R. M., Stroot, M. T. and Weiss, G. H. (1972). Numerical inversion of Laplace transforms with application to percentage labeled mitoses experiments. Comput. Biomed. Res. 5, 596607.Google Scholar
[38] Tijms, H. C. (2003). A First Course in Stochastic Models. John Wiley, Chichester.Google Scholar
[39] Vandeven, H. (1991). Family of spectral filters for discontinuous problems. J. Sci. Comput. 6, 159192.Google Scholar
[40] Wimp, J. (1981). Sequence Transformations and Their Applications. Academic Press, London.Google Scholar
[41] Zygmund, A. (1959). Trigonometric Series, Vol. 1. Cambridge University Press.Google Scholar