Experimental mathematics and integration

Similar documents
Computer discovery of new mathematical facts and formulas

Expectations on Fractal Sets

Computation of the omega function

High-Precision Computation and Reproducibility

A Comparison of Three High-Precision Quadrature Schemes

Analytical expressions of 3 and 4-loop sunrise Feynman integrals and 4-dimensional lattice integrals

Numerical Integration with the double exponential method

Experimental computation with oscillatory integrals

Algorithms for Experimental Mathematics I David H Bailey Lawrence Berkeley National Lab

NUMERICAL QUADRATURE: THEORY AND COMPUTATION

Integer Relation Methods : An Introduction

MOMENTS OF PRODUCTS OF ELLIPTIC INTEGRALS

Evaluating Singular and Nearly Singular Integrals Numerically

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam

Random walks in the plane

April 15 Math 2335 sec 001 Spring 2014

Chapter 4: Interpolation and Approximation. October 28, 2005

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)

Expectations over Fractal Sets

MATHEMATICAL FORMULAS AND INTEGRALS

Construction Of Binomial Sums For π And Polylogarithmic Constants Inspired By BBP Formulas

MATH 18.01, FALL PROBLEM SET #5 SOLUTIONS (PART II)

MATHEMATICAL FORMULAS AND INTEGRALS

Series Solutions of ODEs. Special Functions

On A Central Binomial Series Related to ζ(4).

arxiv: v1 [physics.comp-ph] 22 Jul 2010

you expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form

Mathematics 324 Riemann Zeta Function August 5, 2005

SOLVED PROBLEMS ON TAYLOR AND MACLAURIN SERIES

