Siko1056

Joined 14 April 2013
428 bytes removed ,  10 June 2013
Line 40: Line 40:
== Y: Your task ==
== Y: Your task ==
* The task I would like to combine with my master thesis is [http://wiki.octave.org/Summer_of_Code_Project_Ideas#Incomplete_sparse_factorizations_ichol.2C_ilu Incomplete sparse factorizations ichol, ilu]. It may sound contradicting to implement approximation algorithms, when trying to implement accurate ones. My main reason to work on this project is to get more in touch with efficient ways of how to access big sparse matrices and how to work with the Octave-Interface. After the GSoC I want to apply this knowledge to deal with accurate matrix-vector products.
* The task I would like to combine with my master thesis is [http://wiki.octave.org/Summer_of_Code_Project_Ideas#Incomplete_sparse_factorizations_ichol.2C_ilu Incomplete sparse factorizations ichol, ilu]. It may sound contradicting to implement approximation algorithms, when trying to implement accurate ones. My main reason to work on this project is to get more in touch with efficient ways of how to access big sparse matrices and how to work with the Octave-Interface. After the GSoC I want to apply this knowledge to deal with accurate matrix-vector products.
* My suggested schedule looks as follows (critics are welcome):
** 04 Mai - 16 June: Getting to know Octave and required algorithms in depth (much Mentor consultation to get the task right)
** 17 June - 02 August [Coding begins to Midterm]: Mostly autonomous implementation phase. First working implementations.
** 03 August - 16 September [Pencils down]: Everything fully implemented and tested according to Mentor consultation.


For more information of my progress have a look at my [http://siko1056-gsoc.blogspot.com/ blog].
* For more information of my progress have a look at my [http://siko1056-gsoc.blogspot.com/ blog].


[[Category:Summer of Code 2013 Applicants]]
[[Category:Summer of Code 2013 Applicants]]