A Novel Efficient Numerical Solution Of Poisson's Equation For Arbitrary Shapes In Two Dimensions


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.


Electrical and Computer Engineering

Keywords and Phrases

electrostatics; Fast Poisson solver; loop-tree decomposition

International Standard Serial Number (ISSN)

1991-7120; 1815-2406

Document Type

Article - Journal

Document Version


File Type





© 2024 Cambridge University Press, All rights reserved.

Publication Date

01 Nov 2016