Cahn–Hilliard-type EquationsRobust Discretization and Efficient Implementation
Cahn–Hilliard-type Equations
Robust Discretization and Efficient Implementation
dc.contributor.advisor | Otto, Felix | |
dc.contributor.author | Penzler, Patrick | |
dc.date.accessioned | 2020-04-13T23:50:47Z | |
dc.date.available | 2020-04-13T23:50:47Z | |
dc.date.issued | 11.05.2009 | |
dc.identifier.uri | https://hdl.handle.net/20.500.11811/4071 | |
dc.description.abstract | In this work, a robust and efficient numerical method to simulate Cahn–Hilliard-type equations is presented. The considered equations are of fourth order and contain two nonlinearities: one is the concentration-dependent mobility and the other one is the potential. Using the fact that Cahn–Hilliard-type equations are a gradient flow, we can derive symmetric time-discrete equations for the flux, even though the mobility is concentration dependent. As time-step scheme, we use the TR-BDF2 scheme. For spatial discretization, we use H(div)-conformal finite elements, more precisely Raviart–Thomas elements. The introduced discrete gradient leads to the appearance of the inverse of the mass matrix. Since there is no mass-lumping method for Raviart–Thomas elements, this inverse is dense. To circumvent this difficulty, we adapt a technique from the area of mixed methods to our situation. It is based on the introduction of inter-element multipliers to guarantee conformality and yields a block-diagonal mass matrix. This approach is up to fifty times faster than more naïve ones like using a matrix-free method. The discretization was efficiently implemented in a space- and time-adaptive finite element software, which was written from scratch in C++. We use the software to simulate Cahn–Hilliard-type equations arising in two different physical contexts. The first one is the decomposition of a binary mixture both for the case of a constant mobility and a double-well potential (shallow quench) and the case of a degenerate mobility and a concave potential (deep quench). The latter is approximated with a variable-quench Ansatz and low temperature. We are able to compute large domains and long times. Theoretical results on the coarsening rate were reproduced accurately. The second application is thin-film crystal growth. We use a diffuse-interface approximation to the standard BCF model which includes the Ehrlich–Schwoebel (ES) barrier. With this approximation we can handle topological changes. As an example, we consider the pinch-off caused by an instability due to the ES barrier. Thanks to the discretization via the flux, we can easily simulate step trains using skew-periodic boundary conditions. | |
dc.language.iso | eng | |
dc.rights | In Copyright | |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | Cahn-Hilliard | |
dc.subject | finite elements | |
dc.subject | concentration dependent mobility | |
dc.subject | phase field equation | |
dc.subject | free boundary problems | |
dc.subject | TR-BDF2 | |
dc.subject | Raviart-Thomas | |
dc.subject | static condensation | |
dc.subject | coarsening | |
dc.subject | molecular beam epitaxy | |
dc.subject | epitaxial growth | |
dc.subject | diffuse interface | |
dc.subject | Ehrlich-Schwoebel | |
dc.subject | pinch-off | |
dc.subject.ddc | 510 Mathematik | |
dc.title | Cahn–Hilliard-type Equations | |
dc.title.alternative | Robust Discretization and Efficient Implementation | |
dc.type | Dissertation oder Habilitation | |
dc.publisher.name | Universitäts- und Landesbibliothek Bonn | |
dc.publisher.location | Bonn | |
dc.rights.accessRights | openAccess | |
dc.identifier.urn | https://nbn-resolving.org/urn:nbn:de:hbz:5N-17445 | |
ulbbn.pubtype | Erstveröffentlichung | |
ulbbnediss.affiliation.name | Rheinische Friedrich-Wilhelms-Universität Bonn | |
ulbbnediss.affiliation.location | Bonn | |
ulbbnediss.thesis.level | Dissertation | |
ulbbnediss.dissID | 1744 | |
ulbbnediss.date.accepted | 09.04.2009 | |
ulbbnediss.fakultaet | Mathematisch-Naturwissenschaftliche Fakultät | |
dc.contributor.coReferee | Rumpf, Martin |
Files in this item
This item appears in the following Collection(s)
-
E-Dissertationen (4067)