Pages that link to "Item:Q2936576"

The following pages link to Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems (Q2936576):

Displayed 50 items.

• A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system (Q262960) ‎ (← links)
• Self-corrective iterations (SCI) for generalized diagonally dominant matrices (Q268346) ‎ (← links)
• Cover times, blanket times, and majorizing measures (Q431644) ‎ (← links)
• Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) ‎ (← links)
• Spectral concentration and greedy \(k\)-clustering (Q1624584) ‎ (← links)
• iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data (Q1624673) ‎ (← links)
• The resistance perturbation distance: a metric for the analysis of dynamic networks (Q1693161) ‎ (← links)
• Band-restricted diagonally dominant matrices: computational complexity and application (Q1713483) ‎ (← links)
• A spectral approach to the shortest path problem (Q2020688) ‎ (← links)
• On fast computation of directed graph Laplacian pseudo-inverse (Q2029845) ‎ (← links)
• Polynomial-time algorithms for submodular Laplacian systems (Q2235770) ‎ (← links)
• A filter in constructing the preconditioner for solving linear equation systems of radiation diffusion problems (Q2242642) ‎ (← links)
• On graph parameters guaranteeing fast sandpile diffusion (Q2260617) ‎ (← links)
• Toward a spectral theory of cellular sheaves (Q2304007) ‎ (← links)
• On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices (Q2310401) ‎ (← links)
• On the de-randomization of space-bounded approximate counting problems (Q2348703) ‎ (← links)
• Resistance distances in Cayley graphs on symmetric groups (Q2357139) ‎ (← links)
• Fitting a graph to one-dimensional data (Q2663044) ‎ (← links)
• A generalized Cheeger inequality (Q2693705) ‎ (← links)
• Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) ‎ (← links)
• Graphs, Vectors, and Matrices (Q3178747) ‎ (← links)
• Near-Optimal Distributed Maximum Flow (Q4561245) ‎ (← links)
• Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (Q4604398) ‎ (← links)
• A New Approach to Laplacian Solvers and Flow Problems (Q4633047) ‎ (← links)
• An Adaptive Fast Solver for a General Class of Positive Definite Matrices Via Energy Decomposition (Q4643812) ‎ (← links)
• A Class of Symmetric Factored Approximate Inverses and Hybrid Two-Level Solver (Q4962546) ‎ (← links)
• A first hitting time approach to finding effective spreaders in a network (Q4965258) ‎ (← links)
• Ranking and Sparsifying a Connection Graph (Q4985350) ‎ (← links)
• Graph Clustering using Effective Resistance (Q4993308) ‎ (← links)
• (Q5002644) ‎ (← links)
• RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems (Q5021403) ‎ (← links)
• (Q5053269) ‎ (← links)
• A tractable latent variable model for nonlinear dimensionality reduction (Q5073081) ‎ (← links)
• Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) ‎ (← links)
• (Q5090445) ‎ (← links)
• (Q5111734) ‎ (← links)
• Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory (Q5112239) ‎ (← links)
• Hardness Results for Structured Linear Systems (Q5117379) ‎ (← links)
• Determinant-Preserving Sparsification of SDDM Matrices (Q5117381) ‎ (← links)
• (Q5214254) ‎ (← links)
• Coordinate Difference Matrices (Q5222098) ‎ (← links)
• Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations (Q5228057) ‎ (← links)
• Synchronization of Kuramoto Oscillators: Inverse Taylor Expansions (Q5238242) ‎ (← links)
• (Q5857607) ‎ (← links)
• (Q5875459) ‎ (← links)
• Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) ‎ (← links)
• Space Hardness of Solving Structured Linear Systems. (Q6065465) ‎ (← links)
• Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition (Q6069849) ‎ (← links)
• Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) ‎ (← links)
• Tropical Feynman integration in the Minkowski regime (Q6074933) ‎ (← links)