User:Gouzouni: Difference between revisions

Jump to navigation Jump to search
1,125 bytes added ,  11 May 2014
Line 99: Line 99:
All deliverables will be tested and debugged during this period.
All deliverables will be tested and debugged during this period.


'''( July 1th - August 31st )'''
''' (July 1st - July 4th) '''
 
Testing, documentation, further debugging.
 
''' (July 5th - July 15th)
 
Break. As stated below, my examination period starts at June 10th and end at July 4th, so I would like to have a 10 days break in order to rest
and clear up my mind.
 
'''( July 16th - August 15th )'''


Continue with the algorithms' development. Given the four days per algorithm estimation, about 7 - 8 different algorithms should be created during this period.
Continue with the algorithms' development. Given the four days per algorithm estimation, about 7 - 8 different algorithms should be created during this period.


Milestone 2 : The goal for the end of this period will be to have a fully functioning multi-precision class ( or new basic numerical type ) and also a big enough arsenal of algorithms upon it.
Milestone 2 : The goal for the end of this period will be to have a fully functioning multi-precision class ( or new basic numerical type ) and also a big enough arsenal of algorithms upon it.
''' (August 16th - August 31st) '''
Wrapping up the project. Finish what is left to be done. Documentation, debugging and testing.


A list of algorithms that will be implemented ( not necessary in this order ) to support multi-precision objects is given below :
A list of algorithms that will be implemented ( not necessary in this order ) to support multi-precision objects is given below :
Line 115: Line 128:
Root of non-linear function finder ( fzero ),  
Root of non-linear function finder ( fzero ),  
Minimum value finder ( fmins ).  
Minimum value finder ( fmins ).  
Development methodology :
  A rough schedule that will be followed ( not necessarily in this order ) while developing the above algorithms will be :
Step 1 : Check if there is some library based on GMP or MPFR implementing any of those algorithms and if this can be embedded on Octave.
Step 2 : Study Octave's already implemented for double precision algorithms and see if they can be re-formed in order to support multiple precision.
Step 3 : Check if there is any Fortran code implementing any of the required algorithms and if it can be used to add support for multiple precision.
Step 4 : Implementing the algorithm from the scratch. This will be the final choice, and will be done only if there is no other way to implement an algorithm.


Imponderables like illness, bad days, Internet going down globally and such stuff are considered by the above schedule, this is why a precise estimation of days per algorithm is not given.
Imponderables like illness, bad days, Internet going down globally and such stuff are considered by the above schedule, this is why a precise estimation of days per algorithm is not given.


The only commitment I have for the summer is my university exam period which starts somewhere around June 6th and ends somewhere around June 27th. Despite that, I will keep coding during these days for about 5 - 6 hours everyday as stated above. Studying for the exams will be done the other hours of the day.
The only commitment I have for the summer is my university exam period which starts at June 10th and ends at July 4th. Despite that, I will keep coding during these days for about 5 - 6 hours everyday as stated above. Studying for the exams will be done the other hours of the day.


== N: News ==
== N: News ==
67

edits

Navigation menu