/
static_function.cpp
141 lines (131 loc) · 3.27 KB
/
static_function.cpp
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
#include "runtime.h"
#include "static_function.h"
StaticFunction::StaticFunction(int ord, double dqm, double dqr,int in)
{
order=ord;
dQmin=dqm;
dQrel=dqr;
devsIndex=in;
crossFunction=false;
for (int i=0;i<inputRows;i++)
{
if (inputMatrix[i*2]==devsIndex) {
cout << "Block " << devsIndex << " has as input var " << inputMatrix[i*2+1] <<endl;
inputs.push_back(inputMatrix[i*2+1]);
}
}
for (int i=0;i<outputRows;i++)
{
if (outputMatrix[i*2]==devsIndex) {
cout << "Block " << devsIndex << " has as output var " << outputMatrix[i*2+1] <<endl;
computes.push_back(outputMatrix[i*2+1]);
}
}
}
StaticFunction::~StaticFunction()
{
delete []inp;
delete []out;
delete []outdt;
delete []out_dt;
if (order>1) {
delete []out_2dt;
delete []out2dt;
}
}
void StaticFunction::init(Time t, unsigned int i)
{
dt=1e-8;
index=i;
sigma=1e-12;
outVars=1;
out = new double[outVars];
inp = new double[outVars];
outdt = new double[outVars];
out_dt = new double[outVars];
if (order>1) {
out_2dt = new double[outVars];
out2dt = new double[outVars];
}
}
void StaticFunction::makeStep(Time t)
{
// Evaluate at t
advanceInputs(t);
function_staticBlocks(index,t,inp,out);
if (order>1)
{
// Evaluate at t-dt
advanceInputs(t-dt);
function_staticBlocks(index,t-dt,inp,out_dt);
// Evaluate at t+dt
advanceInputs(t+dt);
function_staticBlocks(index,t+dt,inp,outdt);
}
sigma=INF;
writeOutputs(t);
// Take back the time
globalData->timeValue=t;
}
void StaticFunction::update(Time t)
{
sigma=0;
}
void StaticFunction::writeOutputs(Time t)
{
std::list<int>::iterator it=computes.begin();
int i=0;
if (crossFunction)
{
zc[indexCrossing].sampledAt(t);
zc[indexCrossing].setCoeff(0,out[0]);
zc[indexCrossing].setCoeff(1,(outdt[i]-out_dt[i])/(dt*2));
return;
}
for (;it!=computes.end();it++,i++)
{
if (isState(*it))
{
//cout << "Block " << devsIndex << " writes der " << stateNumber(*it) << endl;
//derX[stateNumber(*it)].sampledAt(t);
//derX[stateNumber(*it)].setCoeff(0,out[i]);
//if (order>1)
//derX[stateNumber(*it)].setCoeff(1,(outdt[i]-out_dt[i])/(dt*2));
} else {
//cout << "Block " << devsIndex << " writes algebraic " << algNumber(*it) << endl;
//alg[algNumber(*it)].sampledAt(t);
//alg[algNumber(*it)].setCoeff(0,out[i]);
//if (order>1)
//alg[algNumber(*it)].setCoeff(1,(outdt[i]-out_dt[i])/(dt*2));
}
if (order==2)
{
const double ddf=(outdt[i]-2*out[i]+out_dt[i])/(dt*dt*2);
const double tolerr=dQmin+dQrel*fabs(out[i]);
if (ddf!=0)
{
const double s=.9*sqrt(fabs(ddf/tolerr));
if (s<sigma) {
cout << "Adjusting sigma to " << s << endl;
sigma=s;
}
}
}
}
}
void StaticFunction::advanceInputs(Time t)
{
int i=0;
std::list<int>::iterator it=inputs.begin();
for (;it!=inputs.end();it++,i++)
{
if (isState(*it))
{
//cout << "Block " << devsIndex << " uses state " << stateNumber(*it) << endl;
//inp[i] = q[stateNumber(*it)].valueAt(t);
} else {
//cout << "Block " << devsIndex << " uses state " << algNumber(*it) << endl;
//inp[i] = alg[algNumber(*it)].valueAt(t);
}
}
}