Displaying similar documents to “An implementation of Karr's summation algorithm in Mathematica.”

An analysis of selection sort using recurrence relations.

Francesc J. Ferri, Jesús Albert (1996)

Qüestiió

Similarity:

This paper presents a method for obtaining the expected number of data movements executed by the well-known Selection sort algorithm along with its corresponding variance. The approach presented here requires hardly any specific mathematical background. In particular, the average-case cost and variance are represented using recurrence relations whose solutions lead to the desired results. Even though this method is not applicable in general, it serves to conveniently present average-case...

A modification of the two-level algorithm with overcorrection

Stanislav Míka, Petr Vaněk (1992)

Applications of Mathematics

Similarity:

In this paper we analyse an algorithm which is a modification of the so-called two-level algorithm with overcorrection, published in [2]. We illustrate the efficiency of this algorithm by a model example.

Convergence acceleration by the E + p -algorithm

A. Fdil (1998)

Applicationes Mathematicae

Similarity:

A new algorithm which generalizes the E-algorithm is presented. It is called the E + p -algorithm. Some results on convergence acceleration for the E + p -algorithm are proved. Some applications are given.

Some results on convergence acceleration for the E-algorithm

A. Fdil (1997)

Applicationes Mathematicae

Similarity:

Some new results on convergence acceleration for the E-algorithm which is a general extrapolation method are obtained. A technique for avoiding numerical instability is proposed. Some applications are given. Theoretical results are illustrated by numerical experiments