ZIB-Report
Refine
Year of publication
Document Type
- ZIB-Report (194)
- Article (2)
Is part of the Bibliography
- no (196)
Keywords
Institute
- Numerical Mathematics (196) (remove)
13-64
In high accuracy numerical simulations and optimal control of time-dependent processes, often both many time steps and fine spatial discretizations are needed. Adjoint gradient computation, or post-processing of simulation results, requires the storage of the solution trajectories over the whole time, if necessary together with the adaptively refined spatial grids. In this paper we discuss various techniques to reduce the memory requirements, focusing first on the storage of the solution data, which typically are double precision floating point values. We highlight advantages and disadvantages of the different approaches. Moreover, we present an algorithm for the efficient storage of adaptively refined, hierarchic grids, and the integration with the compressed storage of solution data.
14-05
In recent years Markov State Models (MSMs) have attracted a consid-
erable amount of attention with regard to modelling conformation changes
and associated function of biomolecular systems. They have been used
successfully, e.g., for peptides including time-resolved spectroscopic ex-
periments, protein function and protein folding , DNA and RNA, and
ligand-receptor interaction in drug design and more complicated multi-
valent scenarios. In this article a novel reweighting scheme is introduced
that allows to construct an MSM for certain molecular system out of an
MSM for a similar system. This permits studying how molecular proper-
ties on long timescales differ between similar molecular systems without
performing full molecular dynamics simulations for each system under con-
sideration. The performance of the reweighting scheme is illustrated for
simple test cases including one where the main wells of the respective en-
ergy landscapes are located differently and an alchemical transformation
of butane to pentane where the dimension of the state space is changed.
13-34
Markov Decision Processes (MDP) or Partially Observable MDPs (POMDP) are
used for modelling situations in which the evolution of a process is partly random and
partly controllable. These MDP theories allow for computing the optimal control policy
for processes that can continuously or frequently be observed, even if only partially.
However, they cannot be applied if state observation is very costly and therefore rare
(in time). We present a novel MDP theory for rare, costly observations and derive the
corresponding Bellman equation. In the new theory, state information can be derived
for a particular cost after certain, rather long time intervals. The resulting information
costs enter into the total cost and thus into the optimization criterion. This approach
applies to many real world problems, particularly in the medical context, where the
medical condition is examined rather rarely because examination costs are high. At the
same time, the approach allows for efficient numerical realization. We demonstrate the
usefulness of the novel theory by determining, from the national economic perspective,
optimal therapeutic policies for the treatment of the human immunodefficiency virus
(HIV) in resource-rich and resource-poor settings. Based on the developed theory and
models, we discover that available drugs may not be utilized efficiently in resource-poor
settings due to exorbitant diagnostic costs.
13-41
Knochenremodellierung beinhaltet den Auf- und Abbau der Knochenmasse durch die verschiedenen Knochenzellen und findet fast überall, auch am Skelett Erwachsener, statt. Für die Erneuerung der Knochensubstanz sind die Osteoblasten zuständig. Sie ersetzen exakt die Menge der Knochenmasse, welche zuvor durch Osteoklasten abgebaut wurde. Störungen dieses, durch viele Faktoren beeinflussten Prozesses führen zu pathologischen Veränderungen, beispielsweise zu Osteoporose oder Arthritis.
Auf der Grundlage analysierter publizierter Modelle wurde ein Modell entwickelt, welches den Einfluss einiger dieser Faktoren realistisch abbildet. Auf diese Weise kann die Wirkung von basalem PTH, des RANKL-OPG-Systems ( RANKL: Receptor activator of nuclear factor kappa-B ligand, OPG: Osteoprotegerin) und des Estradiols auf den Knochenstoffwechsel am vorgestellten System untersucht werden.
Außerdem wurde durch Estradiolmangel hervorgerufene Osteoporose und der kurative Effekt von synthetischen Medikamenten wie Estradiol oder intermittierend verabreichtem PTH modelliert.
Mit der Parameterschätzung anhand des Gauß-Newton-Verfahrens wird des Weiteren eine Methode vorgestellt, die es ermöglicht, mathematische Modelle bestmöglich durch Variation der Parameterwerte an experimentelle Daten anzupassen. Das am Zuse-Institut Berlin entwickelte Softwarepaket POEM wendet diesen Algorithmus an und wird ebenfalls erläutert.
13-58
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.
13-50
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.
13-43
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.
13-51
A good deal of molecular dynamics simulations aims at predicting and quantifying rare events, such as the folding of a protein or a phase transition. Simulating rare events is often prohibitive, especially if the equations of motion are high-dimensional, as is the case in molecular dynamics. Various algorithms have been proposed for efficiently computing mean first passage times, transition rates or reaction pathways. This article surveys and discusses recent developments in the field of rare event simulation and outlines a new approach that combines ideas from optimal control and statistical mechanics. The optimal control approach described in detail resembles the use of Jarzynski's equality for free energy calculations, but with an optimized protocol that speeds up the sampling, while (theoretically) giving variance-free estimators of the rare events statistics. We illustrate the new approach with two numerical examples and discuss its relation to existing methods.
13-52
Rare but important transition events between long lived states are a key feature of many molecular systems. In many cases the computation of rare event statistics by direct molecular dynamics (MD) simulations is infeasible even on the most powerful computers because of the immensely long simulation timescales needed. Recently a technique for spatial discretization of the molecular state space designed to help overcome such problems, so-called Markov State Models (MSMs), has attracted a lot of attention. We review the theoretical background and algorithmic realization of MSMs and illustrate their use by some numerical examples. Furthermore we introduce a novel approach to using MSMs for the efficient solution of optimal control problems that appear in applications where one desires to optimize molecular properties by means of external controls.
16-39
In this paper, we present a new, optimization-based method to exhibit cyclic behavior in non-reversible stochastic processes. While our method is general, it is strongly motivated by discrete simulations of ordinary differential equations representing non-reversible biological processes, in particular molecular simulations. Here, the discrete time steps of the simulation are often very small compared to the time scale of interest, i.e., of the whole process. In this setting, the detection of a global cyclic behavior of the process becomes difficult because transitions between individual states may appear almost reversible on the small time scale of the simulation. We address this difficulty using a mixed-integer programming model that allows us to compute a cycle of clusters with maximum net flow, i.e., large forward and small backward probability. For a synthetic genetic regulatory network consisting of a ring-oscillator with three genes, we show that this approach can detect the most productive overall cycle, outperforming classical spectral analysis methods. Our method applies to general non-equilibrium steady state systems such as catalytic reactions, for which the objective value computes the effectiveness of the catalyst.