Open Access
Translator Disclaimer
1997 Computing logarithmic capacity with linear programming
Jérémie Rostand
Experiment. Math. 6(3): 221-238 (1997).

Abstract

We construct an algorithm for estimating the capacity of nice compact subsets of the plane. Our method is based on a relation between capacity and Green's function together with a uniform harmonic approximation theorem. We use the simple least-square technique and, what is most important, we can obtain a bound on the error made in the estimated capacity.

Citation

Download Citation

Jérémie Rostand. "Computing logarithmic capacity with linear programming." Experiment. Math. 6 (3) 221 - 238, 1997.

Information

Published: 1997
First available in Project Euclid: 17 March 2003

zbMATH: 0951.65028
MathSciNet: MR1481591

Subjects:
Primary: 65E05
Secondary: 90C05

Rights: Copyright © 1997 A K Peters, Ltd.

JOURNAL ARTICLE
18 PAGES


SHARE
Vol.6 • No. 3 • 1997
Back to Top