Dense and Sparse - MIT
web.mit.edu › 18 › www\dense" matrix A and then converting it to a sparse data structure.) We’ve actually seen this several times in graph/network-based problems, where we often get matrices of the form: A= GT DG where D is diagonal (very sparse!) and G is the incidence matrix. Since each graph node is typically only connected to a few other nodes, G is sparse and ...