This bugzilla service is closed. All entries have been migrated to https://gitlab.com/libeigen/eigen
Bug 1353 - Very Sparse matrices of big dimension (i.e. OuterStarts has high repetition)
Summary: Very Sparse matrices of big dimension (i.e. OuterStarts has high repetition)
Status: RESOLVED DUPLICATE of bug 1179
Alias: None
Product: Eigen
Classification: Unclassified
Component: Sparse (show other bugs)
Version: 3.3 (current stable)
Hardware: All All
: Normal Feature Request
Assignee: Nobody
URL:
Whiteboard:
Keywords:
Depends on:
Blocks:
 
Reported: 2016-11-30 11:17 UTC by Angelos Mantzaflaris
Modified: 2019-12-04 16:33 UTC (History)
2 users (show)


Attachments
Add an attachment (proposed patch, testcase, etc.)

Description Angelos Mantzaflaris 2016-11-30 11:17:07 UTC 
The compressed format of Eigen::SparseMatrix uses memory

O(NNZ+innerSize)

For very sparse matrices with many zero columns (or rows) this becomes not usable.
I am interested in a compressed format with memory usage

O(NNZ)

What would be a good way to implement it ? I was thinking of using a sparse storage (i.e. kind of a SparseVector) for each column (or row) of the matrix. Would that be compatible with Eigen::SparseMatrixBase ?
Comment 1 Gael Guennebaud 2016-11-30 16:32:14 UTC 

*** This bug has been marked as a duplicate of bug 1179 ***
Comment 2 Nobody 2019-12-04 16:33:18 UTC 
-- GitLab Migration Automatic Message --

This bug has been migrated to gitlab.com's GitLab instance and has been closed from further activity.

You can subscribe and participate further through the new bug through this link to our GitLab instance: https://gitlab.com/libeigen/eigen/issues/1353.
Note You need to log in before you can comment on or make changes to this bug.