Kidnapster
- 2
- 0
_nx represents the nth iteration.
Show that {_{n+2}}x = _nx + M^{-1}(b-A{_nx})
{_{n+1}}x = _nx + M_1^{-1}(b-A{_nx})
{_{n+2}}x = {_{n+1}}x + M_2^{-1}(b-A{_{n+1}x})
M = M_1(M_1+M_2-A)^{-1}M_2
I tried was adding the two equations, which gives _{n+2}x = M_2^{-1}(b-A{_{n+1}x}) + _nx + M_1^{-1}(b-A{_nx}). But M_2^{-1}(b-A{_{n+1}}x) devolves into a huge mess once I expand it. Subtraction is less helpful, as you are left without any _nx. Directly substituting for _{n+1}x in the second equation is even less helpful, as you are left with a huge mess of terms that can't really be factored. What am I missing?
Homework Statement
Show that {_{n+2}}x = _nx + M^{-1}(b-A{_nx})
Homework Equations
{_{n+1}}x = _nx + M_1^{-1}(b-A{_nx})
{_{n+2}}x = {_{n+1}}x + M_2^{-1}(b-A{_{n+1}x})
M = M_1(M_1+M_2-A)^{-1}M_2
The Attempt at a Solution
I tried was adding the two equations, which gives _{n+2}x = M_2^{-1}(b-A{_{n+1}x}) + _nx + M_1^{-1}(b-A{_nx}). But M_2^{-1}(b-A{_{n+1}}x) devolves into a huge mess once I expand it. Subtraction is less helpful, as you are left without any _nx. Directly substituting for _{n+1}x in the second equation is even less helpful, as you are left with a huge mess of terms that can't really be factored. What am I missing?