Interval computation of Viswanath's constant

DOI10.1023/A:1014702122205MaRDI QIDQ1597644zbMATH OpenOpenAlexWikidataFDO

Authors João Batista Oliveira, Luiz Henrique de Figueiredo

Publication date 30 May 2002

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1014702122205

zbMATH Keywords

floating-point arithmeticinterval arithmeticrandom Fibonacci sequences

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Special sequences (11K31) Random matrices (algebraic aspects) (15B52) Interval and finite arithmetic (65G30)

Review text

\textit{D. Viswanath} [Math. Comput. 69, 1131-1155 (2000; Zbl 0983.11007)] has shown that the terms of the random Fibonacci sequences defined by \(t_1=t_2=1\) and \(t_n= \pm t_{n-1}\pm t_{n-2}\) for \(n>2\), where each \(\pm\) sign is chosen randomly, increase exponentially in the sense that \(\root n\of {|t_n|}\to 1.13198824\dots\) as \(n\to \infty\) with probability 1. Viswanath computed this approximation for this limit with floating-point arithmetic and provided a rounding-error analysis to validate his computer calculation. In this note, we show how to avoid this rounding-error analysis by using interval arithmetic.

Recommendations

• The computation of classical constants
• Computing the hyperbolicity constant
• scientific article; zbMATH DE number 5939590
• 3295. Approximate evaluation of Euler’s constant
• Computation of the Regular Continued Fraction for Euler's Constant
• On Computing Euler's Constant
• On approximating Euler's constant
• scientific article; zbMATH DE number 176881
• Approximations to Euler's constant
• Computing Stieltjes constants using complex integration

This page was built for publication: Interval computation of Viswanath's constant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1597644)