Re: Accelerating a one-line program doing matrix multiplication [message #72754 is a reply to message #72696] |
Wed, 29 September 2010 08:55   |
Axel Martínez
Messages: 22 Registered: June 2010
|
Junior Member |
|
|
On 29 Sep., 17:45, Paulo Penteado <pp.pente...@gmail.com> wrote:
> On Sep 29, 12:24 pm, Axel M <axe...@gmail.com> wrote:
>
>> Great, I did not know about this construction, and honestly I do not
>> understand how it works (is there any documentation about it?).
>> Anyways, I tried it, and unfortunately I saw that it needed ~20%
>> longer (the complete function, not the rebin only). So, it is not
>> faster.. but it is great though.
>
> It is replicating a structure of a single field which contains the
> array input ({temp:input}), then selecting only a single field (the
> first, 0) of the resulting structure array. Documentation for this
> would be on creation and use of structures.
Ok, I got it. Thanks! Then probably it is the memory allocation for
the array of structures which takes so long... it would be great if
the ITT people would develop a _fast_ vector replicate, I fear
rebinning is not the best option.
In any case, based on the answers, I assume that my problem is rather
on the matrix multiplication part, so I can probably do nothing for
that.
Thanks a lot
|
|
|