doi: 10.4304/jsw.8.12.3200-3205
2Department of Computer, Wenzhou University, Wenzhou, China
3School of Computer Science and Technology, Shandong University, Jinan, China
Abstract—A single polymer chain with one end tethered to an impenetrable flat surface is simulated by using Monte Carlo simulation method. The polymer chain is generated using self-avoiding walk method in the simple cubic lattice. The monomer does Brownian motion by the bondfluctuation method in the simulation. After a long Monte Carlo step, the conformation of the chain reaches equilibrium. There is a scaling relation between the surface contact number M and the chain length N at the critical adsorption temperature Tc. The scaling algorithm is presented to determine the critical adsorption point Tc by the variance between the interpolation value and the curve fitting value. The dependence of the surface contact number M on the chain length N is presented near the critical adsorption point Tc by two critical exponents φ and δ. The results provide a new efficient method to locate the critical adsorption point and to find out the critical exponents.
Index Terms—simulation, chain, critical adsorption, scaling method.
Cite: He-Bei Gao, Zhi-Yang Gu, Rui Zhong, Chang-Ji Qian, Hong Li, Bin Gong, "A Scaling Algorithm of Self-avoiding Chain Adsorbed on the Surface," Journal of Software vol. 8, no. 12, pp. 3200-3205, 2013.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Oct 22, 2024 News!
Vol 19, No 3 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]