/src/quantlib/ql/methods/finitedifferences/schemes/expliciteulerscheme.cpp
Line | Count | Source (jump to first uncovered line) |
1 | | /* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ |
2 | | |
3 | | /* |
4 | | Copyright (C) 2009 Andreas Gaida |
5 | | Copyright (C) 2009 Ralph Schreyer |
6 | | Copyright (C) 2009 Klaus Spanderen |
7 | | |
8 | | This file is part of QuantLib, a free-software/open-source library |
9 | | for financial quantitative analysts and developers - http://quantlib.org/ |
10 | | |
11 | | QuantLib is free software: you can redistribute it and/or modify it |
12 | | under the terms of the QuantLib license. You should have received a |
13 | | copy of the license along with this program; if not, please email |
14 | | <quantlib-dev@lists.sf.net>. The license is also available online at |
15 | | <https://www.quantlib.org/license.shtml>. |
16 | | |
17 | | This program is distributed in the hope that it will be useful, but WITHOUT |
18 | | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS |
19 | | FOR A PARTICULAR PURPOSE. See the license for more details. |
20 | | */ |
21 | | |
22 | | #include <ql/methods/finitedifferences/schemes/expliciteulerscheme.hpp> |
23 | | #include <utility> |
24 | | |
25 | | namespace QuantLib { |
26 | | ExplicitEulerScheme::ExplicitEulerScheme(ext::shared_ptr<FdmLinearOpComposite> map, |
27 | | const bc_set& bcSet) |
28 | 0 | : dt_(Null<Real>()), map_(std::move(map)), bcSet_(bcSet) {} |
29 | | |
30 | 0 | void ExplicitEulerScheme::step(array_type& a, Time t) { |
31 | 0 | step(a, t, 1.0); |
32 | 0 | } |
33 | | |
34 | 0 | void ExplicitEulerScheme::step(array_type& a, Time t, Real theta) { |
35 | 0 | QL_REQUIRE(t-dt_ > -1e-8, "a step towards negative time given"); |
36 | 0 | map_->setTime(std::max(0.0, t - dt_), t); |
37 | 0 | bcSet_.setTime(std::max(0.0, t-dt_)); |
38 | |
|
39 | 0 | bcSet_.applyBeforeApplying(*map_); |
40 | 0 | a += (theta*dt_) * map_->apply(a); |
41 | 0 | bcSet_.applyAfterApplying(a); |
42 | 0 | } |
43 | | |
44 | 0 | void ExplicitEulerScheme::setStep(Time dt) { |
45 | 0 | dt_ = dt; |
46 | 0 | } |
47 | | } |