-
Notifications
You must be signed in to change notification settings - Fork 1
/
AuclertTrick_JACTRAN.py
786 lines (535 loc) · 27.7 KB
/
AuclertTrick_JACTRAN.py
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
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
# -*- coding: utf-8 -*-
"""
Created on Mon Jul 5 21:17:13 2021
@author: Du800
"""
from __future__ import print_function
import sys
import os
from copy import copy, deepcopy
import numpy as np
import scipy as sc
import numba as nb
from numba import jit
from scipy import sparse as sp
from HARK.ConsumptionSaving.ConsIndShockModel import IndShockConsumerType
from HARK.utilities import make_grid_exp_mult
from JAC_Utility import DiscreteDistribution2, combine_indep_dstns2
from HARK.distribution import DiscreteDistribution,combine_indep_dstns, Lognormal, MeanOneLogNormal, Uniform, calc_expectation
import matplotlib.pyplot as plt
"""
Created on Sun Jul 4 15:02:16 2021
@author: wdu
"""
'''
Extends the IndShockConsumerType agent to store a distribution of agents and
calculates a transition matrix for this distribution, along with the steady
state distribution
'''
class JACTran(IndShockConsumerType):
'''
An extension of the IndShockConsumerType that adds methods to handle
the distribution of agents over market resources and permanent income.
These methods could eventually become part of IndShockConsumterType itself
'''
time_inv_ = IndShockConsumerType.time_inv_ + [
"SSPmu",
"SSWmu",
#"wage",
"N",
"B",
"dx",
"T_sim",
"jac",
"jacW",
"jacN",
"jacT",
"PermShkStd",
"Ghost",
"PermShkCount",
"TranShkCount",
"TranShkStd",
"tax_rate",
"UnempPrb",
"IncUnemp",
"G",
"DisULabor",
"InvFrisch",
"s",
]
#def __init__(self,cycles=0,time_flow=True,**kwds):
def __init__(self,cycles=0,**kwds):
'''
Just calls on IndShockConsumperType
Parameters
----------
cycles : int
Number of times the sequence of periods should be solved.
time_flow : boolean
Whether time is currently "flowing" forward for this instance.
Returns
-------
None
'''
IndShockConsumerType.__init__(self, cycles = 0, **kwds)
## Initialize an IndShockConsumerType
#IndShockConsumerType.__init__(self,cycles=cycles,time_flow=time_flow,**kwds)
def update_income_process(self):
self.wage = 1/(self.SSPmu) #calculate SS wage
if type(self.Rfree) == list:
self.N = ((self.IncUnemp*self.UnempPrb ) + self.G + (1 - (1/(self.Rfree[0]) ) ) * self.B) / (self.wage*self.tax_rate)
else:
self.N = ((self.IncUnemp*self.UnempPrb ) + self.G + (1 - (1/(self.Rfree) ) ) * self.B) / (self.wage*self.tax_rate)#calculate SS labor supply from Budget Constraint
TranShkDstn = MeanOneLogNormal(self.TranShkStd[0],123).approx(self.TranShkCount)
TranShkDstn.pmf = np.insert(TranShkDstn.pmf*(1.0-self.UnempPrb),0,self.UnempPrb)
TranShkDstn.X = np.insert(TranShkDstn.X*(((1.0-self.tax_rate)*self.N*self.wage)/(1-self.UnempPrb)),0,self.IncUnemp)
PermShkDstn = MeanOneLogNormal(self.PermShkStd[0],123).approx(self.PermShkCount)
self.IncShkDstn = [combine_indep_dstns2(PermShkDstn,TranShkDstn)]
self.TranShkDstn = [TranShkDstn]
self.PermShkDstn = [PermShkDstn]
self.add_to_time_vary('IncShkDstn')
TranShkDstnW = MeanOneLogNormal(self.TranShkStd[0],123).approx(self.TranShkCount)
TranShkDstnW.pmf = np.insert(TranShkDstnW.pmf*(1.0-self.UnempPrb),0,self.UnempPrb)
TranShkDstnW.X = np.insert(TranShkDstnW.X*(((1.0-self.tax_rate)*self.N*(self.wage + self.dx))/(1-self.UnempPrb)),0,self.IncUnemp)
PermShkDstnW = MeanOneLogNormal(self.PermShkStd[0],123).approx(self.PermShkCount)
self.IncShkDstnW = [combine_indep_dstns2(PermShkDstnW,TranShkDstnW)]
self.TranShkDstnW = [TranShkDstnW]
self.PermShkDstnW = [PermShkDstnW]
self.add_to_time_vary('IncShkDstnW')
TranShkDstnN = MeanOneLogNormal(self.TranShkStd[0],123).approx(self.TranShkCount)
TranShkDstnN.pmf = np.insert(TranShkDstnN.pmf*(1.0-self.UnempPrb),0,self.UnempPrb)
TranShkDstnN.X = np.insert(TranShkDstnN.X*(((1.0-self.tax_rate)*(self.N + self.dx)*self.wage)/(1-self.UnempPrb)),0,self.IncUnemp)
PermShkDstnN = MeanOneLogNormal(self.PermShkStd[0],123).approx(self.PermShkCount)
self.IncShkDstnN= [combine_indep_dstns2(PermShkDstnN,TranShkDstnN)]
self.TranShkDstnN = [TranShkDstnN]
self.PermShkDstnN = [PermShkDstnN]
self.add_to_time_vary('IncShkDstnN')
TranShkDstnt = MeanOneLogNormal(self.TranShkStd[0],123).approx(self.TranShkCount)
TranShkDstnt.pmf = np.insert(TranShkDstnt.pmf*(1.0-self.UnempPrb),0,self.UnempPrb)
TranShkDstnt.X = np.insert(TranShkDstnt.X*(((1.0- (self.tax_rate +self.dx)) *self.N*self.wage)/(1-self.UnempPrb)),0,self.IncUnemp)
PermShkDstnt = MeanOneLogNormal(self.PermShkStd[0],123).approx(self.PermShkCount)
self.IncShkDstnt= [combine_indep_dstns2(PermShkDstnt,TranShkDstnt)]
self.TranShkDstnt = [TranShkDstnt]
self.PermShkDstnt = [PermShkDstnt]
self.add_to_time_vary('IncShkDstnt')
TranShkDstnP = MeanOneLogNormal(self.TranShkStd[0],123).approx(self.TranShkCount)
TranShkDstnP.pmf = np.insert(TranShkDstnP.pmf*(1.0-self.UnempPrb),0,self.UnempPrb)
TranShkDstnP.X = np.insert(TranShkDstnP.X*(((1.0- self.tax_rate) *self.N*self.wage)/(1-self.UnempPrb)),0,self.IncUnemp)
PermShkDstnP = MeanOneLogNormal(self.PermShkStd[0] + self.dx ,123).approx(self.PermShkCount)
self.IncShkDstnP= [combine_indep_dstns2(PermShkDstnP,TranShkDstnP)]
self.TranShkDstnP = [TranShkDstnP]
self.PermShkDstnP = [PermShkDstnP]
self.add_to_time_vary('IncShkDstnP')
TranShkDstnT = MeanOneLogNormal(self.TranShkStd[0] + self.dx,123).approx(self.TranShkCount)
TranShkDstnT.pmf = np.insert(TranShkDstnT.pmf*(1.0-self.UnempPrb),0,self.UnempPrb)
TranShkDstnT.X = np.insert(TranShkDstnT.X*(((1.0- self.tax_rate) *self.N*self.wage)/(1-self.UnempPrb)),0,self.IncUnemp)
PermShkDstnT = MeanOneLogNormal(self.PermShkStd[0],123).approx(self.PermShkCount)
self.IncShkDstnT= [combine_indep_dstns2(PermShkDstnT,TranShkDstnT)]
self.TranShkDstnT = [TranShkDstnT]
self.PermShkDstnT = [PermShkDstnT]
self.add_to_time_vary('IncShkDstnT')
def DefineDistributionGrid(self, Dist_mGrid=None, Dist_pGrid=None):
'''
Defines the grid on which the distribution is defined
Parameters
----------
Dist_mGrid : np.array()
Grid for distribution over normalized market resources
Dist_pGrid : np.array()
Grid for distribution over permanent income
Returns
-------
None
'''
#if self.cycles != 0:
#print('Distributional methods presently only work for perpetual youth agents (cycles=0)')
if self.cycles==0:
if Dist_mGrid == None:
self.Dist_mGrid = self.aXtraGrid
else:
self.Dist_mGrid = Dist_mGrid
if Dist_pGrid == None:
num_points = 50
#Dist_pGrid is taken to cover most of the ergodic distribution
p_variance = self.PermShkStd[0]**2
max_p = 20.0*(p_variance/(1-self.LivPrb[0]))**0.5
one_sided_grid = make_grid_exp_mult(1.0+1e-3, np.exp(max_p), num_points, 2)
self.Dist_pGrid = np.append(np.append(1.0/np.fliplr([one_sided_grid])[0],np.ones(1)),one_sided_grid)
else:
self.Dist_pGrid = Dist_pGrid
elif self.T_cycle !=0:#and self.cycles!=0:
if Dist_mGrid == None:
self.Dist_mGrid = self.aXtraGrid
else:
self.Dist_mGrid = Dist_mGrid
if Dist_pGrid == None:
num_points = 50
#Dist_pGrid is taken to cover most of the ergodic distribution
p_variance = self.PermShkStd[0]**2
max_p = 20.0*(p_variance/(1-self.LivPrb[0]))**0.5
one_sided_grid = make_grid_exp_mult(1.0+1e-3, np.exp(max_p), num_points, 2)
self.Dist_pGrid = np.append(np.append(1.0/np.fliplr([one_sided_grid])[0],np.ones(1)),one_sided_grid)
else:
self.Dist_pGrid = Dist_pGrid
def CalcTransitionMatrix(self):
'''
Calculates how the distribution of agents across market resources
transitions from one period to the next
'''
if self.cycles == 0:
Dist_mGrid = self.Dist_mGrid
Dist_pGrid = self.Dist_pGrid
aNext = Dist_mGrid - self.solution[0].cFunc(Dist_mGrid)
self.aNext = aNext
self.Cnow = self.solution[0].cFunc(Dist_mGrid)
bNext = self.Rfree*aNext
ShockProbs = self.IncShkDstn[0].pmf
TranShocks = self.IncShkDstn[0].X[1]
PermShocks = self.IncShkDstn[0].X[0]
LivPrb = self.LivPrb[0]
#New borns have this distribution (assumes start with no assets and permanent income=1)
NewBornDist = self.JumpToGrid(TranShocks,np.ones_like(TranShocks),ShockProbs)
TranMatrix = np.zeros((len(Dist_mGrid)*len(Dist_pGrid),len(Dist_mGrid)*len(Dist_pGrid)))
for i in range(len(Dist_mGrid)):
for j in range(len(Dist_pGrid)):
mNext_ij = bNext[i]/PermShocks + TranShocks
pNext_ij = Dist_pGrid[j]*PermShocks
TranMatrix[:,i*len(Dist_pGrid)+j] = LivPrb*self.JumpToGrid(mNext_ij, pNext_ij, ShockProbs) + (1.0-LivPrb)*NewBornDist
self.TranMatrix = TranMatrix
elif self.T_cycle!=0:
self.CNrmList = []
self.aNrmList =[]
self.TranMatList =[]
Dist_mGrid = self.Dist_mGrid
Dist_pGrid = self.Dist_pGrid
for i in range(self.T_cycle):
aNext = Dist_mGrid - self.solution[i].cFunc(Dist_mGrid)
self.aNext = aNext
self.aNrmList.append(self.aNext)
self.Cnow = self.solution[i].cFunc(Dist_mGrid)
self.CNrmList.append(self.Cnow)
if type(self.Rfree)==list:
bNext = self.Rfree[i]*aNext
else:
bNext = self.Rfree*aNext
ShockProbs = self.IncShkDstn[i].pmf
TranShocks = self.IncShkDstn[i].X[1]
PermShocks = self.IncShkDstn[i].X[0]
LivPrb = self.LivPrb[i]
#New borns have this distribution (assumes start with no assets and permanent income=1)
NewBornDist = self.JumpToGrid(TranShocks,np.ones_like(TranShocks),ShockProbs)
TranMatrix = np.zeros((len(Dist_mGrid)*len(Dist_pGrid),len(Dist_mGrid)*len(Dist_pGrid)))
for i in range(len(Dist_mGrid)):
for j in range(len(Dist_pGrid)):
mNext_ij = bNext[i]/PermShocks + TranShocks
pNext_ij = Dist_pGrid[j]*PermShocks
TranMatrix[:,i*len(Dist_pGrid)+j] = LivPrb*self.JumpToGrid(mNext_ij, pNext_ij, ShockProbs) + (1.0-LivPrb)*NewBornDist
#self.TranMatrix = TranMatrix
self.TranMatList.append(TranMatrix)
print(len(self.TranMatList))
def JumpToGrid(self,m_vals, perm_vals, probs):
'''
Distributes values onto a predefined grid, maintaining the means
'''
probGrid = np.zeros((len(self.Dist_mGrid),len(self.Dist_pGrid)))
mIndex = np.digitize(m_vals,self.Dist_mGrid) - 1
mIndex[m_vals <= self.Dist_mGrid[0]] = -1
mIndex[m_vals >= self.Dist_mGrid[-1]] = len(self.Dist_mGrid)-1
pIndex = np.digitize(perm_vals,self.Dist_pGrid) - 1
pIndex[perm_vals <= self.Dist_pGrid[0]] = -1
pIndex[perm_vals >= self.Dist_pGrid[-1]] = len(self.Dist_pGrid)-1
for i in range(len(m_vals)):
if mIndex[i]==-1:
mlowerIndex = 0
mupperIndex = 0
mlowerWeight = 1.0
mupperWeight = 0.0
elif mIndex[i]==len(self.Dist_mGrid)-1:
mlowerIndex = -1
mupperIndex = -1
mlowerWeight = 1.0
mupperWeight = 0.0
else:
mlowerIndex = mIndex[i]
mupperIndex = mIndex[i]+1
mlowerWeight = (self.Dist_mGrid[mupperIndex]-m_vals[i])/(self.Dist_mGrid[mupperIndex]-self.Dist_mGrid[mlowerIndex])
mupperWeight = 1.0 - mlowerWeight
if pIndex[i]==-1:
plowerIndex = 0
pupperIndex = 0
plowerWeight = 1.0
pupperWeight = 0.0
elif pIndex[i]==len(self.Dist_pGrid)-1:
plowerIndex = -1
pupperIndex = -1
plowerWeight = 1.0
pupperWeight = 0.0
else:
plowerIndex = pIndex[i]
pupperIndex = pIndex[i]+1
plowerWeight = (self.Dist_pGrid[pupperIndex]-perm_vals[i])/(self.Dist_pGrid[pupperIndex]-self.Dist_pGrid[plowerIndex])
pupperWeight = 1.0 - plowerWeight
probGrid[mlowerIndex][plowerIndex] = probGrid[mlowerIndex][plowerIndex] + probs[i]*mlowerWeight*plowerWeight
probGrid[mlowerIndex][pupperIndex] = probGrid[mlowerIndex][pupperIndex] + probs[i]*mlowerWeight*pupperWeight
probGrid[mupperIndex][plowerIndex] = probGrid[mupperIndex][plowerIndex] + probs[i]*mupperWeight*plowerWeight
probGrid[mupperIndex][pupperIndex] = probGrid[mupperIndex][pupperIndex] + probs[i]*mupperWeight*pupperWeight
return probGrid.flatten()
def CalcErgodicDist(self):
'''
Calculates the egodic distribution across normalized market resources and
permanent income as the eigenvector associated with the eigenvalue 1.
The distribution is reshaped as an array with the ij'th element representing
the probability of being at the i'th point on the mGrid and the j'th
point on the pGrid.
'''
eigen, ergodic_distr = sp.linalg.eigs(self.TranMatrix , k=1 , which='LM')
ergodic_distr = ergodic_distr.real/np.sum(ergodic_distr.real)
self.vec_dstn = ergodic_distr
self.ergodic_distr = ergodic_distr.reshape((len(self.Dist_mGrid),len(self.Dist_pGrid)))
FBSDict={
# Parameters shared with the perfect foresight model
"CRRA":2, # Coefficient of relative risk aversion
"Rfree": 1.05**.25, # Interest factor on assets
"DiscFac": 0.97, #.96, # Intertemporal discount factor
"LivPrb" : [.99375], # Survival probability
"PermGroFac" :[1.00], # Permanent income growth factor
# Parameters that specify the income distribution over the lifecycle
"PermShkStd" : [(.005*4/11)**.5], #[(0.01*4/11)**0.5], # Standard deviation of log permanent shocks to income
"PermShkCount" : 5, # Number of points in discrete approximation to permanent income shocks
"TranShkStd" : [.2], # Standard deviation of log transitory shocks to income
"TranShkCount" : 5, # Number of points in discrete approximation to transitory income shocks
"UnempPrb" : 0.05, #.08 # Probability of unemployment while working
"IncUnemp" : .2, # Unemployment benefits replacement rate
"UnempPrbRet" : 0.0005, # Probability of "unemployment" while retired
"IncUnempRet" : 0.0, # "Unemployment" benefits when retired
"T_retire" : 0, # Period of retirement (0 --> no retirement)
"tax_rate" : .2, # Flat income tax rate (legacy parameter, will be removed in future)
# Parameters for constructing the "assets above minimum" grid
"aXtraMin" : 0.001, # Minimum end-of-period "assets above minimum" value
"aXtraMax" : 20, # Maximum end-of-period "assets above minimum" value
"aXtraCount" : 48, # Number of points in the base grid of "assets above minimum"
"aXtraNestFac" : 3, # Exponential nesting factor when constructing "assets above minimum" grid
"aXtraExtra" : [None], # Additional values to add to aXtraGrid
# A few other parameters
"BoroCnstArt" : 0.0, # Artificial borrowing constraint; imposed minimum level of end-of period assets
"vFuncBool" : False, # Whether to calculate the value function during solution
"CubicBool" : False, # Preference shocks currently only compatible with linear cFunc
"T_cycle" : 1, # Number of periods in the cycle for this agent type
# Parameters only used in simulation
"AgentCount" : 100000, # Number of agents of this type
"T_sim" : 200, # Number of periods to simulate
"aNrmInitMean" : np.log(1.6)-(.5**2)/2,# Mean of log initial assets
"aNrmInitStd" : .5, # Standard deviation of log initial assets
"pLvlInitMean" : 0.0, # Mean of log initial permanent income
"pLvlInitStd" : 0.0, # Standard deviation of log initial permanent income
"PermGroFacAgg" : 1.0, # Aggregate permanent income growth factor
"T_age" : None, # Age after which simulated agents are automatically killed
# new parameters
"dx" : 0, #Deviation from steady state
"jac" : False,
"jacW" : False,
"jacN" : False,
"jact" : False,
"jacT" : False,
"jacPerm" : False,
"Ghost" : False,
#New Economy Parameters
"SSWmu" : 1.05 , # Wage Markup from sequence space jacobian appendix
"SSPmu" : 1.01, # Price Markup from sequence space jacobian appendix
"calvo price stickiness": .926, # Auclert et al 2020
"calvo wage stickiness": .899, # Auclert et al 2020
"B" : .1, # Net Bond Supply
"G" : .4,
"DisULabor": 0.8823685356415617,
"InvFrisch": 2 ,
"s" : 1
}
'''
G=.2
t=.175
Inc = .3
mho=.06
r = (1.05)**.25 - 1
B=.1 #.65
w = (1/1.01)
N = (Inc*mho + G + (1 - (1/(1+r)) ) *B) / (w*t)
q = ((1-w)*N)/r
A = ( B/(1+r) ) + q
0.9744680017987608
'''
G=.4
t=.2 #0.16563445378151262
Inc = .2
mho=.05
r = (1.05)**.25 - 1
B=.1 #.65
w = (1/1.01)
N = (Inc*mho + G + (1 - (1/(1+r)) ) *B) / (w*t)
q = ((1-w)*N)/r
A = ( B/(1+r) ) + q
#('output =' +str(N))
#print(q)
#print('Target Consumption =' +str(N-G))
#print('Target Assets =' +str(A))
target = A
ss = JACTran(**FBSDict)
ss.cycles=0
ss.dx=0
ss.T_sim = 1000
norm = ((1-ss.UnempPrb)/((ss.wage) * ss.N * (1 - ss.tax_rate)))
tolerance = .01
completed_loops=0
go = True
DiscFac = ss.DiscFac
while go:
ss.DiscFac = DiscFac
ss.solve()
#ss.initialize_sim()
#ss.simulate()
#Consumption = np.mean((ss.state_now['mNrm'] - ss.state_now['aNrm'])*ss.state_now['pLvl'])
#ASSETS = np.mean(ss.state_now['aNrm']*ss.state_now['pLvl'])
ss.DefineDistributionGrid()
ss.CNrmList = []
ss.aNrmList =[]
ss.TranMatList =[]
ss.CalcTransitionMatrix()
ss.CalcErgodicDist()
vecDstn = ss.vec_dstn
erg_Dstn = ss.ergodic_distr
TranMat = ss.TranMatrix
p = ss.Dist_pGrid
c = ss.Cnow
asset = ss.aNext
gridc = np.zeros((len(c),len(p)))
grida = np.zeros((len(asset),len(p)))
gridmu_ss = np.zeros((len(c),len(p)))
for j in range(len(p)):
gridc[:,j] = p[j]*c # cgrid by pgrid matrix, each element of an array denotes level of unnormalized consumption
grida[:,j] = p[j]*asset
gridmu_ss[:,j] = p[j]* ((p[j]*c) **-ss.CRRA)
Css = np.dot(gridc.flatten(),vecDstn)
AggA = np.dot(grida.flatten() ,vecDstn)
MUss = np.dot(gridmu_ss.flatten() ,vecDstn)
dif = AggA - target
if dif[0] > 0 :
DiscFac = DiscFac - dif[0]/200
elif dif[0] < 0:
DiscFac = DiscFac- dif[0]/200
else:
break
print('MU =' +str( MUss))
#print('MRS =' + str(MRS))
#print('what it needs to be:' + str(AMRS))
print('Assets =' + str(AggA))
#print('simulated assets = ' +str(ASSETS))
print('Target Assets =' +str(A))
print('consumption =' + str(Css))
#print('simulated Consumption = ' +str(Consumption))
print('Target Consumption =' +str(N-G))
print('DiscFac =' + str(DiscFac))
distance = abs(dif[0])
completed_loops += 1
print('Completed loops:' + str(completed_loops))
go = distance >= tolerance and completed_loops < 10
print("Done Computing Steady State")
class FBSNK_JAC(JACTran):
def update_solution_terminal(self):
"""
Update the terminal period solution. This method should be run when a
new AgentType is created or when CRRA changes.
Parameters
----------
none
Returns
-------
none
"""
self.solution_terminal.cFunc = deepcopy(ss.solution[0].cFunc)
self.solution_terminal.vFunc = deepcopy(ss.solution[0].vFunc)
self.solution_terminal.vPfunc = deepcopy(ss.solution[0].vPfunc)
self.solution_terminal.vPPfunc = deepcopy(ss.solution[0].vPPfunc)
def CalcErgodicDist(self):
'''
Calculates the egodic distribution across normalized market resources and
permanent income as the eigenvector associated with the eigenvalue 1.
The distribution is reshaped as an array with the ij'th element representing
the probability of being at the i'th point on the mGrid and the j'th
point on the pGrid.
'''
eigen, ergodic_distr = sp.linalg.eigs(ss.TranMatrix , k=1 , which='LM')
ergodic_distr = ergodic_distr.real/np.sum(ergodic_distr.real)
self.vec_dstn = ergodic_distr
self.ergodic_distr = ergodic_distr.reshape((len(self.Dist_mGrid),len(self.Dist_pGrid)))
params = deepcopy(FBSDict)
params['T_cycle'] = 60
params['LivPrb']= params['T_cycle']*[ss.LivPrb[0]]
params['PermGroFac']=params['T_cycle']*[1]
params['PermShkStd'] = params['T_cycle']*[ss.PermShkStd[0]]
params['TranShkStd']= params['T_cycle']*[ss.TranShkStd[0]]
params['Rfree'] = params['T_cycle']*[ss.Rfree]
example = FBSNK_JAC(**params)
example.pseudo_terminal = False
example.cycles = 1
example.jac= False
example.jacW = False
example.jacN = True
if example.jac == True:
example.dx = .0001
example.del_from_time_inv('Rfree')
example.add_to_time_vary('Rfree')
example.IncShkDstn = params['T_cycle']*ss.IncShkDstn
if example.jacW==True or example.jacN == True:
example.dx = .0001 #.8
example.Rfree = ss.Rfree
example.update_income_process()
q = params['T_cycle'] - 1
if example.jac == True:
example.Rfree = (q)*[ss.Rfree] + [ss.Rfree + example.dx] + (params['T_cycle'] - q - 1)*[ss.Rfree]
if example.jacW == True:
example.IncShkDstn = q*ss.IncShkDstn + example.IncShkDstnW + (params['T_cycle'] - q - 1)* ss.IncShkDstn
if example.jacN == True:
example.IncShkDstn = q*ss.IncShkDstn + example.IncShkDstnN + (params['T_cycle'] - q - 1)* ss.IncShkDstn
example.solve()
example.DefineDistributionGrid()
example.CalcTransitionMatrix()
Dist_mGrid = example.Dist_mGrid
Dist_pGrid = example.Dist_pGrid
'''
plt.plot((MUList - MUss[0])/example.dx,label = '15')
plt.plot(np.zeros(len(AggA_List)), color = 'k')
plt.legend()
#plt.savefig("MUJAC_TRANMAT.jpg", dpi=500)
plt.show()
plt.plot((AggA_List - AggA[0])/example.dx,label = '15')
plt.plot(np.zeros(len(AggA_List)), color = 'k')
plt.legend()
#plt.savefig("AJACW.jpg", dpi=500)
plt.show()
plt.plot((AggC_List - Css[0])/example.dx,label = '15',)
plt.plot(np.zeros(len(AggA_List)), color= 'k')
plt.legend()
#plt.savefig("CJACW.jpg", dpi=500)
plt.show()
'''
'''
G = gridc**(-ss.CRRA)
GG = np.zeros((len(c),len(p)))
for i in range(len(p)):
GG[:,i] = G[:,i]*p[i]
MUGG = np.dot(GG.flatten(),Dstn)
X = ss.TranShkDstn[0].X*norm
gmu =[]
for i in range(len(ss.TranShkDstn[0].X)):
gmu.append(X[i]*gridmu)
cc= 0
for i in range (5):
cc += np.dot(gmu[i].flatten(), Dstn* ss.TranShkDstn[0].pmf[i])
print(cc)
#gridc = np.zeros((len(c),len(p)))
#grida = np.zeros((len(anrm),len(p)))
#gridmu = np.zeros((len(c),len(p)))
#for j in range(len(p)):
#gridc[:,j] = p[j]*c
#grida[:,j] = p[j]*anrm
#gridmu[:,j] = p[j]*(p[j]*c) **-ss.CRRA
'''