Robert D. Skeel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Robert D. Skeel has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Axel T. Brunger
Department of Molecular and Cellular Physiology, Stanford University, Stanford, United States
1 shared publication - Daniel Okunbor1 shared publication
- David J. Hardy
University of Illinois at Urbana-Champaign, United States
1 shared publication Gang Zou
Renaissance Technologies, East Setauket, New York, USA
1 shared publicationIsmail Tezcan
Department of Computer Science and Beckman Institute, University of Illinois, 1304 West Springfield Avenue, Urbana, Illinois 61801-2987
1 shared publication- Jan Hermans
Department of Biochemistry and Biophysics, School of Medicine, University of North Carolina, Chapel Hill, North Carolina 27599-7260, USA
1 shared publication
Latest Publications
- 1 October 2003
- Published by Elsevier in Biophysical Journal
- Vol. 85 (4) , 2147-2157
Robust Biased Brownian Dynamics for Rate Constant Calculation
- 1 October 2003
- Published by Elsevier in Biophysical Journal
- Vol. 85 (4) , 2147-2157
Robust Biased Brownian Dynamics for Rate Constant Calculation
- 18 March 2002
- Published by Wiley in Journal of Computational Chemistry
- Vol. 23 (6) , 673-684
Multiple grid methods for classical molecular dynamics
Presented in the context of classical molecular mechanics and dynamics are multilevel summation methods for the fast calculation of energies/forces for pairwise interactions, which are based on the hierarchical interpolation of interaction potentials on multiple grids. The concepts and details underlying multigrid interpolation are described. For integration of molecular dynamics the use of different time steps for different interactions allows longer time steps for many of the interactions, and this can be combined with multiple grids in space. Comparison is made to the fast multipole method, and evidence is presented suggesting that for molecular simulations multigrid methods may be superior to the fast multipole method and other tree methods. © 2002 Wiley Periodicals, Inc. J Comput Chem 23: 673–684, 2002
- 18 March 2002
- Published by Wiley in Journal of Computational Chemistry
- Vol. 23 (6) , 673-684
Multiple grid methods for classical molecular dynamics
Presented in the context of classical molecular mechanics and dynamics are multilevel summation methods for the fast calculation of energies/forces for pairwise interactions, which are based on the hierarchical interpolation of interaction potentials on multiple grids. The concepts and details underlying multigrid interpolation are described. For integration of molecular dynamics the use of different time steps for different interactions allows longer time steps for many of the interactions, and this can be combined with multiple grids in space. Comparison is made to the fast multipole method, and evidence is presented suggesting that for molecular simulations multigrid methods may be superior to the fast multipole method and other tree methods. © 2002 Wiley Periodicals, Inc. J Comput Chem 23: 673–684, 2002
- Open Access
- 1 May 1999
- Published by Elsevier in Journal of Computational Physics
- Vol. 151 (1) , 9-48
Algorithmic Challenges in Computational Molecular Biophysics
- 1 May 1999
- Published by Elsevier in Journal of Computational Physics
- Vol. 151 (1) , 9-48
Open AccessAlgorithmic Challenges in Computational Molecular Biophysics
- 30 November 1997
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 25 (2-3) , 297-302
Cheap implicit symplectic integrators
- 30 November 1997
- Published by Elsevier in Applied Numerical Mathematics
- Vol. 25 (2-3) , 297-302
Cheap implicit symplectic integrators
- 1 October 1992
- Published by JSTOR in Mathematics of Computation
- Vol. 59 (200) , 439-455
Explicit Canonical Methods for Hamiltonian Systems
We consider canonical partitioned Runge-Kutta methods for separable Hamiltonians $H = T(p) + V(q)$ and canonical Runge-Kutta-Nyström methods for Hamiltonians of the form $H = \frac {1}{2}{p^{\text {T}}}{M^{ - 1}}p + V(q)$ with M a diagonal matrix. We show that for explicit methods there is great simplification in their structure. Canonical methods of orders one through four are constructed. Numerical experiments indicate the suitability of canonical numerical schemes for long-time integrations.- 1 October 1992
- Published by JSTOR in Mathematics of Computation
- Vol. 59 (200) , 439-455
Explicit Canonical Methods for Hamiltonian Systems
We consider canonical partitioned Runge-Kutta methods for separable Hamiltonians $H = T(p) + V(q)$ and canonical Runge-Kutta-Nyström methods for Hamiltonians of the form $H = \frac {1}{2}{p^{\text {T}}}{M^{ - 1}}p + V(q)$ with M a diagonal matrix. We show that for explicit methods there is great simplification in their structure. Canonical methods of orders one through four are constructed. Numerical experiments indicate the suitability of canonical numerical schemes for long-time integrations.