A fixed point obeys . Thus the necessary and sufficient existence condition is
If is not an eigenvalue of , then is an invertible matrix and the unique constant solution is . If is singular but the equation is consistent, all constant solutions are for any particular solution . For an existing fixed point, ; the successive difference in the question likewise obeys .
Repeated substitution in the affine iteration gives
Therefore the required matrix polynomials are
These formulas do not require an inverse. If is an invertible matrix, multiplying the finite geometric sum by gives .
For a diagonalizable matrix, write . Relative to an existing fixed point,
Convergence to the same fixed point for every initial vector therefore holds exactly when
Here is the spectral radius. Necessity follows by choosing an initial displacement in each eigenspace; sufficiency follows because every displayed scalar power tends to zero. The condition also makes an invertible matrix, so that fixed point exists uniquely for every .
If instead different initial vectors may converge to different constant solutions, an eigenvalue is allowed: all other eigenvalues must have modulus less than one, and the component of in the eigenspace for must vanish. That component of the initial vector then remains unchanged. No other unit-modulus eigenvalue is compatible with convergence for arbitrary initial vectors.

Articles by others on the same topic (0)

There are currently no matching articles.