Recognizing Numerical Constants (Organic Mathematics Proceedings)
Library Home || Full Table of Contents || Suggest a Link || Library Help
|David H. Bailey, Simon Plouffe|
|Article and presentation. Abstract: The advent of inexpensive, high-performance computers and new efficient algorithms have made possible the automatic recognition of numerically computed constants. In other words, techniques now exist for determining, within certain limits, whether a computed real or complex number can be written as a simple expression involving the classical constants of mathematics. In this presentation, some of the recently discovered techniques for constant recognition, notably integer relation detection algorithms, are presented. As an application of these methods, the author's recent work in recognizing "Euler sums" is described in some detail. The latter work was done jointly with Jonathan Borwein and Roland Girgensohn of SFU/CECM.|
|Math Topics:||Imaginary/Complex Numbers, e|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.