The spectral theorem for real symmetric matrices gives with an orthogonal matrix . Positive definiteness makes every eigenvalue positive. Define the matrix square rootIt is symmetric, its square is , and for any nonzero vector ,Thus it is also positive-definite, and its matrix inverse is .
The induced matrix norm associated with the given energy norm is a supremum of length ratios. The invertible change of variables givesThe last expression is the Euclidean operator norm. This is the matrix norm induced by an energy norm: transforming to coordinates with Euclidean lengths transforms the operator by the corresponding matrix similarity.
Write , where is the diagonal matrix of diagonal entries of , and are its strictly lower- and upper-triangular parts. Since is symmetric, . Subtract the two factors in the SOR iteration:Therefore, for ,Positive definiteness makes each , so the triangular matrix is an invertible matrix for every . The original formula gives ; the expression for itself is undefined there. The affine term ensuring that the desired solution is a fixed point is .
Apply the matrix norm induced by an energy norm and set . Multiplication givesThe bracket factors as . Because and ,Thus for the stated matrix. In particular is a positive semidefinite matrix. The Euclidean operator norm squared is the largest eigenvalue of , and all those eigenvalues are nonnegative. ConsequentlyThis identity is the algebraic step in the energy-norm proof of convergence of SOR; spectral radius equals the largest eigenvalue here because .
For , the coefficient is positive. Moreoveris a positive-definite matrix: for a nonzero vector , put ; then . Hence every eigenvalue of is strictly below one. Part (d) also gives , so these eigenvalues are nonnegative. ThereforeThe energy-norm proof of convergence of SOR thus makes the iteration a strict contraction mapping in this norm. Its forward error satisfies , so it converges geometrically to zero.
Articles by others on the same topic
There are currently no matching articles.