Low-rank approximation to the Graph Laplacian matrix of a regular grid.

751 Views Asked by At

As mentioned in the title, does anybody know any methods of efficient low-rank approximation $LL^T$ to the Graph Laplacian matrix $A$ corresponding to a square lattice? (except PCA)