[BOOK][B] Experimentation in mathematics: Computational paths to discovery
JM Borwein, DH Bailey, R Girgensohn - 2004 - taylorfrancis.com
New mathematical insights and rigorous results are often gained through extensive
experimentation using numerical examples or graphical images and analyzing them. Today …
experimentation using numerical examples or graphical images and analyzing them. Today …
High-precision floating-point arithmetic in scientific computation
DH Bailey - Computing in science & engineering, 2005 - ieeexplore.ieee.org
IEEE 64-bit floating-point arithmetic is sufficient for most scientific applications, but a rapidly
growing body of scientific computing applications requires a higher level of numeric precision…
growing body of scientific computing applications requires a higher level of numeric precision…
[PDF][PDF] The NAS parallel benchmarks—summary and preliminary results
DH Bailey, E Barszcz, JT Barton, DS Browning… - Proceedings of the …, 1991 - dl.acm.org
A new set of benchmarks has been developed for the performance evaluation of highly
parallel supercomputers. These benchmarks consist of five ‘parallel kernel” benchmarks and …
parallel supercomputers. These benchmarks consist of five ‘parallel kernel” benchmarks and …
Design, implementation and testing of extended and mixed precision BLAS
This article describes the design rationale, a C implementation, and conformance testing of
a subset of the new Standard for the BLAS (Basic Linear Algebra Subroutines): Extended …
a subset of the new Standard for the BLAS (Basic Linear Algebra Subroutines): Extended …
The fractional Fourier transform and applications
DH Bailey, PN Swarztrauber - SIAM review, 1991 - SIAM
This paper describes the “fractional Fourier transform,” which admits computation by an
algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the …
algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the …
FFTs in external or hierarchical memory
DH Bailey - The journal of Supercomputing, 1990 - Springer
Conventional algorithms for computing large one-dimensional fast Fourier transforms (FFTs),
even those algorithms recently developed for vector and parallel computers, are largely …
even those algorithms recently developed for vector and parallel computers, are largely …
Precimonious: Tuning assistant for floating-point precision
Given the variety of numerical errors that can occur, floating-point programs are difficult to
write, test and debug. One common practice employed by developers without an advanced …
write, test and debug. One common practice employed by developers without an advanced …
Enhancing reproducibility for computational methods
Over the past two decades, computational methods have radically changed the ability of
researchers from all areas of scholarship to process and analyze data and to simulate complex …
researchers from all areas of scholarship to process and analyze data and to simulate complex …
[PDF][PDF] The HPC Challenge (HPCC) benchmark suite
PR Luszczek, DH Bailey, JJ Dongarra… - Proceedings of the …, 2006 - researchgate.net
… Piotr Luszczek, David Bailey, Jack Dongarra, Jeremy Kepner, Robert Lucas, Rolf
Rabenseifner, Daisuke Takahashi … (H L … 1 E (A H P C R C …
Rabenseifner, Daisuke Takahashi … (H L … 1 E (A H P C R C …
Algorithms for quad-double precision floating point arithmetic
Y Hida, XS Li, DH Bailey - Proceedings 15th IEEE Symposium …, 2001 - ieeexplore.ieee.org
A quad-double number is an unevaluated sum of four IEEE double precision numbers,
capable of representing at least 212 bits of significand. We present the algorithms for various …
capable of representing at least 212 bits of significand. We present the algorithms for various …