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
|
/*
* 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 "QuasiTriangularZero.hh"
#include "SchurDecomp.hh"
#include "SylvMatrix.hh"
#include "SylvException.hh"
#include <iostream>
QuasiTriangularZero::QuasiTriangularZero(int num_zeros, const ConstVector &d,
int d_size)
: QuasiTriangular(SqSylvMatrix(GeneralMatrix(Vector{d}, num_zeros+d_size, d_size),
num_zeros, 0, d_size).getData(),
d_size),
nz(num_zeros),
ru(GeneralMatrix(Vector{d}, num_zeros+d_size, d_size), 0, 0, num_zeros, d_size)
{
}
QuasiTriangularZero::QuasiTriangularZero(double r,
const QuasiTriangularZero &t)
: QuasiTriangular(r, t),
nz(t.nz),
ru(t.ru)
{
ru.mult(r);
}
QuasiTriangularZero::QuasiTriangularZero(double r,
const QuasiTriangularZero &t,
double r2,
const QuasiTriangularZero &t2)
: QuasiTriangular(r, t, r2, t2),
nz(t.nz),
ru(t.ru)
{
ru.mult(r);
ru.add(r2, t2.ru);
}
QuasiTriangularZero::QuasiTriangularZero(const std::string &dummy, const QuasiTriangularZero &t)
: QuasiTriangular(dummy, t),
nz(t.nz),
ru(t.ru)
{
ru.multRight(t);
}
QuasiTriangularZero::QuasiTriangularZero(const SchurDecompZero &decomp)
: QuasiTriangular(decomp.getT().getData(),
decomp.getT().nrows()),
nz(decomp.getZeroCols()),
ru(decomp.getRU())
{
}
QuasiTriangularZero::QuasiTriangularZero(const QuasiTriangular &t)
: QuasiTriangular(t),
nz(0), ru(0, t.getDiagonal().getSize())
{
}
void
QuasiTriangularZero::solvePre(Vector &x, double &eig_min)
{
Vector xu(x, 0, nz);
Vector xl(x, nz, x.length()-nz);
QuasiTriangular::solvePre(xl, eig_min);
ru.multsVec(xu, xl);
if (nz > 0)
eig_min = (eig_min > 1.0) ? 1.0 : eig_min;
}
void
QuasiTriangularZero::solvePreTrans(Vector &x, double &eig_min)
{
Vector xu(x, 0, nz);
Vector xl(x, nz, x.length()-nz);
ru.multsVecTrans(xl, xu);
QuasiTriangular::solvePreTrans(xl, eig_min);
if (nz > 0)
eig_min = (eig_min > 1.0) ? 1.0 : eig_min;
}
void
QuasiTriangularZero::multVec(Vector &x, const ConstVector &b) const
{
x.zeros();
multaVec(x, b);
}
void
QuasiTriangularZero::multVecTrans(Vector &x, const ConstVector &b) const
{
x.zeros();
multaVecTrans(x, b);
}
void
QuasiTriangularZero::multaVec(Vector &x, const ConstVector &b) const
{
ConstVector bl(b, nz, b.length()-nz);
Vector xu(x, 0, nz);
Vector xl(x, nz, x.length()-nz);
xu.zeros();
ru.multaVec(xu, bl);
QuasiTriangular::multVec(xl, bl);
}
void
QuasiTriangularZero::multaVecTrans(Vector &x, const ConstVector &b) const
{
ConstVector bu(b, 0, b.length());
ConstVector bl(b, nz, b.length()-nz);
Vector xu(x, 0, nz);
Vector xl(x, nz, x.length()-nz);
xu.zeros();
QuasiTriangular::multVecTrans(xl, bl);
ru.multaVecTrans(xl, bu);
}
void
QuasiTriangularZero::multLeftOther(GeneralMatrix &a) const
{
GeneralMatrix a1(a, 0, 0, nz, a.ncols());
GeneralMatrix a2(a, nz, 0, a.nrows()-nz, a.ncols());
a1.mult(ru, a2);
QuasiTriangular::multLeftOther(a2);
}
void
QuasiTriangularZero::print() const
{
std::cout << "super=" << std::endl;
QuasiTriangular::print();
std::cout << "nz=" << nz << std::endl
<< "ru=" << std::endl;
ru.print();
}
void
QuasiTriangularZero::multKron(KronVector &x) const
{
throw SYLV_MES_EXCEPTION("Attempt to run QuasiTriangularZero::multKron.");
}
void
QuasiTriangularZero::multKronTrans(KronVector &x) const
{
throw SYLV_MES_EXCEPTION("Attempt to run QuasiTriangularZero::multKronTrans.");
}
|
