J. H. Reif and S. R. Tate. The complexity of Trummer's problem, zeta function evaluation, and n-body simulation. Unpublished., 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Multipole-Based Algorithms for Efficient Calculation of Forces.. - Lambert (1994) (4 citations) (Correct)
....This has been recently been done in 3D [5] where the O(p 4 ) cost of the multipole to local conversion of O(p 2 ) sized coefficient matrices is reduced to an O(p 2 log p) operation via FFT techniques. Similarly, in 2D, this cost can be reduced from O(p 2 ) to O(p log p) See also [13, 15]. The cost of computing the table of expansions, M i for i = 0 : k Gamma 2 is proportional to np kp log p as it takes np steps to compute the initial multipole expansion, M 0 , and 9p log p steps each time 9 multipole expansions are shifted and added to create successive entries M 1 : ....
J. H. Reif and S. R. Tate. The complexity of Trummer's problem, zeta function evaluation, and n-body simulation. Unpublished., 1992.
Prototyping Parallel Algorithms - Nyland, Prins (1992) (1 citation) (Correct)
....This problem would have been very hard to find indeed in a low level implementation, and its solution even harder to include in such an implementation. Another way in which we wish to use Proteus is to experiment with modifications of the fast multipole algorithm. In a recent theoretical paper [RT92], there are modifications to the algorithm which give it better performance, however it is more complex. An effort to analyze the performance gains of such an algorithm would be difficult, and it would also be difficult to modify existing FMA parallel programs. It is our goal to be able to ....
John H. Reif and Stephen R. Tate. The Complexity of Trummer's Problem, Zeta Function Evaluation, and N-body Simulation. Technical Report, Department of Computer Science, Duke University. 1992.
Multipole-Based Algorithms for Efficient Calculation of Forces.. - Lambert (1994) (4 citations) (Correct)
....This has been recently been done in 3D [5] where the O(p 4 ) cost of the multipole to local conversion of O(p 2 ) sized coe#cient matrices is reduced to an O(p 2 log p) operation via FFT techniques. Similarly, in 2D, this cost can be reduced from O(p 2 ) to O(p log p) See also [13, 15]. The cost of computing the table of expansions, M i for i = 0 . k 2 is proportional to np kp log p as it takes np steps to compute the initial multipole expansion, M 0 , and 9p log p steps each time 9 multipole expansions are shifted and added to create successive entries M 1 . M ....
J. H. Reif and S. R. Tate. The complexity of Trummer's problem, zeta function evaluation, and n-body simulation. Unpublished., 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC