Algorithm 1. Pseudocode of UTSR algorithm using IRLS.

UTSR(v(u,t), H, α, β, ∊)

begin

v ← vec [υ(u, t)]

f(0) ← H†v

foreach j=0,1,2,… do

${\mathbf{W}}_R^{(j)}=\text{diag}(\frac{1}{\left|f_m^{(j)}\right|+\beta })$

${\mathbf{f}}^{(j+1)}\leftarrow \text{pcg}({\mathbf{\text{H}}}^{†}\mathbf{\text{H}}+{\alpha }^2{\mathbf{W}}_R^{(j)},{\mathbf{\text{H}}}^{†}\mathbf{v})$

if ‖f (j+1) − f(j)‖ ≤ ∊ then

fUTSR ← f(j+1)

finished

end

end