Polar decomposition — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
The nearest orthogonal matrix
Every field that has to clean up a drifted rotation reaches for QR, and QR does not answer the question. The nearest orthogonal matrix is the orthogonal factor of the polar decomposition — nearer by about a tenth, and, more to the point, the same matrix whatever order the columns were written in. QR's answer changes completely.
An iteration that only multiplies
Newton's iteration for the polar factor needs an inverse every step. Newton–Schulz needs only matrix products — nothing that reads an entry, nothing that pivots — and it converges if and only if every singular value is below √3. At 1.73205 it converges and at 1.73206 it returns an orthogonal matrix that is not the answer, with a residual of 5·10⁻¹⁶ and nothing to say so.
Named alongside it
The objects these essays reach for when they reach for this one.
OrthogonalityCondition numberConvergence rateFixed pointFlop countGram–SchmidtHouseholderInvarianceMatrix-freeNewton iterationQR factorisationRotation