Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Improving the Wang-Landau algorithm for polymers and proteins

Tools
- Tools
+ Tools

Swetnam, Adam D. and Allen, M. P. (2010) Improving the Wang-Landau algorithm for polymers and proteins. Journal of Computational Chemistry, Volume 32 (Number 5). pp. 816-821. doi:10.1002/jcc.21660 ISSN 0192-8651.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Official URL: http://dx.doi.org/10.1002/jcc.21660

Request Changes to record.

Abstract

The 1/t Wang–Landau algorithm is tested on simple models of polymers and proteins. It is found that this method resolves the problem of the saturation of the error present in the original algorithm for lattice polymers. However, for lattice proteins, which have a rough energy landscape with an unknown energy minimum, it is found that the density of states does not converge in all runs. A new variant of the Wang–Landau algorithm that appears to solve this problem is described and tested. In the new variant, the optimum modification factor is calculated in the same straightforward way throughout the simulation. There is only one free parameter for which a value of unity appears to give near optimal convergence for all run lengths for lattice homopolymers when pull moves are used. For lattice proteins, a much smaller value of the parameter is needed to ensure rapid convergence of the density of states for energies discovered late in the simulation, which unfortunately results in poor convergence early on in the run.

Item Type: Journal Article
Subjects: Q Science > QC Physics
Divisions: Faculty of Science, Engineering and Medicine > Science > Physics
Library of Congress Subject Headings (LCSH): Monte Carlo method, Polymers, Proteins
Journal or Publication Title: Journal of Computational Chemistry
Publisher: John Wiley & Sons, Inc.
ISSN: 0192-8651
Official Date: 15 April 2010
Dates:
DateEvent
15 April 2010Published
Volume: Volume 32
Number: Number 5
Page Range: pp. 816-821
DOI: 10.1002/jcc.21660
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: Engineering and Physical Sciences Research Council (EPSRC)

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us