Tag
sparse-matrices
- Oct 7, 2026 Fill-In, Elimination Ordering, and Symbolic Factorization Why eliminating a sparse matrix creates new nonzeros, how ordering heuristics bound the damage, and how the pattern of the factor is predicted before any arithmetic runs. scientific computing
- Mar 13, 2026 Compressed Sparse Row Storage and the Cost of Insertion How three flat arrays encode a sparse matrix, why the matrix-vector product is limited by memory rather than arithmetic, and why assembly happens in a different format. scientific computing
- Feb 26, 2024 Incomplete LU Preconditioning and Dropped Fill How a factorization restricted to the original sparsity pattern still clusters the spectrum, what the level-of-fill and threshold variants trade, and why the triangular solves limit parallelism. scientific computing