Bin-centred difference scheme

From Atomix
Revision as of 10:00, 11 November 2021 by Brian scannell (talk | contribs)

For a bin-centred difference scheme:

  1. start at bin n=nrmax2+1
    1. start with δ = 1
    2. if δ is even compute the second order structure function D(n,δ) as the segment mean of the square of the velocity difference between the bins separated by distance δr0 centered around bin n:

      D(n,δ)=[v(n+δ2, t)v(nδ2, t)]2

      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
    3. if δ is odd compute the second order structure function D(n,δ) as the segment mean of the mean of the square of the velocity difference between the bins separated by distance δr0 centered on the upper and lower extent of bin n:

      Δvlo(n,δ,t)=v(n+floor(δ2), t)v(nceil(δ2), t)
      Δvhi(n,δ,t)=v(n+ceil(δ2), t)v(nfloor(δ2), t)

      where ceil and floor indicate the upper and lower integer value respectively, then

      D(n,δ)=Δvlo(n,δ,t)2+Δvhi(n,δ,t)22

      the angled brackets again indicating the mean across all t in the data segment yielding a velocity difference after the application of the Level 1 QC criteria
    4. increment δ and repeat steps until δ=nrmax
  2. increment n and repeat steps until n+nrmax2 exceeds the bin number for which valid v are available

Return to ADCP Flow Chart front page