20
edits
User:Sharma94: Difference between revisions
Jump to navigation
Jump to search
→Y: Your task
| Line 89: | Line 89: | ||
Yes | Yes | ||
** If yes, what task did you choose? Please describe what part of it you especially want to focus on if you can already provide this information. ''Please also wiki-link the page for your elaborated proposal here.'' | ** If yes, what task did you choose? Please describe what part of it you especially want to focus on if you can already provide this information. ''Please also wiki-link the page for your elaborated proposal here.'' | ||
''Italic textThe project on Improving matrix functions was chosen.The main task is to replace the eigenvalue decomposition method by the latest Schur-Parlett method. | |||
The link to the detailed proposal can be provided on request. | The link to the detailed proposal can be provided on request.'' | ||
** If you apply for a task you have added yourself instead, please describe this task, its scope and people you already talked to concerning it. What field of tasks did you miss on the list? | ** If you apply for a task you have added yourself instead, please describe this task, its scope and people you already talked to concerning it. What field of tasks did you miss on the list? | ||
* Please provide a rough estimated timeline for your work on the task. ''This should include the GSoC midterms and personal commitments like exams or vacation ("non-coding time"). Optionally include two or three milestones you expect.'' | * Please provide a rough estimated timeline for your work on the task. ''This should include the GSoC midterms and personal commitments like exams or vacation ("non-coding time"). Optionally include two or three milestones you expect.'' | ||
'' | |||
Till April end:Fixing bugs,utilizing some toolboxes for the project | Till April end:Fixing bugs,utilizing some toolboxes for the project | ||
---- | ---- | ||
| Line 103: | Line 103: | ||
<hr> | <hr> | ||
First week & Second Week--4th to 18th June:Include Schur decomposition,check for special cases.Blocking and confluent permutation Algorithms implemented for making T usable for Parlett's recurrence in solving Sylvester's equation which determine the complete f(T). | First week & Second Week--4th to 18th June:Include Schur decomposition,check for special cases.Blocking and confluent permutation Algorithms implemented for making T usable for Parlett's recurrence in solving Sylvester's equation which determine the complete f(T). | ||
funm done.Milestone 1 completed. | funm done.Also develop the equivalent code in C++.Milestone 1 completed. | ||
---- | ---- | ||
Third week & Fourth week--20th to 2nd July:Implement the logm as a special case using the same Schur-Parlett. sqrtm also using the similar Blocked-Schur Algorithm | Third week & Fourth week--20th to 2nd July:Implement the logm as a special case using the same Schur-Parlett. sqrtm also using the similar Blocked-Schur Algorithm | ||
[http://www.maths.manchester.ac.uk/~higham/papers/dhr13.pdf].Milestone 2 completed. | [http://www.maths.manchester.ac.uk/~higham/papers/dhr13.pdf].Milestone 2 completed.Also develop the equivalent C++ code. | ||
---- | ---- | ||
Fifth & Sixth week--5th July to 20th July:If time permits implement logm by the latest Scaling and Squaring Algorithms by N.Higham[http://eprints.ma.man.ac.uk/1851/01/covered/MIMS_ep2011_83.pdf].Develop some more functions for funm which are presently absent. | Fifth & Sixth week--5th July to 20th July:If time permits implement logm by the latest Scaling and Squaring Algorithms by N.Higham[http://eprints.ma.man.ac.uk/1851/01/covered/MIMS_ep2011_83.pdf].Develop some more functions for funm which are presently absent.And equivalent C++ code as well. | ||
---- | ---- | ||
Seventh & Eighth week--22nd July to 30th July:Intense testing and documentation | Seventh & Eighth week--22nd July to 30th July:Intense testing and documentation | ||
Afterwards-Relax !! | Afterwards-Relax !! | ||
'' | |||
[[Category: Summer of Code]] | [[Category: Summer of Code]] | ||