Solving Graph Laplacian Systems Through Recursive Partitioning and Two-Grid Preconditioning
暂无分享,去创建一个
[1] Shang-Hua Teng,et al. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.
[2] Ludmil T. Zikatanov,et al. On two‐grid convergence estimates , 2005, Numer. Linear Algebra Appl..
[3] Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..
[4] P. Vassilevski. Multilevel Block Factorization Preconditioners: Matrix-based Analysis and Algorithms for Solving Finite Element Equations , 2008 .
[5] Jure Leskovec,et al. {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .
[6] François Pellegrini,et al. PT-Scotch: A tool for efficient parallel graph ordering , 2008, Parallel Comput..
[7] Owe Axelsson,et al. A survey of preconditioned iterative methods for linear systems of algebraic equations , 1985 .
[8] Gary L. Miller,et al. A Nearly-m log n Time Solver for SDD Linear Systems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[9] David A. Bader,et al. Benchmarking for Graph Clustering and Partitioning , 2014, Encyclopedia of Social Network Analysis and Mining.
[10] D. Rose,et al. Generalized nested dissection , 1977 .
[11] A. George. Nested Dissection of a Regular Finite Element Mesh , 1973 .
[12] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[13] Albert,et al. Emergence of scaling in random networks , 1999, Science.