Wei Wang

Bio: Wei Wang is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Iterative method & Preconditioner. The author has an hindex of 4, co-authored 4 publications receiving 13352 citations.

Scalable molecular dynamics with NAMD

Abstract: NAMD is a parallel molecular dynamics code designed for high-performance simulation of large biomolecular systems. NAMD scales to hundreds of processors on high-end parallel platforms, as well as tens of processors on low-cost commodity clusters, and also runs on individual desktop and laptop computers. NAMD works with AMBER and CHARMM potential functions, parameters, and file formats. This article, directed to novices as well as experts, first introduces concepts and methods used in the NAMD program, describing the classical molecular dynamics force field, equations of motion, and integration methods along with the efficient electrostatics evaluation algorithms employed and temperature and pressure controls used. Features for steering the simulation across barriers and for calculating both alchemical and conformational free energy differences are presented. The motivations for and a roadmap to the internal design of NAMD, implemented in C++ and based on Charm++ parallel objects, are outlined. The factors affecting the serial and parallel performance of a simulation are discussed. Finally, typical NAMD use is illustrated with representative applications to a small, a medium, and a large biomolecular system, highlighting particular features of NAMD, for example, the Tcl scripting language. The article also provides a list of the key features of NAMD and discusses the benefits of combining NAMD with the molecular graphics/sequence analysis software VMD and the grid computing/collaboratory software BioCoRE. NAMD is distributed free of charge with source code at www.ks.uiuc.edu.

Analysis of a few numerical integration methods for the Langevin equation

Abstract: We study the position recurrence relation of several existing numerical integrators for the Langevin equation and use the modified equation approach to analyse their accuracy. We show that for the harmonic oscillator, the BBK integrator converges weakly with order 1 while the vGB82 and Langevin impulse (LI)‡ integrator converge weakly with order 2. We also study a restricted class of velocity definitions—those that lead to explicit starting procedures. We show that some recurrence relations exact for constant force, can achieve the exact virial relation by a proper definition of velocity, extending the result of Pastor et al. on the analysis of BBK integrators in 1988.

Fast evaluation of polarizable forces.

Abstract: Polarizability is considered to be the single most significant development in the next generation of force fields for biomolecular simulations. However, the self-consistent computation of induced atomic dipoles in a polarizable force field is expensive due to the cost of solving a large dense linear system at each step of a simulation. This article introduces methods that reduce the cost of computing the electrostatic energy and force of a polarizable model from about 7.5 times the cost of computing those of a nonpolarizable model to less than twice the cost. This is probably sufficient for the routine use of polarizable forces in biomolecular simulations. The reduction in computing time is achieved by an efficient implementation of the particle-mesh Ewald method, an accurate and robust predictor based on least-squares fitting, and non-stationary iterative methods whose fast convergence is accelerated by a simple preconditioner. Furthermore, with these methods, the self-consistent approach with a larger timestep is shown to be faster than the extended Lagrangian approach. The use of dipole moments from previous timesteps to calculate an accurate initial guess for iterative methods leads to an energy drift, which can be made acceptably small. The use of a zero initial guess does not lead to perceptible energy drift if a reasonably strict convergence criterion for the iteration is imposed.

Fast polarizable force field computation in biomolecular simulations

Abstract: Polarizable force fields are considered to be the single most significant development in the next-generation force fields used in biomolecular simulations The self-consistent computation of induced atomic dipoles in a polarizable force field is expensive due to the cost of solving a large dense linear system at each timestep in molecular dynamics simulations Methods are developed that reduce the cost of computing the electrostatic energy and force of a polarizable model from about 75 times the cost of computing those of a non-polarizable model to less than twice the cost The reduction is achieved by an efficient implementation of the particle-mesh Ewald method, an accurate and robust predictor based on least squares fitting, and two non-stationary iterative methods whose fast convergence is empowered by a simple preconditioner Furthermore, with these methods, we show that the self-consistent approach with a larger timestep is faster than the extended Lagrangian approach The use of dipole moments from previous timesteps to calculate an accurate initial guess for iterative methods leads to an energy drift and compromises the volume-preserving property of the integration Iterative methods with zero initial guess do not lead to perceptible energy drift if a reasonably strict convergence criterion for the iteration is imposed and the numerical integrator is volume-preserving The approximate solution computed by an iterative method ruins the symplectic property of the integrator To address this problem, a non-iterative method has been developed based on an approximation to the electrostatic potential energy and has been efficiently implemented The method preserves the symplecticness of the integrator and is suitable for long time simulations The research will help polarizable force fields modeling and computation to become a routine part of molecular dynamics simulations for biomolecular systems

