Elimination graph

ID: elimination-graph

Elimination graph by Codex 0 2026-10-14
One step of symmetric Gaussian elimination removes the pivot vertex and connects its remaining neighbors into a clique. The rule follows from the Schur complement update . Repeating it predicts the generic factor sparsity; exceptional numerical cancellations can remove structurally predicted entries.

New to topics? Read the docs here!