TY - GEN A1 - Schädle, Achim A1 - Zschiedrich, Lin T1 - Additive Schwarz method for scattering problems using the PML method at interfaces N2 - Scattering problems in integrated optics can be modeled in simple cases by the Helmholtz equation. The computational domain is truncated by a non-reflecting boundary condition. We investigate Schwarz algorithms with a sort of DtN operator, realized by the PML-method, at the interfaces of the sub-domains as an iterative solver. T3 - ZIB-Report - 05-27 KW - perfectly matched layer KW - Helmholtz equation KW - scattering KW - domain decomposition Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8613 ER - TY - GEN A1 - Franzone, Piero Colli A1 - Deuflhard, Peter A1 - Erdmann, Bodo A1 - Lang, Jens A1 - Pavarino, Luca Franco T1 - Adaptivity in Space and Time for Reaction-Diffusion Systems in Electrocardiology N2 - Adaptive numerical methods in space and time are introduced and studied for multiscale cardiac reaction-diffusion models in three dimensions. The evolution of a complete heartbeat, from the excitation to the recovery phase, is simulated with both the anisotropic Bidomain and Monodomain models, coupled with either a variant of the simple FitzHugh-Nagumo model or the more complex phase-I Luo-Rudy ionic model. The simulations are performed with the {\sc kardos} library, that employs adaptive finite elements in space and adaptive linearly implicit methods in time. The numerical results show that this adaptive method successfully solves these complex cardiac reaction-diffusion models on three-dimensional domains of moderate sizes. By automatically adapting the spatial meshes and time steps to the proper scales in each phase of the heartbeat, the method accurately resolves the evolution of the intra- and extra-cellular potentials, gating variables and ion concentrations during the excitation, plateau and recovery phases. T3 - ZIB-Report - 05-30 KW - reaction-diffusion equations KW - cardiac Bidomain and Monodomain models KW - adaptive finite elements KW - adaptive time integration Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8649 ER - TY - THES A1 - Friese, Tilmann T1 - Eine Mehrgitter-Methode zur Lösung des Eigenwertproblems der komplexen Helmholtzgleichung Y1 - 1998 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:188-1999000133 ER - TY - GEN A1 - Prüfert, Uwe A1 - Tröltzsch, Fredi A1 - Weiser, Martin T1 - The convergence of an interior point method for an elliptic control problem with mixed control-state constraints N2 - The paper addresses primal interior point method for state constrained PDE optimal control problems. By a Lavrentiev regularization, the state constraint is transformed to a mixed control-state constraint with bounded Lagrange multiplier. Existence and convergence of the central path are established, and linear convergence of a short-step pathfollowing method is shown. The behaviour of the regularizations are demonstrated by numerical examples. T3 - ZIB-Report - 04-47 KW - interior point methods in function space KW - optimal control KW - mixed control-state constraints KW - Lavrentiev regularization Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8223 ER - TY - GEN A1 - Lopez-Fernandez, Maria A1 - Lubich, Christian A1 - Schädle, Achim T1 - Adaptive, Fast and Oblivious Convolution in Evolution Equations with Memory N2 - To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing $N$ steps requires only $O(N\log N)$ operations and $O(\log N)$ active memory, in place of $O(N^2)$ operations and $O(N)$ memory for a direct implementation. A basic feature of the fast algorithm is the reduction, via contour integral representations, to differential equations which are solved numerically with adaptive step sizes. Rather than the kernel itself, its Laplace transform is used in the algorithm. The algorithm is illustrated on three examples: a blow-up example originating from a Schrödinger equation with concentrated nonlinearity, chemical reactions with inhibited diffusion, and viscoelasticity with a fractional order constitutive law. T3 - ZIB-Report - 06-45 KW - convolution quadrature KW - adaptivity KW - Volterra integral equations KW - numerical inverse Laplace transform KW - anomalous diffusion KW - fractional order visco Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-9399 ER - TY - GEN A1 - Weiser, Martin A1 - Deuflhard, Peter A1 - Erdmann, Bodo T1 - Affine conjugate adaptive Newton methods for nonlinear elastomechanics N2 - The paper extends affine conjugate Newton methods from convex to nonconvex minimization, with particular emphasis on PDE problems originating from compressible hyperelasticity. Based on well-known schemes from finite dimensional nonlinear optimization, three different algorithmic variants are worked out in a function space setting, which permits an adaptive multilevel finite element implementation. These algorithms are tested on two well-known 3D test problems and a real-life example from surgical operation planning. T3 - ZIB-Report - 04-01 KW - affine conjugate Newton methods KW - nonconvex minimization KW - nonlinear elastomechnics KW - cranio-maxillofacial surgery KW - soft tissue simulation KW - multilev Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7768 ER - TY - GEN A1 - Weiser, Martin A1 - Gänzler, Tobias A1 - Schiela, Anton T1 - A Control Reduced Primal Interior Point Method for PDE Constrained Optimization N2 - A primal interior point method for control constrained optimal control problems with PDE constraints is considered. Pointwise elimination of the control leads to a homotopy in the remaining state and dual variables, which is addressed by a short step pathfollowing method. The algorithm is applied to the continuous, infinite dimensional problem, where discretization is performed only in the innermost loop when solving linear equations. The a priori elimination of the least regular control permits to obtain the required accuracy with comparable coarse meshes. Convergence of the method and discretization errors are studied, and the method is illustrated at two numerical examples. T3 - ZIB-Report - 04-38 KW - interior point methods in function space KW - optimal control KW - finite elements KW - discretization error Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8138 ER - TY - GEN A1 - Deuflhard, Peter A1 - Huisinga, Wilhelm A1 - Jahnke, Tobias A1 - Wulkow, Michael T1 - Adaptive Discrete Galerkin Methods Applied to the Chemical Master Equation N2 - \begin{abstract} In systems biology, the stochastic description of biochemical reaction kinetics is increasingly being employed to model gene regulatory networks and signalling pathways. Mathematically speaking, such models require the numerical solution of the underlying evolution equat ion, also known as the chemical master equation (CME). Up to now, the CME has almost exclusively been treated by Monte-Carlo techniques, the most prominent of which is the simulation algorithm suggest ed by Gillespie in 1976. Since this algorithm requires an update for each single reaction event, realizations can be computationally very costly. As an alternative, we here propose a novel approach, which focuses on the discrete partial differential equation (PDE) structure of the CME and thus allows to adopt ideas from adaptive discrete Galerkin methods (as designed by two of the present authors in 1989), which have proven to be highly efficient in the mathematical modelling of polyreaction kinetics. Among the two different options of discretizing the CME as a discrete PDE, the method of lines approach (first space, then time) and the Rothe method (first time, then space), we select the latter one for clear theoretical and algorithmic reasons. First numeric al experiments at a challenging model problem illustrate the promising features of the proposed method and, at the same time, indicate lines of necessary further research. \end{abstract} T3 - ZIB-Report - 07-04 KW - adaptive discrete Galerkin methods KW - adaptive Rothe method KW - discrete Chebyshev polynomials KW - stochastic reactions kinetics KW - chemical master equation Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-9471 ER - TY - GEN A1 - Schädle, Achim A1 - Zschiedrich, Lin A1 - Burger, Sven A1 - Klose, Roland A1 - Schmidt, Frank T1 - Domain Decomposition Method for Maxwell's Equations: Scattering off Periodic Structures N2 - We present a domain decomposition approach for the computation of the electromagnetic field within periodic structures. We use a Schwarz method with transparent boundary conditions at the interfaces of the domains. Transparent boundary conditions are approximated by the perfectly matched layer method (PML). To cope with Wood anomalies appearing in periodic structures an adaptive strategy to determine optimal PML parameters is developed. We focus on the application to typical EUV lithography line masks. Light propagation within the multi-layer stack of the EUV mask is treated analytically. This results in a drastic reduction of the computational costs and allows for the simulation of next generation lithography masks on a standard personal computer. T3 - ZIB-Report - 06-04 KW - domain decomposition KW - conical diffraction KW - electro-magnetic scattering KW - Maxwell's equations KW - Lithography KW - finite elements Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8984 ER - TY - GEN A1 - Lopez-Fernandez, Maria A1 - Palencia, Cesar A1 - Schädle, Achim T1 - A spectral order method for inverting sectorial Laplace transforms N2 - Laplace transforms which admit a holomorphic extension to some sector strictly containing the right half plane and exhibiting a potential behavior are considered. A spectral order, parallelizable method for their numerical inversion is proposed. The method takes into account the available information about the errors arising in the evaluations. Several numerical illustrations are provided. T3 - ZIB-Report - 05-26 KW - Laplace transform KW - numerical inversion KW - parabolic KW - spectral order KW - parallelizable Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8607 ER - TY - THES A1 - Weber, Marcus T1 - Meshless Methods in Confirmation Dynamics Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-10232 ER - TY - THES A1 - Galliat, Tobias T1 - Adaptive Multilevel Cluster Analysis by Self-Organizing Box Maps N2 - Als Cluster Analyse bezeichnet man den Prozess der Suche und Beschreibung von Gruppen (Clustern) von Objekten, so daß die Objekte innerhalb eines Clusters bezüglich eines gegebenen Maßes maximal homogen sind. Die Homogenität der Objekte hängt dabei direkt oder indirekt von den Ausprägungen ab, die sie für eine Anzahl festgelegter Attribute besitzen. Die Suche nach Clustern läßt sich somit als Optimierungsproblem auffassen, wobei die Anzahl der Cluster vorher bekannt sein muß. Wenn die Anzahl der Objekte und der Attribute groß ist, spricht man von komplexen, hoch-dimensionalen Cluster Problemen. In diesem Fall ist eine direkte Optimierung zu aufwendig, und man benötigt entweder heuristische Optimierungsverfahren oder Methoden zur Reduktion der Komplexität. In der Vergangenheit wurden in der Forschung fast ausschließlich Verfahren für geometrisch basierte Clusterprobleme entwickelt. Bei diesen Problemen lassen sich die Objekte als Punkte in einem von den Attributen aufgespannten metrischen Raum modellieren; das verwendete Homogenitätsmaß basiert auf der geometrischen Distanz der den Objekten zugeordneten Punkte. Insbesondere zur Bestimmung sogenannter metastabiler Cluster sind solche Verfahren aber offensichtlich nicht geeignet, da metastabile Cluster, die z.B. in der Konformationsanalyse von Biomolekülen von zentraler Bedeutung sind, nicht auf einer geometrischen, sondern einer dynamischen Ähnlichkeit beruhen. In der vorliegenden Arbeit wird ein allgemeines Clustermodell vorgeschlagen, das zur Modellierung geometrischer, wie auch dynamischer Clusterprobleme geeignet ist. Es wird eine Methode zur Komplexitätsreduktion von Clusterproblemen vorgestellt, die auf einer zuvor generierten Komprimierung der Objekte innerhalb des Datenraumes basiert. Dabei wird bewiesen, daß eine solche Reduktion die Clusterstruktur nicht zerstört, wenn die Komprimierung fein genug ist. Mittels selbstorganisierter neuronaler Netze lassen sich geeignete Komprimierungen berechnen. Um eine signifikante Komplexitätsreduktion ohne Zerstörung der Clusterstruktur zu erzielen, werden die genannten Methoden in ein mehrstufiges Verfahren eingebettet. Da neben der Identifizierung der Cluster auch deren effiziente Beschreibung notwendig ist, wird ferner eine spezielle Art der Komprimierung vorgestellt, der eine Boxdiskretisierung des Datenraumes zugrunde liegt. Diese ermöglicht die einfache Generierung von regelbasierten Clusterbeschreibungen. Für einen speziellen Typ von Homogenitätsfunktionen, die eine stochastische Eigenschaft besitzen, wird das mehrstufige Clusterverfahren um eine Perroncluster Analyse erweitert. Dadurch wird die Anzahl der Cluster, im Gegensatz zu herkömmlichen Verfahren, nicht mehr als Eingabeparameter benötigt. Mit dem entwickelten Clusterverfahren kann erstmalig eine computergestützte Konformationsanalyse großer, für die Praxis relevanter Biomoleküle durchgeführt werden. Am Beispiel des HIV Protease Inhibitors VX-478 wird dies detailliert beschrieben. KW - Biochemical conformations KW - cluster analysis KW - molecular dynamics KW - Perron cluster analysis KW - Self-Organizing Maps KW - Biochemical conformations KW - cluster analysis KW - molecular dynamics KW - Perron cluster analysis KW - Self-Organizing Maps Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:188-2002001258 ER - TY - GEN A1 - Weber, Marcus A1 - Becker, Roland A1 - Köppen, Robert A1 - Durmaz, Vedat T1 - Classical hybrid Monte-Carlo simulations of the interconversion of hexabromocyclododecane N2 - In this paper, we investigate the interconversion processes of the major flame retardant -- 1,2,5,6,9,10-hexabromocyclododecane (HBCD) -- by the means of statistical thermodynamics based on classical force-fields. Three ideas will be presented. First, the application of classical hybrid Monte-Carlo simulations for quantum mechanical processes will be justified. Second, the problem of insufficient convergence properties of hybrid Monte-Carlo methods for the generation of low temperature canonical ensembles will be solved by an interpolation approach. Furthermore, it will be shown how free energy differences can be used for a rate matrix computation. The results of our numerical simulations will be compared to experimental results. T3 - ZIB-Report - 07-31 KW - Markov process KW - molecular dynamics KW - rate matrix Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-10308 SN - 1438-0064 ER - TY - GEN A1 - Götschel, Sebastian A1 - Nagaiah, Chamakuri A1 - Kunisch, Karl A1 - Weiser, Martin T1 - Lossy Compression in Optimal Control of Cardiac Defibrillation N2 - This paper presents efficient computational techniques for solving an optimization problem in cardiac defibrillation governed by the monodomain equations. Time-dependent electrical currents injected at different spatial positions act as the control. Inexact Newton-CG methods are used, with reduced gradient computation by adjoint solves. In order to reduce the computational complexity, adaptive mesh refinement for state and adjoint equations is performed. To reduce the high storage and bandwidth demand imposed by adjoint gradient and Hessian-vector evaluations, a lossy compression technique for storing trajectory data is applied. An adaptive choice of quantization tolerance based on error estimates is developed in order to ensure convergence. The efficiency of the proposed approach is demonstrated on numerical examples. T3 - ZIB-Report - 13-26 KW - monodomain model KW - defibrillation KW - optimal control KW - Newton-CG KW - trajectory storage KW - compression Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-18566 SN - 1438-0064 ER - TY - GEN A1 - Götschel, Sebastian A1 - Weiser, Martin T1 - Lossy Compression for PDE-constrained Optimization: Adaptive Error Control N2 - For the solution of optimal control problems governed by nonlinear parabolic PDEs, methods working on the reduced objective functional are often employed to avoid a full spatio-temporal discretization of the problem. The evaluation of the reduced gradient requires one solve of the state equation forward in time, and one backward solve of the ad-joint equation. The state enters into the adjoint equation, requiring the storage of a full 4D data set. If Newton-CG methods are used, two additional trajectories have to be stored. To get numerical results which are accurate enough, in many case very fine discretizations in time and space are necessary, which leads to a significant amount of data to be stored and transmitted to mass storage. Lossy compression methods were developed to overcome the storage problem by reducing the accuracy of the stored trajectories. The inexact data induces errors in the reduced gradient and reduced Hessian. In this paper, we analyze the influence of such a lossy trajectory compression method on Newton-CG methods for optimal control of parabolic PDEs and design an adaptive strategy for choosing appropriate quantization tolerances. T3 - ZIB-Report - 13-27 KW - optimal control KW - semilinear parabolic PDEs KW - Newton-CG KW - trajectory storage KW - lossy compression Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-18575 SN - 1438-0064 ER - TY - GEN A1 - Weiser, Martin T1 - Faster SDC convergence on non-equidistant grids by DIRK sweeps N2 - Spectral deferred correction methods for solving stiff ODEs are known to converge rapidly towards the collocation limit solution on equidistant grids, but show a much less favourable contraction on non-equidistant grids such as Radau-IIa points. We interprete SDC methods as fixed point iterations for the collocation system and propose new DIRK-type sweeps for stiff problems based on purely linear algebraic considerations. Good convergence is recovered also on non-equidistant grids. The properties of different variants are explored on a couple of numerical examples. T3 - ZIB-Report - 13-30 KW - spectral deferred correction Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-18662 SN - 1438-0064 ER - TY - GEN A1 - Bondouy, Manon A1 - Röblitz, Susanna T1 - Mathematical modeling of follicular development in bovine estrous cycles N2 - Normal follicular growth is a prerequisite for successful fertilization of dairy cows. However, submission rates have been decreasing during the last decades because animals are not ovulating at the planned time of mating or insemination. In this study we use a mathematical model to investigate mechanisms that lead to anestrus. This model is derived by coupling two previously published models: a small model for the development of multiple follicles (Smith et al., 2004), and a large estrous cycle model (St\"otzel et al., 2012). We first investigate the influence of synchronization protocols on the time-shift of ovulation. In a second scenario we simulate an extended period of anestrus as it typically occurs after calving. T3 - ZIB-Report - 12-26 KW - ordinary differential equations KW - systems biology KW - reproduction KW - dairy cows Y1 - 2012 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-15585 SN - 1438-0064 ER - TY - GEN A1 - Tunga, Burcu A1 - Weber, Marcus T1 - Free Energy Calculation Using Mayer Cluster Expansion and Fluctuation Free Integration N2 - This work aims to develop a new algorithm to calculate the free energy of water molecules by using a deterministic way. For this purpose, we assume a closed system confined to a physical volume, having water molecules in gas phase. To calculate the free energy of this sytem we utilized Mayer cluster expansion and the fluctuation free integration method. T3 - ZIB-Report - 12-35 Y1 - 2012 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-16031 SN - 1438-0064 ER - TY - GEN A1 - Plöntzke, Julia A1 - Berg, Mascha A1 - Olany, Amiya A1 - Leonhard-Marek, Sabine A1 - Müller, Kerstin-Elisabeth A1 - Röblitz, Susanna T1 - Modeling potassium balance in dairy cows N2 - Potassium is fundamental for cell functioning including signal transduction, acid-base- and water-metabolism. Since diet of dairy cows is generally rich in potassium, hypokalemia was not in the focus of research for long time. Furthermore, hypokalemia was not frequently diagnosed because blood potassium content is difficult to measure. In recent years, measurement methods have been improved. Nowadays hypokalemia is increasingly diagnosed in cows with disorders such as abomasal displacement, ketosis or down cow syndrome, calling for intensified research on this topic. In this report we describe the development of a basic mechanistic, dynamic model of potassium balance based on ordinary differential and algebraic equations. Parameter values are obtained from data of a clinical trial in which potassium balance and the influence of therapeutic intervention in glucose and electrolyte metabolism on potassium balance in non-lactating dairy cows were studied. The model is formulated at a high abstraction level and includes information and hypotheses from literature. This work represents a first step towards the understanding and design of effective prophylactic feed additives and treatment strategies. T3 - ZIB-Report - 13-09 KW - systems biology KW - differential equations KW - metabolism Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-17749 SN - 1438-0064 ER - TY - GEN A1 - Weber, Marcus A1 - Fackeldey, Konstantin T1 - Computing the Minimal Rebinding Effect Included in a Given Kinetics N2 - The rebinding effect is a phenomenon which occurs when observing a ligand-receptor binding process. On the macro scale this process comprises the Markov property. This Makovian view is spoiled when switching to the atomistic scale of a binding process. We therefore suggest a model which accurately describes the rebinding effect on the atomistic scale by allowing ''intermediate'' bound states. This allows us to define an indicator for the magnitude of rebinding and to formulate an optimization problem. The results form our examples show good agreement with data form laboratory. T3 - ZIB-Report - 13-12 KW - Rebinding KW - Molecular Kinetics KW - Conformation Dynamics Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-17796 SN - 1438-0064 ER - TY - GEN A1 - Winkelmann, Stefanie A1 - Schütte, Christof A1 - von Kleist, Max T1 - Markov Control Processes with Rare State Observation: Theory and Application to Treatment Scheduling in HIV-1 N2 - 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. T3 - ZIB-Report - 13-34 KW - information costs KW - hidden state KW - bellmann equation KW - optimal therapeutic policies KW - diagnostic frequency KW - resource-poor KW - resource-rich Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-41955 SN - 1438-0064 ER - TY - CHAP A1 - Skibina, Julia A1 - Iliew, Rumen A1 - Bethge, Jens A1 - Bock, Martin A1 - Fischer, Dorit A1 - Beloglazov, Valentin A1 - Wedell, Reiner A1 - Burger, Sven A1 - Steinmeyer, Günter T1 - A chirped photonic crystal fiber for high-fidelity guiding of sub-100 fs pluses T2 - CLEO/QELS Y1 - 2009 U6 - https://doi.org/10.1364/CLEO.2009.CMHH1 SP - CMHH1 ER - TY - GEN A1 - Lie, Han Cheng A1 - Fackeldey, Konstantin A1 - Weber, Marcus T1 - A square root approximation of transition rates for a Markov State Model N2 - 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. T3 - ZIB-Report - 13-43 KW - Markov State Models KW - Markov chains KW - meshfree methods KW - metastability KW - Voronoi KW - linear programming Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-42195 SN - 1438-0064 ER - TY - CHAP A1 - Burger, Sven A1 - Zschiedrich, Lin A1 - Pomplun, Jan A1 - Schmidt, Frank T1 - Finite-element based electromagnetic field simulations: Benchmark results for isolated structures T2 - Proc. SPIE Y1 - 2013 U6 - https://doi.org/10.1117/12.2026213 VL - 8880 SP - 88801Z ER -