LetA(h) be an approximation depending on a single parameterh to a fixed quantityA, and assume thatA−A(h)=c 1 h k 1 +c 2 h k 2 +.... Given a sequence ofh-valuesh 1>h 2>...>h n and corresponding computed approximationsA(h i ), the orders for repeated Richardson extrapolation are estimated, and the repeated extrapolation is performed. Hence in this case the algorithm described here can do the same work as Brezinski'sE-algorithm and at the same time provide a check whether repeated extrapolation is justified.