= 4 Level Sparse Matrix Set 1 Set 2 Set 3 • Total Number of Non-zero Entries is O(N)

Optimization: Number of Levels • Increase Levels: More Sparsity • Increase Levels: Larger Size of the Matrix Dry Run: Pre-Estimation of Number of Levels • Re-Order The Unknowns Based on Geometry • Dry-Run Cost is a Function of Fillin-Factor (w)