[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: elements of a sparse matrix
|
From: |
Jordi Gutiérrez Hermoso |
|
Subject: |
Re: elements of a sparse matrix |
|
Date: |
Mon, 27 Dec 2010 10:58:31 -0600 |
On 27 December 2010 10:42, Søren Hauberg <address@hidden> wrote:
> The 'A' matrix will *not* be sparse, so it will contain
>
> 10000 * 10000 = 100 million
>
> elements. Each requires 8 bytes, so that's 800 megabytes of data.
Actually, it's a bit more than that because as a compressed column
sparse matrix, you have to store the indices as well. If she really
wants a matrix this large, she could actually save space by saving it
as a full matrix instead of a sparse one, i.e. A = full(B'*B).
- Jordi G. H.