THE ORDER OF APPEL ALGORITHM

被引：22

作者：

ESSELINK, K

机构：

[1] Koninklijke / Shell-Laboratorium, Amsterdam (Shell Research B.V.), 1031 CM Amsterdam

来源：

INFORMATION PROCESSING LETTERS | 1992年 / 41卷 / 03期

关键词：

ANALYSIS OF ALGORITHMS; COMPUTATIONAL COMPLEXITY;

D O I：

10.1016/0020-0190(92)90043-U

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In 1985 Andrew Appel published an algorithm for the simulation of N particles interacting in a gravitational force field. This replaced the original O(N2) algorithm and was believed to be O(N log N). We show that the order of Appel's algorithm is in fact N.

引用

页码：141 / 147

页数：7

共 6 条

[1] AN EFFICIENT PROGRAM FOR MANY-BODY SIMULATION [J].

APPEL, AW .

SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1985, 6 (01) :85-103

[2] A HIERARCHICAL O(N-LOG-N) FORCE-CALCULATION ALGORITHM [J].

BARNES, J ;

HUT, P .

NATURE, 1986, 324 (6096) :446-449

[3] A FAST ALGORITHM FOR PARTICLE SIMULATIONS [J].

GREENGARD, L ;

ROKHLIN, V .

JOURNAL OF COMPUTATIONAL PHYSICS, 1987, 73 (02) :325-348

[4] COMPUTATIONAL STRUCTURE OF THE N-BODY PROBLEM [J].

KATZENELSON, J .

SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1989, 10 (04) :787-815

[5]

SIMON T, 1990, THESIS MIT CAMBRIDGE

[6]

ZHAO F, 1987, MIT995 ART INT LAB T

← 1 →