Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-13T09:58:17.539Z Has data issue: false hasContentIssue false

A Novel Efficient Numerical Solution of Poisson's Equation for Arbitrary Shapes in Two Dimensions

Published online by Cambridge University Press:  02 November 2016

Zu-Hui Ma*
Affiliation:
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong
Weng Cho Chew*
Affiliation:
Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL 61801 USA
Li Jun Jiang*
Affiliation:
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong
*
*Corresponding author. Email addresses:zuhuima@gmail.com (Z.-H. Ma), w-chew@uiuc.edu (W. C. Chew), jianglj@hku.hk (L. J. Jiang)
*Corresponding author. Email addresses:zuhuima@gmail.com (Z.-H. Ma), w-chew@uiuc.edu (W. C. Chew), jianglj@hku.hk (L. J. Jiang)
*Corresponding author. Email addresses:zuhuima@gmail.com (Z.-H. Ma), w-chew@uiuc.edu (W. C. Chew), jianglj@hku.hk (L. J. Jiang)

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Even though there are various fast methods and preconditioning techniques available for the simulation of Poisson problems, little work has been done for solving Poisson's equation by using the Helmholtz decomposition scheme. To bridge this issue, we propose a novel efficient algorithm to solve Poisson's equation in irregular two dimensional domains for electrostatics through a quasi-Helmholtz decomposition technique—the loop-tree basis decomposition. It can handle Dirichlet, Neumann or mixed boundary problems in which the filling media can be homogeneous or inhomogeneous. A novel point of this method is to first find the electric flux efficiently by applying the loop-tree basis functions. Subsequently, the potential is obtained by finding the inverse of the gradient operator. Furthermore, treatments for both Dirichlet and Neumann boundary conditions are addressed. Finally, the validation and efficiency are illustrated by several numerical examples. Through these simulations, it is observed that the computational complexity of our proposed method almost scales as , where N is the triangle patch number of meshes. Consequently, this new algorithm is a feasible fast Poisson solver.

Information

Type
Research Article
Copyright
Copyright © Global-Science Press 2016