Cristina I. Draghicescu. Efficient Algorithms for Particle Methods. PhD thesis, The Pennsylvania State University, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Parallel Fast Multipole Method In Molecular Dynamics - Singer (1995) (4 citations) (Correct)
.... method was also independently described by van Dommelen and Rundensteiner [62] The principal disadvantage of the Fast Multipole Method, its restriction to harmonic functions, can be overcome by an expansion in Taylor polynomials instead of spherical harmonics, as is described by Draghicescu [18, 19, 20]. Anderson [4] manages to implement the Fast Multipole Method without using multipoles. Soon after Greengard s dissertation was published, implementations of the three dimensional version of the Fast Multipole Method started to appear, nearly all of which were concerned with the application of the ....
....components 0 i k 2 L ; 1 k n we have a non overlapping domain decomposition C = L [ l=0 I l;I : Remark 2.1. 1 Using the shift operators S k instead of S for the domain decompositions one can also construct non overlapping domain decompositions useful for Fast Summation Algorithms (cf.[18, 19, 20]) 2.2 Function Spaces To obviate predicaments, it is deemed opportune to restrict considerations in this section to radial symmetric functions on the punctured ball B r of radius r, but generalizations to more comprehensive cases are quite unequivocal. We also do not distinguish between f(x) ....
Cristina I. Draghicescu. Efficient Algorithms for Particle Methods. PhD thesis, The Pennsylvania State University, 1991.
Parallel Molecular Dy... - Ar Dy (Correct)
....algorithm for evaluating the Coulombic forces has been considered by Greengard and Rokhlin [9] using multipole expansions. A related algorithm for computing simultaneously the Coulombic and short range forces (e.g. Lennard Jones potentials) has been introduced by Draghicescu in her thesis [8]. Both of these techniques (as well as techniques that involve solving a Laplace equation for the electrostatic potential [7] yield a close approximation to the actual interaction among all particles. At the moment, techniques of this type are not in wide spread use in existing molecular ....
C. I. Draghicescu, Efficient Algorithms for Particle Methods, Ph. D. Thesis, Pennsylvania State University, 1991.
The Parallel Fast Multipole Method in Three Dimensions - Singer (1995) (Correct)
.... method was also independently described by van Dommelen and Rundensteiner [vDR89] The principal disadvantage of the Fast Multipole Method, its restriction to harmonic functions, can be overcome by an expansion in Taylor polynomials instead of spherical harmonics, as is described by Draghicescu [Dra91, Dra94, DD95] Anderson [And92] manages to implement the Fast Multipole Method without using multipoles. Soon after Greengard s dissertation was published, implementations of the threedimensional version of the Fast Multipole Method started to appear, nearly all of which were concerned with the ....
Cristina I. Draghicescu. Efficient Algorithms for Particle Methods. PhD thesis, The Pennsylvania State University, 1991.
Parallel Implementation of the Fast Multipole Method with.. - Singer (1995) (1 citation) (Correct)
.... method was also independently described by van Dommelen and Rundensteiner [vDR89] The principal disadvantage of the Fast Multipole Method, its restriction to harmonic functions, can be overcome by an expansion in Taylor polynomials instead of spherical harmonics, as is described by Draghicescu [Dra91, Dra94, DD95] Anderson [And92] manages to implement the Fast Multipole Method without using multipoles. Soon after Greengard s dissertation was published, implementations of the three dimensional version of the Fast Multipole Method started to appear, nearly all of which were concerned with the ....
Cristina I. Draghicescu. Efficient Algorithms for Particle Methods. PhD thesis, The Pennsylvania State University, 1991.
Parallelization Strategies for a Molecular Dynamics.. - Clark, Hanxleden.. (1992) (11 citations) (Correct)
....algorithm for evaluating the Coulombic forces has been considered by Greengard and Rokhlin [12] using multipole expansions. A related algorithm for computing simultaneously the Coulombic and short range forces (e.g. Lennard Jones potentials) has been introduced by Draghicescu in her thesis [8]. Both of these techniques, as well as techniques that involve solving a Laplace equation for the electrostatic potential [7] yield a close approximation to the actual interaction among all particles. However, techniques of this type are not widely used yet in existing molecular dynamics codes. A ....
C. I. Draghicescu. Efficient Algorithms for Particle Methods. PhD thesis, Dept. of Computer Science, The Pennsylvania State University, 1991.
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