Skip to main content

Accelerating convergence and Aitken's ∆² method.

 Accelerating convergence

A technique called Aitken's ∆² method is used to accelerate the convergence of a sequence that is linearly convergent, regardless of its origin of application.

Aitken's ∆² method:

Suppose {pₙ}ₙ᪲₌₀ is a linearly convergent sequence with limit p. To motivate the construction of a sequence  {p̂ₙ}ₙ᪲₌₀ that converges more rapidly to p than {pₙ}ₙ᪲₌₀. Let us first assume that 
(pₙ₊₁ - p)/(pₙ - p) ≈ (pₙ₊₂ - p)/(pₙ₊₁ - p)

=> (pₙ₊₁ - p)² ≈ (pₙ₊₂ - p)×(pₙ - p)

=> (pₙ₊₁)² -2pₙ₊₁p + p² ≈ pₙ₊₂pₙ -(pₙ+ pₙ₊₂)p+p²

=>  (pₙ₊₁)² -2pₙ₊₁p ≈ pₙ₊₂pₙ -(pₙ+ pₙ₊₂)p

=> (pₙ₊₂ + pₙ - 2pₙ₊₁)p ≈ pₙ₊₂pₙ - (pₙ₊₁)²

=> p ≈  [pₙ₊₂pₙ - (pₙ₊₁)²] /  (pₙ₊₂ + pₙ - 2pₙ₊₁)

Adding and subtracting the terms (pₙ)² and 2pₙ₊₁pₙ in the numerator and grouping terms appropriately gives

p ≈ [pₙ₊₂pₙ -2pₙ₊₁pₙ +(pₙ)² - (pₙ₊₁)² +2pₙ₊₁pₙ -(pₙ)² ] / (pₙ₊₂ + pₙ - 2pₙ₊₁)

=> p ≈ [(pₙ₊₂ -2pₙ₊₁+pₙ)pₙ - {(pₙ₊₁)² -2pₙ₊₁pₙ +(pₙ)² }] / (pₙ₊₂ + pₙ - 2pₙ₊₁)

=> p ≈ pₙ - {(pₙ₊₁ -pₙ)² / (pₙ₊₂ + pₙ - 2pₙ₊₁)}

Aitken's ∆² method is based on the assumption that the sequence {p̂ₙ}ₙ᪲₌₀  defined by

p̂ₙ ≈ pₙ - {(pₙ₊₁ -pₙ)² / (pₙ₊₂ + pₙ - 2pₙ₊₁)}

converges more rapidly to p than does the original sequence  {pₙ}ₙ᪲₌₀.

Question 1) The sequence pₙ = 1/n ,n≥1 converges to 0. Use Aitken's ∆² method to generate p̂ₙ until |p̂ₙ|≤ 5× 10⁻²?

Solution. pₙ = 1/n, n≥1

p₁ = 1

p₂ = 1/2 = 0.5

p₃ = 1/3 = 0.33

p₄ = 0.25

p₅ = 0.2

p₆ = 0.167

p₇ = 0.143

p₈ = 0.125

p₉ = 0.11


p̂₁ = p₁ - (p₂ - p₁)²/[p₃-2p₂+p₁ ]
= 1 - (0.5-1)²/[0.33-2(0.5)+1] = 1 - 0.25/[1.33 - 1] = 1 - 0.25/0.33 = 1- 0.76 = 0.24

p̂₂ = p₂ - (p₃-p₂)²/[p₄-2p₃+p₂]
= 0.5 - (0.33 - 0.5)²/ [0.25 - 2(0.33) + 0.5 ]= 0.5 - 0.0289/0.09 = 0.5 - 0.321 = 0.179.

p̂₃ = p₃ - (p₄-p₃)²/[p₅-2p₄+p₃]
= 0.33 - (0.25 - 0.33)²/[0.2 - 2(0.25)+0.33] = 0.33 - 0.0064/0.03 = 0.33 - 0.213 = 0.117

