A pseudocode definition of the NTVS algorithm is written as follows: |
1: set k = 0 |
2: set ℓ−1 = 0 |
3: set |
4: while k < K do |
5: set n = 0 |
6: set ℓk = rand(k, ℓk−1) |
7: set xk,n = xk |
8: while n < N do |
9: set vk,n = ϕ′(xk,n) |
10: set βk,n = αℓk |
11: set xk,n+1 = xk,n + βk,nvk,n |
12: set n = n + 1 |
13: set ℓk = ℓk + 1 |
14: end while |
15: set xk+1 = PT(xk,N) |
16: set k = k + 1 |
17: end while |