Partitions approximated by finite cosine-series
HTML articles powered by AMS MathViewer
- by Harvey Dubner PDF
- Math. Comp. 58 (1992), 729-736 Request permission
Abstract:
By using a specialized numerical Laplace transform inversion technique the number of partitions are expressed by a finite cosine-series. The accuracy of the results is only limited by the accuracy of computation and available computer time. The method is general and is applicable to all generating functions.References
- J. Abate and H. Dubner, A new method for generating power series expansions of functions, SIAM J. Numer. Anal. 5 (1968), 102–112. MR 223067, DOI 10.1137/0705008 C. Caldwell, The near repdigit primes, J. Recreational Math. 22 (1990), 101-109.
- H. Dubner and J. Abate, Numerical inversion of Laplace transforms by relating them to the finite Fourier cosine transform, J. Assoc. Comput. Mach. 15 (1968), 115–123. MR 235726, DOI 10.1145/321439.321446
- G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, 5th ed., The Clarendon Press, Oxford University Press, New York, 1979. MR 568909
Additional Information
- © Copyright 1992 American Mathematical Society
- Journal: Math. Comp. 58 (1992), 729-736
- MSC: Primary 65T10; Secondary 65R10
- DOI: https://doi.org/10.1090/S0025-5718-1992-1122065-8
- MathSciNet review: 1122065