|
|
Ublas : |
From: Sourabh (sourabh_at_[hidden])
Date: 2007-03-15 07:06:05
In the following mail,
my purpose is to solve the equations:
(I + slopelemba) slopes = slopeomegas
delay = delaylembda * slopes + delayomega
Thanks.
On Thu, 15 Mar 2007, Sourabh wrote:
> Hi all,
>
> I want to optimize the following set of lines of code. These lines form
> the part of internal loop which will be executed 2000000000 times.
>
> inplace_solve_lower<true>(slopelembda, slopeomegas);
> axpy_prod(delaylembda, slopeomegas, delayomegas, false);
> double pathdelay = 0;
> for (unsigned gate = 0; gate < delayomegas.size (); ++gate) {
> pathdelay += delayomegas(gate);
> }
>
>
> In the above question,
> slopelembda: A strictly lower triangular matrix
> delaylembda: A strictly lower triangular matrix
> slopeomegas: A dense vector of size 100
> delayomegas: A dense vector of size 100
>
>
> Can I optimize it further ? If I am able to reduce its time by some
> margin, I will gain a lot of time because it is executed 2e9 times.
>
> Please suggest.
>
-- -- Sourabh