DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-31
How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Unshifted QR iteration, shifted QR iteration, deflation, and the Wilkinson shift
Definition
Let and let .
- The unshifted QR iteration factors with unitary and upper triangular, then sets
- Given shifts , the shifted QR iteration factors and sets
- Given a declared tolerance , numerical deflation at index occurs when : that entry is then replaced by , splitting the matrix into the two diagonal blocks separated at index . Exact deflation is the special case .
- For a real symmetric tridiagonal matrix, the Wilkinson shift is the eigenvalue of the trailing principal block that is nearer to the bottom-right entry; away from a tie, this eigenvalue is unique.
Depends on
Used by
- A Wilkinson-shifted QR step can sharply reduce the tail of a symmetric tridiagonal matrix Example
- One unshifted QR step and one shifted QR step on the same symmetric matrix show the role of the shift Example
- Shifted QR iteration preserves upper Hessenberg form Proposition
- Unshifted QR is orthonormalised simultaneous iteration, and every QR iterate is unitarily similar to the original matrix Proposition
- A real Wilkinson-shifted symmetric tridiagonal QR step preserves symmetric tridiagonal form away from ties Theorem
Dependency tree · two levels
7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Per-Olof Persson, The QR Algorithm I (standard reference, not scraped)
- Per-Olof Persson, The QR Algorithm II (standard reference, not scraped)