~/talk

Nearly Linear Time Algorithms for Solving Inverse Symmetric M-Matrices

links:none on file
slides:none on file

Provides algorithms that recover and solve three hard cases—perturbed Laplacians, Laplacian pseudoinverses, and inverse symmetric M-matrices—by producing a spectral approximation and then preconditioning to solve linear systems in roughly n^2 time while making only polylogarithmic matrix‑vector multiplies. Uses a matrix‑recovery SDP framework (packing/covering solvers), iterative preconditioning with a decreasing regularization parameter, and sparse edge decompositions. Works in an oracle model (only matvecs); proofs give poly(1/γ) iteration bounds. Open: faster than n^2 and nonadaptive queries.

AI-written summary · about

  1. 0:00Intro
  2. 1:08Motivation
  3. 2:42Laplacian System Solving
  4. 6:00Beyond Laplacian Systems?
  5. 8:33Directed Graphs and Asymmetric Systems
  6. 10:38Perturbed Laplacians
  7. 14:02Laplacian Pseudoinverse
  8. 16:52Inverse M-Matrices
  9. 19:24Hold up!
  10. 20:12Our Results
  11. 23:47Rest of Talk
  12. 26:47How to Solve?
  13. 28:55Picture
  14. 30:52Idea #1 - Linear Sketch
  15. 36:04Idea #2 - Optimize
  16. 37:27General Problem
  17. 45:04Pseudoinverse Problem
  18. 46:50Inverse Symmetric M-Matrices
  19. 47:39Open Problems
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.