comp.lang.idl-pvwave archive: archive » Re: Matrix expansion performance

Home » Public Forums » archive » Re: Matrix expansion performance

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Re: Matrix expansion performance [message #43272 is a reply to message #43263]

Mon, 28 March 2005 05:50

Kenneth P. Bowman
Messages: 585
Registered: May 2000

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

This should be quite fast, if I understand your problem correctly:

B = BYTARR(m,n,p)
FOR k = 0, p-1 DO B[0,0,k] = A

This will avoid subscript arrays and should access memory efficiently on
most machines.

Ken Bowman

Report message to a moderator

[Message index]

		Re: Matrix expansion performance By: Timm Weitkamp on Wed, 30 March 2005 00:22
		Re: Matrix expansion performance By: Ricardo Bugalho on Tue, 29 March 2005 01:55
		Re: Matrix expansion performance By: Kenneth P. Bowman on Mon, 28 March 2005 05:50
		Re: Matrix expansion performance By: Chris Lee on Mon, 28 March 2005 05:43
		Re: Matrix expansion performance By: Chris Lee on Wed, 30 March 2005 07:21
		Re: Matrix expansion performance By: Ricardo Bugalho on Wed, 30 March 2005 04:18

Previous Topic:	Line-Mouse widget tool
Next Topic:	IDLWAVE Manuals: Your Support Needed

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Fri Oct 10 14:07:49 PDT 2025

Total time taken to generate the page: 0.32180 seconds