Debian Codegraph @

tests/bgp/nk-1/nk.mod

raw
1 var y i pi ;
2
3 parameters a1 a2 a3 a4 a5;
4
5 a1 = -.5;
6 a2 = .1;
7 a3 = .9;
8 a4 = 1.5;
9 a5 = 0.5;
10
11 model;
12
13 y = y(1)*(i/pi(1))^a1;
14
15 pi = (y^a2)*(pi(1)^a3);
16
17 i = (pi^a4)*(y^a5);
18
19 end;
20
21 verbatim;
22
23 bgp.write(M_);
24 if isoctave
25 options = optimset('Display', 'iter', 'MaxFunEvals', 1000000,'MaxIter',100000,'Jacobian','on','TolFun',1e-8,'TolX',1e-8);
26 else
27 options = optimoptions('fsolve','Display','iter','Algorithm','levenberg-marquardt','MaxFunctionEvaluations',1000000,'MaxIterations',100000,'SpecifyObjectiveGradient',true,'FunctionTolerance',1e-8,'StepTolerance',1e-8);
28 end
29 y = 1+(rand(3,1)-.5)*.5;
30 g = 1+(rand(3,1)-.5)*.1;
31 [y, fval, exitflag] = fsolve(@nk.bgpfun, [y;g], options);
32 assert(max(abs(y-1))<1e-9);
33
34 end;