Divide-and-conquer eigenvalue algorithm: Difference between revisions

Revision as of 23:46, 25 October 2004

Revision as of 10:00, 26 October 2004

Line 20:

We write <math>T</math> as a block diagonal matrix, plus a [[Rank (linear algebra)|rank-1]] correction:

:<math>T = \begin{bmatrix} \hat{T}_{1} & 0 \\ 0 & \hat{T}_{2}\end{bmatrix} + \begin{bmatrix} & & & & & \\ & & & & & \\ & & \beta & \beta & & \\ & & \beta & \beta & & \\ & & & & & \\ & & & & & \end{bmatrix}</math>

[[Category:Numerical analysis]][[Category:Linear algebra]][[Category:Algorithms]]