Advertisement
Published in:
2003 | OriginalPaper | Chapter
Fast Relative Approximation of Potential Fields
Author : Martin Ziegler
Published in: Algorithms and Data Structures
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Multi-evaluation of the Coulomb potential induced by N particles is a central part of N-body simulations. In 3D, known subquadratic time algorithms return approximations up to given absolute precision. By combining data structures from Computational Geometry with fast polynomial arithmetic, the present work obtains approximations of prescribable relative error ε> 0 in time $\mathcal{O}(\frac{1}{\epsilon}N \cdot {\rm polylog}N)$.