• Corpus ID: 246276213

Computing the logarithmic capacity of compact sets having (infinitely) many components with the Charge Simulation Method

@article{Liesen2022ComputingTL,
  title={Computing the logarithmic capacity of compact sets having (infinitely) many components with the Charge Simulation Method},
  author={J{\"o}rg Liesen and Mohamed M. S. Nasser and Olivier S{\`e}te},
  journal={ArXiv},
  year={2022},
  volume={abs/2201.10228}
}
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 [14]), while maintaining a very high level of accuracy. We study properties of the linear algebraic… 

References

SHOWING 1-10 OF 33 REFERENCES
Fast and Accurate Computation of the Logarithmic Capacity of Compact Sets
We present a numerical method for computing the logarithmic capacity of compact subsets of $$\mathbb {C}$$C, which are bounded by Jordan curves and have finitely connected complement. The subsets may
Unique solvability of the linear system appearing in the invariant scheme of the charge simulation method
We show that the linear system appearing in the invariant scheme of the charge simulation method is uniquely solvable when the scheme is applied to a two-dimensional Dirichlet problem for a disk, for
A Charge Simulation Method for Numerical Conformal Mapping onto Circular and Radial Slit Domains
  • K. Amano
  • Mathematics
    SIAM J. Sci. Comput.
  • 1998
TLDR
A simple numerical method based on the charge simulation method or the method of fundamental solutions applied to the Dirichlet problem of Laplace's equation in which a pair of conjugate harmonic functions are approximated by a linear combination of complex logarithmic potentials.
Log-lightning computation of capacity and Green's function
TLDR
This is the first systematic exploration of applications of the log-lightning method, which opens up the possibility of solving Laplace problems with an efficiency not achievable by previous methods.
Numerical approximation of the logarithmic capacity
TLDR
A new algorithm is presented that numerically approximates the logarithmic capacity for more involved sets in R 2 based on the solution of a Dirichlet problem with the help of boundary integral equations.
The Lanczos and conjugate gradient algorithms in finite precision arithmetic
TLDR
A tribute is paid to those who have made an understanding of the Lanczos and conjugate gradient algorithms possible through their pioneering work, and to review recent solutions of several open problems that have also contributed to knowledge of the subject.
Numerical Computation of the Conformal Map onto Lemniscatic Domains
TLDR
A numerical method for the computation of the conformal map from unbounded multiply-connected domains onto lemniscatic domains, which works for domains with close-to-touching boundaries, non-convex boundaries, piecewise smooth boundaries, and for domains of high connectivity.
Capacity Estimates for Planar Cantor-Like Sets
  • C. D. Minda
  • Mathematics
    Canadian Journal of Mathematics
  • 1974
Upper and lower bounds for the capacity of planar Cantor-like sets are presented. Chebichev polynomials are the principal tool employed in the derivation of these estimates. A necessary and
...
...