NUMERICAL METHODS. x n+1 = 2x n x 2 n. In particular: which of them gives faster convergence, and why? [Work to four decimal places.

MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS

Test one Review Cal 2

6 Lecture 6b: the Euler Maclaurin formula

Parametric Euler Sum Identities

Monte Carlo Methods for Statistical Inference: Variance Reduction Techniques

ENGI 9420 Lecture Notes 1 - ODEs Page 1.01

Second Midterm Exam Name: Practice Problems March 10, 2015

Symbolic integration of multiple polylogarithms

Bernoulli Polynomials

1 Solutions to selected problems

Math 122 Fall Unit Test 1 Review Problems Set A

Some Fun with Divergent Series

From trigonometry to elliptic functions

BC Exam 1 - Part I 28 questions No Calculator Allowed - Solutions C = 2. Which of the following must be true?

Differential Equations and Associators for Periods

CS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation

Quadratic Transformations of Hypergeometric Function and Series with Harmonic Numbers

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF MATHEMATICS ACADEMIC YEAR / EVEN SEMESTER QUESTION BANK

A collocation method for solving some integral equations in distributions

This ODE arises in many physical systems that we shall investigate. + ( + 1)u = 0. (λ + s)x λ + s + ( + 1) a λ. (s + 1)(s + 2) a 0

1 Solutions to selected problems

Formulae for some classical constants

Mahler measure as special values of L-functions

Final Exam 2011 Winter Term 2 Solutions

(x x 0 )(x x 1 )... (x x n ) (x x 0 ) + y 0.

Math 1B, lecture 15: Taylor Series

Math 113 Winter 2005 Key

The Riemann and Hurwitz zeta functions, Apery s constant and new rational series representations involving ζ(2k)

Advances in the theory of box integrals

Introduction to Differential Equations

A gentle introduction to PSLQ

On the Representations of xy + yz + zx

Pascal s Triangle on a Budget. Accuracy, Precision and Efficiency in Sparse Grids

Section Taylor and Maclaurin Series

Completion Date: Monday February 11, 2008

Math 141: Lecture 11

Math 115 HW #5 Solutions

Is Analysis Necessary?

The generalized Euler-Maclaurin formula for the numerical solution of Abel-type integral equations.

MTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1.

Practice Problems For Test 3

Bessel s Equation. MATH 365 Ordinary Differential Equations. J. Robert Buchanan. Fall Department of Mathematics

Three-Step and Four-Step Random Walk Integrals

High-Precision Computation and Mathematical Physics

7.3 Hyperbolic Functions Hyperbolic functions are similar to trigonometric functions, and have the following

MATH115. Infinite Series. Paolo Lorenzo Bautista. July 17, De La Salle University. PLBautista (DLSU) MATH115 July 17, / 43

Mathematics for Engineers. Numerical mathematics

Friday 09/15/2017 Midterm I 50 minutes

Ramanujan and Euler s Constant

Math 308 Week 8 Solutions

An idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim

MATH 1231 MATHEMATICS 1B Calculus Section 1: - Integration.

5.4 Bessel s Equation. Bessel Functions

Summation Techniques, Padé Approximants, and Continued Fractions

Solution: APPM 1350 Final Exam Spring 2014

Chapter 2: Differentiation

Diagonals: Combinatorics, Asymptotics and Computer Algebra

APPM 1350 Final Exam Fall 2017

MATH 1231 S2 2010: Calculus. Section 2: Techniques of integration.

Computer-Assisted Discovery and Proof

Higher Order Linear Equations

(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by

Euler s Method and Logistic Growth (BC Only)

An Introduction to Bessel Functions

THE DISTANCE BETWEEN TWO RANDOM POINTS IN A 4- AND 5-CUBE.

More Final Practice Problems

MA 242 Review Exponential and Log Functions Notes for today s class can be found at

DIFFERENTIAL EQUATIONS

Inverse Symbolic Calculation: Jonathan Borwein, FRSC Computer Assisted Research Mathematics and Applications CARMA

JUST THE MATHS UNIT NUMBER DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) A.J.Hobson

Transcription:

Experimental mathematics and integration David H. Bailey http://www.davidhbailey.com Lawrence Berkeley National Laboratory (retired) Computer Science Department, University of California, Davis October 2, 217 1 / 27

Identifying definite integrals Using computational methods to identify integrals is one of the most productive application of the experimental mathematics paradigm. Some particularly useful instances include: Ising integrals. Box integrals. Ramble integrals. Integrals of elliptic integral functions. The key challenge is evaluating the integral to several hundred or several thousand digit precision. Most quadrature (i.e., numerical integration) schemes studied in numerical analysis fail miserably for very high precision applications. 2 / 27

Gaussian quadrature Gaussian quadrature is often the most efficient scheme for completely regular functions (including endpoints) and modest precision (less than 1 digits): n f (x) dx w j f (x j ) 1 The abscissas (x j ) are the roots of the n-th degree Legendre polynomial P n (x) on [ 1, 1]. The weights (w j ) are given by w j = j=1 2 (n + 1)P n(x j )P n+1 (x j ) The abscissas (x j ) are computed by Newton iterations, with starting values cos[π(j 1/4)/(n + 1/2)]. Legendre polynomials and their derivatives can be computed using the formulas P (x) =, P 1 (x) = 1, and (k + 1)P k+1 (x) = (2k + 1)xP k (x) kp k 1 (x) P n(x) = n(xp n (x) P n 1 (x))/(x 2 1) 3 / 27

Gaussian quadrature, continued Advantages: For regular functions, it is typically the fastest quadrature scheme available. Decreasing h by a factor of two (i.e., increasing n by a factor of two) typically doubles the number of correct digits (provided all computations are performed to at least this precision level). Disadvantages: Gaussian quadrature fails if the function or its higher derivatives has a singularity. Computation cost of abscissas and weights increases quadratically with n. This limits the scheme to less than 1 digits or so. Abscissas and weights for a given n cannot be used for 2n or any other value. 4 / 27

The Euler-Maclaurin summation formula b a f (x) dx = h n j= m i=1 f (x j ) h (f (a) + f (b)) 2 h 2i B 2i (2i)! ( ) D 2i 1 f (b) D 2i 1 f (a) E(h) E(h) 2(b 1)(h/(2π)) 2m+2 max a x b D2m+2 f (x) Here h = (b a)/n and x j = a + jh; B 2i are Bernoulli numbers; D m f (x) is the m-th derivative of f (x). The E-M formula can be thought of as providing high-order correction terms to the trapezoidal rule. Note that in the case when f (x) and all of its derivatives are zero at the endpoints a and b (as in a bell-shaped curve), the error E(h) of a simple trapezoidal approximation to the integral goes to zero more rapidly than any power of h. 5 / 27

Tanh-sinh quadrature Given f (x) defined on ( 1, 1), define g(t) = tanh(π/2 sinh t), so that g (t) = π/2 cosh(t)/ cosh 2 (π/2 sinh(t)). Then substituting x = g(t) yields 1 f (x) dx = f (g(t))g (t) dt h N j= N w j f (x j ), where x j = g(hj) and w j = g (hj). These abscissas and weights can be precomputed. Since g (t) goes to zero very rapidly for large t, the integrand f (g(t))g (t) typically is a nice bell-shaped function for which the Euler-Maclaurin formula applies. As a consequence, for most integrand functions f (t), the simple summation above (which is the tanh-sinh scheme) is remarkably accurate. D. H. Bailey, X. S. Li and K. Jeyabalan, A comparison of three high-precision quadrature schemes, Experimental Mathematics, vol. 14 (25), 317 329. 6 / 27

Tanh-sinh quadrature, continued Advantages: Tanh-sinh is not bothered by singularities at the endpoints (either for the function itself or any higher derivative). If there is a singularity within the interval, just perform two integrals. Computation cost of abscissas and weights only increases linearly with n, and so computations with many thousands of digits are entirely feasible. Abscissas and weights computed for a given n can be used for the 2n set. They are simply the even-indexed elements of the 2n set. Decreasing h by a factor of two (i.e., increasing n by a factor of two) typically doubles the number of correct digits (provided all computations are performed to at least this precision level). Disadvantages: For regular functions that can also be evaluated using Gaussian quadrature, tanh-sinh is typically several times slower. I confess: tanh-sinh is my favorite! 7 / 27

How the tanh-sinh transformation handles singularities at endpoints Upper plot: Original integrand on [ 1, 1]: f (x) = log cos ( ) πx 2 Note the singularities at the endpoints. Lower plot: Transformed using x = g(t): f (g(t))g (t) = log cos(π/2 tanh(sinh t)) ( cosh(t) ) cosh(sinh t) 2 This is now a nice smooth bell-shaped function, so the E-M formula implies that a trapezoidal approximation is very accurate. 8 / 27

Regular function or not? Plots of f (x) = sin p (πx)ζ(p, x) (upper) and its fourth derivative (lower), for p = 3 (solid) and p = 7/2 (dashed). Here ζ is Hurwitz zeta function. When p = 7/2, the function itself appears completely regular, but the fourth derivative blows up at both endpoints. As a result, Gaussian quadrature works very poorly for this function. But tanh-sinh works fine. 9 / 27

A log-tan integral identity verified with tanh-sinh quadrature 24 π/2 7 tan t + 7 log 7 π/3 tan t 7 dt = L 7(2) = [ ] 1 (7n + 1) 2 + 1 (7n + 2) 2 1 (7n + 3) 2 + 1 (7n + 4) 2 1 (7n + 5) 2 1 (7n + 6) 2 n= This identity arises from analysis of volumes of knot complements in hyperbolic space. This is simplest of 998 related identities. We verified this numerically to 2, digits, using tanh-sinh quadrature on a highly parallel computer. A proof was known, but we were not aware of this at the time. 1 / 27

Ising integrals from mathematical physics We recently applied our methods to study three classes of integrals (one of which was referred to us by Craig Tracy of U.C. Davis) that arise in the Ising theory of mathematical physics: C n := 4 n! 1 du 1 ( nj=1 ) 2 du n (u j + 1/u j ) u 1 u n D n := 4 ( ) ui u 2 j i<j u i +u j du 1 ( n! nj=1 ) 2 du n (u j + 1/u j ) u 1 u n E n = 2 2 u k u j dt 2 dt 3 dt n u 1 j<k n k + u j where in the last line u k = t 1 t 2 t k. D. H. Bailey, J. M. Borwein and R. E. Crandall, Integrals of the Ising class, Journal of Physics A: Mathematical and General, vol. 39 (26), pg. 12271 1232. 11 / 27

Limiting value of C n : What is this number? Key observation: The C n integrals can be converted to one- dimensional integrals involving the modified Bessel function K (t): C n = 2n tk n (t) dt n! High-precision numerical values, computed using this formula and tanh-sinh quadrature, approach a limit. For example: C 124 =.634735337438679612241927187894354587787... What is this number? We copied the first 5 digits into the online Inverse Symbolic Calculator (ISC) at https://isc.carma.newcastle.edu.au. The result was: lim C n = 2e 2γ. n where γ denotes Euler s constant. This is now proven. 12 / 27

Other Ising integral evaluations found using PSLQ D 3 = 8 + 4π 2 /3 27 Li 3 (2) D 4 = 4π 2 /9 1/6 7ζ(3)/2 E 2 = 6 8 log 2 E 3 = 1 2π 2 8 log 2 + 32 log 2 2 E 4 = 22 82ζ(3) 24 log 2 + 176 log 2 2 256(log 3 2)/3 + 16π 2 log 2 22π 2 /3 E 5 = 42 1984 Li 4 (1/2) + 189π 4 /1 74ζ(3) 1272ζ(3) log 2 + 4π 2 log 2 2 62π 2 /3 + 4(π 2 log 2)/3 + 88 log 4 2 + 464 log 2 2 4 log 2 where ζ(x) is the Riemann zeta function and Li n (x) is the polylogarithm function. 13 / 27

The Ising integral E 5 We were able to reduce E 5 to an extremely complicated 3-D integral (see right). We computed this integral to 25-digit precision, using a highly parallel, high-precision 3-D quadrature program. Then we used a PSLQ program to discover the evaluation given on the previous page. We also computed D 5 to 5 digits, but were unable to identify it. In March 214, Erik Panzer proved our formula for E 5 and found a similar evaluation for D 5. D. H. Bailey, J. M. Borwein and R. E. Crandall, Integrals of the Ising class, J. Physics A: Math. and Gen., vol. 39 (26), 12271 1232. 1 1 1 E5 = 2(1 x) 2 (1 y) 2 (1 xy) 2 (1 z) 2 (1 yz) 2 (1 xyz) 2 4(x + 1)(xy + 1) log(2) y 5 z 3 x 7 y 4 z 2 (4(y + 1)z + 3)x 6 y 3 z y 2 +1 z 2 + 4(y+ 1)z + 5) x 5 + y 2 4y(y + 1)z 3 +3 y 2 +1 z 2 + 4(y + 1)z 1 x 4 + y z z 2 +4z +5) y 2 +4 z 2 +1 y +5z +4 x 3 + 3z 2 4z +1 y 2 4zy +1 x 2 (y(5z + 4) +4)x 1)] / (x 1) 3 (xy 1) 3 (xyz 1) 3 + 3(y 1) 2 y 4 (z 1) 2 z 2 (yz 1) 2 x 6 +2y 3 z 3(z 1) 2 z 3 y 5 + z 2 5z 3 +3z 2 +3z +5 y 4 +(z 1) 2 z 5z 2 + 16z +5 y 3 + 3z 5 +3z 4 22z 3 22z 2 +3z +3 y 2 +3 2z 4 + z 3 +2 z 2 + z 2 y +3z 3 +5z 2 +5z +3 x 5 + y 2 7(z 1) 2 z 4 y 6 2z 3 z 3 + 15z 2 +15z + 1) y 5 +2z 2 21z 4 +6z 3 + 14z 2 +6z 21 y 4 2z z 5 6z 4 27z 3 27z 2 6z +1 y 3 + 7z 6 3z 5 + 28z 4 + 54z 3 + 28z 2 3z +7 y 2 2 7z 5 +15z 4 6z 3 6z 2 + 15z +7 y +7z 4 2z 3 42z 2 2z +7 x 4 2y z 3 z 3 9z 2 9z +1 y 6 + z 2 7z 4 14z 3 18z 2 14z +7 y 5 + z 7z 5 + 14z 4 +3 z 3 +3z 2 + 14z +7 y 4 + z 6 14z 5 +3z 4 + 84z 3 +3z 2 14z +1 y 3 3 3z 5 +6z 4 z 3 z 2 +6z +3 y 2 9z 4 + 14z 3 14z 2 + 14z +9 y + z 3 +7z 2 +7z +1) x 3 + z 2 11z 4 +6z 3 66z 2 +6z + 11 y 6 +2z 5z 5 + 13z 4 2z 3 2z 2 +13z + 5) y 5 + 11z 6 + 26z 5 + 44z 4 66z 3 + 44z 2 + 26z + 11 y 4 + 6z 5 4 z 4 66z 3 66z 2 4z +6 y 3 2 33z 4 +2z 3 22z 2 +2z + 33 y 2 + 6z 3 + 26 z 2 + 26z +6 y + 11z 2 + 1z + 11 x 2 2 z 2 5z 3 +3z 2 +3z +5 y 5 + z 22z 4 +5z 3 22z 2 +5z + 22 y 4 + 5z 5 +5z 4 26z 3 26z 2 +5z +5 y 3 + 3z 4 22z 3 26z 2 22z +3 y 2 + 3z 3 +5z 2 +5z +3 y +5z 2 + 22z +5 x + 15z 2 +2z +2y(z 1) 2 (z + 1) + 2y 3 (z 1) 2 z(z + 1) + y 4 z 2 15z 2 +2z + 15 + y 2 15z 4 2z 3 9z 2 2z + 15 + 15 / (x 1) 2 (y 1) 2 (xy 1) 2 (z 1) 2 (yz 1) 2 (xyz 1) 2 4(x + 1)(y + 1)(yz + 1) z 2 y 4 +4z(z + 1)y 3 + z 2 +1 y 2 4(z + 1)y +4x y 2 1 y 2 z 2 1 + x 2 z 2 y 4 4z(z + 1)y 3 z 2 +1 y 2 +4(z + 1)y + 1) 1) log(x + 1)] / (x 1) 3 x(y 1) 3 (yz 1) 3 [4(y + 1)(xy +1)(z + 1) x 2 z 2 4z 1 y 4 +4x(x + 1) z 2 1 y 3 x 2 +1 z 2 4z 1 y 2 4(x + 1) z 2 1 y + z 2 4z 1 log(xy + 1) / x(y 1) 3 y(xy 1) 3 (z 1) 3 4(z + 1)(yz + 1) x 3 y 5 z 7 + x 2 y 4 (4x(y + 1) + 5)z 6 xy 3 y 2 + 1) x 2 4(y + 1)x 3 z 5 y 2 4y(y + 1)x 3 +5 y 2 +1 x 2 + 4(y + 1)x +1 z 4 + y y 2 x 3 4y(y + 1)x 2 3 y 2 +1 x 4(y + 1) z 3 + 5x 2 y 2 + y 2 +4x(y + 1) y + 1) z 2 + ((3x + 4)y + 4)z 1 log(xyz + 1) / xy(z 1) 3 z(yz 1) 3 (xyz 1) 3 / (x + 1) 2 (y + 1) 2 (xy + 1) 2 (z + 1) 2 (yz + 1) 2 (xyz + 1) 2 dx dy dz 14 / 27

