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
|
/*
* Copyright © 2004-2011 Ondra Kamenik
* Copyright © 2019 Dynare Team
*
* This file is part of Dynare.
*
* Dynare is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Dynare 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
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Dynare. If not, see <http://www.gnu.org/licenses/>.
*/
#include "KronUtils.hh"
#include "int_power.hh"
void
KronUtils::multAtLevel(int level, const QuasiTriangular &t,
KronVector &x)
{
if (0 < level && level < x.getDepth())
for (int i = 0; i < x.getM(); i++)
{
KronVector xi(x, i);
multAtLevel(level, t, xi);
}
else if (0 == level && 0 < x.getDepth())
{
GeneralMatrix tmp(x, x.getN(), power(x.getM(), x.getDepth()));
t.multLeftOther(tmp);
}
else if (0 == level && 0 == x.getDepth())
{
Vector b(const_cast<const KronVector &>(x));
t.multVec(x, b);
}
else // 0 < level == depth
t.multKron(x);
}
void
KronUtils::multAtLevelTrans(int level, const QuasiTriangular &t,
KronVector &x)
{
if (0 < level && level < x.getDepth())
for (int i = 0; i < x.getM(); i++)
{
KronVector xi(x, i);
multAtLevelTrans(level, t, xi);
}
else if (0 == level && 0 < x.getDepth())
{
GeneralMatrix tmp(x, x.getN(), power(x.getM(), x.getDepth()));
t.multLeftOtherTrans(tmp);
}
else if (level == 0 && 0 == x.getDepth())
{
Vector b(const_cast<const KronVector &>(x));
t.multVecTrans(x, b);
}
else // 0 < level == depth
t.multKronTrans(x);
}
void
KronUtils::multKron(const QuasiTriangular &f, const QuasiTriangular &k,
KronVector &x)
{
multAtLevel(0, k, x);
if (x.getDepth() > 0)
for (int level = 1; level <= x.getDepth(); level++)
multAtLevelTrans(level, f, x);
}
|
