Abstract
A numerical computation in crystallography involves an infinite integral depending on one parameter. In a recent article in this journal this computational problem is addressed using Romberg’s method and tools for error control. One observe numerical difficulties with the reported approach both near the parameter’s endpoints and near the parameter interval’s midpoint. In this short note we will present an alternative approach making use of a known infinite series formulation of the problem at hand and a simple and efficient series acceleration technique. If some care is taken to avoid cancellations the numerical results are excellent for all values of the parameter.
Similar content being viewed by others
References
C. Brezinski and M. Redivo-Zaglia, Extrapolation Methods, Theory and Practice, Studies in Computational Mathematics, Vol. 2 (North-Holland, Amsterdam, 1991).
T.O. Espelid, Doubly adaptive quadrature routines based on Newton–Cotes rules, BIT 43 (2003) 319–337.
T.O. Espelid and K.J. Overholt, DQAINF: An algorithm for automatic integrating of infinite oscillating tails, Numer. Algorithms 8 (1994) 83–101.
W. Harrison, Total energies in the tight-binding theory, Phys. Rev. B 23 (1981) 5230–5245.
F. Jézéquel and J.M. Chesneaux, Computation of an infinite integral using Romberg’s method, Numer. Algorithms 36 (2004) 265–283.
K.J. Overholt, The P-algorithms for extrapolation, Report 36, Department of Informatics, University of Bergen (1989).
Problem 95-7, SIAM Rev. 38(2) (1996) 324.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C. Brezinski
AMS subject classification
65B05, 65B10, 65D30
Rights and permissions
About this article
Cite this article
Espelid, T.O. Computation of an infinite integral using series acceleration. Numer Algor 40, 17–22 (2005). https://doi.org/10.1007/s11075-005-1514-6
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11075-005-1514-6