Changes

Jump to navigation Jump to search
113 bytes added ,  19:42, 30 April 2013
no edit summary
Line 2: Line 2:  
* I am '''Kai Torben Ohlhus''', a [http://www.tuhh.de/alt/tuhh/education/degree-courses/masters-programs/informatik-ingenieurwesen.html computer science and engineering] student in the final master semester from Hamburg, Germany. During my studies I specialized on software systems and communication networks and discovered a passion for computer arithmetic and algorithms, which will now be topic of my master thesis. I speak German (native), English (fluent) and Spanish (basic).
 
* I am '''Kai Torben Ohlhus''', a [http://www.tuhh.de/alt/tuhh/education/degree-courses/masters-programs/informatik-ingenieurwesen.html computer science and engineering] student in the final master semester from Hamburg, Germany. During my studies I specialized on software systems and communication networks and discovered a passion for computer arithmetic and algorithms, which will now be topic of my master thesis. I speak German (native), English (fluent) and Spanish (basic).
 
* My intention to participate in the GSoC 2013 is to work on a software project that can be part of my master thesis, which will begin in April. Till now I have not participated in any GSoC and this year will be my last chance to do so.
 
* My intention to participate in the GSoC 2013 is to work on a software project that can be part of my master thesis, which will begin in April. Till now I have not participated in any GSoC and this year will be my last chance to do so.
* The choice for Octave came during the planning of my thesis schedule. My master thesis will deal with accurate fast scalar products. The modification of an dot product algorithm [http://www.ti3.tu-harburg.de/paper/rump/OgRuOi05.pdf [1, p. 8]] [http://rnc7.loria.fr/louvet_poster.pdf [2]], which makes use of FMA-instructions [https://en.wikipedia.org/wiki/FMA_instruction_set [3]] (which will soon be available on ordinary PCs Intel and AMD) is the starting point to create a routine to efficiently compute residuals (thus matrix vector products) of the form <math>r_i = (A_i , -1) * (x , b_i)^T</math>. The next step is to optimize them to be used with big sparse A matrices. To make the use of the routines available to many possible applications e.g. MATLAB or GNU Octave routines by using the MEX-Interface or Oct-Interface. However, I prefer to program upon software where I have access to the source code, rather than only to a sparse documentation. So don't be afraid to disapprove my application, I'll stick to Octave.
+
* The choice for Octave came during the planning of my thesis schedule. My master thesis will deal with accurate fast scalar products. The modification of an dot product algorithm [http://www.ti3.tu-harburg.de/paper/rump/OgRuOi05.pdf [1, p. 8]] [http://rnc7.loria.fr/louvet_poster.pdf [2]], which makes use of FMA-instructions [https://en.wikipedia.org/wiki/FMA_instruction_set [3]] (which will soon be available on ordinary PCs Intel and AMD) is the starting point to create a routine to efficiently compute residuals (thus matrix vector products) of the form r_i = (A_i, -1) * (x , b_i)^T. The next step is to optimize them to be used with big sparse A matrices. To make the use of the routines available to many possible applications e.g. MATLAB or GNU Octave routines by using the MEX-Interface or Oct-Interface. However, I prefer [http://www.gnu.org/philosophy/open-source-misses-the-point.html free software] (Thank you Jordi for correcting my terminology) where I have access to the source code and freedom to modify it, rather than only to a sparse documentation. So don't be afraid to disapprove my application, I'll stick to Octave.
    
== C: Contact ==
 
== C: Contact ==

Navigation menu