Lx = b
From MaRDI portal
Recommendations
- Efficient algorithms for solving the p-Laplacian in polynomial time
- Algorithms, graph theory, and the solution of Laplacian linear equations
- A new approach to Laplacian solvers and flow problems
- Algorithms, graph theory, and linear equations in Laplacian matrices
- A numerical algorithm for finding solutions of p-Laplacian Dirichlet problems
- scientific article; zbMATH DE number 3954213
- On \(l_ p\)-approximate solutions of linear equations
- The matrix and polynomial approaches to Lanczos-type algorithms
- scientific article; zbMATH DE number 1471006
- Lanczos-type algorithms for solving systems of linear equations
Cited in
(41)- Duality and nonlinear graph Laplacians
- Engineering a combinatorial Laplacian solver: lessons learned
- A queueing network-based distributed Laplacian solver
- Fitting Laplacian regularized stratified Gaussian models
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence
- A queueing network-based distributed Laplacian solver for directed graphs
- Polynomial-time algorithms for submodular Laplacian systems
- A linear work, \(O(n^{1/6})\) time, parallel algorithm for solving planar Laplacians
- Matrix-free convex optimization modeling
- Algorithms, graph theory, and linear equations in Laplacian matrices
- Algorithms, graph theory, and the solution of Laplacian linear equations
- The Laplacian paradigm: emerging algorithms for massive graphs
- Randomized algorithms in numerical linear algebra
- A new approach to Laplacian solvers and flow problems
- Active-set Methods for Submodular Minimization Problems
- Solving local linear systems with boundary conditions using heat kernel pagerank
- scientific article; zbMATH DE number 7370577 (Why is no real title available?)
- Probabilistic logarithmic-space algorithms for Laplacian solvers
- Persistent Laplacians: properties, algorithms and implications
- On solving linear systems in sublinear time
- Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
- Hardness results for structured linear systems
- Determinant-preserving sparsification of SDDM matrices
- An empirical comparison of graph Laplacian solvers
- Synchronization of Kuramoto oscillators: inverse Taylor expansions
- Global registration of multiple point clouds using semidefinite programming
- Sparsified Cholesky and multigrid solvers for connection Laplacians
- Solving 1-Laplacians in nearly linear time: collapsing and expanding a topological ball
- The unique games conjecture, integrality gap for cut problems and embeddability of negative-type metrics into _1
- Diffuse scattering on graphs
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
- Hodge decomposition and general Laplacian solvers for embedded simplicial complexes
- Stochastic mirror descent for convex optimization with consensus constraints
- Sandpile groups of Cayley graphs of 𝔽 r 2
- Interior point methods in the year 2025
- Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
- Random multitype spanning forests for synchronization on sparse graphs
- A regularized interior point method for sparse optimal transport on graphs
- Online algorithms for spectral hypergraph sparsification
- Online algorithms for spectral hypergraph sparsification
- Quantum computing inspired iterative refinement for semidefinite optimization
This page was built for publication: Lx = b
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396760)
