Conformal Mapping for the Efficient Solution of Poisson Problems with the Kansa-RBF Method
Ημερομηνία
2017Source
Journal of Scientific ComputingVolume
71Issue
3Pages
1035-1061Google Scholar check
Keyword(s):
Metadata
Εμφάνιση πλήρους εγγραφήςΕπιτομή
We consider the solution of Poisson Dirichlet problems in simply-connected irregular domains. These domains are conformally mapped onto the unit disk and the resulting Poisson Dirichlet problems are solved efficiently using a Kansa-radial basis function (RBF) method with a matrix decomposition algorithm (MDA). In a similar way, we treat Poisson Dirichlet and Poisson Dirichlet–Neumann problems in doubly-connected domains. These domains are mapped onto annular domains by a conformal mapping and the resulting Poisson Dirichlet and Poisson Dirichlet–Neumann problems are solved efficiently using a Kansa-RBF MDA. Several examples demonstrating the applicability of the proposed technique are presented. © 2016, Springer Science+Business Media New York.