The complexity of N-body simulation

DOI10.1007/3-540-56939-1_70MaRDI QIDQ4630258zbMATH OpenOpenAlexFDO

Authors Stephen R. Tate, J. Reif

Publication date 29 March 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56939-1_70

zbMATH Keywords

\(n\)-body simulationpotential fieldreachability problemtarget time

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) (n)-body problems (70F10)

Recommendations

• Computational Structure of the N-Body Problem
• scientific article; zbMATH DE number 1057776
• N-body simulations
• scientific article; zbMATH DE number 4057090
• \(N\)-body simulations of massively parallel architectures
• Direct \(N\)-body simulations
• scientific article; zbMATH DE number 663846
• Publication:4860177
• The computational complexity of the initial value problem for the three body problem
• The Event-Driven Approach toN-Body Simulation

Cites work

• Conservative logic
• scientific article; zbMATH DE number 4080996 (Why is no real title available?)
• scientific article; zbMATH DE number 41859 (Why is no real title available?)
• scientific article; zbMATH DE number 42384 (Why is no real title available?)
• Multipole-accelerated capacitance extraction algorithms for 3-D structures with multiple dielectrics
• Relationships between nondeterministic and deterministic tape complexities
• Unpredictability and undecidability in dynamical systems

Cited in

(7)

• Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
• The computational complexity of the initial value problem for the three body problem
• Three-dimensional simulation in N-body problem
• scientific article; zbMATH DE number 663846 (Why is no real title available?)
• scientific article; zbMATH DE number 1500640 (Why is no real title available?)
• Average-case polynomial-time computability of Hamiltonian dynamics
• Can Newtonian systems, bounded in space, time, mass and energy compute all functions?

Describes a project that uses

Uses Software

• Fastcap

This page was built for publication: The complexity of N-body simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630258)