Solving SDD linear systems in nearly mlog1/2n time
暂无分享,去创建一个
Jakub W. Pachocki | Gary L. Miller | Richard Peng | Michael B. Cohen | Rasmus Kyng | Anup B. Rao | Shen Chen Xu | Michael B. Cohen | G. Miller | Richard Peng | Rasmus Kyng | S. Xu | J. Pachocki
[1] Yijie Han,et al. Deterministic sorting in O(nloglogn) time and linear space , 2004, J. Algorithms.
[2] Amin Saberi,et al. Subgraph sparsification and nearly optimal ultrasparsifiers , 2009, STOC '10.
[3] 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.
[4] Shang-Hua Teng,et al. Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..
[5] Nisheeth K. Vishnoi,et al. Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator , 2011, STOC '12.
[6] Gary L. Miller,et al. Runtime guarantees for regression problems , 2011, ITCS '13.
[7] Aleksander Madry,et al. Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[8] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[9] Patrice Assouad. Plongements lipschitziens dans ${\mathbb {R}}^n$ , 1983 .
[10] Gary L. Miller,et al. Approaching Optimality for Solving SDD Linear Systems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[11] Mikkel Thorup. Floats, Integers, and Single Source Shortest Paths , 2000, J. Algorithms.
[12] Gary L. Miller,et al. Faster approximate multicommodity flow using quadratically coupled flows , 2012, STOC '12.
[13] Assaf Naor,et al. Assouad's theorem with dimension independent of the snowflaking , 2010, 1012.2307.
[14] Nikhil Srivastava,et al. Twice-ramanujan sparsifiers , 2008, STOC '09.
[15] Shang-Hua Teng,et al. Spectral sparsification of graphs: theory and algorithms , 2013, CACM.
[16] A. George,et al. Graph theory and sparse matrix computation , 1993 .
[17] Daniel A. Spielman,et al. Faster approximate lossy generalized flow via interior point algorithms , 2008, STOC.
[18] Richard Peng,et al. Algorithm Design Using Spectral Graph Theory , 2013 .
[19] Richard Peng,et al. An efficient parallel solver for SDD linear systems , 2013, STOC.
[20] Noga Alon,et al. A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..
[21] Mikkel Thorup,et al. Maintaining information in fully dynamic trees with top trees , 2003, TALG.
[22] Mark Rudelson,et al. Sampling from large matrices: An approach through geometric functional analysis , 2005, JACM.
[23] Daniel A. Spielman,et al. A Note on Preconditioning by Low-Stretch Spanning Trees , 2009, ArXiv.
[24] Shang-Hua Teng,et al. Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31) , 2003, ArXiv.
[25] Ittai Abraham,et al. Nearly Tight Low Stretch Spanning Trees , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[26] Bruce Hendrickson,et al. Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners , 2004, SIAM J. Numer. Anal..
[27] HanYijie. Deterministic sorting in O(nlog logn) time and linear space , 2004 .
[28] Nikhil Srivastava,et al. Graph sparsification by effective resistances , 2008, SIAM J. Comput..
[29] Jakub W. Pachocki,et al. Stretching Stretch , 2014, ArXiv.
[30] Numérisation de documents anciens mathématiques. Bulletin de la Société Mathématique de France , 1873 .
[31] Ittai Abraham,et al. Using petal-decompositions to build a low stretch spanning tree , 2012, STOC '12.
[32] Anastasios Zouzias,et al. A Matrix Hyperbolic Cosine Algorithm and Applications , 2011, ICALP.
[33] Jakub W. Pachocki,et al. Preconditioning in Expectation , 2014, ArXiv.
[34] Yin Tat Lee,et al. Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[35] P. Assouad. Plongements lipschitziens dans ${\bbfR}\sp n$ , 1983 .
[36] Shang-Hua Teng,et al. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.
[37] Yair Bartal,et al. Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[38] Gary L. Miller,et al. Approximate Maximum Flow on Separable Undirected Graphs , 2012, SODA.
[39] Shang-Hua Teng,et al. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.
[40] K. Clarkson. Subgradient and sampling algorithms for l1 regression , 2005, SODA '05.
[41] Zeyuan Allen Zhu,et al. A simple, combinatorial algorithm for solving SDD systems in nearly-linear time , 2013, STOC '13.
[42] M. Chial,et al. in simple , 2003 .
[43] Shang-Hua Teng,et al. Solving sparse, symmetric, diagonally-dominant linear systems in time O(m/sup 1.31/ , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[44] P. Assouad. Plongements lipschitziens dans Rn , 2003 .
[45] Kunio Tanabe,et al. Upper and lower bounds for the arithmetic-geometric-harmonic means of positive definite matrices , 1994 .
[46] Shang-Hua Teng,et al. Lower-stretch spanning trees , 2004, STOC '05.