Binary cascades iterative refinement in doubled-mantissa arithmetics (Q1063384): Difference between revisions

We investigate some computational aspects of binary cascades iterative refinement (BCIR) [see \textit{A. Kielbasinski}, ibid. 21, 97-103 (1981; Zbl 0455.65025)] for solving to a prescribed relative accuracy \(\epsilon\), \(\epsilon >0\), a nonsingular \(n\times n\) linear system \[ (1.1)\quad Ax=b,\quad \| x-\alpha \| \leq \epsilon \| \alpha \|,\quad \alpha =A^{-1}b. \] We deal with BCIR in doubled-mantissa arithmetics which was not considered by Kielbasinski. Our version is suitable for the whole class of problems which are exactly representable in a starting arithmetic \(fl(t_ 0)\).