Hi,
I remember there were some useful posts to find the positions in an array
satisfying defined conditions.

Another approach is attached.

Array_Pos2.sm (15.2 KiB) downloaded 664 time(s).

To expand on this concept further, I generally avoid using augment/stack functions with vectors of indeterminate size. The reason being that there is generally quite a bit of overhead in using those functions when it comes to execution time. I propose an alternative method shown here. Firstly we perform the test on the input matrix to determine the size of the result vector and location of results in input matrix. Then we instantiate the result vector and fill it in. To demonstrate the difference in execution I've also created a 100x100 input vector and timed the execution of both algorithms. The execution time difference becomes more apparent the larger the input matrix becomes.

Show Spoiler

Array_Pos2.pdf (137.54 KiB) downloaded 363 time(s).
Array_Pos2.sm (44.07 KiB) downloaded 628 time(s).