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
|
/*
Copyright (C) 2000, 2001, 2002 RiskMap srl
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 ferdinando@ametrano.net
The license is also available online at http://quantlib.org/html/license.html
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 impliciteuler.hpp
\brief implicit Euler scheme for finite difference methods
\fullpath
ql/FiniteDifferences/%impliciteuler.hpp
*/
// $Id: impliciteuler.hpp,v 1.7 2002/02/22 16:37:16 nando Exp $
#ifndef quantlib_backward_euler_h
#define quantlib_backward_euler_h
//#include <ql/FiniteDifferences/finitedifferencemodel.hpp>
#include <ql/FiniteDifferences/mixedscheme.hpp>
namespace QuantLib {
namespace FiniteDifferences {
//! Backward Euler scheme for finite difference methods
/*! See sect. \ref findiff for details on the method.
In this implementation, the passed operator must be derived
from either TimeConstantOperator or TimeDependentOperator.
Also, it must implement at least the following interface:
\code
typedef ... arrayType;
// copy constructor/assignment
// (these will be provided by the compiler if none is defined)
Operator(const Operator&);
Operator& operator=(const Operator&);
// inspectors
Size size();
// modifiers
void setTime(Time t);
// operator interface
arrayType solveFor(const arrayType&);
static Operator identity(Size size);
// operator algebra
Operator operator*(double, const Operator&);
Operator operator+(const Operator&, const Operator&);
\endcode
*/
template <class Operator>
class ImplicitEuler : public MixedScheme<Operator> {
friend class FiniteDifferenceModel<ImplicitEuler<Operator> >;
private:
// typedefs
typedef typename Operator::arrayType arrayType;
typedef Operator operatorType;
// constructors
ImplicitEuler(const Operator& L)
: MixedScheme<Operator>(L, 1.0) {}
};
}
}
#endif
|
