Skip to main content
SpringerLink
Log in

Fast Relative Approximation of Potential Fields

  • Conference paper
Algorithms and Data Structures (WADS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2748))

Included in the following conference series:

Abstract

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)\).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barnes, J., Hut, P.: A hierarchical O(N · log N) force-calculation algorithm. Nature 324, 446–449 (1986)

    Article  Google Scholar 

  2. de Berg, M., van Kreveld, M., Overmars, M., Cheong, O.: Computational Geometry. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  3. Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  4. Callahan, P.B., Kosaraju, S.R.: A Decomposition of Multidimensional Point Sets with Application to k-Nearest-Neighbors and n-Body Potential Fields. J. ACM 42, 67–90 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cheng, H., Greengard, L., Rokhlin, V.: A Fast Adaptive Multipole Algorithm in Three Dimensions. Journal of Computational Physics 155, 468–498 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gerasoulis, A.: A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors. Mathematics of Computation 50(181), 179–188 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pan, V., Reif, J.H., Tate, S.R.: The Power of Combining the Techniques of Algebraic and Numerical Computing: Improved Approximate Multipoint Polynomial Evaluation and Improved Multipole Algorithms. In: Proc. 32th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1992) pp. 703–713 (1992); see also Reif, J.H., Tate, S.R.: N-body Simulation I: Fast Algorithms for Potential Field Evaluation and Trummer’s Problem, Tech. Report No. N-96-002, Univ. of North Texas Dept. of Computer Science (1996)

    Google Scholar 

  8. Rogers, C.A.: Covering a Sphere with Spheres. Mathematika 10, 157–164 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  9. Rudin, W.: Functional Analysis. McGraw-Hill, New York (1991)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Paderborn, 33095, Germany

    Martin Ziegler

Authors
  1. Martin Ziegler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carleton University, Ottawa, Canada

    Frank Dehne

  2. School of Computer Science, Carleton University, 1125 Colonel By Drive, K1S 5B6, Ottawa, Canada

    Jörg-Rüdiger Sack

  3. School of Computer Science, Carleton University, K1S 5B6, Ottawa, ON, Canada

    Michiel Smid

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In: Dehne, F., Sack, JR., Smid, M. (eds) Algorithms and Data Structures. WADS 2003. Lecture Notes in Computer Science, vol 2748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45078-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45078-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40545-0

  • Online ISBN: 978-3-540-45078-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation