• Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/boms/007/01/0035-0041

    • Keywords

       

      Polymer chains; self avoiding random walks; Monte-Carlo methods

    • Abstract

       

      The present paper describes an algorithm which can generate, even on a small computer, arbitrarily long polymer chains, making sure that the configurations generated do not suffer from boundary effects. This has been achieved by employing the concept of a window, which is an analogue of virtual memory scheme. The algorithm has been tested for the case of dilute polymer solution.

    • Author Affiliations

       

      S L Narasimhan1 P S Goyal1 B A Dasannacharya1

      1. Nuclear Physics Division, Bhabha Atomic Research Centre, Trombay, Bombay - 400 085, India
    • Dates

       
  • Bulletin of Materials Science | News

    • Dr Shanti Swarup Bhatnagar for Science and Technology

      Posted on October 12, 2020

      Prof. Subi Jacob George — Jawaharlal Nehru Centre for Advanced Scientific Research, Jakkur, Bengaluru
      Chemical Sciences 2020

      Prof. Surajit Dhara — School of Physics, University of Hyderabad, Hyderabad
      Physical Sciences 2020

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.