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
|
/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2008 Andrea Odetti
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
<https://www.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.
*/
#include <ql/experimental/mcbasket/mcpathbasketengine.hpp>
#include <utility>
namespace QuantLib {
EuropeanPathMultiPathPricer::EuropeanPathMultiPathPricer(
ext::shared_ptr<PathPayoff>& payoff,
std::vector<Size> timePositions,
std::vector<Handle<YieldTermStructure> > forwardTermStructures,
Array discounts)
: payoff_(payoff), timePositions_(std::move(timePositions)),
forwardTermStructures_(std::move(forwardTermStructures)), discounts_(std::move(discounts)) {}
Real EuropeanPathMultiPathPricer::operator()(const MultiPath& multiPath)
const {
Size n = multiPath.pathSize();
QL_REQUIRE(n > 0, "the path cannot be empty");
Size numberOfAssets = multiPath.assetNumber();
QL_REQUIRE(numberOfAssets > 0, "there must be some paths");
const Size numberOfTimes = timePositions_.size();
Matrix path(numberOfAssets, numberOfTimes, Null<Real>());
for (Size i = 0; i < numberOfTimes; ++i) {
const Size pos = timePositions_[i];
for (Size j = 0; j < numberOfAssets; ++j)
path[j][i] = multiPath[j][pos];
}
Array values(numberOfTimes, 0.0);
// ignored
Array exercises;
std::vector<Array> states;
payoff_->value(path, forwardTermStructures_, values, exercises, states);
// in this engine we ignore early exercise
Real discountedPayoff = DotProduct(values, discounts_);
return discountedPayoff;
}
}
|
