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*: Tue, 24 Jun 2008 16:44:11 +0200

On Tuesday 24 June 2008 16:40:48 Benoît Jacob wrote: > For sum(), things are different. Since sum() is a far less common > operation, compilation time matters less, so I'm OK with merging it back to > redux once redux is vectorized (again, sum is a starting point for that). i forgot something ! Since we reimplemented the fuzzy compares using Hilbert-Schmidt norm, which uses sum(), the compilation time of sum() suddenly matters more! Also, all well considered, it seems to me that for certain users sum() could be a very common operation. However, it might well be that merging sum back in redux does not increase compilation time significantly -- here there is no question of constructing nested xprs as with dot and Product. Cheers, Benoit

**Attachment:
signature.asc**

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

**Re: [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] syntax highlighting on the wiki** - Previous by thread:
**Re: [eigen] first benchmark of large and sparse matrix** - Next by thread:
**[eigen] vectorization of sum**

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