Hello! I read from the commons math web page that Q-R -decomposition of matrices is on the wish list. Last night and this afternoon I had some free time so I created a clean-room implementation of this decomposition using Householder reflectors. The main source of information was the description of the algorithm found in Wikipedia: http://en.wikipedia.org/wiki/QR_decomposition
I would be interested in working towards getting this algorithm integrated in commons-math, but how should I proceed? And does anyone have suggestions on how to improve the implementation? The source code is downloadable from http://www.student.oulu.fi/~jonisalo/QRDecomp.java (should be understandable but may not be up to Apache standards yet) There is a problem with the current implementation though: it only works for non-singular square matrices. What will the usage of the algorithm be like? Should the singular and non-square cases be implemented, too? Kind regards, Joni Salonen --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
