[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: stack and append
From: |
Michael Hanke |
Subject: |
Re: stack and append |
Date: |
Wed, 16 Jun 1999 08:59:37 +0200 (MET DST) |
On Wed, 16 Jun 1999, Eduardo Gallestey wrote:
> I think that "newkron.oct" is much faster than "mykron.m" due to the
> speed up in the loops. The memory management is essentially the same in
> both of them.
>
> I guess the idea is that if one has large loops, one should write an
> .oct function.
Agree. But if speed is really an issue, shouldn't it be better to use
blas and the like? Usually, hand optimized versions are available and
can be easily used within octave (replace the libcruft stuff).
Michael
>
> Eduardo
>
>
>
> ---------------------------------------------------------------------
> Octave is freely available under the terms of the GNU GPL. To ensure
> that development continues, see www.che.wisc.edu/octave/giftform.html
> Instructions for unsubscribing: www.che.wisc.edu/octave/archive.html
> ---------------------------------------------------------------------
>
>
+---------------------------------------------------------------+
| Michael Hanke Royal Institute of Technology |
| NADA |
| S-10044 Stockholm |
| Sweden |
+---------------------------------------------------------------+
| Visiting address: Lindstedtsvaegen 3 |
| Phone: + (46) (8) 790 6278 |
| Fax: + (46) (8) 790 0930 |
| Email: address@hidden |
| address@hidden |
+---------------------------------------------------------------+
---------------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL. To ensure
that development continues, see www.che.wisc.edu/octave/giftform.html
Instructions for unsubscribing: www.che.wisc.edu/octave/archive.html
---------------------------------------------------------------------