File: tridiagonaloperator.hpp

package info (click to toggle)
quantlib 0.2.1.cvs20020322-1
  • links: PTS
  • area: main
  • in suites: woody
  • size: 4,716 kB
  • ctags: 4,614
  • sloc: cpp: 19,601; sh: 7,389; makefile: 796; ansic: 22
file content (277 lines) | stat: -rw-r--r-- 10,894 bytes parent folder | download
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277


/*
 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 tridiagonaloperator.hpp
    \brief tridiagonal operator

    \fullpath
    ql/FiniteDifferences/%tridiagonaloperator.hpp
*/

// $Id: tridiagonaloperator.hpp,v 1.16 2002/02/22 16:37:16 nando Exp $

#ifndef quantlib_tridiagonal_operator_h
#define quantlib_tridiagonal_operator_h

#include <ql/FiniteDifferences/boundarycondition.hpp>
#include <ql/array.hpp>
#include <ql/date.hpp>
#include <ql/handle.hpp>

namespace QuantLib {

    namespace FiniteDifferences {

        //! Base implementation for tridiagonal operator
        /*! \warning to use real time-dependant algebra, you must overload
            the corresponding operators in the inheriting time-dependent
            class
        */
        class TridiagonalOperator {
            // unary operators
            friend TridiagonalOperator operator+(const TridiagonalOperator&);
            friend TridiagonalOperator operator-(const TridiagonalOperator&);
            // binary operators
            friend TridiagonalOperator operator+(const TridiagonalOperator&,
                const TridiagonalOperator&);
            friend TridiagonalOperator operator-(const TridiagonalOperator&,
                const TridiagonalOperator&);
            friend TridiagonalOperator operator*(double,
                const TridiagonalOperator&);
            friend TridiagonalOperator operator*(const TridiagonalOperator&,
                double);
            friend TridiagonalOperator operator/(const TridiagonalOperator&,
                double);
          public:
            typedef Array arrayType;
            // constructors
            TridiagonalOperator(Size size = 0);
            TridiagonalOperator(const Array& low, const Array& mid,
                const Array& high);
            #if defined(QL_PATCH_MICROSOFT_BUGS)
                /* This copy constructor and assignment operator are here
                   because somehow Visual C++ is not able to generate working
                   ones. They are _not_ to be defined for other compilers
                   which are able to generate correct ones.   */
                TridiagonalOperator(const TridiagonalOperator& L);
                TridiagonalOperator& operator=(const TridiagonalOperator& L);
            #endif
            //! \name Operator interface
            //@{
            //! apply operator to a given array
            Array applyTo(const Array& v) const;
            //! solve linear system for a given right-hand side
            Array solveFor(const Array& rhs) const;
            //! solve linear system with SOR approach
            Array SOR(const Array& rhs, double tol) const;
            //! identity instance
            static TridiagonalOperator identity(Size size);
            //@}
            //! \name Inspectors
            //@{
            Size size() const;
            bool isTimeDependent();
            //@}
            //! \name Modifiers
            //@{
            void setLowerBC(const BoundaryCondition& bc);
            void setUpperBC(const BoundaryCondition& bc);
            void setFirstRow(double, double);
            void setMidRow(Size, double, double, double);
            void setMidRows(double, double, double);
            void setLastRow(double, double);
            void setTime(Time t);
            //@}
            //! encapsulation of time-setting logic
            class TimeSetter {
              public:
                virtual ~TimeSetter() {}
                virtual void setTime(Time t,
                                     TridiagonalOperator& L) const = 0;
            };
          protected:
            Array diagonal_, belowDiagonal_, aboveDiagonal_;
            BoundaryCondition lowerBC_, upperBC_;
            Handle<TimeSetter> timeSetter_;
        };


        // inline definitions

        #if defined(QL_PATCH_MICROSOFT_BUGS)
            inline TridiagonalOperator::TridiagonalOperator(
                const TridiagonalOperator& L) {
                    belowDiagonal_ = L.belowDiagonal_;
                    diagonal_      = L.diagonal_;
                    aboveDiagonal_ = L.aboveDiagonal_;
                    lowerBC_       = L.lowerBC_;
                    upperBC_       = L.upperBC_;
                    timeSetter_    = L.timeSetter_;
            }
            inline TridiagonalOperator& TridiagonalOperator::operator=(
                const TridiagonalOperator& L){
                    belowDiagonal_ = L.belowDiagonal_;
                    diagonal_      = L.diagonal_;
                    aboveDiagonal_ = L.aboveDiagonal_;
                    lowerBC_       = L.lowerBC_;
                    upperBC_       = L.upperBC_;
                    timeSetter_    = L.timeSetter_;
                    return *this;
            }
        #endif

        inline Size TridiagonalOperator::size() const {
            return diagonal_.size();
        }

        inline bool TridiagonalOperator::isTimeDependent() {
            return !timeSetter_.isNull();
        }

        inline void TridiagonalOperator::setFirstRow(double valB,
          double valC) {
            diagonal_[0]      = valB;
            aboveDiagonal_[0] = valC;
        }

