Difference between revisions of "Iterative method"
Karl Jones (Talk | contribs) (→External links) |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 18: | Line 18: | ||
== See also == | == See also == | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
== External links == | == External links == | ||
Revision as of 19:58, 24 August 2016
In computational mathematics, an iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems.
Description
A specific implementation of an iterative method, including the termination criteria, is an algorithm of the iterative method.
An iterative method is called convergent if the corresponding sequence converges for given initial approximations.
A mathematically rigorous convergence analysis of an iterative method is usually performed; however, heuristic-based iterative methods are also common.
In the problems of finding the root of an equation (or a solution of a system of equations), an iterative method uses an initial guess to generate successive approximations to a solution.
In contrast, direct methods attempt to solve the problem by a finite sequence of operations. In the absence of rounding errors, direct methods would deliver an exact solution.
Iterative methods are often the only choice for nonlinear equations.
However, iterative methods are often useful even for linear problems involving a large number of variables (sometimes of the order of millions), where direct methods would be prohibitively expensive (and in some cases impossible) even with the best available computing power.
See also
External links
- Iterative method @ Wikipedia