Box integrals The following integrals appear in numerous applications: ( ) s/2 B n (s) := r1 2 + + rn 2 dr n (s) := ( (r 1 q 1 ) 2 + + (r n q n ) 2) s/2 drdq B n (1) is average distance of a random point from the origin. n (1) is average distance between two random points. B n ( n + 2) is average electrostatic potential in an n-cube whose origin has a unit charge. n ( n + 2) is average electrostatic energy between two points in a uniform n-cube of charged jellium. Recently integrals of this type have arisen in neuroscience, e.g. the average distance between synapses in a mouse brain. D. H. Bailey, J. M. Borwein and R. E. Crandall, Box integrals, Journal of Computational and Applied Mathematics, vol. 26 (27), pg. 196 28. 15 / 27

Sample evaluations of box integrals n s B n (s) any even s rational, e.g., : B 2 (2) = 2/3 1 1 s 1 s+1 2-4 1 4 π 8 2-3 2 2-1 2 log(1 + 2) 1 2 1 3 2 + 1 2) 7 2 3 5 2 + 3 2 log(1 + 2) 2 2 s 2 2+s 2F ( 1 1 2, s 2 ; 3 2 ; 1) 3-5 6 1 3 1 12 π 3-4 3 2 2 arctan 2 1 3-2 3G + 3 2 π log(1 + 2) + 3 Ti 2 (3 2 2) 3-1 1 4 π + 3 2 log ( 2 + 3 ) 1 3 1 4 3 1 24 π + 1 2 log ( 2 + 3 ) 2 3 3 5 3 1 6 π 7 2 log ( 2 + 3 ) Here F is hypergeometric function; G is Catalan; Ti is Lewin s inverse-tan function. 16 / 27

