mcbasketengine.hpp
来自「有很多的函数库」· HPP 代码 · 共 191 行
HPP
191 行
/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2004 Neil Firth
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 mcbasketengine.hpp
\brief European basket MC Engine
*/
#ifndef quantlib_mc_basket_engine_hpp
#define quantlib_mc_basket_engine_hpp
#include <ql/instruments/basketoption.hpp>
#include <ql/pricingengines/mcsimulation.hpp>
#include <ql/processes/blackscholesprocess.hpp>
#include <ql/processes/stochasticprocessarray.hpp>
namespace QuantLib {
//! Pricing engine for basket options using Monte Carlo simulation
/*! \ingroup basketengines
\test the correctness of the returned value is tested by
reproducing results available in literature.
*/
template <class RNG = PseudoRandom, class S = Statistics>
class MCBasketEngine : public BasketOption::engine,
public McSimulation<MultiVariate,RNG,S> {
public:
typedef typename McSimulation<MultiVariate,RNG,S>::path_generator_type
path_generator_type;
typedef typename McSimulation<MultiVariate,RNG,S>::path_pricer_type
path_pricer_type;
typedef typename McSimulation<MultiVariate,RNG,S>::stats_type
stats_type;
// constructor
MCBasketEngine(Size maxTimeStepsPerYear,
bool brownianBridge,
bool antitheticVariate,
bool controlVariate,
Size requiredSamples,
Real requiredTolerance,
Size maxSamples,
BigNatural seed);
void calculate() const {
McSimulation<MultiVariate,RNG,S>::calculate(requiredTolerance_,
requiredSamples_,
maxSamples_);
results_.value = this->mcModel_->sampleAccumulator().mean();
if (RNG::allowsErrorEstimate)
results_.errorEstimate =
this->mcModel_->sampleAccumulator().errorEstimate();
}
protected:
// McSimulation implementation
TimeGrid timeGrid() const;
boost::shared_ptr<path_generator_type> pathGenerator() const {
boost::shared_ptr<BasketPayoff> payoff =
boost::dynamic_pointer_cast<BasketPayoff>(
arguments_.payoff);
QL_REQUIRE(payoff, "non-basket payoff given");
Size numAssets = arguments_.stochasticProcess->size();
TimeGrid grid = timeGrid();
typename RNG::rsg_type gen =
RNG::make_sequence_generator(numAssets*(grid.size()-1),seed_);
return boost::shared_ptr<path_generator_type>(
new path_generator_type(arguments_.stochasticProcess,
grid, gen, brownianBridge_));
}
boost::shared_ptr<path_pricer_type> pathPricer() const;
// Real controlVariateValue() const;
// data members
Size maxTimeStepsPerYear_;
Size requiredSamples_;
Size maxSamples_;
Real requiredTolerance_;
bool brownianBridge_;
BigNatural seed_;
};
class EuropeanMultiPathPricer : public PathPricer<MultiPath> {
public:
EuropeanMultiPathPricer(boost::shared_ptr<BasketPayoff> payoff,
DiscountFactor discount);
Real operator()(const MultiPath& multiPath) const;
private:
boost::shared_ptr<BasketPayoff> payoff_;
DiscountFactor discount_;
};
// template definitions
template<class RNG, class S>
inline MCBasketEngine<RNG,S>::MCBasketEngine(Size maxTimeStepsPerYear,
bool brownianBridge,
bool antitheticVariate,
bool controlVariate,
Size requiredSamples,
Real requiredTolerance,
Size maxSamples,
BigNatural seed)
: McSimulation<MultiVariate,RNG,S>(antitheticVariate, controlVariate),
maxTimeStepsPerYear_(maxTimeStepsPerYear),
requiredSamples_(requiredSamples), maxSamples_(maxSamples),
requiredTolerance_(requiredTolerance),
brownianBridge_(brownianBridge), seed_(seed) {}
template <class RNG, class S>
inline TimeGrid MCBasketEngine<RNG,S>::timeGrid() const {
Time residualTime = this->arguments_.stochasticProcess->time(
this->arguments_.exercise->lastDate());
return TimeGrid(residualTime, maxTimeStepsPerYear_);
}
template <class RNG, class S>
inline
boost::shared_ptr<QL_TYPENAME MCBasketEngine<RNG,S>::path_pricer_type>
MCBasketEngine<RNG,S>::pathPricer() const {
boost::shared_ptr<BasketPayoff> payoff =
boost::dynamic_pointer_cast<BasketPayoff>(arguments_.payoff);
QL_REQUIRE(payoff, "non-basket payoff given");
boost::shared_ptr<StochasticProcessArray> processes =
boost::dynamic_pointer_cast<StochasticProcessArray>(
arguments_.stochasticProcess);
QL_REQUIRE(processes, "stochastic-process array required");
boost::shared_ptr<GeneralizedBlackScholesProcess> process =
boost::dynamic_pointer_cast<GeneralizedBlackScholesProcess>(
processes->process(0));
QL_REQUIRE(process, "Black-Scholes process required");
return boost::shared_ptr<
QL_TYPENAME MCBasketEngine<RNG,S>::path_pricer_type>(
new EuropeanMultiPathPricer(
payoff,
process->riskFreeRate()->discount(
arguments_.exercise->lastDate())));
}
/*
template<class RNG, class S>
inline Real MCBasketEngine<RNG,S>::controlVariateValue() const {
boost::shared_ptr<PricingEngine> controlPE =
this->controlPricingEngine();
QL_REQUIRE(controlPE,
"engine does not provide "
"control-variation pricing engine");
BasketOption::arguments* controlArguments =
dynamic_cast<BasketOption::arguments*>(
controlPE->arguments());
*controlArguments = arguments_;
controlPE->calculate();
const BasketOption::results* controlResults =
dynamic_cast<const BasketOption::results*>(
controlPE->results());
return controlResults->value;
}
*/
}
#endif
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?