Multigrid Poisson Solver for Complex Geometries Using Finite Difference Method
Deepak Gautam, Bhooshan Paradkar

TL;DR
This paper introduces a transformation optics-inspired finite difference multigrid method for efficiently solving the Poisson equation in complex geometries by mapping them to uniform computational domains.
Contribution
It presents a novel approach combining coordinate transformations with finite difference methods to handle arbitrary shapes efficiently.
Findings
Achieves second-order accuracy in complex geometries.
Enables integration of fast multigrid solvers on uniform grids.
Flexible boundary transformation for various geometric configurations.
Abstract
We present an efficient numerical method, inspired by transformation optics, for solving the Poisson equation in complex and arbitrarily shaped geometries. The approach operates by mapping the physical domain to a uniform computational domain through coordinate transformations, which can be applied either to the entire domain or selectively to specific boundaries inside the domain. This flexibility allows both homogeneous (Laplace equation) and inhomogeneous (Poisson equation) problems to be solved efficiently using iterative or fast direct solvers, with only the material parameters and source terms modified according to the transformation. The method is formulated within a finite difference framework, where the modified material properties are computed from the coordinate transformation equations, either analytically or numerically. This enables accurate treatment of arbitrary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Methods in Computational Mathematics · Electromagnetic Scattering and Analysis · Matrix Theory and Algorithms