        inline void TridiagonalOperator::setMidRow(Size i,
          double valA, double valB, double valC) {
            QL_REQUIRE(i>=1 && i<=size()-2,
                "out of range in TridiagonalSystem::setMidRow");
            belowDiagonal_[i-1] = valA;
            diagonal_[i]        = valB;
            aboveDiagonal_[i]   = valC;
        }

        inline void TridiagonalOperator::setMidRows(double valA,
          double valB, double valC){
            for (Size i=1; i<=size()-2; i++) {
                belowDiagonal_[i-1] = valA;
                diagonal_[i]        = valB;
                aboveDiagonal_[i]   = valC;
            }
        }

        inline void TridiagonalOperator::setLastRow(double valA,
          double valB) {
            belowDiagonal_[size()-2] = valA;
            diagonal_[size()-1]      = valB;
        }

        inline void TridiagonalOperator::setTime(Time t) {
            if (!timeSetter_.isNull())
                timeSetter_->setTime(t,*this);
        }


        // Time constant algebra

        inline TridiagonalOperator operator+(const TridiagonalOperator& D) {
            return D;
        }

        inline TridiagonalOperator operator-(const TridiagonalOperator& D) {
            Array low = -D.belowDiagonal_, mid = -D.diagonal_,
                high = -D.aboveDiagonal_;
            TridiagonalOperator result(low,mid,high);
            result.setLowerBC(D.lowerBC_);
            result.setUpperBC(D.upperBC_);
            return result;
        }

        inline TridiagonalOperator operator+(const TridiagonalOperator& D1,
          const TridiagonalOperator& D2) {
            QL_REQUIRE(D1.lowerBC_.type() == BoundaryCondition::None ||
                       D2.lowerBC_.type() == BoundaryCondition::None,
                "Adding operators with colliding boundary conditions");
            QL_REQUIRE(D1.upperBC_.type() == BoundaryCondition::None ||
                       D2.upperBC_.type() == BoundaryCondition::None,
                "Adding operators with colliding boundary conditions");
            Array low = D1.belowDiagonal_+D2.belowDiagonal_,
                mid = D1.diagonal_+D2.diagonal_,
                high = D1.aboveDiagonal_+D2.aboveDiagonal_;
            TridiagonalOperator result(low,mid,high);
            if (D1.lowerBC_.type() == BoundaryCondition::None)
                result.setLowerBC(D2.lowerBC_);
            else
                result.setLowerBC(D1.lowerBC_);
            if (D1.upperBC_.type() == BoundaryCondition::None)
                result.setUpperBC(D2.upperBC_);
            else
                result.setUpperBC(D1.upperBC_);
            return result;
        }

        inline TridiagonalOperator operator-(const TridiagonalOperator& D1,
          const TridiagonalOperator& D2) {
            QL_REQUIRE(D1.lowerBC_.type() == BoundaryCondition::None ||
                       D2.lowerBC_.type() == BoundaryCondition::None,
                "Subtracting operators with colliding boundary conditions");
            QL_REQUIRE(D1.upperBC_.type() == BoundaryCondition::None ||
                       D2.upperBC_.type() == BoundaryCondition::None,
                "Subtracting operators with colliding boundary conditions");
            Array low = D1.belowDiagonal_-D2.belowDiagonal_,
                mid = D1.diagonal_-D2.diagonal_,
                high = D1.aboveDiagonal_-D2.aboveDiagonal_;
            TridiagonalOperator result(low,mid,high);
            if (D1.lowerBC_.type() == BoundaryCondition::None)
                result.setLowerBC(D2.lowerBC_);
            else
                result.setLowerBC(D1.lowerBC_);
            if (D1.upperBC_.type() == BoundaryCondition::None)
                result.setUpperBC(D2.upperBC_);
            else
                result.setUpperBC(D1.upperBC_);
            return result;
        }

        inline TridiagonalOperator operator*(double a,
          const TridiagonalOperator& D) {
            Array low = D.belowDiagonal_*a, mid = D.diagonal_*a,
                high = D.aboveDiagonal_*a;
            TridiagonalOperator result(low,mid,high);
            result.setLowerBC(D.lowerBC_);
            result.setUpperBC(D.upperBC_);
            return result;
        }

        inline TridiagonalOperator operator*(const TridiagonalOperator& D,
          double a) {
            Array low = D.belowDiagonal_*a, mid = D.diagonal_*a,
                high = D.aboveDiagonal_*a;
            TridiagonalOperator result(low,mid,high);
            result.setLowerBC(D.lowerBC_);
            result.setUpperBC(D.upperBC_);
            return result;
        }

        inline TridiagonalOperator operator/(const TridiagonalOperator& D,
          double a) {
            Array low = D.belowDiagonal_/a, mid = D.diagonal_/a,
                high = D.aboveDiagonal_/a;
            TridiagonalOperator result(low,mid,high);
            result.setLowerBC(D.lowerBC_);
            result.setUpperBC(D.upperBC_);
            return result;
        }

    }

}


#endif