Towards the fast DSA: improvement of computational performance of the DSA model

The approaches to improve the performance of the DSA (directed self-assembly) computational models are being reviewed and discussed. We start by reviewing the computational complexity of a rigorous self-consistent field theory (SCFT) DSA model and also the currently utilized ways to reduce this computational complexity and improve its performance, as implemented in GLOBALFOUNDRIES DSA Solver. We proceed with presenting new approximations in the SCFT model making it possible to improve the computational performance of the DSA model further.