Re: [eigen] tri1 = tri2*tri1

[ Thread Index | Date Index | More Archives ]

I opened a related bug some time ago:

Another benefit would be to safe temporaries and copy operations (I never benchmarked this, however). And we do support in-place solvers already.


On 23.09.2014 15:47, Gael Guennebaud wrote:
indeed, for such problems, what you gain from skipping the known zeros is
partly compensated by the extra logic to keep vectorization and more cache


On Tue, Sep 23, 2014 at 10:40 AM, Sebastian Birk <birk@xxxxxxxxxxxxxxxxxxxxx

and currently I use dense square matrices for that with
   temp.tri = b*a.tri
I'm afraid there is nothing better at the moment. What are the typical
sizes of your matrices?

They are rather small and range from 2 to about 100. So I guess there is
not much benefit in trying to optimise this.

I'm using them for block Krylov subspace methods where at some point QR
decompositions start to become the predominant computations.


Dipl.-Inf., Dipl.-Math. Christoph Hertzberg
Cartesium 0.049
Universität Bremen
Enrique-Schmidt-Straße 5
28359 Bremen

Tel: +49 (421) 218-64252

Mail converted by MHonArc 2.6.19+