Semi-coarsening — where it appears
Named by 4 essays across one field — each of them below, with the objects they name alongside it.
Coarsening in one direction only
Leave the smoother alone and halve only the strong direction, and the smoothing factor is 0.3340 — identical to line relaxation's, at every anisotropy and every weight, to twelve digits. The convergence factors are then a factor of three apart, and at 45° both repairs fail outright.
The coarse grid the matrix chooses
Given a tridiagonal matrix and no information about a grid, the coarsening keeps every other point and derives the weights ½, 1, ½ — the operators the geometric method was handed. Given the anisotropic operator, it discovers semi-coarsening, in the right direction, without a coordinate.
How much direction there was to lose
At 45° the nine-point stencil hands smoothed aggregation the same wrong hierarchy at every anisotropy — six strong neighbours per interior point, 121 aggregates, the identical partition from ε = 10⁻⁴ to 0.099. The convergence factor that one hierarchy produces runs from 0.802 to 0.581 over the same range.
The switch does not know which side is better
The strength threshold moves the coarsening from full to semi at θ = ε exactly, at every anisotropy. Which of the two converges faster is a separate question with a separate answer, and it changes sign between ε = 0.33 and ε = 0.34 — where nothing whatever happens to the switch.
Named alongside it
The objects these essays reach for when they reach for this one.
AnisotropyStrength of connectionAlgebraic multigridCoarse fine splittingConvergence rateGalerkin coarse operatorM-matrixOperator complexityProlongationRotated anisotropyDiscretisationGrid alignment