Pages that link to "Item:Q5495863"

The following pages link to A simple, combinatorial algorithm for solving SDD systems in nearly-linear time (Q5495863):

Displaying 33 items.

• A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system (Q262960) (← links)
• Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
• iSIRA: integrated shift-invert residual Arnoldi method for graph Laplacian matrices from big data (Q1624673) (← links)
• Duality and nonlinear graph Laplacians (Q1694674) (← links)
• Engineering a combinatorial Laplacian solver: lessons learned (Q1736844) (← links)
• Combinatorial characterization of the null spaces of symmetric H-matrices (Q1887495) (← links)
• A queueing network-based distributed Laplacian solver (Q1979459) (← links)
• Electrical flows over spanning trees (Q2097649) (← links)
• Fitting Laplacian regularized stratified Gaussian models (Q2147926) (← links)
• On a refinement-free Calderón multiplicative preconditioner for the electric field integral equation (Q2311512) (← links)
• Fitting a graph to one-dimensional data (Q2663044) (← links)
• A Simple Efficient Interior Point Method for Min-Cost Flow (Q2942676) (← links)
• Matrix-Free Convex Optimization Modeling (Q2957708) (← links)
• Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (Q4604398) (← links)
• The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods (Q4629338) (← links)
• Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391) (← links)
• A New Approach to Laplacian Solvers and Flow Problems (Q4633047) (← links)
• Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank (Q4985799) (← links)
• Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method (Q4993286) (← links)
• Graph Clustering using Effective Resistance (Q4993308) (← links)
• Probabilistic logarithmic-space algorithms for Laplacian solvers (Q5002644) (← links)
• Amortized Analysis of Asynchronous Price Dynamics (Q5009575) (← links)
• RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems (Q5021403) (← links)
• Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
• Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space (Q5096446) (← links)
• A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians (Q5161767) (← links)
• Local Flow Partitioning for Faster Edge Connectivity (Q5210551) (← links)
• Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems (Q5270418) (← links)
• Multi-way spectral partitioning and higher-order cheeger inequalities (Q5415539) (← links)
• Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis (Q5874469) (← links)
• A combinatorial cut-toggling algorithm for solving Laplacian linear systems (Q6066766) (← links)
• Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
• A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation (Q6592907) (← links)