Re: [eigen] first benchmark of large and sparse matrix |

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

*To*: eigen@xxxxxxxxxxxxxxxxxxx*Subject*: Re: [eigen] first benchmark of large and sparse matrix*From*: Benoît Jacob <jacob@xxxxxxxxxxxxxxx>*Date*: Mon, 23 Jun 2008 07:30:27 +0200

On Monday 23 June 2008 07:05:30 Benoît Jacob wrote: > this is of high interest for Krita and for Step and probably has > countless interesting applications I forgot to mention that support for sparse matrices should be of high interest to OpenBabel (chemistry lib, also considering eigen2): if I remember well they sometimes apply solving algorithms to the adjacency matrix of a molecule, so for a molecule with N atoms the matrix is NxN and has 2N nonzero entries. As far as I remember they used to apply dense algorithms, so N^3 complexity which is only doable for small N (like 10^2) while some molecules they deal with have up to 10^5 atoms. This example suggests that adjacency matrices of large graphs are a countless source of applications for sparse matrices... Cheers, Benoit

**Attachment:
signature.asc**

**Follow-Ups**:**Re: [eigen] first benchmark of large and sparse matrix***From:*Gael Guennebaud

**References**:**[eigen] first benchmark of large and sparse matrix***From:*Gael Guennebaud

**Re: [eigen] first benchmark of large and sparse matrix***From:*Benoît Jacob

**Messages sorted by:**[ date | thread ]- Prev by Date:
**Re: [eigen] first benchmark of large and sparse matrix** - Next by Date:
**[eigen] vectorization of sum** - Previous by thread:
**Re: [eigen] first benchmark of large and sparse matrix** - Next by thread:
**Re: [eigen] first benchmark of large and sparse matrix**

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