File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

김재업

Kim, Jaeup U.
Nanostructured Polymer Theory Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Accelerating Langevin Field-Theoretic Simulation of Polymers with Deep Learning

Author(s)
Yong, DaeseongKim, Jaeup U.
Issued Date
2022-07
DOI
10.1021/acs.macromol.2c00705
URI
https://scholarworks.unist.ac.kr/handle/201301/60046
Citation
MACROMOLECULES, v.55, no.15, pp.6505 - 6515
Abstract
Langevin field-theoretic simulation (L-FTS) is a promising tool in polymer field theory that can account for the compositional fluctuation effect, which is neglected in the self-consistent field theory (SCFT). However, L-FTS is a computationally expensive tool, and it may take more than a week to accurately calculate ensemble averages of thermodynamic quantities. In our previous study, we introduced a deep neural network (DNN) that estimates the saddle point of the pressure field to reduce the subsequent Anderson mixing (AM) iterations. Herein, we propose a novel DNN that can be successively applied to determine the saddle point without using conventional field-update algorithms. Major deep learning (DL) models for semantic segmentation in computer vision are adopted to construct the optimal DNN architecture. Our model utilizing atrous convolutions in parallel is accurate and computationally efficient, and it is robust to the simulation parameter changes and can consequently be reused after single training. We demonstrate that our DNN can achieve speedup of factor 6 or more compared to the AM method without affecting accuracy. Open-source code for our deep Langevin FTS (DL-FTS) enables an easy and rapid Python scripting of SCFT and L-FTS incorporated with CPU or GPU parallelization and DL.
Publisher
American Chemical Society
ISSN
0024-9297
Keyword
MELTS

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.