Bin-centred difference scheme: Difference between revisions
From Atomix
No edit summary |
No edit summary |
||
Line 6: | Line 6: | ||
## increment <math>\delta</math> and repeat steps until <math>\delta = n_{\text{rmax}}</math> | ## increment <math>\delta</math> and repeat steps until <math>\delta = n_{\text{rmax}}</math> | ||
# increment <math>n</math> and repeat steps until <math>n + \frac{n_{\text{rmax}}}{2}</math> exceeds the bin number for which valid <math>v^\prime</math> are available | # increment <math>n</math> and repeat steps until <math>n + \frac{n_{\text{rmax}}}{2}</math> exceeds the bin number for which valid <math>v^\prime</math> are available | ||
Return to [[ADCP structure function flow chart| ADCP Flow Chart front page]] |
Revision as of 10:00, 11 November 2021
For a bin-centred difference scheme:
- start at bin
- start with
= 1 - if
is even compute the second order structure function as the segment mean of the square of the velocity difference between the bins separated by distance centered around bin :
where the angled brackets indicate the mean across all t for the data segment yielding a velocity difference after the application of the Level 1 QC criteria - if
is odd compute the second order structure function as the segment mean of the mean of the square of the velocity difference between the bins separated by distance centered on the upper and lower extent of bin :
where and indicate the upper and lower integer value respectively, then
the angled brackets again indicating the mean across all in the data segment yielding a velocity difference after the application of the Level 1 QC criteria - increment
and repeat steps until
- start with
- increment
and repeat steps until exceeds the bin number for which valid are available
Return to ADCP Flow Chart front page