|
Authors
|
M. Lang, W. Michalke, S. Kreitmeier
|
|
Title
|
Analysis of trapped entanglements in polymer networks
|
|
Date
|
01.03.2003
|
|
Number
|
2115
|
|
Abstract
|
This work reviews different standard methods to analyze trapped entanglements of polymer networks and discusses their advantages and drawbacks with respect to simplicity, computing time and accuracy of the results. Since this standard analysis is based on the pairwise test of closed cycles, two algorithms for the determination of these cycles are introduced and compared. The decomposition into meshes creates unsolved problems regarding the non-ambiguity and the completeness of the received results. Examples are given in order to show their effects and to start further discussion to receive more convenient methods. As one possible solution Vassilievs invariants are discussed and an approximation method is introduced to correct the possible multiple counting of entanglements.
|
|
Publisher
|
Journal of Computational Physics
|
|
Wikidata
|
|
|
Citation
|
Journal of Computational Physics 185 (2003) 549-561
|
|
DOI
|
https://doi.org/10.1016/S0021-9991(03)00003-2
|
|
Tags
|
|
