Author:
Guo Yachong,Werner Marco,Baulin Vladimir A.
Abstract
AbstractDesign problems of finding efficient patterns, adaptation of complex molecules to external environments, affinity of molecules to specific targets, dynamic adaptive behavior of chemical systems, reconstruction of 3D structures from diffraction data are examples of difficult to solve optimal design or inverse search problems. Nature inspires evolution strategies to solve design problems that are based on selection of successful adaptations and heritable traits over generations. To exploit this strategy in the creation of new materials, a concept of adaptive chemistry was proposed to provide a route for synthesis of self-adapting molecules that can fit to their environment. We propose a computational method of an efficient exhaustive search exploiting massive parallelization on modern GPUs, which finds a solution for an inverse problem by solving repetitively a direct problem in the mean field approximation. One example is the search for a composition of a copolymer that allows the polymer to translocate through a lipid membrane at a minimal time. Another example is a search of a copolymer sequence that maximizes the polymer load in the micelle defined by the radial core-shell potentials. The length and the composition of the sequence are adjusted to fit into the restricted environment. Hydrogen bonding is another pathway of adaptation to the environment through reversible links. A linear polymer that interacts with water through hydrogen bonds adjusts the position of hydrogen bonds along the chain as a function of the concentration field around monomers. In the last example, branching of the molecules is adjusted to external fields, providing molecules with annealed topology, that can be flexibly changed by changing external conditions. The method can be generalized and applied to a broad spectrum of design problems in chemistry and physics, where adaptive behavior in multi-parameter space in response to environmental conditions lead to non-trivial patterns or molecule architectures and compositions. It can further be combined with machine learning or other optimization techniques to explore more efficiently the parameter space.
Funder
Science and Technology Innovation Foundation of Harbin
Academic Consortium 21
Ministerio de Ciencia, Innovación y Universidades
Publisher
Springer Science and Business Media LLC
Reference43 articles.
1. Inverse Problems in Engineering Mechanics III (Elsevier, 2002). https://linkinghub.elsevier.com/retrieve/pii/B9780080439518X50000.
2. Stanley, M. B., Osher, S. J. & Yablonovitch, E. Inverse problem techniques for the design of photonic crystals. IEICE Trans. Electron. 87, 258–265 (2004).
3. Benning, M. & Burger, M. Modern regularization methods for inverse problems. Acta Numerica 27, 1–111 (2018). https://www.cambridge.org/core/journals/acta-numerica/article/modern-regularization-methods-for-inverse-problems/1C84F0E91BF20EC36D8E846EF8CCB830.
4. Delsanto, S., Griffa, M. & Morra, L. Inverse Problems and Genetic Algorithms. In Delsanto, P. P. (ed.) Universality of Nonclassical Nonlinearity, 349–366 (Springer New York, New York, NY, 2006). http://link.springer.com/10.1007/978-0-387-35851-2_22.
5. Adler, J. & Öktem, O. Solving ill-posed inverse problems using iterative deep neural networks. Inverse Problems 33, 124007 (2017). http://stacks.iop.org/0266-5611/33/i=12/a=124007.