Rump, Siegfried M.Siegfried M.Rump2020-12-082020-12-082020Electronic Transactions on Numerical Analysis (52): 571-575 (2020)http://hdl.handle.net/11420/8157In a recent paper [Electron. Trans. Numer. Anal, 52 (2020), pp. 358-369], we analyzed Muller's famous recurrence, where, for particular initial values, the iteration over real numbers converges to a repellent fixed point, whereas finite precision arithmetic produces a different result, the attracting fixed point. We gave necessary and sufficient conditions for such recurrences to produce only nonzero iterates. In the above-mentioned paper, an example was given where only finitely many terms of the recurrence over R are well defined, but floating-point evaluation indicates convergence to the attracting fixed point. The input data of that example, however, are not representable in binary floating-point, and the question was posed whether such examples exist with binary representable data. This note answers that question in the affirmative.en1068-96132020571575BfloatDouble precision (binary64)Exactly representable dataHalf precision (binary16)IEEE-754RecurrencesRounding errorsSingle precision (binary32)InformatikMathematikJournal Article10.1553/ETNA_VOL52S571Other