Sample evaluations of delta integrals n s n(s) 3-7 4 16 2 + 2 3 + π 5 15 5 15 3 3,-4,-5,-6 ( ) ( ) ( 3 2 2π 12 G + 12 Ti 2 3 2 2 + 6π log 1 + 2 + 2 log 2 5 log 3 8 2 arctan 2 3-1 2 2 π + ( ) ( ) 2 5 3 5 2 4 5 3 + 2 log 1 + 2 + 12 log 1+ 3 2 4 log ( 2 + 3 ) 3 1 118 2 π + ( ) ( ) 34 21 3 21 2 4 7 3 + 2 log 1 + 2 + 8 log 1+ 3 2 3 3 1 2 π + 73 15 15 84 2 + 1 35 3 + 3 log ( 1 + 2 ) ( ) + 13 log 1+ 3 56 35 2 ) 1 2 17 / 27

Ramble integrals Continuing some earlier research [see refs below], we considered W n (s) = n [,1] n k=1 s e 2πxki, dx which is the s-th moment of the distance to the origin after n steps of a uniform random walk in the plane, with unit steps in a random direction. 1. J. M. Borwein, D. Nuyens, A. Straub and J. Wan, Some arithmetic properties of short random walk integrals, Ramanujan Journal. 2. J.M. Borwein, A. Straub and J. Wan, Three-step and four-step random walk integrals, Experimental Mathematics. 18 / 27

