# Iteration to Self-Consistency

It often happens that we need to solve an equation of the form a = f(a), where the precise form of the function f( ) depends on the problem in hand. Eboracus may well remember one such instance from his days as Chief Programmer at a UK financial institution, where an interest rate needed to be calculated subject to constraints that themselves depended on that very interest rate.

In these cases

- [Eqn 14e] would be recast as: a = ℓ / sinh(d/a)
- [Eqn 15] would be recast as: a = h / [cosh(d/a) – 1]

To solve such circular problems, we adopt a circular procedure, by guessing a plausible value of a, a_{0} say, and evaluating f(a_{0}). These two will not be equal (unless we are incredibly lucky), so we calculate their average (arithmetic, geometric or harmonic, according to taste) a_{1} = [a_{0} +f(a_{0})]/2, say. We repeat the procedure for a_{1}, a_{2}, a_{3}, ... , a_{n} until we observe that a_{n} and f(a_{n}) are equal to within the required number of significant figures. a_{n} is said to be self-consistent.

When this procedure works, it's said to be convergent. When it doesn't, it's said to be divergent, or maybe oscillatory. Successful convergence all too often depends on how good the initial guess was.