Solving local linear systems with boundary conditions using heat kernel pagerank
From MaRDI portal
Recommendations
Cites work
- A linear work, \(O(n^{1/6})\) time, parallel algorithm for solving planar Laplacians
- A Nearly-m log n Time Solver for SDD Linear Systems
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
- A sublinear time algorithm for PageRank computations
- Algorithms, graph theory, and linear equations in Laplacian matrices
- An efficient parallel solver for SDD linear systems
- Approaching optimality for solving SDD linear systems
- Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Lx = b
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
- On the spectra of general random graphs
- Probability and Computing
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- Strong converse for identification via quantum channels
- User-friendly tail bounds for sums of random matrices
Cited in
(4)
This page was built for publication: Solving local linear systems with boundary conditions using heat kernel pagerank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985799)