Algorithm for a moving irregular time window?
7 visualizzazioni (ultimi 30 giorni)
Mostra commenti meno recenti
The code in movmean, movmedian etc. is extremely fast even when I use a duration row vector as directional window length, e.g.: "m = movmedian(tabdata, [days(30) 0],'SamplePoints',datum);" which calculates medians for the last 30 days, even if the datum (datetime) is not regular. It takes - in my case - 35 times longer to run through all dates in a loop, like: "idx = datum >= datum(ii) - days(30) & datum <= datum(ii)". Does anyone know the algorithm used in movmean, movmedian etc.?
0 Commenti
Risposte (1)
John D'Errico
il 27 Feb 2018
The "algorithm"?
type movmean
'movmean' is a built-in function.
So movmean is a compiled function. It uses a loop, scanning through the data, maintaining a window of the desired size. Because the loop is compiled code, carefully written in a lower level language, it will be pretty efficient, more so than a loop in parsed MATLAB code, even with a good parsing capability as is built into MATLAB.
Anyway, as you wrote it, that is not even close to how I would try to write it even in MATLAB. you are using find on EVERY iteration. UGH. A bad idea. Instead, by keeping track of the points which will be in the window, even if the points are irregular, as long as they are sorted, you will do better than a repeated call to find. This is certainly how I would write the code in a lower level language.
Vedere anche
Categorie
Scopri di più su Loops and Conditional Statements in Help Center e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!