comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: Matrix expansion performance
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: Matrix expansion performance [message #43273 is a reply to message #43272] Mon, 28 March 2005 05:43 Go to previous messageGo to previous message
Chris Lee is currently offline  Chris Lee
Messages: 101
Registered: August 2003
Senior Member
In article <d28tre$j32$1@pegasus.fccn.pt>, "Ricardo Bugalho"
<rbugalho@ibili.uc.pt> wrote:


> Hi,
> I have a matrix A (m,n) is and I want to create a matrix B(m,n,p) such
> that each B(*,*,i) slice equals A. p is very large and n is usually
> smaller than m so I have:
> B=bytArr(m,n,p)
> C=byteArr(p) + 1
> FOR i = 0, n-1 DO B[*,i,*] = REFORM(A[*,i]) # p Quite fast, but not
> enough for my needs. Any one has better sugestions? Still stuck in IDL
> 5.4, by the way.
> Thanks,
> Ricardo
>

Assuming your code was wrong, and that #p should be #C. A bit of reform
magic will do what you want.

http://www.dfanning.com/tips/rebin_magic.html

e.g.

b=rebin(reform(a, [m, n,1]), [m,n,p])

Chris.
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Line-Mouse widget tool
Next Topic: IDLWAVE Manuals: Your Support Needed

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Fri Oct 10 11:38:53 PDT 2025

Total time taken to generate the page: 0.41528 seconds