With zero boundary values eliminated, the diagonal of is . The Jacobi method is thereforewhich averages the four neighboring components. The sine addition identity shows that the supplied product vectors are eigenvectors, withThe discrete sine vectors form a basis, so these are all eigenvalues. Their largest modulus isattained at the lowest and highest sine frequencies. Thus the asymptotic error reduction factor per iteration is . If the convergence rate is expressed logarithmically, as . A fixed error reduction therefore takes Jacobi sweeps. For the special grid , and one sweep solves its single interior equation.
The endpoint in the printed nonnegative-parameter hypothesis must be excluded. We first establish the intended result for , then describe that endpoint exactly.
Write for the two directional matrices; they commute because they act on separate tensor-product coordinates. At a limit , the intermediate vector also has a limit . Subtract the two limiting equations in the form that cancels and ; this gives . Hence for . Substitution then gives , precisely the required discrete equation.
Eliminating the intermediate vector gives the alternating direction implicit iteration matrixThe sine-product basis simultaneously diagonalizes , with eigenvalues and , whereThusFor , each factor has modulus strictly less than one. Hence , proving convergence from every starting vector to the unique discrete solution.
At the two factors are both , so . The forcing terms cancel in the composed iteration as well, and for every starting vector. An incorrect initial vector therefore remains incorrect forever, even though the sequence is constant and has a limit. This disproves both the literal fixed-point implication and the claimed general convergence-to-solution assertion at zero; strict positivity of is the necessary repair.
Articles by others on the same topic
There are currently no matching articles.