Professional Documents
Culture Documents
Why do we care?
Exp-arc explained
Results
Outline
Why do we care?
Exp-arc explained
Results
Outline
Why do we care?
Exp-arc explained
Results
X
(1)k (z/2)2k +
k =0
k !(k + + 1)
X
(1)k (z/2)2k +
k =0
k !(k + + 1)
X
(1)k (z/2)2k +
k =0
k !(k + + 1)
X
z
1
J (z)t n .
e 2 (t t ) =
n
n=
X
z
1
J (z)t n .
e 2 (t t ) =
n
n=
X
z
1
J (z)t n .
e 2 (t t ) =
n
n=
n1
X
(n k 1)!(z/2)2k n
k!
k =0
!
X
(1)k (z/2)2k +n (Hk + Hk +n )
.
k !(n + k )!
2( + log(z/2))Jn (z)
k =0
n1
X
(n k 1)!(z/2)2k n
k!
k =0
!
X
(1)k (z/2)2k +n (Hk + Hk +n )
.
k !(n + k )!
2( + log(z/2))Jn (z)
k =0
n1
X
(n k 1)!(z/2)2k n
k!
k =0
!
X
(1)k (z/2)2k +n (Hk + Hk +n )
.
k !(n + k )!
2( + log(z/2))Jn (z)
k =0
i/2
J (iz) =
X
k =0
(z/2)2k +
,
k !(k + + 1)
I (z) I (z)
.
2
sin
i/2
J (iz) =
X
k =0
(z/2)2k +
,
k !(k + + 1)
I (z) I (z)
.
2
sin
i/2
J (iz) =
X
k =0
(z/2)2k +
,
k !(k + + 1)
I (z) I (z)
.
2
sin
X
(1)k ( 12 )2k ( 12 + )2k
cos(z
k !(2z)2k
k =0
!
X
(1)k ( 12 )2k +1 ( 12 + )2k +1
sin(z 2 4 )
,
k !(2z)2k +1
2
z
1/2
4)
k =0
X
(1)k ( 12 )2k ( 12 + )2k
cos(z
k !(2z)2k
k =0
!
X
(1)k ( 12 )2k +1 ( 12 + )2k +1
sin(z 2 4 )
,
k !(2z)2k +1
2
z
1/2
4)
k =0
X
(1)k ( 12 )2k ( 12 + )2k
cos(z
k !(2z)2k
k =0
!
X
(1)k ( 12 )2k +1 ( 12 + )2k +1
sin(z 2 4 )
,
k !(2z)2k +1
2
z
1/2
4)
k =0
ez
( + 12 ) 2z
X
( 12 )k 2z +k 1 t
2 e dt.
t
k !(2z)k 0
k =0
Note that the error behaves like N 1/2 when the series is
truncated after N terms.
For more information on the classical theory, see Watsons
book, A Treatise on the Theory of Bessel Functions."
ez
( + 12 ) 2z
X
( 12 )k 2z +k 1 t
2 e dt.
t
k !(2z)k 0
k =0
Note that the error behaves like N 1/2 when the series is
truncated after N terms.
For more information on the classical theory, see Watsons
book, A Treatise on the Theory of Bessel Functions."
ez
( + 12 ) 2z
X
( 12 )k 2z +k 1 t
2 e dt.
t
k !(2z)k 0
k =0
Note that the error behaves like N 1/2 when the series is
truncated after N terms.
For more information on the classical theory, see Watsons
book, A Treatise on the Theory of Bessel Functions."
Outline
Why do we care?
Exp-arc explained
Results
r2 (n) = x + P(x),
0nx
r2 (n) = x + P(x),
0nx
r2 (n) = x +
X
n=1
r2 (n)
x 1/2
n
J1 (2 nx).
q
q
1
3
J1 4 m(n + 4 )x
X
J1 4 m(n + 4 )x
X
q
q
.
+2 x
m(n + 41 )
m(n + 43 )
n=0 m=1
r2 (n) = x +
X
n=1
r2 (n)
x 1/2
n
J1 (2 nx).
q
q
1
3
J1 4 m(n + 4 )x
X
J1 4 m(n + 4 )x
X
q
q
.
+2 x
m(n + 41 )
m(n + 43 )
n=0 m=1
2
K (z);
2
K (z);
2
K (z);
Entry
For x > 0 and 0 < < 1,
X
n=1
x
n
sin(2n) = x
1
2
1
4
cot()
p
p
J1 4 m(n + 1 )x
1 X X J1 4 m(n + )x
p
p
+
x
2
m(n + )
m(n + 1 )
m=1 n=0
Entry
For x > 0 and 0 < < 1,
1
x log(2 sin())
4
n=1
p
p
Z1 4 m(n + 1 )x
1 X X Z1 4 m(n + )x
p
p
+
x
+
.
2
m(n + )
m(n + 1 )
F
x
n
cos(2n) =
m=1 n=0
Outline
Why do we care?
Exp-arc explained
Results
What is exp-arc?
In their recent paper to find asymptotics for Laguerre
polynomials with effective (explicit) error bounds, D. Borwein,
J. M. Borwein, and R. Crandall were led to consider the
following integral
Z
/2
I(p, q) :=
eiq ep cos d.
/2
Z
0
1/ 2
dx.
1 x2
What is exp-arc?
In their recent paper to find asymptotics for Laguerre
polynomials with effective (explicit) error bounds, D. Borwein,
J. M. Borwein, and R. Crandall were led to consider the
following integral
Z
/2
I(p, q) :=
eiq ep cos d.
/2
Z
0
1/ 2
dx.
1 x2
What is exp-arc?
In their recent paper to find asymptotics for Laguerre
polynomials with effective (explicit) error bounds, D. Borwein,
J. M. Borwein, and R. Crandall were led to consider the
following integral
Z
/2
I(p, q) :=
eiq ep cos d.
/2
Z
0
1/ 2
dx.
1 x2
arcsin x
=1+
X
ck ( )x k
k =1
k!
where
c2k +1 ( ) =
k
Y
( 2 + (2j 1)2 ),
j=1
c2k =
k
Y
( 2 + (2j 2)2 ).
j=1
arcsin x
=1+
X
ck ( )x k
k =1
k!
where
c2k +1 ( ) =
k
Y
( 2 + (2j 1)2 ),
j=1
c2k =
k
Y
( 2 + (2j 2)2 ).
j=1
X
gk (2iq)
k =0
(2k )!
Bk (p),
(1)
where
g0 := 1,
gk () :=
k
Y
(2j 1)2 + 2
for k 1,
j=1
and
Z
Bk (p) :=
1/ 2
2k 2px 2
x e
0
dx =
2k 2
epu u k 2 du.
X
gk (2iq)
k =0
(2k )!
Bk (p),
(1)
where
g0 := 1,
gk () :=
k
Y
(2j 1)2 + 2
for k 1,
j=1
and
Z
Bk (p) :=
1/ 2
2k 2px 2
x e
0
dx =
2k 2
epu u k 2 du.
X
gk (2iq)
k =0
(2k )!
Bk (p),
(1)
where
g0 := 1,
gk () :=
k
Y
(2j 1)2 + 2
for k 1,
j=1
and
Z
Bk (p) :=
1/ 2
2k 2px 2
x e
0
dx =
2k 2
epu u k 2 du.
Note that
gk and Bk are rapidly computable via recursion
R1
The integral 0 epu u k 1/2 du is uniformly bounded for all
k > 0, and so the Bk decrease geometrically as 2k .
gk ()/(2k )! are bounded for fixed .
Therefore, the series for I(p, q) is geometrically convergent.
Note that
gk and Bk are rapidly computable via recursion
R1
The integral 0 epu u k 1/2 du is uniformly bounded for all
k > 0, and so the Bk decrease geometrically as 2k .
gk ()/(2k )! are bounded for fixed .
Therefore, the series for I(p, q) is geometrically convergent.
Note that
gk and Bk are rapidly computable via recursion
R1
The integral 0 epu u k 1/2 du is uniformly bounded for all
k > 0, and so the Bk decrease geometrically as 2k .
gk ()/(2k )! are bounded for fixed .
Therefore, the series for I(p, q) is geometrically convergent.
Note that
gk and Bk are rapidly computable via recursion
R1
The integral 0 epu u k 1/2 du is uniformly bounded for all
k > 0, and so the Bk decrease geometrically as 2k .
gk ()/(2k )! are bounded for fixed .
Therefore, the series for I(p, q) is geometrically convergent.
Outline
Why do we care?
Exp-arc explained
Results
Integral Representations
Z
Z
1
sin tz sinh t
J (z) =
cos(t z sin t)dt
e
dt,
0
Z
Z 0
1
1
sin(z sin t t)dt
(et + et cos )ez sinh t dt
Y (z) =
0
0
Z
Z
sin z cosh tt
1 z cos t
I (z) =
e
cos t dt
e
dt,
0
0
and
Z
K (z) =
0
z cosh t
1
cosh t dt =
2
ez cosh tt dt.
1
I(z, n) + ein I(z, n) .
2
1
I(z, n) + ein I(z, n) .
2
0
0
This is an exp-arc integral, but our expansion is only valid on
[0, 1). So what should we do?
0
0
This is an exp-arc integral, but our expansion is only valid on
[0, 1). So what should we do?
X
An ()
n=0
s2n
(1)n 2 ( + n + 1)n1
,
22n n!
( + 2n 2)( + 2n 1)
An1 .
4n(n + )
X
An ()
n=0
s2n
(1)n 2 ( + n + 1)n1
,
22n n!
( + 2n 2)( + 2n 1)
An1 .
4n(n + )
X
an (k , )
n=0
n!
sn
where for n 0,
an+2 =
1 2
2
(
n
)a
k
(2n
+
1)a
n
n+1 ,
k2 + 1
and
a0 = (k +
p
k 2 + 1) ,
a1 =
a0
k2 + 1
X
an (k , )
n=0
n!
sn
where for n 0,
an+2 =
1 2
2
(
n
)a
k
(2n
+
1)a
n
n+1 ,
k2 + 1
and
a0 = (k +
p
k 2 + 1) ,
a1 =
a0
k2 + 1
X
an (k , )
n=0
n!
sn
where for n 0,
an+2 =
1 2
2
(
n
)a
k
(2n
+
1)a
n
n+1 ,
k2 + 1
and
a0 = (k +
p
k 2 + 1) ,
a1 =
a0
k2 + 1
zs arcsinh s
ds =
X
n=0
X
an (0, )
an (k , )
n (z) + n (z)
ekz
n!
n!
k =1
+ An ()Gn (N + 12 , z, ) ,
where
Z
1/2
n (z) :=
ezs sn ds =
1/2
n (z) :=
ezs sn ds =
1/2
ez/2 n
+ n1 (z),
2n z
z
ez/2 n
ez/2
+ n1 (z),
(2)n z
2n z
z
and
Gn (N, z, ) :=
=
eNz
N 2n+1
eNzs (1 + s)2n ds
( + 2n 1)( + 2n 2)
Nz
e
(2(n z 1) + )
2
+ z Gn1 (N, z, ) .
N 2n+1
Key points:
All the summands are easily computable via recursion
The recursions only involve elementary operations. The
initial conditions B0 (from I) and G0 each require one
evaluation of incomplete gamma, which can be done via
continued fraction.
Each series converges geometrically, like 2N (as opposed
to the Hadamard expansion for I , which is like N )
Can choose N large to avoid the An Gn sum if we want. In
this way, we can pre-compute summands involving only
and summands involving only z for one-z many- or
one- many-z evaluations.
Key points:
All the summands are easily computable via recursion
The recursions only involve elementary operations. The
initial conditions B0 (from I) and G0 each require one
evaluation of incomplete gamma, which can be done via
continued fraction.
Each series converges geometrically, like 2N (as opposed
to the Hadamard expansion for I , which is like N )
Can choose N large to avoid the An Gn sum if we want. In
this way, we can pre-compute summands involving only
and summands involving only z for one-z many- or
one- many-z evaluations.
Key points:
All the summands are easily computable via recursion
The recursions only involve elementary operations. The
initial conditions B0 (from I) and G0 each require one
evaluation of incomplete gamma, which can be done via
continued fraction.
Each series converges geometrically, like 2N (as opposed
to the Hadamard expansion for I , which is like N )
Can choose N large to avoid the An Gn sum if we want. In
this way, we can pre-compute summands involving only
and summands involving only z for one-z many- or
one- many-z evaluations.
Key points:
All the summands are easily computable via recursion
The recursions only involve elementary operations. The
initial conditions B0 (from I) and G0 each require one
evaluation of incomplete gamma, which can be done via
continued fraction.
Each series converges geometrically, like 2N (as opposed
to the Hadamard expansion for I , which is like N )
Can choose N large to avoid the An Gn sum if we want. In
this way, we can pre-compute summands involving only
and summands involving only z for one-z many- or
one- many-z evaluations.