Refine
Year of publication
Language
- English (61)
Keywords
- molecular dynamics (4)
- spatially adaptive smoothing (3)
- Markov models (2)
- functional MRI (2)
- signal detection (2)
- stability (2)
- Allen-Cahn-equation (1)
- Bayesian error analysis (1)
- Brownian dynamics (1)
- Chemical master equation (1)
We consider a particle constrained to a submanifold ? of the
configuration space Rm. Using that the notion of holonomic constraints coincides
with integrability of the corresponding vector field, we show how this property
naturally determines local coordinates on ?. We give a rigorous justification for
the calculation of the mean force along a constrained coordinate, and we provide
a concise geometrical interpretation of the different contributions to the mean
force in terms of the unconstrained vector field and extrinsic curvature properties
of ? in Rm. Our approach gives rise to a Hybrid Monte-Carlo based algorithm
that can be used to compute the mean force acting on selected coordinates in the
context of thermodynamic free energy statistics.
We present an algorithm that constructs parametrizations of boundary
and interface surfaces automatically. Starting with high-resolution triangulated
surfaces describing the computational domains, we iteratively
simplify the surfaces yielding a coarse approximation of the boundaries
with the same topological type. While simplifying we construct a function
that is defined on the coarse surface and whose image is the original
surface. This function allows access to the correct shape and surface normals
of the original surface as well as to any kind of data defined on it.
Such information can be used by geometric multigrid solvers doing adaptive
mesh refinement. Our algorithm runs stable on all types of input
surfaces, including those that describe domains consisting of several materials.
We have used our method with success in different fields and we
discuss examples from structural mechanics and biomechanics.
In this paper we analyze decompositions of reversible nearly uncoupled
Markov chains into rapidly mixing subchains. We state upper
bounds on the 2nd eigenvalue for restriction and stochastic complementation
chains of reversible Markov chains, as well as a relation between
them. We illustrate the obtained bounds analytically for bunkbed
graphs, and furthermore apply them to restricted Markov chains that
arise when analyzing conformation dynamics of a small biomolecule.
This article is concerned with the averaging principle and its extensions
for stochastic dynamical systems with fast and slow degrees of
freedom. It is demonstrated how the \conventional" averaging principle
results from asymptotic multiscale analysis, how one can construct
an indicator for its (in-)appropriateness, and how, if inappropriate, it
may be extended into an improved approximation. The conventional
scheme contains averages over the entire accessible state space of the
fast degrees of freedom and may thus fail if these fast degrees of freedom
exhibit long-term (auto-)correlations. In contrast, the improved
scheme combines several conditional averages with a Markov jump process
that is designed to represent the
ipping process between the
conditional averages and thus incorporates the important long-term
correlations. All important steps of the derivation are illustrated by
numerical experiments. Application to problems from molecular dynamics
is discussed.
The paper presents a unified approach to local likelihood estimation
for a broad class of nonparametric models, including e.g. the regression,
density, Poisson and binary response model. The method extends
the adaptive weights smoothing (AWS) procedure introduced in Polzehl
and Spokoiny (2000) in context of image denoising. Performance of the
proposed procedure is illustrated by a number of numerical examples
and applications to density or volatility estimation, classification and
estimation of the tail index parameter. We also establish a number of
important theoretical results on properties of the proposed procedure.
The adaptive weights smoothing (AWS) procedure was introduced in
Polzehl and Spokoiny (2000) in the context of image denoising. The
procedure has some remarkable properties like preservation of edges and
contrast, and (in some sense) optimal reduction of noise. The procedure
is fully adaptive and dimension free. Simulations with artificial images
show that AWS is superior to classical smoothing techniques especially
when the underlying image function is discontinuous and can be well
approximated by a piecewise constant function. However, the latter as-
sumption can be rather restrictive for a number of potential applications.
Here the AWS method is generalized to the case of an arbitrary local lin-
ear parametric structure. We also establish some important results about
properties of the AWS procedure including the so called "propagation
condition" and spatial adaptivity. The performance of the procedure is
illustrated by examples for local polynomial regression in univariate and
bivariate situations.
We report on a novel approach to the automatic identification
of metastable states from long term simulation of complex
molecular systems. The new approach is based on a hierarchical concept
of metastability: metastable states are understood as subsets of
state or configuration space from which the dynamics exits only very rarely;
subsets with the smallest exit probabilities are of most interest, their
further decomposition then may reveal subsets from which exiting
is less but comparably difficult for the system under investigation.
The article gives a survey of the theoretical foundation of
the approach and its algorithmic realization that generalizes
the well-known concept of Hidden Markov Models.
The performance of the resulting algorithm are illustrated by
application to a 100 ns simulation of penta-alanine with explicit water.
We demonstrate the resulting metastable states allow to
reveal the conformation dynamics of the moelcule.
We comment on two different notions of the thermodynamical free energy
that are used in Hamiltonian molecular dynamics. Both concepts have
different scopes of applications as was pointed out recently in the
context of high--friction Langevin dynamics. We show that problems
that rely on either definition can be treated in a uniform way using
constrained molecular dynamics. Not only proves this useful in
designing algorithms that sample the free energy landscape, but it
also clarifies the relation between seemingly contradictory results
that are present in the literature.
We shortly review the uncoupling-coupling method, a Markov chain
Monte Carlo based approach to compute statistical properties of systems like
medium-sized biomolecules. This technique has recently been proposed for the efficient computation of biomolecular conformations. One crucial step of UC is the
decomposition of reversible nearly uncoupled Markov chains into rapidly mixing
subchains. We show how the underlying scheme of uncoupling-coupling can also be
applied to stochastic differential equations where it can be translated into a domain
decomposition technique for partial differential equations.
We consider a particle constrained to a submanifold ? of the configuration space
Rm. Using that the notion of holonomic constraints coincides with integrability of the corresponding
vector field, we show how this property naturally determines local coordinates on ? . We give a
rigorous justification for the calculation of the mean force along the constrained coordinates, and
we provide a concise geometrical interpretation of the different contributions to the mean force.
Our approach gives rise to a generalisation of the Fixman Theorem which is well known and widely
used in molecular dynamics applications. It further allows for working out a Hybrid Monte-Carlo
based algorithm that can be used to compute arbitrary statistical quantities from constrained
simulations such as the mean force in the context of thermodynamic free energy statistics.