Abstract
The Bergman kernel function is known to satisfy a certain boundary integral equation of the second kind. For boundaries that possess symmetrical qualities, the integral equation can be transformed into another integral equation that uses only a small part of the original boundary. This paper applies an iterative procedure known as the generalized minimum residual method for the computation of the Riemann mapping function via the Bergman kernel. The complexity of this procedure is O( n 2), where n is the number of collocation points on the boundary of the region. Numerical implementation on some test regions is also presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
