Duality and nonlinear graph Laplacians

DOI10.1016/j.tcs.2017.12.034zbMath1387.05148arXiv1507.07789OpenAlexW2963248431MaRDI QIDQ1694674

Eric J. Friedman, Adam S. Landsberg

Publication date: 6 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.07789

zbMATH Keywords

nonlinear equationsspectral analysisgraph Laplaciannonlinear duality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A randomized Kaczmarz algorithm with exponential convergence
• Efficient approximate solution of sparse linear systems
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• Lx = b
• Using petal-decompositions to build a low stretch spanning tree
• A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
• Graph Sparsification by Effective Resistances

This page was built for publication: Duality and nonlinear graph Laplacians