= Notes for Ma221 Lecture 21, Nov 10 2009
{c}
{title2=lecture dated 10 November 2009}
Lecture notes in <Math 221, Matrix Computations, Fall 2009>, dated 10 November 2009 in the heading. The page has no explicit author byline. <James Demmel> is the verified course instructor; the University of California, Berkeley EECS faculty website hosts the notes. No separate publication date or institutional authorship is asserted.
Online text: https://people.eecs.berkeley.edu/~demmel/ma221_Fall09/Lectures/Lecture_21.html
Cited passages: Basic iterative methods, splitting and recurrence (\*); spectral-radius lemmas and convergence-for-all-starts theorem; Jacobi and Gauss-Seidel component loops; strict row diagonal dominance, Theorem 1 and proof; 1D Dirichlet Poisson matrix and sine eigenvectors.
Additional cited passages: opening solver building blocks; Gauss-Seidel component loop, splitting, ordering remark and red-black scheduling; Theorem 1, strict row diagonal dominance; Theorem 3, SOR convergence for symmetric positive-definite matrices with the ω = 1 specialization. The lecture date and instructor association above remain distinct from author bylines and publication dates.
Back to article page
