Re: [eigen] Getting to a solution from sparse matrices, Eigen3 |

[ Thread Index | Date Index | More lists.tuxfamily.org/eigen Archives ]

*To*: eigen@xxxxxxxxxxxxxxxxxxx*Subject*: Re: [eigen] Getting to a solution from sparse matrices, Eigen3*From*: FMDSPAM <fmdspam@xxxxxxxxx>*Date*: Tue, 17 Aug 2010 20:27:00 +0200

Am 17.08.2010 15:59, schrieb Will S:
To quote the docs "To summarize, it is recommanded to use a SparseMatrix whenever this is possible, and reserve the use of DynamicSparseMatrix for matrix assembly purpose when a SparseMatrix is not flexible enough."... So far the only way through the API I've seen to solve is to first call sparse.toDense() then solve, but I'm wondering if there is a way to solve a sparse matrix without calling .toDense() first in Eigen 3 and "Then the DynamicSparseMatrix object can be converted to a compact SparseMatrix to be used" I presume your sneaking suspision: Converting a (dynamic)sparsematrix into a densematrix is really pointless. cheers Frank |

**Follow-Ups**:**Re: [eigen] Getting to a solution from sparse matrices, Eigen3***From:*Gael Guennebaud

**References**:

**Messages sorted by:**[ date | thread ]- Prev by Date:
**Re: [eigen] gcc 4.2.4 warning on type-punned pointers** - Next by Date:
**Re: [eigen] Do we need geometry refactoring?** - Previous by thread:
**[eigen] Getting to a solution from sparse matrices, Eigen3** - Next by thread:
**Re: [eigen] Getting to a solution from sparse matrices, Eigen3**

Mail converted by MHonArc 2.6.19+ | http://listengine.tuxfamily.org/ |