Memory access problems in block cyclic reduction on vector computers (Q806949)

The paper is concerned with linear systems with block tridiagonal coefficient matrices, which are also allowed to be of interval type. Generalizations of block cyclic methods as they were introduced by \textit{O. Bunnemann} [A compact noniterative Poisson solver, Inst. for Plasma Research, Report 294, Stanford University (1969)] are combined with interval arithmetic techniques as solution methods. Memory access problems are intended to be reduced drastically by the use of an appropriate data organization avoiding the usual powers of 2 as increments.