Convergence acceleration of number-machine sequences
From MaRDI portal
The relative distance d(x,y) of two real numbers x, y is defined and either d(x,y)\(\geq \tau\) or \(x=y\) holds, where \(\tau\) is introduced as the relative error of representation in a computer. The author modifies the definition of convergence and stationarity for ``number-machine sequences and demonstrates a using of the definitions on Aitken's process.
Recommendations
- scientific article; zbMATH DE number 176380
- Acceleration of convergence of interval sequences
- Remarks to a definition of convergence acceleration illustrated by means of continued fractions \(K(a_ n/1)\) where \(a_ n\to 0\)
- Convergence acceleration of some logarithmic sequences
- scientific article; zbMATH DE number 709412
Cites work
Cited in
(6)- Acceleration of convergence of interval sequences
- Development of the Levin-type algorithms for accelerating convergence of sequences
- scientific article; zbMATH DE number 4208145 (Why is no real title available?)
- scientific article; zbMATH DE number 3905740 (Why is no real title available?)
- scientific article; zbMATH DE number 176380 (Why is no real title available?)
- Probabilistic Richardson extrapolation
This page was built for publication: Convergence acceleration of number-machine sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639587)