Re: [MATH] Re: Pivoting QR Decomposition: Take Two!

2011-10-05 Thread Chris Nix
ecomposition.getRank(). Chris. On 5 October 2011 05:05, Greg Sterijevski wrote: > My apologies! Forgot to tag the subject line. > > On Tue, Oct 4, 2011 at 8:35 PM, Greg Sterijevski >wrote: > > > Hello all, > > > > A while back I was interested in being able to do pi

Re: [math] Re: SingularValueDecompositionImpl

2011-08-15 Thread Chris Nix
> Also, I think that further cleanup is possible (cf. "wantu" and "wantv" > checks that don't seem very useful). This is residual from the JAMA code and is not required with our current interface. I wonder if we could implement something around this. I can conceive of cases where users may only

Re: [math] Pivoting in QR decomposition

2011-08-07 Thread Chris Nix
to be moved out of the constructor (we would have an overridable method > being called in the constructor). > > -Greg > > On Sun, Aug 7, 2011 at 7:29 AM, Chris Nix wrote: > > > Oooops, the ***** below should read MATH-630. > > > > Chris > > > > O

Re: [math] Pivoting in QR decomposition

2011-08-07 Thread Chris Nix
Oooops, the * below should read MATH-630. Chris On 7 August 2011 13:28, Chris Nix wrote: > Thanks, Greg, for looking more at this. Apologies I've not been able to > focus on this too much recently. > > Yes, the approach above works, however the solvers also require a

Re: [math] Pivoting in QR decomposition

2011-08-07 Thread Chris Nix
Thanks, Greg, for looking more at this. Apologies I've not been able to focus on this too much recently. Yes, the approach above works, however the solvers also require a change so that they don't unexpectedly solve for a permuted matrix. Additionally, a getRank() method can now be implemented m

Re: [math] Pivoting in QR decomposition

2011-07-23 Thread Chris Nix
We can do this with the current Householder reflection implementation, except instead of just obtaining reflections from columns in sequence across the input matrix, we select the column with the greatest L2-norm at each iteration. The resulting permutation matrix is thus built and can be returned

Re: [math] Pivoting in QR decomposition

2011-07-21 Thread Chris Nix
Looking at the current implementation, there is no column pivoting and so the pivot matrix is the identity. I have just written a small patch that does QR Decomposition with column pivoting and has a getP() method to get the resulting permutation matrix. If this is useful, I can open a JIRA issue

[math] [GUMP@vmgump]: Project commons-math (in module apache-commons) failed

2011-07-21 Thread Chris Nix
Luc, This is a result of the test resources I added for MATH-611. Unfortunately, I think file extensions .csv are not copied to the test-classes directory when the tests are built. I've never dealt with gump, but I wonder if there are two options, either: a. Rename matrix1.csv and matrix2.csv t

[math] Incorporating JAMA code to solve problems?

2011-07-05 Thread Chris Nix
All, I've been working on another implementation of SVD as in issue MATH-355, I'm mostly there. However, I'm consistently impressed with the JAMA code. I email to ask a question that is perhaps quite bold for one such as me, so new to Commons Math.