Thomas Wanner

NA
4papers
39citations
Novelty45%
AI Score21

4 Papers

APDec 4, 2017
Computer-assisted proof of heteroclinic connections in the one-dimensional Ohta-Kawasaki model

Jacek Cyranka, Thomas Wanner

We present a computer-assisted proof of heteroclinic connections in the one-dimensional Ohta-Kawasaki model of diblock copolymers. The model is a fourth-order parabolic partial differential equation subject to homogeneous Neumann boundary conditions, which contains as a special case the celebrated Cahn-Hilliard equation. While the attractor structure of the latter model is completely understood for one-dimensional domains, the diblock copolymer extension exhibits considerably richer long-term dynamical behavior, which includes a high level of multistability. In this paper, we establish the existence of certain heteroclinic connections between the homogeneous equilibrium state, which represents a perfect copolymer mixture, and all local and global energy minimizers. In this way, we show that not every solution originating near the homogeneous state will converge to the global energy minimizer, but rather is trapped by a stable state with higher energy. This phenomenon can not be observed in the one-dimensional Cahn-Hillard equation, where generic solutions are attracted by a global minimizer.

NAOct 12, 2016
Rigorous cubical approximation and persistent homology of continuous functions

Paweł Dłotko, Thomas Wanner

The interaction between discrete and continuous mathematics lies at the heart of many fundamental problems in applied mathematics and computational sciences. In this paper we discuss the problem of discretizing vector-valued functions defined on finite-dimensional Euclidean spaces in such a way that the discretization error is bounded by a pre-specified small constant. While the approximation scheme has a number of potential applications, we consider its usefulness in the context of computational homology. More precisely, we demonstrate that our approximation procedure can be used to rigorously compute the persistent homology of the original continuous function on a compact domain, up to small explicitly known and verified errors. In contrast to other work in this area, our approach requires minimal smoothness assumptions on the underlying function.

NAMay 13, 2009
A sampling inequality for fractional order Sobolev semi-norms using arbitrary order data

Andrew Corrigan, John Wallin, Thomas Wanner

To improve convergence results obtained using a framework for unsymmetric meshless methods due to Schaback (Preprint Göttingen 2006), we extend, in two directions, the Sobolev bound due to Arcangéli et al. (Numer Math 107, 181-211, 2007), which itself extends two others due to Wendland and Rieger (Numer Math 101, 643-662, 2005) and Madych (J. Approx Theory 142, 116-128, 2006). The first is to incorporate discrete samples of arbitrary order derivatives into the bound, which are used to obtain higher order convergence in higher order Sobolev norms. The second is to optimally bound fractional order Sobolev semi-norms, which are used to obtain more optimal convergence rates when solving problems requiring fractional order Sobolev spaces, notably inhomogeneous boundary value problems.

NAAug 24, 2015
Topological Microstructure Analysis Using Persistence Landscapes

Paweł Dłotko, Thomas Wanner

Phase separation mechanisms can produce a variety of complicated and intricate microstructures, which often can be difficult to characterize in a quantitative way. In recent years, a number of novel topological metrics for microstructures have been proposed, which measure essential connectivity information and are based on techniques from algebraic topology. Such metrics are inherently computable using computational homology, provided the microstructures are discretized using a thresholding process. However, while in many cases the thresholding is straightforward, noise and measurement errors can lead to misleading metric values. In such situations, persistence landscapes have been proposed as a natural topology metric. Common to all of these approaches is the enormous data reduction, which passes from complicated patterns to discrete information. It is therefore natural to wonder what type of information is actually retained by the topology. In the present paper, we demonstrate that averaged persistence landscapes can be used to recover central system information in the Cahn-Hilliard theory of phase separation. More precisely, we show that topological information of evolving microstructures alone suffices to accurately detect both concentration information and the actual decomposition stage of a data snapshot. Considering that persistent homology only measures discrete connectivity information, regardless of the size of the topological features, these results indicate that the system parameters in a phase separation process affect the topology considerably more than anticipated. We believe that the methods discussed in this paper could provide a valuable tool for relating experimental data to model simulations.