Schur form — where it appears
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
Six routes to one spectrum
Three linearisations of one quadratic, each reduced to a standard eigenvalue problem two ways. All six have exactly the same eigenvalues in exact arithmetic. On a well-scaled problem they differ by noise; on a badly scaled one by a factor of forty; and two of the six are the same matrix.
An equation whose unknown is a matrix
AX + XB = C is linear in X, so it has a coefficient matrix, and writing it down is the obvious thing to do. At n = 100 that matrix has a hundred million entries for a problem with ten thousand unknowns, and the algorithm everybody uses instead never forms it. Its conditioning is not the eigenvalue gap either, which is the number a reader is invited to consult.
Named alongside it
The objects these essays reach for when they reach for this one.
Condition numberBack-substitutionBackward errorCompanion formEigenvaluesFlop countKronecker productLinearisationMatrix equationMatrix polynomialNon-normalityQuadratic eigenvalue problem