[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: the competition's expm vs ours
From: |
Jaroslav Hajek |
Subject: |
Re: the competition's expm vs ours |
Date: |
Wed, 10 Dec 2008 13:15:57 +0100 |
On Wed, Dec 10, 2008 at 9:23 AM, Marco Caliari <address@hidden> wrote:
>> On 9-Dec-2008, Jaroslav Hajek wrote:
>>
>> I wonder whether there's
>> room to optimize further, but I don't see anything left.
>
> If you allow to precompute another auxiliary matrix
>
> a4 = a2^2;
>
> then you can rewrite
>
> x = (c(8) * a4 + c(6) * a2) * a4 + c(4) * a4 + c(2) * a2 + id;
>
> At this point, you can even increase by one the degree of the approximation
> (at the same cost) and write
>
> y = ((c(9) * a4 + c(7) * a2) * a4 + c(5) * a4 + c(3) * a2 + c(1) * id) * aa;
>
> Of course, you need a new set of coefficients c(1:9).
>
OK, interesting :) I uploaded the new expm code, so feel free to
suggest patches.
> Best regards,
>
> Marco
>
--
RNDr. Jaroslav Hajek
computing expert
Aeronautical Research and Test Institute (VZLU)
Prague, Czech Republic
url: www.highegg.matfyz.cz
- Re: the competition's expm vs ours, (continued)
- Re: the competition's expm vs ours, Jaroslav Hajek, 2008/12/10
- Re: the competition's expm vs ours, Jordi GutiƩrrez Hermoso, 2008/12/10
- Re: the competition's expm vs ours, John W. Eaton, 2008/12/10
- Re: the competition's expm vs ours, Jaroslav Hajek, 2008/12/10
- Re: the competition's expm vs ours, John W. Eaton, 2008/12/11
- Re: the competition's expm vs ours, Jaroslav Hajek, 2008/12/11
- Re: the competition's expm vs ours, Marco Caliari, 2008/12/10
- Re: the competition's expm vs ours,
Jaroslav Hajek <=