Skip to main content
Log in

Detection of the singularities of a complex function by numerical approximations of its Laurent coefficients

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

For several applications, it is important to know the location of the singularities of a complex function: just for example, the rightmost singularity of a Laplace Transform is related to the exponential order of its inverse function. We discuss a numerical method to approximate, within an input accuracy tolerance, a finite sequence of Laurent coefficients of a function by means of the Discrete Fourier Transform (DFT) of its samples along an input circle. The circle may also enclose some singularities, since the method works with the Laurent expansion. The DFT is computed by the FFT algorithm so that, from a computational point of view, the efficiency is guaranteed. The function samples may be obtained by solving a numerical problem such as, for example, a differential problem. We derive, as consequences of the method, some new outcomes able to detect those singularities which are close to the circle and to discover if the singularities are all external or internal to the circle so that the Laurent expansion reduces to its regular or singular part, respectively. Other singularities may be located by means of a repeated application of the method, as well as an analytic continuation. Some examples and results, obtained by a first implementation, are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bornemann, F.: Accuracy and stability of computing high-order derivatives of analytic functions by cauchy integrals. Found. Comput. Math. 11(1), 1–63 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Brent, R.P., Kung, H.T.: Fast algorithms for manipulating formal power series. J. ACM 25(4), 581–595 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  3. Finkston, B.: Cluster data by using the mean shift algorithm. https://it.mathworks.com/matlabcentral/fileexchange/10161-mean-shift-clustering

  4. Fukunaga, K., Hostetler, L.D.: The estimation of the gradient of a density function, with applications in pattern recognition. IEEE Trans IT 21(1), 32–40 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  5. Duffy, D.G.: Transform methods for solving partial differential equations. Chapman & Hall/CRC, Florida (2004)

    Book  MATH  Google Scholar 

  6. Giunta, G., Laccetti, G., Rizzardi, M.: A numerical method for locating the abscissa of convergence of a laplace transform function with no singularity at infinity. Int. J. Comp. Math. 37(1), 89–103 (1990)

    Article  MATH  Google Scholar 

  7. Gonnet, P., Guettel, S., Trefethen, L.N.: Robust Padé approximation via SVD. SIAM Rev. 55(1), 101–117 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gonnet, P., Pachon, R., Trefethen, L.N.: Robust rational interpolation and least squares. ETNA 38, 146–167 (2011)

    MathSciNet  MATH  Google Scholar 

  9. Henrici, P.: Applied and computational complex analysis, vol I. Wiley, New York (1988)

    MATH  Google Scholar 

  10. Henrici, P.: Applied and computational complex analysis, vol III. Wiley, New York (1993)

    MATH  Google Scholar 

  11. Lyness, J.N.: Differentiation formulas for analytic functions. Math. Comp. 22, 352–362 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lyness, J.N., Giunta, G.: A modification of the weeks method for numerical inversion of the laplace transform. Math. Comp. 47, 313–322 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lyness, J.N., Moler, C.B.: Numerical differentiation of analytic functions. SIAM J. Numer. Anal. 4(2), 201–210 (1967)

    MathSciNet  MATH  Google Scholar 

  14. Lyness, J.N., Sande, G.: Algorithm 413: ENTCAF and ENTCRE. Evaluation of normalized taylor coefficients of an analytic function. Comm. ACM 14, 669–675 (1971)

    Article  Google Scholar 

  15. Needham, T.: Visual complex analysis. Clarendon Press, Oxford (1999)

  16. Rizzardi, M.: LaurentCoeffs. http://dist.uniparthenope.it/mariarosaria.rizzardi (2017)

  17. Talbot, A.: The accurate numerical inversion of laplace transforms. J. Inst. Math. Appl. 23, 97–120 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  18. Tourigny, Y., Grinfeld, M.: Deciphering singularities by discrete methods. Math. Comp. 62(205), 155–169 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  19. Weeks, T.: Numerical inversion of laplace transform using laguerre functions. J. ACM, 13 (1966)

  20. Wegert, E.: Visual complex functions: an introduction with phase portraits. Birkhäuser/Springer (2012)

  21. Wegert, E.: Phase plots of complex functions, http://it.mathworks.com/matlabcentral/fileexchange/44375-phase-plots-of-complex-functions. (upyeard 2014) (2013)

  22. Wegert, E.: Complex function explorer. http://it.mathworks.com/matlabcentral/fileexchange/45464-complex-function-explorer (2014)

  23. Weideman, J.A.C.: Computing the dynamics of complex singularities of nonlinear PDEs. SIAM J. Appl. Dynam. Systems 2(2), 171–186 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mariarosaria Rizzardi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rizzardi, M. Detection of the singularities of a complex function by numerical approximations of its Laurent coefficients. Numer Algor 77, 955–982 (2018). https://doi.org/10.1007/s11075-017-0349-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-017-0349-2

Keywords

Navigation