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
|
/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2009 Andreas Gaida
Copyright (C) 2009 Ralph Schreyer
Copyright (C) 2009 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.
*/
#include <ql/methods/finitedifferences/schemes/expliciteulerscheme.hpp>
namespace QuantLib {
ExplicitEulerScheme::ExplicitEulerScheme(
const boost::shared_ptr<FdmLinearOpComposite> & map,
const std::vector<boost::shared_ptr<FdmDirichletBoundary> > & bcSet)
: dt_(Null<Real>()),
map_ (map),
bcSet_(bcSet) {
}
void ExplicitEulerScheme::step(array_type& a, Time t) {
QL_REQUIRE(t-dt_ > -1e-8, "a step towards negative time given");
map_->setTime(std::max(0.0, t-dt_), t);
a += dt_*map_->apply(a);
for (Size i=0; i<bcSet_.size(); i++)
bcSet_[i]->applyAfterApplying(a);
}
void ExplicitEulerScheme::setStep(Time dt) {
dt_=dt;
}
}
|
