Rate of convergence

In numerical analysis, the speed at which a convergent sequence approaches its limit is called the rate of convergence. Although strictly speaking, a limit does not give information about any finite first part of the sequence, this concept is of practical importance in dealing with a sequence of successive approximations for an iterative method, as then typically fewer iterations are needed to yield a useful approximation if the rate of convergence is higher. This may even make the difference between needing ten or a million iterations insignificant.

Similar concepts are used for discretization methods. The solution of the discretized problem converges to the solution of the continuous problem as the grid size goes to zero, and the speed of convergence is one of the factors of the efficiency of the method. However, the terminology in this case is different from the terminology for iterative methods.

Series acceleration is a collection of techniques for improving the rate of convergence of a series discretization. Such acceleration is commonly accomplished with sequence transformations.

Convergence speed for iterative methods

Basic definition

Suppose that the sequence {xk} converges to the number L.

We say that this sequence converges linearly to L, if there exists a number μ ∈ (0, 1) such that

The number μ is called the rate of convergence.

If the sequence converges, and

If the sequence converges sublinearly and additionally

then it is said the sequence {xk} converges logarithmically to L.

The next definition is used to distinguish superlinear rates of convergence. We say that the sequence converges with order q to L for q>1[1] if

In particular, convergence with order

This is sometimes called Q-linear convergence, Q-quadratic convergence, etc., to distinguish it from the definition below. The Q stands for "quotient," because the definition uses the quotient between two successive terms.

A practical method to calculate the rate of convergence for a sequence is to calculate the following sequence which is converging to p.

Extended definition

The drawback of the above definitions is that these do not catch some sequences which still converge reasonably fast, but whose "speed" is variable, such as the sequence {bk} below. Therefore, the definition of rate of convergence is sometimes extended as follows.

Under the new definition, the sequence {xk} converges with at least order q if there exists a sequence {εk} such that

and the sequence {εk} converges to zero with order q according to the above "simple" definition. To distinguish it from that definition, this is sometimes called R-linear convergence, R-quadratic convergence, etc. (with the R standing for "root").


Consider the following sequences:

The sequence {ak} converges linearly to 0 with rate 1/2. More generally, the sequence k converges linearly with rate μ if |μ| < 1. The sequence {bk} also converges linearly to 0 with rate 1/2 under the extended definition, but not under the simple definition. The sequence {ck} converges superlinearly. In fact, it is quadratically convergent. Finally, the sequence {dk} converges sublinearly and logarithmically.

Plot showing the different rates of convergence for the sequences a_k, b_k, c_k and d_k.
Linear, Linear, Superlinear/Quadratic and sublinear rate of convergence.

Convergence speed for discretization methods

A similar situation exists for discretization methods. The important parameter here for the convergence speed is not the iteration number k but it depends on the number of grid points and grid spacing. In this case, the number of grid points n in a discretization process is inversely proportional to the grid spacing.

In this case, a sequence is said to converge to L with order p if there exists a constant C such that

This is written as |xn - L| = O(np) using the big O notation.

This is the relevant definition when discussing methods for numerical quadrature or the solution of ordinary differential equations. A practical method to calculate the rate of convergence for a discretization method is to implement the following formula:


The sequence {dk} with dk = 1 / (k+1) was introduced above. This sequence converges with order 1 according to the convention for discretization methods.

The sequence {ak} with ak = 2k, which was also introduced above, converges with order p for every number p. It is said to converge exponentially using the convention for discretization methods. However, it only converges linearly (that is, with order 1) using the convention for iterative methods.

The order of convergence of a discretization method is related to its Global Truncation Error (GTE).

Acceleration of convergence

Many methods exist to increase the rate of convergence of a given sequence, i.e. to transform a given sequence into one converging faster to the same limit. Such techniques are in general known as "series acceleration". The goal of the transformed sequence is to reduce the computational cost of the calculation. One example of series acceleration is Aitken's delta-squared process.


  1. q may be non-integer. For example, the secant method has, in the case of convergence to a regular, simple root, convergence order φ=1.618....


The simple definition is used in

The extended definition is used in

Logarithmic convergence is used in

The Big O definition is used in

The terms Q-linear and R-linear are used in; The Big O definition when using Taylor series is used in

One may also study the following paper for Q-linear and R-linear:

This article is issued from Wikipedia - version of the 10/31/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.