Skip to main content

iterative methods

iterative methods Numerical methods that are based on or utilize the idea of iteration. Such methods are widely used in the solution of many different types of problem, ranging from linear and nonlinear optimization to discretized systems of partial differential equations. Starting from an initial estimate x0 of the solution x*, the methods generate a sequence of approximations x0, x1, x2,…. The main objectives are to design methods that will converge from poor initial estimates and also converge rapidly in the vicinity of x*. Different ideas may be employed in these two phases. Newton's method, together with its variants, is of fundamental importance for all types of nonlinear equations.

For the linear system Ax = b where A is large and perhaps sparse (see sparse matrix), or has some other special structure, an important class of iterative methods is obtained by “splitting” A into the form A = M – N. The splitting is such that systems of the form Mz = d are “easy” to solve, e.g. M could be lower triangular. The iteration then takes the form Mxk+1 = Nxk + d, k = 0,1,2,…,

where x0 is an approximation to the solution. Convergence for any x0 is guaranteed if all the eigenvalues (see eigenvalue problems) of M–1N have modulus less than one. The objective is to choose splittings for which each step is efficient and the convergence is rapid.

In partial differential equations, linear systems arise for which the method of successive over-relaxation is particularly suitable. This is given by (D + ωL)xk+1 = {(1 – ω)D – ωU}xk + ωb,

where A = D + L + U, D consists of the diagonal elements of A, and L, U are respectively the strictly lower and upper triangular parts. The scalar ω is a free parameter and is chosen to try to maximize the rate of convergence. For special problems in partial differential equations, optimal values of ω can be computed. More recently the sucessive over-relaxation method is an important technique in the multigrid method.

Cite this article
Pick a style below, and copy the text for your bibliography.

  • MLA
  • Chicago
  • APA

"iterative methods." A Dictionary of Computing. . 12 Mar. 2019 <>.

"iterative methods." A Dictionary of Computing. . (March 12, 2019).

"iterative methods." A Dictionary of Computing. . Retrieved March 12, 2019 from

Learn more about citation styles

Citation styles gives you the ability to cite reference entries and articles according to common styles from the Modern Language Association (MLA), The Chicago Manual of Style, and the American Psychological Association (APA).

Within the “Cite this article” tool, pick a style to see how all available information looks when formatted according to that style. Then, copy and paste the text into your bibliography or works cited list.

Because each style has its own formatting nuances that evolve over time and not all information is available for every reference entry or article, cannot guarantee each citation it generates. Therefore, it’s best to use citations as a starting point before checking the style against your school or publication’s requirements and the most-recent information available at these sites:

Modern Language Association

The Chicago Manual of Style

American Psychological Association

  • Most online reference entries and articles do not have page numbers. Therefore, that information is unavailable for most content. However, the date of retrieval is often important. Refer to each style’s convention regarding the best way to format page numbers and retrieval dates.
  • In addition to the MLA, Chicago, and APA styles, your school, university, publication, or institution may have its own requirements for citations. Therefore, be sure to refer to those guidelines when editing your bibliography or works cited list.