Lang, Michael and Michalke, Wolfgang and Kreitmeier, Stefan (2001) Optimized decomposition of simulated polymer networks into meshes. MACROMOLECULAR THEORY AND SIMULATIONS, 10 (3). pp. 204-208. ISSN 1022-1344
Full text not available from this repository. (Request a copy)Abstract
Full Paper: An algorithm is introduced which decomposes simulated polymer networks into meshes in order to permit an analysis of the entanglements of the network. The decomposition process intends to obtain the set of meshes most active during the deformation process. Optimizing both the choice of the spanning tree of the network and the order of adding chains to the tree, a decomposition is obtained, which only contains the smallest meshes necessary. By applying it to stimulated networks it is found that, especially for statistical networks, an optimization process is necessary to perform a valid entanglement analysis. [GRAPHICS] (a) Graph theoretical representation of a polymer network showing monomers (circles) and cross-linkers (squares). On mapping (b), the monomer chains are replaced by edges and dangling bonds have been removed.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | MONTE-CARLO; |
| Subjects: | 500 Science > 530 Physics |
| Divisions: | Physics > Institute of Experimental and Applied Physics |
| Depositing User: | Dr. Gernot Deinzer |
| Date Deposited: | 08 Feb 2022 09:26 |
| Last Modified: | 08 Feb 2022 09:26 |
| URI: | https://pred.uni-regensburg.de/id/eprint/41631 |
Actions (login required)
 |
View Item |
