Computing Logarithmic Capacity with Linear Programming

DOI10.1080/10586458.1997.10504611zbMath0951.65028OpenAlexW1983341224MaRDI QIDQ4376778

Jérémie Rostand

Publication date: 2 January 2001

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1047920422

zbMATH Keywords

linear programmingGreen's functionlogarithmic capacityleast squares techniqueuniform harmonic approximationerrror bound

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Potentials and capacity, harmonic measure, extremal length and related notions in two dimensions (31A15)

Related Items (9)

A relation between the logarithmic capacity and the condition number of the BEM‐matrices ⋮ Computation of analytic capacity and applications to the subadditivity problem ⋮ Computation of logarithmic capacity ⋮ Fast and accurate computation of the logarithmic capacity of compact sets ⋮ Computing the logarithmic capacity of compact sets having (infinitely) many components with the charge simulation method ⋮ Pluripotential numerics ⋮ Computation of capacity via quadratic programming ⋮ SERIES SOLUTION OF LAPLACE PROBLEMS ⋮ Computation of capacity

Uses Software

• LAPACK

Cites Work

• Isoperimetric Inequalities in Mathematical Physics. (AM-27)
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing Logarithmic Capacity with Linear Programming