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