Algorithmresearch
Structured Gaussian elimination
Also called structured elimination.
Eliminates sparse columns and rows first to shrink a large sparse system before dense solving, used in integer factorization.
Eliminates sparse columns and rows first to shrink a large sparse system before dense solving, used in integer factorization.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag FPBFNE Edit this page History Report an error