Linear Algebra and Its Applications · Problem 7.4.16

Linear Programming and Game Theory — Gilbert Strang

Mathematics · arnoldi-lanczos-method

Problem

When A=ATA = A^T, the Arnoldi-Lanczos method finds orthonormal qq's so that Aqj=bj−1qj−1+ajqj+bjqj+1Aq_j = b_{j-1}q_{j-1} + a_j q_j + b_j q_{j+1} (with q0=0q_0 = 0). Multiply by qjTq_j^T to find a formula for aja_j. The equation says that AQ=QTAQ = QT where TT is a \underline{\hspace{1cm}} matrix.
Intuitive explanation

When AA is symmetric, the Lanczos iteration produces a tridiagonal structure because symmetry kills off the upper Hessenberg terms. Multiplying the recurrence by qjTq_j^T isolates aja_j by exploiting orthonormality: the cross terms vanish, leaving aj=qjTAqja_j = q_j^T A q_j. The matrix TT in AQ=QTAQ = QT captures this tridiagonal pattern—it's the compressed representation of AA in the orthonormal basis, with the bb's as off-diagonals and aa's on the main diagonal.

Intuitive explanation

When AA is symmetric, the Lanczos iteration produces a tridiagonal structure because symmetry kills off the upper Hessenberg terms. Multiplying the recurrence by qjTq_j^T isolates aja_j by exploiting orthonormality: the cross terms vanish, leaving aj=qjTAqja_j = q_j^T A q_j. The matrix TT in AQ=QTAQ = QT captures this tridiagonal pattern—it's the compressed representation of AA in the orthonormal basis, with the bb's as off-diagonals and aa's on the main diagonal.

Browse the problem library