Helo,

As sugested Ole, I run the Octave2 test from

http://www.sciviews.org/other/benchmark.htm on my MinGW Octave to evaluate

the performance of the build. The CPU is a AMD Duron 800MHz, 384MB,

Windows 2000-SP4 and I got this:

$ octave -f Octave2.m

GNU Octave, version 2.1.60 (i686-pc-mingw32).

Copyright (C) 2004 John W. Eaton.

This is free software; see the source code for copying conditions.

There is ABSOLUTELY NO WARRANTY; not even for MERCHANTIBILITY or

FITNESS FOR A PARTICULAR PURPOSE. For details, type `warranty'.

Additional information about Octave is available at

http://www.octave.org.

Please contribute if you find this software useful.

For more information, visit

http://www.octave.org/help-wanted.htmlReport bugs to <

[hidden email]> (but first, please read

http://www.octave.org/bugs.html to learn how to write a helpful report).

Octave Benchmark 2

==================

Number of times each test is run__________________________: 3

I. Matrix calculation

---------------------

Creation, transp., deformation of a 1500x1500 matrix (sec): 2.922

800x800 normal distributed random matrix ^1000______ (sec): 4.237

Sorting of 2,000,000 random values__________________ (sec): 3.36

700x700 cross-product matrix (b = a' * a)___________ (sec): 15.05

Linear regression over a 600x600 matrix (c = a \ b') (sec): 3.011

------------------------------------------------------

Trimmed geom. mean (2 extremes eliminated): 3.5

II. Matrix functions

--------------------

FFT over 800,000 random values______________________ (sec): 2.154

Eigenvalues of a 320x320 random matrix______________ (sec): 2.627

Determinant of a 650x650 random matrix______________ (sec): 3.964

Cholesky decomposition of a 900x900 matrix__________ (sec): 3.493

Inverse of a 400x400 random matrix__________________ (sec): 2.838

------------------------------------------------------

Trimmed geom. mean (2 extremes eliminated): 2.964

III. Programmation

------------------

750,000 Fibonacci numbers calculation (vector calc)_ (sec): 11.15

Creation of a 2250x2250 Hilbert matrix (matrix calc) (sec): 1.768

Grand common divisors of 70,000 pairs (recursion)___ (sec): 1.585

Creation of a 220x220 Toeplitz matrix (loops)_______ (sec): 3.315

Escoufier's method on a 37x37 matrix (mixed)________ (sec): 7.21

------------------------------------------------------

Trimmed geom. mean (2 extremes eliminated): 3.483

Total time for all 15 tests_________________________ (sec): 68.68

Overall mean (sum of I, II and III trimmed means/3)_ (sec): 3.306

--- End of test ---

By the way, I realized that the kpathsearch doesn't work properly and I

have to source all the used functions:

%%%% Shell function

%% function get () {

%% f="$1".m; find /usr/local/share/octave/2.1.60/m/ -name $f -exec cp {}

\;

%% sed 's/\(libs={\)/\1"'$1'"; /' Octave2.m >t

%% mv -f t Octave2.m

%% }

libs={"trace"; "cov"; "corrcoef"; "gcd2"; "strcmp"; "mean"; "rem";

"is_leap_year"; "isvector"; "etime"; "clock"; "toc"; "tic"; "findstr";

"split"; "rows"; "setstr"; "isscalar"; "columns"; "repmat"; "deblank";

"strcat"; "isstr"; "num2str"};

for n=1:length(libs);

source([libs{n}, ".m"]);

endfor

On the same computer, I run the standard Octave2.m test on octave 2.1.50a

from

http://octave.sf.net i.e. with octave-forge and a blas optimzed for

PIII (some segfault on my Duron :-( ):

GNU Octave, version 2.1.50 (i686-pc-cygwin).

Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003 John W.

Eaton.

This is free software; see the source code for copying conditions.

There is ABSOLUTELY NO WARRANTY; not even for MERCHANTIBILITY or

FITNESS FOR A PARTICULAR PURPOSE. For details, type `warranty'.

Please contribute if you find this software useful.

For more information, visit

http://www.octave.org/help-wanted.htmlReport bugs to <

[hidden email]>.

>> source("Octave2.m")

Octave Benchmark 2

==================

Number of times each test is run__________________________: 3

I. Matrix calculation

---------------------

Creation, transp., deformation of a 1500x1500 matrix (sec): 3.918

800x800 normal distributed random matrix ^1000______ (sec): 0.811

Sorting of 2,000,000 random values__________________ (sec): 16.45

700x700 cross-product matrix (b = a' * a)___________ (sec): 14.87

Linear regression over a 600x600 matrix (c = a \ b') (sec): 2.964

------------------------------------------------------

Trimmed geom. mean (2 extremes eliminated): 5.569

II. Matrix functions

--------------------

FFT over 800,000 random values______________________ (sec): 1.571

Eigenvalues of a 320x320 random matrix______________ (sec): 6.769

Determinant of a 650x650 random matrix______________ (sec): 3.774

Cholesky decomposition of a 900x900 matrix__________ (sec): 3.201

Inverse of a 400x400 random matrix__________________ (sec): 2.411

------------------------------------------------------

Trimmed geom. mean (2 extremes eliminated): 3.077

III. Programmation

------------------

750,000 Fibonacci numbers calculation (vector calc)_ (sec): 1.979

Creation of a 2250x2250 Hilbert matrix (matrix calc) (sec): 1.322

Grand common divisors of 70,000 pairs (recursion)___ (sec): 1.426

Creation of a 220x220 Toeplitz matrix (loops)_______ (sec): 3.596

Escoufier's method on a 37x37 matrix (mixed)________ (sec): 6.195

------------------------------------------------------

Trimmed geom. mean (2 extremes eliminated): 2.165

Total time for all 15 tests_________________________ (sec): 71.26

Overall mean (sum of I, II and III trimmed means/3)_ (sec): 3.335

--- End of test ---

Cheers,

Laurent

--

Dr. Laurent Mazet -=- /Use the source, Luke/ -=-

[hidden email]