Computing the logarithmic capacity of compact sets having (infinitely) many components with the charge simulation method

DOI10.1007/S11075-022-01428-2arXiv2201.10228OpenAlexW4322487060MaRDI QIDQ6157445FDOQ6157445

Authors: Jörg Liesen, M. M. S. Nasser, Olivier Sète 

Publication date: 11 May 2023

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: 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, S`ete, Nasser, 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.

Full work available at URL: https://arxiv.org/abs/2201.10228

zbMATH Keywords

Cantor setfast multipole methodGMRES methodlogarithmic capacitycharge simulation methodCantor dust

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Iterative numerical methods for linear systems (65F10) Numerical analysis (65-XX) Capacity and harmonic measure in the complex plane (30C85) Potentials and capacity, harmonic measure, extremal length and related notions in two dimensions (31A15)

Cites Work

• A fast algorithm for particle simulations
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Methods of conjugate gradients for solving linear systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solution of Sparse Indefinite Systems of Linear Equations
• On conformal maps from multiply connected domains onto lemniscatic domains
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• On the Conformal Mapping of Multiply Connected Regions
• Krylov subspace methods. Principles and analysis.
• A Charge Simulation Method for Numerical Conformal Mapping onto Circular and Radial Slit Domains
• Computing Logarithmic Capacity with Linear Programming
• Computation of logarithmic capacity
• Unique solvability of the linear system appearing in the invariant scheme of the charge simulation method
• A circular and radial slit mapping of unbounded multiply connected domains
• Cantor polynomials and some related classes of OPRL
• Computation of capacity
• Visual complex functions. An introduction with phase portraits
• Numerical computation of the conformal map onto lemniscatic domains
• Laplace's equation and the Dirichlet-Neumann map: a new mode for Mikhlin's method
• Computing matrix-vector products with centrosymmetric and centro-Hermitian matrices
• Fast and accurate computation of the logarithmic capacity of compact sets
• A method of numerical conformal mapping of curved slit domains by the charge simulation method.
• A method of fundamental solutions in poroelasticity to model the stress field in geothermal reservoirs
• Capacity Estimates for Planar Cantor-Like Sets

Cited In (1)

• Eigenvalue clustering, control energy, and logarithmic capacity

This page was built for publication: Computing the logarithmic capacity of compact sets having (infinitely) many components with the charge simulation method

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