Scalable molecular dynamics with NAMD

Abstract: NAMD is a parallel molecular dynamics code designed for high-performance simulation of large biomolecular systems. NAMD scales to hundreds of processors on high-end parallel platforms, as well as tens of processors on low-cost commodity clusters, and also runs on individual desktop and laptop computers. NAMD works with AMBER and CHARMM potential functions, parameters, and file formats. This article, directed to novices as well as experts, first introduces concepts and methods used in the NAMD program, describing the classical molecular dynamics force field, equations of motion, and integration methods along with the efficient electrostatics evaluation algorithms employed and temperature and pressure controls used. Features for steering the simulation across barriers and for calculating both alchemical and conformational free energy differences are presented. The motivations for and a roadmap to the internal design of NAMD, implemented in C++ and based on Charm++ parallel objects, are outlined. The factors affecting the serial and parallel performance of a simulation are discussed. Finally, typical NAMD use is illustrated with representative applications to a small, a medium, and a large biomolecular system, highlighting particular features of NAMD, for example, the Tcl scripting language. The article also provides a list of the key features of NAMD and discusses the benefits of combining NAMD with the molecular graphics/sequence analysis software VMD and the grid computing/collaboratory software BioCoRE. NAMD is distributed free of charge with source code at www.ks.uiuc.edu.

GROMACS 4: Algorithms for highly efficient, load-balanced, and scalable molecular simulation

Abstract: Molecular simulation is an extremely useful, but computationally very expensive tool for studies of chemical and biomolecular systems Here, we present a new implementation of our molecular simulation toolkit GROMACS which now both achieves extremely high performance on single processors from algorithmic optimizations and hand-coded routines and simultaneously scales very well on parallel machines The code encompasses a minimal-communication domain decomposition algorithm, full dynamic load balancing, a state-of-the-art parallel constraint solver, and efficient virtual site algorithms that allow removal of hydrogen atom degrees of freedom to enable integration time steps up to 5 fs for atomistic simulations also in parallel To improve the scaling properties of the common particle mesh Ewald electrostatics algorithms, we have in addition used a Multiple-Program, Multiple-Data approach, with separate node domains responsible for direct and reciprocal space interactions Not only does this combination of a

CHARMM: the biomolecular simulation program.

Abstract: CHARMM (Chemistry at HARvard Molecular Mechanics) is a highly versatile and widely used molecu- lar simulation program. It has been developed over the last three decades with a primary focus on molecules of bio- logical interest, including proteins, peptides, lipids, nucleic acids, carbohydrates, and small molecule ligands, as they occur in solution, crystals, and membrane environments. For the study of such systems, the program provides a large suite of computational tools that include numerous conformational and path sampling methods, free energy estima- tors, molecular minimization, dynamics, and analysis techniques, and model-building capabilities. The CHARMM program is applicable to problems involving a much broader class of many-particle systems. Calculations with CHARMM can be performed using a number of different energy functions and models, from mixed quantum mechanical-molecular mechanical force fields, to all-atom classical potential energy functions with explicit solvent and various boundary conditions, to implicit solvent and membrane models. The program has been ported to numer- ous platforms in both serial and parallel architectures. This article provides an overview of the program as it exists today with an emphasis on developments since the publication of the original CHARMM article in 1983.