PlumX Metrics
Embed PlumX Metrics

Fast algorithm for the three-dimensional poisson equation in infinite domains

IMA Journal of Numerical Analysis, ISSN: 1464-3642, Vol: 41, Issue: 4, Page: 3024-3045
2021
  • 3
    Citations
  • 0
    Usage
  • 1
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

Article Description

This paper is concerned with a fast finite element method for the three-dimensional Poisson equation in infinite domains. Both the exterior problem and the strip-tail problem are considered. Exact Dirichlet-to-Neumann (DtN)-type artificial boundary conditions (ABCs) are derived to reduce the original infinite-domain problems to suitable truncated-domain problems. Based on the best relative Chebyshev approximation for the square-root function, a fast algorithm is developed to approximate exact ABCs. One remarkable advantage is that one need not compute the full eigensystem associated with the surface Laplacian operator on artificial boundaries. In addition, compared with the modal expansion method and the method based on Padé approximation for the square-root function, the computational cost of the DtN mapping is further reduced. An error analysis is performed and numerical examples are presented to demonstrate the efficiency of the proposed method.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know