David R. Stoutemyer
Abstract
Puiseux series are power series in which the exponents can be fractional and/or negative rational numbers. Several computer algebra systems have one or more built-in or loadable functions for computing truncated Puiseux series. Some are generalized to allow coefficients containing functions of the series variable that are dominated by any power of that variable, such as logarithms and nested logarithms of the series variable. Some computer algebra systems also have built-in or loadable functions that compute infinite Puiseux series. Unfortunately, there are some little-known pitfalls in computing Puiseux series. The most serious of these is expansions within branch cuts or at branch points that are incorrect for some directions in the complex plane. For example with each series implementation accessible to you.
Compare the value of (z2 + z3)3/2 with that of its truncated series expansion about z = 0, approximated at z = ?0.01. Does the series converge to a value that is the negative of the correct value?
Compare the value of ln(z2 + z3) with its truncated series expansion about z = 0, approximated at z = ?0.01 + 0.1i. Does the series converge to a value that is incorrect by 2πi?
Compare arctanh(?2 + ln(z)z) with its truncated series expansion about z = 0, approximated at z = ?0.01. Does the series converge to a value that is incorrect by about πi?
At the time of this writing, most implementations that accommodate such series exhibit such errors. This article describes how to avoid these errors both for manual derivation of series and when implementing series packages.
- Corless, R.M. and Jeffrey, D.J., The unwinding number, ACM SIGSAM Bulletin 30 (2), 1996, pp. 28--35. Google Scholar
Digital Library
- Corless, R.M., Davenport, J.H., Jeffrey, D.J. and Watt, S.M., According to Abramowitz andStegun, ACM SIGSAM Bulletin, 34 (2), 2000, pp 58--65. Google ScholarDigital Library
- Kahan, W., Branch cuts for complex elementary functions, in The State of the Art in Numerical Analysis, editors A. Iserles and M.J.D. Powell, Clarendon Press, 1987, pp. 165--212.Google Scholar
- Norman, A. C., Computing with formal power series, ACM Transactions on mathematical software 1(4), 1975, pp. 346--356. Google ScholarDigital Library
- Stoutemyer, D.R., Series misdemeanors, to appear in ACM Communications in Computer Algebra, e-print at http://arxiv.org/pdf/1203.1357.pdf Google ScholarDigital Library
- Zippel, R.E., Radical simplification made easy, in Proceedings of the 1977 MACSYMA User's Conference, NASA CP-2012 pp. 361--367.Google Scholar
Recommendations
Weighted divisor sums and Bessel function series, V
Let r 2 ( n ) denote the number of representations of n as a sum of two squares. Finding the precise order of magnitude for the error term in the asymptotic formula for n x r 2 ( n ) is known as the circle problem. Next, let d ( n ) denote the number of ...
Some families of Mathieu a-series and alternating Mathieu a-series
The main purpose of this paper is to present a number of potentially useful integral representations for the familiar Mathieu a-series as well as for its alternating version. These results are derived here from many different considerations and are ...
Fourier series of orthogonal polynomials
MATH'08: Proceedings of the American Conference on Applied MathematicsExplicit formulas for the Fourier coeffcients of the Legendre polynomials can be found in the Bateman Manuscript Project. However, similar formulas for more general classes of orthogonal polynomials do not appear to have been worked out. Here we derive ...
Comments