A Levinson-type recursive procedure for updating the predictor of a di
screte stationary random field is developed. This considerably reduces
the number of equations that one must solve in order to recursively u
pdate the predictor as more data and information about the process bec
omes available and thus saves some resources and time. The procedure e
xtends the well-known Levinson recursive algorithm to the case of rand
om fields.