pith. machine review for the scientific record. sign in

arxiv: 1710.05781 · v1 · submitted 2017-10-16 · 💻 cs.CE

Recognition: unknown

A Fast Tree Algorithm for Electric Field Calculation in Electrical Discharge Simulations

Authors on Pith no claims yet
classification 💻 cs.CE
keywords algorithmtimetreecomplexityelectricelectricalerrorfast
0
0 comments X
read the original abstract

The simulation of electrical discharges has been attracting a great deal of attention. In such simulations, the electric field computation dominates the computational time. In this paper, we propose a fast tree algorithm that helps to reduce the time complexity from $O(N^2)$ (from using direct summation) to $O(N\log N)$. The implementation details are discussed and the time complexity is analyzed. A rigorous error estimation shows the error of the tree algorithm decays exponentially with the number of truncation terms and can be controlled adaptively. Numerical examples are presented to validate the accuracy and efficiency of the algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.