-
-
Notifications
You must be signed in to change notification settings - Fork 21
Description
We want to refactorize the code related with AMSS including a series of lectures including opt_tax_recur
and amss
(and potentially amss2
and amss3
in the near future) by a collaboration with @QBatista and @thomassargent30.
The parts to modify are mainly two Python classes
- Sequential Allocation problem
-
SequentialAllocation
both inopt_tax_recur
andamss
-
- Recursive Allocation problem
-
RecursiveAllocation
inopt_tax_recur
-
RecursiveAllocationAMSS
inamss
-
Our goal is to improve the quality of the code in several aspects:
- readability
- math notations of model parameters and variables
- make the code closely and clearly related with the computational algorithm described using math and avoid inconsistency
- efficiency
- optimize the root finding procedure
@QBatista would you please add on your thoughts if I missed anything? I remember that you wanted to jit the class. For me the performance of the current code is quite acceptable but it would be great to discuss if jitting would be needed.
We need to notice that these two lectures share a large fraction of the code so it would be great if we could avoid "copy and paste". We would appreciate it a lot if @mmcky has some suggestions on this issue.
I created a new branch mod_amss
and we will modify the .rst
files and make a PR from there.