Computational Research Department,
Lawrence Berkeley National Laboratory,
Bailey's research has included studies in parallel numerical algorithms, fast Fourier transforms, super-computer performance and computational number theory.
In 1996, with Peter Borwein and Simon Plouffe, David Bailey discovered a new formula for pi. This formula permits one to compute the n-th binary or hexadecimal digit of pi, without computing the first n-1 digits, by means of a simple scheme that requires very little memory and no multiple precision software. More recently, Richard Crandall and him have shown that there is a connection between the new pi formula and the centuries-old question of normality (ie, statistical randomness of digits in a certain sense) of pi and various other math constants.
1993 Sidney Fernbach Award (IEEE Computer Society)
1993 Chauvenet Prize (Mathematical Association of America (MAA))
1993 Merten Hasse Prize (MAA)
1995 H. Julian Allen Award (NASA Ames Research Center)
CSE “Algorithms of the Century.” In January 2000, the PSLQ algorithm, which was developed by Helaman Ferguson, Stephen Arno and David Bailey, was named one of the ten “algorithms of the century” by the editors of the publication Computing in Science and Engineering
BYU Honored Alumnus, College of Physical and Mathematical Sciences (2001). Awarded by the Brigham Young University Alumni Association.
Yozo Hida, Xiaoye S. Li and David H. Bailey, "Quad-Double Arithmetic: Algorithms, Implementation, and Application", manuscript, Oct. 2000; LBNL-46996
X. S. Li, J. W. Demmel, D. H. Bailey, G. Henry, Y. Hida, J. Iskandar, W. Kahan, A. Kapur, M. C. Martin, T. Tung, D. J. Yoo, "Design, Implementation and Testing of Extended and Mixed Precision BLAS", ACM Transactions on Mathematial Software, vol. 28, no. 2 (June 2002), pg. 152-205; LBNL-45991
David H. Bailey, "How Fast Is My Beowulf", in Thomas Sterling, ed., Beowulf Cluster Computing with Linux, and in Beowulf Cluster Computing with Windows, MIT Press, 2001; LBNL-48598.
David H. Bailey and Richard E. Crandall, "Random Generators and Normal Numbers", to appear in Experimental Mathematics (2003); LBNL-46263.
David H. Bailey and Daniel J. Rudolph, "An Ergodic Proof that Rational Times Normal is Normal", manuscript, Feb. 2002; LBNL-51142.
David H. Bailey, David Broadhurst, Yozo Hida, Sherry Li and Brandon Thompson, "High Performance Computing Meets Experimental Mathematics", Proceedings of SC2002, to appear; LBNL-51143.
David H. Bailey, "A Reclusive Kind of Science" (A review of Wolfram's "A New Kind of Science"), Computing in Science and Engineering, June 2002, pg. 79-81; LBNL-53650.
David H. Bailey and Alexei M. Frolov, "Advanced Variational Approach for High-Precision Bound-State Calculations in Three-Body Systems", Journal of Physics B: Atomic, Molecular and Optical Physics, vol. 35 (2002), pg. 1-12; LBNL-51144.
David H. Bailey, Yozo Hida, Xiaoye S. Li and Brandon Thompson, "ARPREC: An Arbitrary Precision Computation Package", manuscript, Sept 2002; LBNL-53651.
David H. Bailey and Xiaoye S. Li, "A Comparison of Three High-Precision Quadrature Schemes", Proceedings of the Real Numbers and Computing Conference, Lyon, France, Sep. 2003; LBNL-53652.
David H. Bailey, "Some Background on Kanada's Recent Pi Calculation", manuscript, Oct 2002.
David H. Bailey, Jonathan M. Borwein, Richard E. Crandall and Carl Pomerance, "On the Binary Expansions of Algebraic Numbers", Journal of Number Theory Bordeaux, to appear, 2003; LBNL-53654.
Alexei M. Frolov and David H. Bailey, "Highly accurate evaluation of the few-body auxiliary functions and four-body integrals", Journal of Physics B: Atomic, Molecular and Optical Physics, vol. 36 (2003), pg. 1857-1867; LBNL-53657.
C. William McCurdy, Horst D. Simon, William G. C. Kramer, Robert F. Lucas, William E. Johnston and David H. Bailey, "Future Directions in Scientific Supercomputing", Computer Physics Communications, vol. 147 (2002), pg. 34-39; LBNL-53659.
David H. Bailey, "A Hot-Spot Proof of Normality for the Alpha Constants", manuscript, Mar. 2003; LBNL-53658.
David H. Bailey and Daniel J. Rudolph, "A Strong Hot Spot Theorem", manuscript, May 2003; LBNL-53656.
David H. Bailey, "Java Meets Numerical Analysis", Review of "Java Number Cruncher" by Ronald Mak, Scientific Programming, to appear.