This article may require cleanup to meet Wikipedia's quality standards. The specific problem is: There are no references in-text. Convergence order uses p and q. and are not introduced.(February 2017) (Learn how and when to remove this template message) |

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, the concept of rate of convergence is of practical importance when working 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.

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.

## Contents

## Convergence speed for iterative methods

### Basic definition

Suppose that the sequence converges to the number .

This sequence is said to *converge linearly* to , if there exists a number such that

The number is called the *rate of convergence*.

If the sequence converges, and

- varies from step to step with for , then the sequence is said to
*converge superlinearly*. - varies from step to step with for , then the sequence is said to
*converge sublinearly*.

If the sequence *converges sublinearly* and additionally

then it is said that the sequence *converges logarithmically* to .

The next definition is used to distinguish superlinear rates of convergence. The sequence *converges with order to * for ^{[1]} if

for some positive constant (not necessarily less than 1). In particular, convergence with order

- is called
*quadratic convergence*, - is called
*cubic convergence*, - etc.

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 sequence that has a quadratic convergence implies that it has a superlinear rates of convergence.

A practical method to calculate the order of convergence for a sequence is to calculate the following sequence, which is converging to

### Extended definition

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

Under the new definition, the sequence converges with at least order if there exists a sequence such that

and the sequence converges to zero with order 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").

### Examples

Consider the following sequences:

The sequence {*a*_{k}} converges linearly to 0 with rate 1/2. More generally, the sequence *Cμ*^{k} converges linearly with rate μ if |μ| < 1. The sequence {*b*_{k}} also converges linearly to 0 with rate 1/2 under the extended definition, but not under the simple definition. The sequence {*c*_{k}} converges superlinearly. In fact, it is quadratically convergent. Finally, the sequence {*d*_{k}} converges sublinearly and logarithmically.

## 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 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 using 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:

where and denote the errors w.r.t. the new and old step sizes and respectively.

### Examples (continued)

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

The sequence {*a*_{k}} with *a*_{k} = 2^{−k}, 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.

## References

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

## Literature

The simple definition is used in

- Michelle Schatzman (2002),
*Numerical analysis: a mathematical introduction*, Clarendon Press, Oxford. ISBN 0-19-850279-6.

The extended definition is used in

- http://web.mit.edu/rudin/www/MukherjeeRuSc11COLT.pdf
- Walter Gautschi (1997),
*Numerical analysis: an introduction,*Birkhäuser, Boston. ISBN 0-8176-3895-4. - Endre Süli and David Mayers (2003),
*An introduction to numerical analysis,*Cambridge University Press. ISBN 0-521-00794-1.

Logarithmic convergence is used in

- Van Tuyl, Andrew H. (1994). "Acceleration of convergence of a family of logarithmically convergent sequences" (PDF).
*Mathematics of Computation*.**63**(207): 229–246. doi:10.2307/2153571.

The Big O definition is used in

- Richard L. Burden and J. Douglas Faires (2001),
*Numerical Analysis*(7th ed.), Brooks/Cole. ISBN 0-534-38216-9

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

- Nocedal, Jorge; Wright, Stephen J. (2006).
*Numerical Optimization*(2nd ed.). Berlin, New York: Springer-Verlag. pp. 619+620. ISBN 978-0-387-30303-1.

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

- Potra, F. A. (1989). "On Q-order and R-order of convergence".
*J. Optim. Th. Appl*.**63**(3): 415–431. doi:10.1007/BF00939805.