• Media type: E-Article
  • Title: Computing the logarithmic capacity of compact sets having (infinitely) many components with the charge simulation method
  • Contributor: Liesen, Jörg; Nasser, Mohamed M. S.; Sète, Olivier
  • imprint: Springer Science and Business Media LLC, 2023
  • Published in: Numerical Algorithms
  • Language: English
  • DOI: 10.1007/s11075-022-01428-2
  • ISSN: 1017-1398; 1572-9265
  • Keywords: Applied Mathematics
  • Origination:
  • Footnote:
  • Description: <jats:title>Abstract</jats:title><jats:p>We apply the charge simulation method (CSM) in order to compute the logarithmic capacity of compact sets consisting of (infinitely) many “small” components. This application allows to use just a single charge point for each component. The resulting method therefore is significantly more efficient than methods based on discretizations of the boundaries (for example, our own method presented in Liesen et al. (<jats:italic>Comput. Methods Funct. Theory</jats:italic><jats:bold>17</jats:bold>, 689–713, 2017)), while maintaining a very high level of accuracy. We study properties of the linear algebraic systems that arise in the CSM, and show how these systems can be solved efficiently using preconditioned iterative methods, where the matrix-vector products are computed using the fast multipole method. We illustrate the use of the method on generalized Cantor sets and the Cantor dust.</jats:p>