Compressed sparse storage
= Compressed sparse storage
<Compressed sparse storage> keeps a <sparse matrix> as numerical nonzero values, their row or column indices, and pointers to the start of each compressed column or row. It avoids allocating all $N^2$ entries. A sparse direct solver must additionally allocate possible <fill-in> predicted by <symbolic factorization>, because elimination can create entries absent from the input.