2016
Sparsified Cholesky and multigrid solvers for connection laplacians
Kyng R, Lee Y, Peng R, Sachdeva S, Spielman D. Sparsified Cholesky and multigrid solvers for connection laplacians. 2016, 842-850. DOI: 10.1145/2897518.2897640.Peer-Reviewed Original ResearchSystem of equationsConnection LaplacianNonzero matrix entriesApproximate inverseLinear time algorithmMultigrid algorithmMultigrid solverLinear equationsLaplacian matrixGaussian eliminationGraph LaplacianMatrix entriesLU factorizationNonzero entriesStrong approximationOriginal matrixLinear numberEquationsLaplacianLinear timeTime algorithmNew algorithmAlgorithmCholeskyFactorization
1996
Expander codes
Sipser M, Spielman D. Expander codes. IEEE Transactions On Information Theory 1996, 42: 1710-1722. DOI: 10.1109/18.556667.Peer-Reviewed Original Research
1994
Expander codes
Sipser M, Spielman D. Expander codes. 1994, 566-576. DOI: 10.1109/sfcs.1994.365734.Peer-Reviewed Original Research