p̂₄ = p₄ - (p₅-p₄)²/[p₆-2p₅+p₄]
= 0.25 - (0.2-0.25)²/[0.167-2(0.2)+0.25] = 0.25 - 0.0025/[0.417-0.4] = 0.25 - 0.0025/0.017 = 0.25 - 0.1470 = 0.103

Similarly

p̂₅ = 0.079

p̂₆ = 0.071

p̂₇ = 0.035 Ans.

Comments

Popular posts from this blog

Newton-Gregory forward interpolation formula and Newton- Gregory backward interpolation formula.

Newton-Gregory forward interpolation formula: Let u = (x-x₀)/h then Newton-Gregory forward interpolation formula f(x) = y₀ + u∆y₀ + [u(u-1)]/2!×∆²y₀+ .......+ {u(u-1)(u-2)[u-(n-1)]}/n!×∆ⁿy₀ Example: Find f(15) by using Newton-Gregory forward interpolation formula? x: 10       20       30        40          50 y: 46       66       81        93          101 Solution. Here x₀=10, h = 10 and x= 15. Thus u = (x-x₀)/h = (15-10)/10 = 5/10 = 1/2 Forward difference table. By using Newton-Gregory forward interpolation formula f(x) = y₀ + u∆y₀ + [u(u-1)]/2!×∆²y₀+ .......+ {u(u-1)(u-2)[u-(n-1)]}/n!×∆ⁿy₀ f(15) = y₀ + 1/2∆y₀ + [1/2(1/2-1)]/2!×∆²y₀+ [1/2(1/2-1)(1/2-2)]/3!×∆³y₀ +[1/2(1/2-1)(1/2-2)(1/2-3)]/4!×∆⁴y₀  f(15) = 46 +(0.5)(20) + [(0.5)(-0.5)]/2×(-5) +[(0.5)(-0.5)(-1.5)]/6×(2) + [(0.5)(-0.5)(-1.5)(-2.5)]/24×(-3) f(15) = 46...

Kinds of number and significant digits.

  Kinds of Number  There are two kinds of number, exact and approximate. Approximate numbers Approximate numbers are those that represent the number to a certain degree of accuracy. Example; An approximate value of π is 3.1416 or if we wish to have a better approximation, it is 3.14169265. But we cannot write the exact value of π. Exact numbers The numbers which are accurately expressed are called exact numbers. For example; 1,2,3…., 1/2,3/2,…. √2, π, e etc written in this manner. Significant digits The digits that are used to express a number are called significant digits or significant figures. Example; The numbers 3.1416, 0.66667, 4.0687 contains five significant digits each. The number 0.00025 has however, only two significant digits viz 2 and 5 since zeroes serve only to fix the position of decimal points. Similarly, the numbers 0.00145, 0.000145, 0.0000145 all have three significant digits. Rule for finding significant digits Rule 1:   Every non zero digit is signif...

Gauss's central difference formula for equal intervals.

 Gauss's central difference formula for equal intervals: We shall develop central difference formulae which are best suitable for interpolation near the middle of the tabulated set (table). x:             x₋₂  x₋₁  x₀  x₁  x₂ y=f(x):    y₋₂  y₋₁  y₀  y₁  y₂ Difference table. Gauss's forward interpolation formula for equal intervals: f(x) = y₀+[u/1!]∆y₀+{[u(u-1)]/2!}∆²y₋₁+{[(u+1)(u)(u-1)]/3!}∆³y₋₁+{[(u+1)u(u-1)(u-2)]/4!}∆⁴y₋₂ +......., Where u= (x-x₀)/h Remark: This formula is applicable when u lies between 0 and 1 i.e (0<u<1). Example: Using Gauss's forward formula to evaluate y₃₀ given that y₂₁=18.4708, y₂₅=17.8144, y₂₉=17.1070, y₃₃=16.3432 and y₃₇=15.5154. Solution. The difference table is Forward difference table. To find y=f(x) at x=30, i.e f(30): Taking x₀ = 29, h=4, x=30, then u= (x-x₀)/h = (30-29)/4 = 0.25 Using Gauss's forward difference formula f(x) = y₀+[u/1!]∆y₀+{[u(u-1)]/2!}∆²y₋₁+...