Fackeldey, Konstantin
Refine
Year of publication
Document Type
- Article (41)
- ZIB-Report (13)
- In Proceedings (10)
- Research data (2)
- Book chapter (1)
- Doctoral Thesis (1)
- Habilitation (1)
Keywords
- Markov State Models (4)
- Markov chain (2)
- Meshfree (2)
- Mixed-Integer Programming (2)
- NESS (2)
- Non-reversible Markov Processes (2)
- Schur decomposition (2)
- Atomistic to Continuum (1)
- COVID-19 (1)
- Conformation Dynamics (1)
Institute
- Numerical Mathematics (61)
- Computational Molecular Design (44)
- Modeling and Simulation of Complex Processes (20)
- Parallel and Distributed Computing (6)
- Mathematical Algorithmic Intelligence (5)
- Mathematical Optimization (2)
- Mathematical Optimization Methods (2)
- Mathematics for Life and Materials Science (2)
- AI in Society, Science, and Technology (1)
- Computational Systems Biology (1)
Medizin aus dem Computer
(2013)
We introduce a generalized operator for arbitrary stochastic processes by using a pre-kernel, which is a generalization of the Markov kernel. For deterministic processes, such an operator is already known as the Frobenius-Perron operator, which is defined for a large class of measures. For Markov processes, there exists transfer operators being only well defined for stationary measures in $L^2$. Our novel generalized transfer operator is well defined for arbitrary stochastic processes, in particular also for deterministic ones. We can show that this operator is acting on $L^1$. For stationary measures, this operator is also an endomorphism of $L^2$ and, therefore, allows for a mathematical analysis in Hilbert spaces.
Obtaining a sufficient sampling of conformational space is a common problem in molecular simulation. We present the implementation of an umbrella-like adaptive sampling approach based on function-based meshless discretization of conformational space that is compatible with state of the art molecular dynamics code and that integrates an eigenvector-based clustering approach for conformational analysis and the computation of inter-conformational transition rates. The approach is applied to three example systems, namely n-pentane, alanine dipeptide, and a small synthetic host-guest system, the latter two including explicitly modeled solvent.
It is the ultimate goal of concurrent multiscale methods to
provide computational tools that allow to simulation physical processes
with the accuracy of micro-scale and the computational speed of
macro-scale models. As a matter of fact, the efficient and scalable
implementation of concurrent multiscale methods on clusters and supercomputers
is a complicated endeavor. In this article we present the parallel
multiscale simulation tool MACI which has been designed for
efficient coupling between molecular dynamics and finite element codes.
We propose a specification for a thin yet versatile interface for the
coupling of molecular dynamics and finite element codes in a modular
fashion. Further we discuss the parallelization strategy pursued in
MACI, in particular, focusing on the parallel assembly of transfer
operators and their efficient execution.
Trajectory- or mesh-based methods for analyzing the dynamical behavior of large molecules tend to be impractical due to the curse of dimensionality - their computational cost increases exponentially with the size of the molecule. We propose a method to break the curse by a novel square root approximation of transition rates, Monte Carlo quadrature and a discretization approach based on solving linear programs. With randomly sampled points on the molecular energy landscape and randomly generated discretizations of the molecular configuration space as our initial data, we construct a matrix describing the transition rates between adjacent discretization regions. This transition rate matrix yields a Markov State Model of the molecular dynamics. We use Perron cluster analysis and coarse-graining techniques in order to identify metastable sets in configuration space and approximate the transition rates between the metastable sets. Application of our method to a simple energy landscape on a two-dimensional configuration space provides proof of concept and an example for which we compare the performance of different discretizations. We show that the computational cost of our method grows only polynomially with the size of the molecule. However, finding discretizations of higher-dimensional configuration spaces in which metastable sets can be identified remains a challenge.