Complex plane plot of W 4 19 / 27

Some ramble integral results W 3() = 5/6 1/6 W 3(2) = 2 + 3 ( π π Cl 3 W 4() = 7 ζ(3) 2 π 2 W n() = log(2) γ W n () = n log(2 sin(πy))dy = 1 π Cl ( π 3 = log(2) γ n ( log ) 3 3 2π ( 2 x (J n (x) 1) dx x ) γ ) log(x)j n 1 (x)j 1 (x)dx ) 2 J n 1 (x)j 1 (x)dx 1 J n (x) dx x W n( 1) = (log 2 γ)w n ( 1) log(x)j n (x)dx W n(1) n = J n 1 (x)j 1 (x) (1 γ log(2x)) dx 2 / 27

1-digit computations of W n() using Sidi s extrapolation scheme n Precision Iterations Time 3-digit numerical values 3 2 159 123.323659472194551493636517238... 4 32 246 1 82 1686 5 2 159 249.54441256175218558519587862745... 4 319 252 1 81 1686 7 2 157 249.729262924769672667878239443952... 4 318 25 1 8 1686 9 2 156 248.824156239532388694825228248496... 4 317 212 1 799 168 11 2 155 247.92185886732653697565891527973... 4 316 4123 1 796 21348 13 2 154 246 1.358353489321164453874328... 4 314 4113 1 796 21354 15 2 152 245 1.738262172568563618425278153... 4 313 496 1 795 21348 17 2 151 244 1.13541737674117295323925429... 4 312 414 21 / 27

