상세 보기
Transfer Matrix Algorithm for Computing the Geometric Quantities of a Square Lattice Polymer
Citations
WEB OF SCIENCE
0Citations
SCOPUS
0초록
I develop a transfer matrix algorithm for computing the geometric quantities of a square lattice polymer with nearest-neighbor interactions. The radius of gyration, the end-to-end distance, and the monomer-to-end distance were computed as functions of the temperature. The computation time scales as less than or similar to 1.8(N) with a chain length N, in contrast to the explicit enumeration where the scaling is similar to 2.7(N). Various techniques for reducing memory requirements are implemented.
키워드
Lattice polymer; Transfer matrix; Exact enumeration; Interacting self-avoiding walk; SELF-AVOIDING WALKS; MONTE-CARLO-SIMULATION; THETA-POINT EXPONENTS; UNIVERSALITY CLASSES; COLLAPSE TRANSITION; PARTITION-FUNCTION; ENUMERATION; POLYGONS; MODEL; ZEROS
- 제목
- Transfer Matrix Algorithm for Computing the Geometric Quantities of a Square Lattice Polymer
- 저자
- Lee, Julian
- 발행일
- 2018-12
- 유형
- Article
- 권
- 73
- 호
- 12
- 페이지
- 1808 ~ 1813
- 언어
- ENG
- 출판사
- KOREAN PHYSICAL SOC
- 발행국가
- 대한민국
- 분량
- 6 페이지
- ISSN
- E 1976-8524
P 0374-4884