𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficiency of the Incomplete Enumeration Algorithm for Monte-Carlo Simulation of Linear and Branched Polymers

✍ Scribed by Sumedha; Deepak Dhar

Publisher
Springer
Year
2005
Tongue
English
Weight
328 KB
Volume
120
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Monte Carlo simulation of tetrahedral ch
Monte Carlo simulation of tetrahedral chains, 5. The pivot-algorithm for non-athermal linear and star-branched polymers
✍ Zifferer, Gerhard 📂 Article 📅 1992 🏛 Wiley (John Wiley & Sons) ⚖ 741 KB

## Abstract By use of the pivot algorithm, star‐branched chains with __F__ = 3–12 arms of length __n, nF__ = 480, and linear chains (__F__ = 2) are generated on a tetrahedral lattice. In order to simulate different qualities of the solvent, specific short‐range interactions are taken into account.

Monte Carlo simulation of tetrahedral ch
Monte Carlo simulation of tetrahedral chains, 6. Linear and star-branched polymers near to theta conditions
✍ Zifferer, Gerhard 📂 Article 📅 1993 🏛 Wiley (John Wiley & Sons) ⚖ 986 KB

## Abstract By use of the pivot algorithm, star‐branched chains with __F__ = 4, 8 and 12 arms of length __n__ and linear chains (__F__ = 2) are generated on a tetrahedral lattice (120 ⩽ __nF__ ⩽ 3 840). By taking into account non‐bonded nearest‐neighbour interactions (each contact contributes an en

Monte Carlo simulation of tetrahedral ch
Monte Carlo simulation of tetrahedral chains, 7 the shape of linear and star-branched polymers near to theta-conditions
✍ Gerhard Zifferer 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 997 KB

## Abstract By use of the pivot algorithm, star‐branched chains with __F__ = 4, 8 and 12 arms of length __n__ and linear chains (__F__ = 2) are generated on a tetrahedral lattice (120 ≤ __nF__ ≤ 3 840). By taking into account nearest neighbour interactions (each contact contributes an energy ϕ __kT