Elliptic integral functions The research with ramble integrals led us to study integrals of the form: I(n, n 1, n 2, n 3, n 4 ) := where K, K, E, E are elliptic integral functions: K(x) := x n K n 1 (x)k n 2 (x)e n 3 (x)e n 4 (x)dx, dt (1 t 2 )(1 x 2 t 2 ) K (x) := K( 1 x 2 ) 1 1 x E(x) := 2 t 2 dt 1 t 2 E (x) := E( 1 x 2 ) 22 / 27

Relations among the I integrals Thousands of relations have been found among the I integrals, using PSLQ. For example, among the class with n D 1 = 4 and n 1 + n 2 + n 3 + n 4 = D 2 = 3 (a set of 1 integrals), we found that all can be expressed in terms of an integer linear combination of 8 simple integrals. For example: 81 x 3 K 2 (x)e(x)dx = 6 K 3 (x)dx 24 x 2 K 3 (x)dx + 51 x 3 K 3 (x)dx + 32 x 4 K 3 (x)dx 243 x 3 K(x)E(x)K (x)dx = 59 K 3 (x)dx + 468 x 2 K 3 (x)dx + 156 x 3 K 3 (x)dx 624 x 4 K 3 (x)dx 2736 x 4 E 2 (x)k (x)dx = 391 K 3 (x)dx 3852 x 2 K 3 (x)dx 1284 x 3 K 3 (x)dx + 5136 2592 x 2 K 2 (x)k (x)dx 972 K(x)E(x)K (x)dx 8316 xk(x)e(x)k (x)d x 4 K 3 (x)d 23 / 27

