Problemcore
Sparse linear systems
Solving systems of linear equations whose coefficient matrices have mostly zero entries, using methods that exploit sparsity to save time and memory.
Solving systems of linear equations whose coefficient matrices have mostly zero entries, using methods that exploit sparsity to save time and memory.
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 J015T6 Edit this page History Report an error