|Re: [eigen] Optimization for special complex operations|
[ Thread Index |
| More lists.tuxfamily.org/eigen Archives
- To: eigen@xxxxxxxxxxxxxxxxxxx
- Subject: Re: [eigen] Optimization for special complex operations
- From: Carlos Becker <carlosbecker@xxxxxxxxx>
- Date: Mon, 16 Aug 2010 16:38:39 +0100
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:mime-version:received:received:in-reply-to :references:date:message-id:subject:from:to:content-type; bh=AQqYE4BXyYW2Dse0NKJuK2y3/2QHm8+4rNGV2/BcmLo=; b=Kpo1EUQzWCRfN/IxVD07/36BuQJZt6EnBmk7/ogb+h3c6vx4Ce2+eW8OjI5BPEHp8G APxPgM/rDSGVoPFIqo9mAyOzv6tQTVKJXerIe8ZFAYSHZMiiwuVPhgLv4xWnxV/CQTZb Z57AWGGIJn505o8Ez7sIGqwnnpiPijlxWnmLo=
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :content-type; b=qfM3Sb3yBoCqa+5DRKNlDG5nRGPhg8TQ+8mVjU6ZZXVnebsjSQ6C61G4FXOIDbwxvf OmtBGKygCFj6oIBD/5FXfhlyo+fShBFoMf6NqtBMRgHxKxLzSdSJgL1f5XU3gbfFBtVc HtJUbh9NNKpatdJ/LEvyVyTpe5+zJx+zVhGCs=
On Mon, Aug 16, 2010 at 2:34 PM, Benoit Jacob <jacob.benoit.1@xxxxxxxxx>
2010/8/16 Carlos Becker <carlosbecker@xxxxxxxxx>:
> Hi everyone again. Lately I've been using Eigen with complex numbers toNo, it wouldn't :-)
> calculate things such as calculating the maximum of the real part or
> imaginary part of a certain vector. I suppose that trying to take the real
> part and then use maxCoeff() or minCoeff() would create a possible
> unnecessary temporary.
Ok good, maybe 'temporary' is not exactly what I wanted to say. I mean that maybe there are vectorized ways to do certain stuff and special implementations could be provided for such operations.
Hm. If we start going that route, won't we end up offering every
> Another thing is to be able to do something like:
> MatrixXf nn,xx;
> xx = nn.colwise().normalized();
possible vector operation as colwise() operation?
The biggest reason not to do it now is that it really isn't necessary
to release Eigen 3.0 .... ;-)
Yes I understand. I think vector-wise operations could be very important, but they would probably require a bit of discussion before implementing them (ie: should we keep .colwise(), should we use .vectorwise(), in the case some names for the reductions and vector-wise operations are the same).. I believe these kind of operations would be very useful since many times a set of vectors is stored in a matrix, so this way the user could benefit from extra performance.
I could try some prototypes to see if I can make it work. I designing something like .vectorwise() could be fine.