Re: Slowup in 2.1.54

[Dmitri A. Sergatskov]

David Bateman wrote:
> I've just rerun the sciview tests, sinced I'd presumed that all of the recent
> changes in Octave would result in significantly faster code. It basically
> is just that the last test is much slower. I think the [] operator is
> slower in 2.1.54, though I need to check some more. Any clues?

I also noticed that recursion is slower. For sciview tests it is in
grand common divisors tests (gcd2.m).

2.1.50:

750,000 Fibonacci numbers calculation (vector calc)_ (sec): 0.3791
Creation of a 2250x2250 Hilbert matrix (matrix calc) (sec): 0.8338
Grand common divisors of 70,000 pairs (recursion)___ (sec): 0.447
Creation of a 220x220 Toeplitz matrix (loops)_______ (sec): 1.031
Escoufier's method on a 37x37 matrix (mixed)________ (sec): 3.515

2.1.54:

750,000 Fibonacci numbers calculation (vector calc)_ (sec): 0.3799
Creation of a 2250x2250 Hilbert matrix (matrix calc) (sec): 0.8019
Grand common divisors of 70,000 pairs (recursion)___ (sec): 0.5951
Creation of a 220x220 Toeplitz matrix (loops)_______ (sec): 0.9687
Escoufier's method on a 37x37 matrix (mixed)________ (sec): 4.484

(As I reported early I also see slow down in sylvester_matrix()
which uses recursion as well).
This change seems to occur in 2.1.53 -> 54 transition, I just do not
have saved data to show.


> Regards
> David

Dmitri.