Capacitance matrix — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
The circulant the problem did not contain
A matrix that differs from a circulant in two corner entries can be solved through the circulant, by a transform and a two-by-two correction, and the cost claim is exact. The accuracy claim is not. On tridiag(−1, 2 + σ, −1), whose condition number stops at 1,712, the correction is wrong by 1.2·10⁻⁴ at σ = 10⁻⁸ while elimination is right to 1.1·10⁻¹⁴ — because the periodic neighbour is singular at σ = 0, the two-by-two system inherits that, and the two amplifications multiply.
Two near-zeros cost less than one
Solve a well-conditioned tridiagonal matrix through a nearly singular wrap and the correction's accuracy is not set by how singular the wrap is. At κ = 4·10⁷ one wrap returns the answer to 8.8·10⁻¹¹ — better than κ·u — and another, at κ = 3.8·10⁷, returns it to 3.3·10⁻⁶. The difference is how many of its samples sit near the symbol's zeros. A real wrap lands on a conjugate pair, a rank-two correction absorbs the pair exactly, and its two-by-two system has condition number 1.00.
Named alongside it
The objects these essays reach for when they reach for this one.
CancellationCirculant matrixCondition numberDiscrete laplacianForward errorNear-null spaceSymbolWoodbury identityInvariant subspaceIterative refinementLow-rank updateTwisted circulant