1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2000, 2001, 2002, 2003 RiskMap srl
Copyright (C) 2003 Ferdinando Ametrano
Copyright (C) 2003, 2004, 2005 StatPro Italia srl
Copyright (C) 2005 Klaus Spanderen
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and developers - http://quantlib.org/
QuantLib is free software: you can redistribute it and/or modify it
under the terms of the QuantLib license. You should have received a
copy of the license along with this program; if not, please email
<quantlib-dev@lists.sf.net>. The license is also available online at
<http://quantlib.org/license.shtml>.
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the license for more details.
*/
/*! \file multipathgenerator.hpp
\brief Generates a multi path from a random-array generator
*/
#ifndef quantlib_multi_path_generator_hpp
#define quantlib_multi_path_generator_hpp
#include <ql/methods/montecarlo/multipath.hpp>
#include <ql/methods/montecarlo/sample.hpp>
#include <ql/stochasticprocess.hpp>
namespace QuantLib {
//! Generates a multipath from a random number generator.
/*! RSG is a sample generator which returns a random sequence.
It must have the minimal interface:
\code
RSG {
Sample<Array> next();
};
\endcode
\ingroup mcarlo
\test the generated paths are checked against cached results
*/
template <class GSG>
class MultiPathGenerator {
public:
typedef Sample<MultiPath> sample_type;
MultiPathGenerator(const boost::shared_ptr<StochasticProcess>&,
const TimeGrid&,
GSG generator,
bool brownianBridge = false);
const sample_type& next() const;
const sample_type& antithetic() const;
private:
const sample_type& next(bool antithetic) const;
bool brownianBridge_;
boost::shared_ptr<StochasticProcess> process_;
GSG generator_;
mutable sample_type next_;
};
// template definitions
template <class GSG>
MultiPathGenerator<GSG>::MultiPathGenerator(
const boost::shared_ptr<StochasticProcess>& process,
const TimeGrid& times,
GSG generator,
bool brownianBridge)
: brownianBridge_(brownianBridge), process_(process),
generator_(generator), next_(MultiPath(process->size(), times), 1.0) {
QL_REQUIRE(generator_.dimension() ==
process->factors()*(times.size()-1),
"dimension (" << generator_.dimension()
<< ") is not equal to ("
<< process->factors() << " * " << times.size()-1
<< ") the number of factors "
<< "times the number of time steps");
QL_REQUIRE(times.size() > 1,
"no times given");
}
template <class GSG>
inline const typename MultiPathGenerator<GSG>::sample_type&
MultiPathGenerator<GSG>::next() const {
return next(false);
}
template <class GSG>
inline const typename MultiPathGenerator<GSG>::sample_type&
MultiPathGenerator<GSG>::antithetic() const {
return next(true);
}
template <class GSG>
const typename MultiPathGenerator<GSG>::sample_type&
MultiPathGenerator<GSG>::next(bool antithetic) const {
if (brownianBridge_) {
QL_FAIL("Brownian bridge not supported");
} else {
typedef typename GSG::sample_type sequence_type;
const sequence_type& sequence_ =
antithetic ? generator_.lastSequence()
: generator_.nextSequence();
Size m = process_->size();
Size n = process_->factors();
MultiPath& path = next_.value;
Array asset = process_->initialValues();
for (Size j=0; j<m; j++)
path[j].front() = asset[j];
Array temp(n);
next_.weight = sequence_.weight;
const TimeGrid& timeGrid = path[0].timeGrid();
Time t, dt;
for (Size i = 1; i < path.pathSize(); i++) {
Size offset = (i-1)*n;
t = timeGrid[i-1];
dt = timeGrid.dt(i-1);
if (antithetic)
std::transform(sequence_.value.begin()+offset,
sequence_.value.begin()+offset+n,
temp.begin(),
std::negate<Real>());
else
std::copy(sequence_.value.begin()+offset,
sequence_.value.begin()+offset+n,
temp.begin());
asset = process_->evolve(t, asset, dt, temp);
for (Size j=0; j<m; j++)
path[j][i] = asset[j];
}
return next_;
}
}
}
#endif
|
