Modification of Rissanen’s method in linear memory

The problem of solving a linear system with a Hankel or block-Hankel matrix, as well as Rissanen’s algorithm and its generalization to the block case, are considered. Modifications of these algorithms that use less memory ($O(n)$ against $O(n^2)$).