EE KK tanh-sinh / PSLQ results D 1 D 2 Relations Basis Total Precision Basis norm bound Max relation norm 1 1 3 4 15 1.58282 1 298 2.23668 1 1 1 5 3 8 15 2.155768 1 297 3.65551 1 2 1 9 3 12 15 2.155768 1 297 5.9168 1 3 1 13 3 16 15 2.155768 1 297 1.679286 1 1 4 1 17 3 2 15 2.155768 1 297 6.59242 1 1 5 1 21 3 24 15 2.155768 1 297 2.419628 1 2 2 4 6 1 15 5.69665 1 261 2.1952 1 1 1 2 12 8 2 15 4.877336 1 196 5.744563 1 2 2 22 8 3 15 6.19876 1 195 2.293469 1 1 3 2 32 8 4 15 6.19876 1 195 2.293469 1 1 4 2 42 8 5 15 6.19876 1 195 1.639153 1 3 5 2 52 8 6 15 6.19876 1 195 2.42826 1 3 3 14 6 2 15 3.871282 1 262 2.6641 1 2 1 3 34 6 4 15 2.16452 1 261 8.96469 1 1 2 3 52 8 6 15 1.49642 1 197 9.666276 1 2 3 3 72 8 8 15 2.8293 1 196 2.291372 1 3 4 3 92 8 1 15 8.853827 1 195 5.86112 1 3 5 3 112 8 12 15 8.853827 1 195 9.24898 1 4 4 2 15 35 15 2.689124 1 14 1.963656 1 4 1 4 53 17 7 15 6.195547 1 91 2.1863 1 3 2 4 88 17 15 15 4.59577 1 91 2.9726 1 4 3 4 121 19 14 15 8.856138 1 81 5.658994 1 5 4 4 156 19 175 15 2.759846 1 82 5.571466 1 6 24 / 27

EE KK tanh-sinh / PSLQ results, continued D 1 D 2 Relations Basis Total Precision Basis norm bound Max relation norm 5 45 11 56 15 1.256977 1 142 1.61532 1 5 1 5 11 11 112 15 2.62478 1 142 1.25453 1 5 2 5 155 13 168 15 2.151577 1 12 3.953731 1 5 3 5 211 13 224 15 1.314945 1 12 3.728547 1 5 4 5 265 15 28 15 5.4597 1 14 8.658997 1 6 5 5 321 15 336 15 4.186191 1 14 3.954175 1 11 6 56 28 84 3 2.958413 1 15 1.74897 1 6 1 6 138 3 168 3 2.188 1 98 2.21943 1 6 2 6 222 3 252 3 3.89318 1 98 6.31251 1 8 3 6 34 32 336 3 1.324953 1 92 2.929549 1 1 4 6 388 32 42 3 9.31261 1 91 6.168516 1 12 5 6 47 34 54 3 6.616755 1 86 7.199329 1 13 25 / 27

For further details David H. Bailey and Jonathan M. Borwein, Hand-to-hand combat with thousand-digit integrals, Journal of Computational Science, vol. 3 (212), 77 86, preprint at: http://www.davidhbailey.com/dhbpapers/combat.pdf 26 / 27

Summary Identifying definite integrals, by computing very high-precision numerical values and then applying PSLQ, is one of the most productive applications of the experimental mathematics paradigm. The key challenge for such applications is to compute the integral to extreme precision. Most schemes taught in numerical analysis courses are not suitable. Although Gaussian quadrature is faster for some problems, the tanh-sinh scheme has numerous advantages, including insensitivity to singularities at endpoints, and a cost for generating abscissas and weights that only increases linearly with n. We have used the tanh-sinh scheme to compute integrals to as high as 2, digit precision. In some applications, such as the EE KK integrals, literally thousands of relations have been discovered by this approach. Thanks! This talk is available at http://www.davidhbailey.com/dhbtalks/dhb-combat-217.pdf 27 / 27