MathGroup Archive 2011

[Date Index] [Thread Index] [Author Index]

Search the Archive

Data Array Recursive Functioning

  • To: mathgroup at smc.vnet.net
  • Subject: [mg121027] Data Array Recursive Functioning
  • From: Jason Sidabras <jason.sidabras at gmail.com>
  • Date: Tue, 23 Aug 2011 05:48:42 -0400 (EDT)
  • Delivered-to: l-mathgroup@mail-archive0.wolfram.com

Hello,

Relatively new with advanced Mathematica functional programming so I
was hoping I can get some help here.

I have a set of DataLists:

Data = {DataList1, DataList2,...}

Each list is 4096 points long and they *should* overlap at the 412th
point:

Data[[1,412]]=Data[[2,1]]
Data[[2,412]]=Data[[3,1]] and so on, but because of the measurement
tools they may be off.

When the data was only 412 long it was easy:

for[i=2,i<=Length[Data],i++,
Data[[i]]= (Data[[i-1,412]]-Data[[i,1]])+Data[[i]];
]

would vertically shift the points, then padding each DataList by 412
would align all of the lists together.

In the case of 4096 the issue is the previous vertical shift moves all
of the points, so what is needed is for each "for" loop, the newest
Data should be loaded, not the Data that was loaded in the beginning
of the "for" loop.

I have been playing with FoldList and Map but I am pretty new at those
powerful features.

Any help would be appreciated.




  • Prev by Date: CUDA, Nvidia and Linux issue
  • Next by Date: Magnified or WYSIWYG notebook printing
  • Previous by thread: Re: CUDA, Nvidia and Linux issue
  • Next by thread: Magnified or WYSIWYG notebook printing