Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Motivation
The instrument
The models
l=
t
exp
T
l
t
r
d
(s)ds
CV
l
Friday, April 17, 2009
Bermudan callable interest rate instruments
l=1
exp
T
l
T
0
r
d
(s)ds
CV
l
Friday, April 17, 2009
Interest rate and exchange rate models
t
i
t
i
,
t
i
N(0, 1)
(1 )(t
k
t
j
)
t
i
=
(t
i
t
j
)
(t
k
t
j
)
, t
j
< t
i
< t
k
,
t
i
N(0, 1)
Friday, April 17, 2009
Comparison of MC with QMC
SV
1,1
SV
1,2
. . . SV
1,N
.
.
.
.
.
.
.
.
.
.
.
.
SV
M,1
SV
M,2
. . . SV
M,N
S
k,i
denotes the value of the swap at time T
i
in the k
th
path
Friday, April 17, 2009
A modied least squares algorithm
T
i
T
0
r
d
(s)ds
set of short rate matrices (MxN matrix) for each short rate
used in the regression SR
l
set of short rate matrices (MxN matrix) for each short rate
used in the regression SR
l
k=1
(S
k,N
g({A
N
}, {r
k,N
}, {f
k,N
}))
2
k=1
(S
k,N
g({A
N
}, {r
k,N
}, {f
k,N
}))
2
k=1
(S
k,N
g({A
N
}, {r
k,N
}, {f
k,N
}))
2
k=1
(S
k,N
g({A
N
}, {r
k,N
}, {f
k,N
}))
2
N
}, {r
k,N
}, {f
k,N
})
Friday, April 17, 2009
A modied least squares algorithm cont.
k=1
(S
k,N
g({A
N
}, {r
k,N
}, {f
k,N
}))
2
k=1
(S
k,N
g({A
N
}, {r
k,N
}, {f
k,N
}))
2
SV
k,N
C
N
if C
N
< RV
g
k,N
0 else
Friday, April 17, 2009
A modied least squares algorithm cont.
SV
1,1
SV
1,2
. . . SV
1,N1
SV
1,N
C
N
SV
2,1
SV
2,2
. . . SV
2,N1
0
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
SV
k1,1
SV
k1,2
. . . SV
k1,N1
0
SV
k,1
SV
k,2
. . . SV
k,N1
SV
k,N
C
N
SV
k+1,1
SV
k+1,2
. . . SV
k+1,N1
0
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
SV
M,1
SV
M,2
. . . SV
M,N1
0
k=1
(SV
k,N1
C
N1
g({A
N1
}{r
k,N1
}, {f
k,N1
}))
2
k=1
l>N1
S
k,l
D
l,k
D
N1,k
h({B
N1
}{r
k,N1
}, {f
k,N1
})
N1
}, {r
k,N1
}, {f
k,N1
})
RV
h
k,N1
= h({B
N1
}, {r
k,N1
}, {f
k,N1
})
Friday, April 17, 2009
A modied least squares algorithm cont.
N1
}, {r
k,N1
}, {f
k,N1
})
RV
h
k,N1
= h({B
N1
}, {r
k,N1
}, {f
k,N1
})
compare RV
g
to RV
h
: If the rst regression value is
smaller than the second regression value, it is better
to exercise the option and take the difference
SV
k,N-1
-C
N-1
, otherwise set S
k,N-1
to 0
SV
k,N1
=
SV
k,N1
C
N1
if RV
g
k,N1
< RV
h
k,N1
0 else
Friday, April 17, 2009
A modied least squares algorithm cont.
SV
1,1
SV
1,2
. . . 0 SV
1,N
C
N
SV
2,1
SV
1,2
. . . SV
1,N1
C
N1
0
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
SV
j1,1
SV
j1,2
. . . SV
j1,N1
C
N1
0
SV
j,1
SV
j,2
. . . 0 SV
j,N
C
N
SV
j+1,1
SV
j+1,2
. . . 0 0
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
SV
M,1
SV
M,2
. . . SV
M,N1
C
N1
0
0 0 . . . 0 SV
1,N
C
N
0 0 . . . SV
1,N1
C
N1
0
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
SV
j1,1
C
1
0 . . . 0 0
0 SV
j,2
C
2
. . . 0 0
0 0 . . . 0 0
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
0 0 . . . SV
M,N1
C
N1
0
0 0 . . . 0 SV
1,N
C
N
0 0 . . . SV
1,N1
C
N1
0
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
SV
j1,1
C
1
0 . . . 0 0
0 SV
j,2
C
2
. . . 0 0
0 0 . . . 0 0
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
0 0 . . . SV
M,N1
C
N1
0
k=1
n
i=0
D
k,i
S
k,i
Friday, April 17, 2009
Regression functions
||<S
x
Y
, x
R
Friday, April 17, 2009
Regression functions
i=1
i
, N
N
r
+N
f
0
,
Y
=
N
r
+N
f
i=1
Y
i
i
(X, {r}, {f}) =
||<S
x
Y
, x
R
Friday, April 17, 2009
The corresponding PDE
i,j=1
ij
2
u
x
i
x
j
i=1
i
u
x
i
+
31
1
u
x
3
+x
2
u = 0
Friday, April 17, 2009
The corresponding PDE
i,j=1
ij
2
u
x
i
x
j
i=1
i
u
x
i
+
31
1
u
x
3
+x
2
u = 0
x
1
= fx
x
2
= r
d
x
3
= r
f
Friday, April 17, 2009
The corresponding PDE
i,j=1
ij
2
u
x
i
x
j
i=1
i
u
x
i
+
31
1
u
x
3
+x
2
u = 0
Friday, April 17, 2009
The corresponding PDE
i,j=1
ij
2
u
x
i
x
j
i=1
i
u
x
i
+
31
1
u
x
3
+x
2
u = 0
Friday, April 17, 2009
The corresponding PDE
i,j=1
ij
2
u
x
i
x
j
i=1
i
u
x
i
+
31
1
u
x
3
+x
2
u = 0
Friday, April 17, 2009
The corresponding PDE
i,j=1
ij
2
u
x
i
x
j
i=1
i
u
x
i
+
31
1
u
x
3
+x
2
u = 0
i,j=1
ij
2
u
x
i
x
j
i=1
i
u
x
i
+
31
1
u
x
3
+x
2
u = 0
i,j=1
ij
2
u
x
i
x
j
i=1
i
u
x
i
+
31
1
u
x
3
+x
2
u = 0
i,j=1
ij
2
u
x
i
x
j
i=1
i
u
x
i
+
31
1
u
x
3
+x
2
u = 0