Analysis of first order systems for the solution of Laplace's equation

From MaRDI portal
Revision as of 07:49, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6250710

arXiv1404.3420MaRDI QIDQ6250710FDOQ6250710

Vance Faber

Publication date: 13 April 2014

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.












This page was built for publication: Analysis of first order systems for the solution of Laplace's equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6250710)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6250710&oldid=35786094"
Powered by MediaWiki