Hi Jake,
This is in the worst case. I haved asked for the amount of data and that's what somebody told me. Anyway I'm not going to make any test with that amount of data. I'm doing my final year project and I just have to make this works with a reasonable amount of data. So I just need to know how the algorithm works. Is it possible to undone the changes in the original eigenvalues to get the original ones? Thanks. Pedro. ---------------------------------------- > From: [email protected] > Date: Tue, 23 Nov 2010 13:35:32 -0800 > Subject: Re: Lanczos Algorithm > To: [email protected] > > What is the expected size of this matrix you have, not the worst case size? > I have never heard of anyone doing a matrix decomposition on a > 100-trillion non-zero element matrix before. Are you sure the *average* > size of the rows would be 10^5 nonzero elements? > > On Tue, Nov 23, 2010 at 11:55 AM, PEDRO MANUEL JIMENEZ RODRIGUEZ < > [email protected]> wrote: > > > > > Well, this is in the worst case but it could be possible. > > > > I'm not going to make any tests with this amount of data because for me is > > impossible but this project is part of a bigger one and they would have > > enough space to deal with this amount of data. > > > > > > ---------------------------------------- > > > From: [email protected] > > > Date: Mon, 22 Nov 2010 14:46:20 -0800 > > > Subject: Re: Lanczos Algorithm > > > To: [email protected] > > > > > > That seems like a lot. That would mean that have 10^14 = 100 trillion > > > nonzero elements which would take 10PB to store with one bit per non-zero > > > element. > > > > > > Are there many totally zero rows? > > > > > > Can you estimate how many non-zero elements you have in all? > > > > > > On Mon, Nov 22, 2010 at 1:07 PM, PEDRO MANUEL JIMENEZ RODRIGUEZ < > > > [email protected]> wrote: > > > > > > > > > > > Hi Ted, > > > > > > > > I can't give you an exact amount but more or less it could be around > > 10^5 > > > > non-zero elements per row. > > > > > > > > Could you please let me know, why the lanzcos algorithm is not always > > > > returning the values in a decreasing order? > > > > > > > > Thanks. > > > > > > > > Pedro. > > > > > > > > ---------------------------------------- > > > > > From: [email protected] > > > > > Date: Fri, 19 Nov 2010 13:34:19 -0800 > > > > > Subject: Re: Lanczos Algorithm > > > > > To: [email protected] > > > > > > > > > > How many non-zero elements? > > > > > > > > > > On Fri, Nov 19, 2010 at 12:34 PM, PEDRO MANUEL JIMENEZ RODRIGUEZ < > > > > > [email protected]> wrote: > > > > > > > > > > > > > > > > > > > > > > > I was talking about 10^9 rows and 10^9 columns > > > > > > > > > > > > ---------------------------------------- > > > > > > > From: [email protected] > > > > > > > Date: Fri, 19 Nov 2010 12:07:16 -0800 > > > > > > > Subject: Re: Lanczos Algorithm > > > > > > > To: [email protected] > > > > > > > > > > > > > > On Fri, Nov 19, 2010 at 11:17 AM, PEDRO MANUEL JIMENEZ RODRIGUEZ > > < > > > > > > > [email protected]> wrote: > > > > > > > > > > > > > > > In this project I would have to work with matrix of 10^9, which > > > > have a > > > > > > very > > > > > > > > sparse data. > > > > > > > > > > > > > > > > > > > > > I think you mean 10^9 rows and 10^9 columns with much fewer 10^18 > > > > > > non-zero > > > > > > > elements. > > > > > > > > > > > > > > Is that correct? > > > > > > > > > > > > > > Can you say how many non-zero elements? > > > > > > > > > > > > > > > > > > > > > > > >
