Analysis of first order systems for the solution of Laplace's equation
Combinatorics
2014-04-15 v1
Abstract
Kelner, Orecchia, Sidford, and Zhu have given a randomized iterative method for approximating the solution to the discrete Laplace equation that has expected running time nearly linear in the size of the problem. The goal of this note is to explain this algorithm in the language of difference operators on graphs.
Keywords
Cite
@article{arxiv.1404.3420,
title = {Analysis of first order systems for the solution of Laplace's equation},
author = {Vance Faber},
journal= {arXiv preprint arXiv:1404.3420},
year = {2014}
}
Comments
10 pages