Discontinuous Galerkin Finite Element Methods for the Landau-de Gennes Minimization Problem of Liquid Crystals
Ruma Rani Maity, Apala Majumdar, Neela Nataraj

TL;DR
This paper develops and analyzes discontinuous Galerkin finite element methods for modeling equilibrium states of liquid crystals, providing stability, error estimates, and convergence results for the nonlinear Landau-de Gennes minimization problem.
Contribution
It introduces a stable discontinuous Galerkin approach for the nonlinear Landau-de Gennes model, with rigorous error analysis and convergence proofs.
Findings
Stable discretization of the nonlinear problem
Optimal a priori error estimates in energy norm
Quadratic convergence of Newton's method
Abstract
We consider a system of second order non-linear elliptic partial differential equations that models the equilibrium configurations of a two dimensional planar bistable nematic liquid crystal device. Discontinuous Galerkin finite element methods are used to approximate the solutions of this nonlinear problem with non-homogeneous Dirichlet boundary conditions. A discrete inf-sup condition demonstrates the stability of the discontinuous Galerkin discretization of a well-posed linear problem. We then establish the existence and local uniqueness of the discrete solution of the non-linear problem. An a priori error estimate in the energy norm is derived and a best approximation property is demonstrated. Further, we prove the quadratic convergence of Newton's iterates along with complementary numerical experiments.
| Order | Order | |||
|---|---|---|---|---|
| 0.3535 | 0.69481292E-1 | 1.10439646 | 0.37102062E-2 | 2.13551126 |
| 0.1767 | 0.29094563E-1 | 1.06282552 | 0.74601448E-3 | 2.08646636 |
| 0.0883 | 0.13383488E-1 | 1.04108837 | 0.16427963E-3 | 2.04993501 |
| 0.0441 | 0.64047595E-2 | 1.02761427 | 0.38801373E-4 | 2.03044486 |
| 0.0220 | 0.31296010E-2 | 1.01899219 | 0.94539471E-5 | 2.02007895 |
| 0.0141 | 0.19860395E-2 | - | 0.38377918E-5 | - |
| Order | Order | |||
|---|---|---|---|---|
| 0.3535 | 0.20812609E-1 | 2.25360832 | 0.59563518E-3 | 3.22432824 |
| 0.1767 | 0.35369466E-2 | 2.17037967 | 0.50612758E-4 | 3.13307115 |
| 0.0883 | 0.71656832E-3 | 2.12009381 | 0.53034861E-5 | 3.08714692 |
| 0.0441 | 0.15828049E-3 | 2.08449035 | 0.60454668E-6 | 3.05924399 |
| 0.0220 | 0.36909294E-4 | 2.05973780 | 0.71945319E-7 | 3.04117003 |
| 0.0141 | 0.14720321E-4 | - | 0.18516670E-7 | - |
| Order | Order | |||
|---|---|---|---|---|
| 0.3535 | 0.44002858E-2 | 2.76328893 | 0.79005568E-4 | 3.7473338 |
| 0.1767 | 0.81936582E-3 | 2.85612226 | 0.76031244E-5 | 3.8488866 |
| 0.0883 | 0.12772385E-3 | 2.92217824 | 0.59938677E-6 | 3.9184264 |
| 0.0441 | 0.17487379E-4 | 2.95474574 | 0.41209120E-7 | 3.9524773 |
| 0.0220 | 0.22702291E-5 | 2.96925442 | 0.26800851E-8 | 3.9677981 |
| 0.0141 | 0.60334919E-6 | - | 0.45615227E-9 | - |
| Solution | ||||
|---|---|---|---|---|
| D1 | 0 | 0 | ||
| D2 | ||||
| R1 | 0 | |||
| R2 | 0 | |||
| R3 | ||||
| R4 |
| Energy | Order | Order | |||
|---|---|---|---|---|---|
| 0.0883 | 77.80650525 | 3.42185356 | 0.90770236 | 0.23846079E-1 | 1.75592834 |
| 0.0441 | 77.90383430 | 1.90966722 | 0.94082516 | 0.78385873E-2 | 1.83134924 |
| 0.0220 | 77.92229141 | 1.00706128 | 0.95848055 | 0.24465831E-2 | 1.98287313 |
| 0.0110 | 77.94112012 | 0.51823233 | - | 0.61895017E-3 | - |
| Energy | Order | Order | |||
|---|---|---|---|---|---|
| 0.0883 | 86.44084273 | 3.46656699 | 0.90994382 | 0.26417589E-1 | 1.79599363 |
| 0.0441 | 86.53931303 | 1.92787441 | 0.94166745 | 0.82372577E-2 | 1.85335905 |
| 0.0220 | 86.55785529 | 1.01547693 | 0.95848131 | 0.25178324E-2 | 1.99673627 |
| 0.0110 | 86.57670525 | 0.52256273 | - | 0.63088371E-3 | - |
| Max | Order | Order | ||
|---|---|---|---|---|
| 0.195 | 0.19019778 | 1.02678772 | 0.70751443E-2 | 2.07685808 |
| 0.999 E-1 | 0.89721415 E-1 | 1.01083542 | 0.11630918E-2 | 1.92959391 |
| 0.333 E-1 | 0.29026972 E-1 | 0.99787440 | 0.13457407E-3 | 1.90301464 |
| 0.199 E-1 | 0.17390702 E-1 | 0.99496176 | 0.49154393E-4 | 1.86299044 |
| 0.142 E-1 | 0.12534273 E-1 | 1.00852040 | 0.26717823E-4 | 1.89491873 |
| 0.111 E-1 | 0.97316088 E-2 | - | 0.14469534E-4 | - |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Discontinuous Galerkin Finite Element Methods for the Landau-de Gennes Minimization Problem of Liquid Crystals
Ruma Rani Maity111 Department of Mathematics, Indian Institute of Technology Bombay, Powai, Mumbai 400076, India. Email. [email protected] Apala Majumdar* 222* Department of Mathematical Sciences, University of Bath, Claverton Down, Bath BA2 7AY, United Kingdom. Visiting Professor, Indian Institute of Technology Bombay, Powai, Mumbai 400076, India. Email. [email protected] Neela Nataraj333Department of Mathematics, Indian Institute of Technology Bombay, Powai, Mumbai 400076, India. Email. [email protected]
Abstract
We consider a system of second order non-linear elliptic partial differential equations that models the equilibrium configurations of a two dimensional planar bistable nematic liquid crystal device. Discontinuous Galerkin finite element methods are used to approximate the solutions of this nonlinear problem with non-homogeneous Dirichlet boundary conditions. A discrete inf-sup condition demonstrates the stability of the discontinuous Galerkin discretization of a well-posed linear problem. We then establish the existence and local uniqueness of the discrete solution of the non-linear problem. An a priori error estimates in the energy and norm are derived and a best approximation property is demonstrated. Further, we prove the quadratic convergence of Newton’s iterates along with complementary numerical experiments.
Keywords: nematic liquid crystals, energy optimization, Landau-de Gennes energy functional, discontinuous Galerkin finite element methods, error analysis, convergence rate
1 Introduction
Liquid crystals are a transitional phase of matter between the liquid and crystalline phases. They inherit versatile properties of both liquid phase (e.g. fluidity) and, crystalline phase (optical, electrical, magnetic anisotropy) which make them ubiquitous in practical applications ranging from wristwatch and computer displays, nanoparticle organizations to proteins and cell membranes. Liquid crystals present different phases as temperature varies. We consider the nematic phase formed by rod-like molecules that self-assemble into an ordered structure, such that the molecules tend to align along a preferred orientation. There are three main mathematical models for nematic liquid crystals studied in literature which are the Oseen-Frank model [35, 6, 2], Ericksen model [19] and Landau-De Gennes model [17, 39, 16].
We present some rigorous results for the discontinuous Galerkin (dG) formulation of a reduced two-dimensional Landau-de Gennes model, following the model problem studied in [37, 42]. In the reduced Landau-de Gennes theory, the state of the nematic liquid crystal is described by a tensor order parameter, where and is the identity matrix. We refer to as the director or the locally preferred in-plane alignment direction of the nematic molecules; is the scalar order parameter that measures the degree of order about We can write as , where is the director angle in the plane. The general Landau-de Gennes Q-tensor order parameter is a symmetric traceless matrix and we can rigorously justify our -D approach in certain model situations (see [43]).
Since Q is a symmetric, traceless matrix, we can represent Q as a two dimensional quantity, where and . The stable nematic equilibria are minimizers of the Landau-de Gennes energy functional given by subject to appropriate boundary conditions. The bulk energy over the domain is given by , and being temperature and material dependent constants. The one-constant elastic energy is with being an elastic constant. The surface anchoring energy is with the anchoring strength on and prescribed Lipschitz continuous boundary function . The electrostatic energy with depending on vaccum permittivity and material dependent constants and E being the electric field vector. Here ’’ denotes the scalar product of vectors of function entries.
In the absence of surface effects () and external fields (), the Landau-de Gennes energy functional in the dimensionless form considered in this article is given by [37]
[TABLE]
where and is a small positive parameter that depends on the elastic constant, bulk energy parameters and the size of the domain. More precisely, (see [37]) after rescaling and suitable non-dimensionalization, is proportional to the ratio of the nematic correlation length to a characteristic domain size. The nematic correlation length (usually on the scale of nanometers) is typically related to defect core sizes. The limit describes the macroscopic limit where the domain size is much larger than the correlation length i.e. describes micron scale geometries or even larger geometries. Some typical values [37] of these physical parameters are , and . We are concerned with the minimization of the functional for the Lipschitz continuous boundary function . More precisely, the admissible space is The strong formulation of (1.1) seeks such that
[TABLE]
The behavior of as has been studied by Brezis et al in [9] with the assumption and an independent bound for has been established. The minimizers of the energy functional (1.1) for a given smooth boundary data with for a smooth bounded domain has been well-studied [9]. Further, the authors rigorously prove in [9] that as in , where is a harmonic map and is a solution of on on . We are interested in the dG finite element approximation of regular solutions of the boundary value problem (1.2). Let be the Ginzburg-Landau operator defined as . For small enough, the linearized operator is bijective when defined between standard spaces (e.g., ) [40], although the norm of its inverse blows up as .
This model problem has been studied using the conforming finite element method for (1.2) for a *fixed * in [37] on a square domain with consistent tangent boundary conditions. The variational formulation of a more generic Landau-de Gennes model with homogeneous Dirichlet boundary data has been studied [16] in which an abstract approach of the finite element approximation of nonsingular solution branches has been analyzed in the conforming finite element set up. However the analysis for the non-homogeneous boundary conditions has not been considered in this work. In [2] and [36], the authors have discussed a mixed finite element method for the Frank-Oseen and Ericksen-Leslie models for nematic liquid crystals, respectively.
It is well-known that Allen-Cahn equation [1] is the gradient flow equation associated with the Lyapunov energy functional where is a scalar valued function and is a small parameter (not to be confused with the in (1.2)) known as an “interaction length” which is small compared to the characteristic dimensions on the laboratory scale. Numerical approximations of the Allen-Cahn equation have been extensively investigated in the literature. A priori error estimate for the error bounds as a function of have been analyzed and shown to be of polynomial order in by Feng and Prohl in [22], for the conforming finite element approximation of the Allen-Cahn problem. A symmetric interior penalty discontinuous Galerkin method [21] and a posteriori error analysis [23, 7] (which has a low order polynomial dependence on ) have also been studied for Allen-Cahn equation. A dG scheme has been proposed recently in [4] for the - dependent stochastic Allen–Cahn equation with mild space-time noise posed on a bounded domain of . The Allen Cahn work is relevant to time-dependent front propagation in nematic liquid crystals, in certain reduced symmetric situations [38]. The problem considered in this article is different from the Allen Cahn equation; we have a system of two coupled nonlinear partial differential equations (PDEs) in a time independent scenario.
Our motivation comes from the planar bistable nematic device reported in [37]. This device consists of a periodic array of shallow square or rectangular wells, filled with nematic liquid crystals, subject to tangent boundary conditions on the lateral surfaces. The vertical well height is much smaller than the cross-sectional dimensions and hence, it is reasonable to assume invariance in the vertical direction and to model the profile on the bottom cross-section, taking the domain to be a square as opposed to a three-dimensional square well. This model reduction can be rigorously justified using gamma-convergence techniques [25, 43]. The tangent boundary conditions require that the nematic director, identified with the leading eigenvector of the Landau-de Gennes Q-tensor order parameter, lies in the plane of the square and is tangent to the square edges. Indeed, this motivates the choice of the Dirichlet conditions for Q on the square edges as described below. The tangent boundary conditions can also be phrased in terms of surface anchoring energies but this results in mixed boundary-value problems for Q which are relatively more difficult to analyse than the Dirichlet counterparts. Our results can be applied to the planar bistable nematic device; we can model a single well as a square domain with Dirichlet tangent boundary conditions on the square edges and analyze discontinuous Galerkin finite element methods (dGFEMs) to approximate regular solutions of (1.2) for a fixed . This involves a semilinear system of PDEs with a cubic nonlinearity (see (1.2)) and non-homogeneous boundary conditions. As reported in [37, 42], there are six experimentally observed stable nematic equilibria, labeled as diagonal and rotated states, for this model problem. The nematic director roughly aligns along one of the square diagonals in the diagonal states whereas the director rotates by radians between a pair of opposite parallel edges, in a rotated state. There are two diagonal states, since there are two square diagonals, and four rotated states related to each other by a rotation. The dGFEMs are attractive because they are element-wise conservative, are flexible with respect to local mesh adaptivity, are easier to implement than finite volume schemes, allow for non-uniform degrees of approximations for solutions with variable regularity over the computational domain and can handle non-homogeneous boundary condition in a natural way. These methods also relax the inter-element continuity requirement in conforming FEM. An a priori error analysis of dGFEMs for general elliptic problems has been derived in [41, 28, 27]. For a comprehensive study of several dGFEMs applied to elliptic problems, see [5]. The dGFEMs are also well studied for fourth order elliptic problems [13, 24]. Recently, dGFEMs have been studied for the von Kármán equations [13] that involves a quadratic non-linearity and homogeneous boundary conditions.
To the best of our knowledge, dGFEMs have not been analysed for the nonlinear system derived from the reduced two-dimensional Landau-de Gennes energy in (1.1) and this is the primary motivation for our study. Our contributions can be summarized as follows.
We derive an elegant representation of the nonlinear operator, convergence analysis with -* dependency* and a priori error estimate of a dGFEM formulation for the system (1.2) with non homogeneous boundary conditions. The choice of the discretization parameter that depends on ensures that (i) the dG discretization of a linearized problem is well-posed and (ii) the corresponding discrete non-linear problem has a unique solution following applications of contraction mapping theorem. 2. 2.
We prove a best approximation result for regular solutions of the non-linear problem (1.2). 3. 3.
We prove the quadratic convergence of the Newton’s iterates to the approximate dGFEM solution. 4. 4.
Our numerical results confirm the theoretical orders of convergence and rate of convergence as a function of and , in the context of the planar bistable nematic device and other representative examples.
Throughout the paper, standard notations on Sobolev spaces and their norms are employed. The standard semi-norm and norm on for positive real numbers, are denoted by and . The standard inner product is denoted by . We use the notation (resp. ) to denote the product space . The standard norms () in the Sobolev spaces () defined by for all for all The norm on space is defined by for all Set and . The inequality abbreviates with the constant independent of mesh-size parameter and . The constants that appear in various Sobolev imbedding results in the sequel are denoted using a generic notation .
The paper is organised as follows. In Section 2, we present the model problem along with the weak formulation and some preliminary results. We state the dG finite element formulation of the problem in Subsection 3.1 and our main results are stated in Subsection 3.2. The existence and uniqueness of the discrete solution of the non-linear problem, error estimates, best approximation result and the convergence of Newton’s method are presented as main theorems. Section 4 contains some auxiliary results needed to prove the main results. A discrete inf-sup condition for a discrete bilinear form has been established. In Section 5, we prove the main theorems. A contraction map has been defined on the discrete space to use a fixed point argument for proving the existence and uniqueness of discrete solution. An alternative proof of the existence and uniqueness of the solution of the discrete problem using Newton-Kantorovich theorem has been given in this section. This is followed by a proof of the quadratic convergence of Newton’s method and numerical results that are consistent with the theoretical results in Section 6.
2 Preliminaries
In this section, we introduce the weak formulation for (1.2) and establish some boundedness results. The details of derivation of the weak formulation in presented in A.1.
In the weak formulation of (1.2), we seek such that
[TABLE]
where for all and
[TABLE]
Remark 2.1*.*
When ,
[TABLE]
The operator corresponds to the non-linear part of the system (1.2). Such representation of yields nice properties proven in Lemma 2.3 which makes the analysis elegant.
Lemma 2.2**.**
(Poincaré inequality)**[33]** Let be a bounded open Lipschitz domain in Then there exists a positive constant such that
[TABLE]
The boundedness and coercivity of and the boundedness of given below can be easily verified. For all , ,
[TABLE]
where depends on The next lemma establishes two boundedness results for .
Lemma 2.3**.**
(Boundedness of )* For all , , , ,*
[TABLE]
and for all , , ,
[TABLE]
Proof.
It is enough to prove the results for ; then (2.6) and (2.7) follow from the definition of and a grouping of the terms. For , a use of Hölder’s inequality and the Sobolev imbedding result [20] leads to (2.6) as
[TABLE]
For , , a use of the Sobolev imbedding result and the Cauchy-Schwarz inequality leads to
[TABLE]
where in the last two inequalities above absorbs and the constant from . ∎
The existence of minimizers of (1.1) follows from the coercivity of and its convexity in in (1.1) and this implies the existence of a solution of the non-linear system in (2.1). The regularity result in the next lemma follows from arguments in [16, 26] and in detailed in A.2.
Lemma 2.4** (Regularity result).**
Let be an open, bounded, Lipschitz and convex domain of Then for any solution of (1.2) belongs to .
In this article, we approximate regular solutions [32] of (1.2) for a given . The regularity of solution implies that the linearized operator is invertible in the Banach space and is equivalent to the following inf-sup condition [18]
[TABLE]
where and the inf-sup constant depends on . From now onwards, the subscript in is suppressed in the sequel for notational brevity.
3 Discrete formulation
In this section, we derive the dGFEM formulation for (1.2) and state our main results.
3.1 The dGFEM formulation
Let be a triangulation [14] of into triangles and let the discretization parameter associated with the partition be defined as where . Let ( resp. ) denote the interior (resp. boundary) edges of and . Also, the boundary of an element is denoted by and the unit normal vector outward from is denoted by For any interior edge shared by two triangles and , let the unit normal pointing from to be [see Figure 1]. We assume the triangulation be shape regular [14] in the sense that there exists such that if is the diameter of , then contains a ball of radius in its interior.
For a positive integer , define the broken Sobolev space by equipped with the broken norm Denote to be the product space with the norm For , we define the broken gradient by Follow the standard convention [41] for the jump and average. Consider the finite dimensional space that consists of piecewise linear polynomials defined by and equip it with the mesh dependent norm defined by where is the penalty parameter. Let be equipped with the product norm defined by
The discontinuous Galerkin formulation corresponding to (1.2) seeks such that for all
[TABLE]
where for ,
[TABLE]
and for , ,
[TABLE]
Remark 3.1*.*
The parameter values corresponds to symmetric interior penalty, incomplete interior penalty and non-symmetric interior penalty dG methods, respectively in the context of linear problems.
3.2 The main results
Our main results are given below. The proofs are presented in Sections 5 and 6. The details of the suppressed constants in ’’ in the Theorems 3.2 - 3.5 will be made clear in the proofs given in Section 5.
Theorem 3.2** (Existence, uniqueness and dG norm error estimate).**
Let be a regular solution of the non-linear system (2.1). For a given fixed sufficiently large and sufficiently small discretization parameter chosen as for any , there exists a unique solution of the discrete non-linear problem (3.1) that approximates such that
[TABLE]
Theorem 3.3** (Best approximation result).**
Let be a regular solution of the non-linear system (2.1). For a given fixed sufficiently large and sufficiently small discretization parameter chosen as with , the unique discrete solution of (3.1) that approximates satisfies the best-approximation property
[TABLE]
Remark 3.4*.*
Theorem 3.3 shows that discrete solution is "the best" approximation of in , up to a constant. Best approximation result is mainly motivated by "the best" approximation of discrete solution of linear PDEs in Céa’s lemma [14] for conforming FEM.
We establish the norm error estimate when the parameter that appears in the discrete non-linear system (3.1) (in the term through ) takes the value .
Theorem 3.5** ( norm error estimate).**
Let be a regular solution of the non-linear system (2.1). For a given fixed sufficiently large and sufficiently small discretization parameter chosen as for , there exists a unique solution of the discrete non-linear problem (3.1) that approximates such that
[TABLE]
We use Newton’s method [32] for computation of discrete solutions. It is a standard and very effective root-finding method to approximate the roots of non-linear system of PDEs.
Theorem 3.6** (Convergence of Newton’s method).**
Let be a regular solution of the non-linear system (2.1) and let solve (3.1). For a given fixed sufficiently large and sufficiently small discretization parameter chosen as with , there exists , independent of , such that for any initial guess with , it follows for all and the iterates of Newton’s method are well-defined and converges quadratically to that is, where is a constant independent of .
4 Auxiliary results
This section presents some auxiliary results needed to establish the main results in Subsection 3.2. The boundedness and ellipticity results for , and the boundedness result for , are proved and the inf-sup conditions for a discrete linearized bilinear form and a perturbed bilinear form are established.
Lemma 4.1**.**
(Poincaré type inequality)**[34, 11]** For , there exists a constant independent of and such that for ,
For boundedness and coercivity results of and the boundedness results of and , it is enough to prove the corresponding results for , and , respectively.
Lemma 4.2**.**
(Boundedness and coercivity of )* [41] For ,*
[TABLE]
where depends on the penalty parameter and the constant from trace inequality. For a sufficiently large parameter , there exists a positive constant such that
[TABLE]
Lemma 4.3**.**
(Boundedness of and )* For , it holds that*
[TABLE]
and for all , , ,
[TABLE]
where the hidden constant in depends on the constants from , and .
Proof.
We prove the boundedness results for and . Then a use of definitions of and , discrete Cauchy-Schwarz inequality and a grouping of the terms yields the required results. For and , a use of Holder’s inequality and Cauchy-Schwarz inequality along with Lemma 4.1 leads to
[TABLE]
The proof of (4.2) follows analogously to that of the proof of (2.7) with a use of the imbedding result and Cauchy-Schwarz inequality. ∎
Remark 4.4*.*
A use of (4.3) leads to the following boundedness estimate
[TABLE]
The next two lemmas describe the estimates for interpolation and enrichment operators that are crucial for the error estimates.
Lemma 4.5**.**
(Interpolation estimate)**[12]** For , there exists such that for any ,
[TABLE]
for and some positive constant independent of .
Lemma 4.6**.**
(Enrichment operator).* [11, 30] Let be an enrichment operator with being the Lagrange conforming finite element space associated with the triangulation . Then for any , the following results hold:*
[TABLE]
where and are constants independent of .
For all , define the discrete bilinear form by
[TABLE]
Theorem 4.7**.**
Let be a regular solution of the non-linear system (2.1). For a given fixed a sufficiently large and a sufficiently small discretization parameter chosen such that , there exists a constant such that the following discrete inf-sup condition holds:
[TABLE]
Proof.
For Lemma 4.3, (2.5) and (2.7) yield , and . Therefore, for a given with , there exist and that solve the linear systems
[TABLE]
A use of Lemmas 4.1, 4.3 and elliptic regularity leads to
[TABLE]
where the hidden constant in depends on , and . Subtract (4.4a) from (4.4b), choose and use (2.4) and (4.2) to obtain
[TABLE]
A use of Lemma 4.6 in (4.6) yields
[TABLE]
where the constant hidden in depends on and . Since is regular solution of (2.1), a use of (2.8) yields that there exists with such that
[TABLE]
A use of (4.4b), (2.4), an introduction of intermediate terms and triangle inequality leads to
[TABLE]
Since on and on , a use of second inequality in Lemma 4.6 and the triangle inequality yields
[TABLE]
Since Lemma 4.2 implies that there exists with such that
[TABLE]
A use of Lemmas 4.3 and 4.6 yields the estimates for the second and third terms in (4.10) as
[TABLE]
A use of Lemmas 4.2, 4.5 and 4.6 leads to
[TABLE]
A combination of (4.11) and (4.12) in (4.10) leads to
[TABLE]
where includes a constant that depends on and A substitution of (4.13) in (4.9) and a use of Lemma 4.5 yields
[TABLE]
Moreover, a use of (4.13), (4.14), Lemma 4.5 and (4.7) in (4.8) yields
[TABLE]
A use of triangle inequality, (4.14), (4.15) and (4.5) leads to
[TABLE]
where the constant is independent of and . Therefore, for a given , the discrete inf-sup condition holds with for . ∎
We use the perturbed bilinear form defined as for all in our analysis and Newton’s algorithm in our manuscript. The next lemma establishes discrete inf-sup condition for the perturbed bilinear form.
Lemma 4.8**.**
(Stability of perturbed bilinear form).* Let be a regular solution of (2.1) and be the interpolation of from Lemma 4.5. For a given fixed a sufficiently large and a sufficiently small discretization parameter chosen as , the perturbed bilinear form satisfies the following discrete inf-sup condition*
[TABLE]
Proof.
For ,
[TABLE]
A use of (3.2) and Remark 4.4 lead to
[TABLE]
[TABLE]
A use of Theorem 4.7, (4.1) and Lemma 4.5 leads to
[TABLE]
where the constant depends on , , , and . Hence, for a sufficiently small choice of with , the required result holds for ∎
5 Proof of main results
The proofs of main results use some preliminary results that are established first. First the non-linear map is defined on the discrete space and in Theorem 5.1 it is established that maps a closed convex set to itself and the fixed point of is a solution of the discrete non-linear problem in (3.1) and vice-versa. For , define the map, by
[TABLE]
The map is well-defined and this follows from the inf-sup conditions of in Lemma 4.8. We use the abbreviation in the rest of the article for notational convenience. Let The existence and uniqueness result of the discrete solution in Theorem 3.2 is an application of Brouwer’s fixed point theorem. Then, the energy norm error estimate is presented. As an alternative approach, the existence and uniqueness of discrete solution is established using Newton-Kantorovich theorem and is followed by the best approximation result.
Theorem 5.1** (Mapping of ball to ball).**
Let be a regular solution of the non-linear system (2.1). For a given fixed a sufficiently large and a sufficiently small discretization parameter chosen as with , there exists a positive constant such that maps the ball to itself;
[TABLE]
Proof.
The solution of (2.1) that belongs to satisfies the dG formulation
[TABLE]
A use of the definition and linearity of , (5.1) and (5.2) leads to
[TABLE]
A use of Lemmas 4.2, 4.3 and 4.5 yields
[TABLE]
A rearrangement of the terms in and a use Lemmas 4.3 and 4.5 lead to
[TABLE]
Set and use definition of , a regrouping of terms and Remark 4.4 to obtain
[TABLE]
The hidden constants in in the estimates of , and depend on , , , and . A substitution of the estimates for , , and in (5) with a use of leads to
[TABLE]
A use of Lemma 4.8 yields that there exists a with such that
[TABLE]
A use of (5.4) and in (5.5) leads to
[TABLE]
where is a positive constant that depends on , , , , and . Assume with so that . Choose For with , we obtain
[TABLE]
Since and This completes the proof of Theorem 5.1 . ∎
Remark 5.2*.*
We derive error estimates with - dependency, for a given fixed . This provides a sufficient condition on the choice of the discretization parameter for a given fixed that ensures convergence. A large value of would require a very small value of . Equally, a very small choice of would require from the estimates above. In this respect, the choices and lead to computationally expensive scenarios and we only focus on bounded values of in this manuscript.
Lemma 5.3** (Contraction result).**
For a given fixed a sufficiently large and a sufficiently small discretization parameter chosen as with , the following contraction result holds: ,
[TABLE]
with some positive constant independent of and .
Proof.
Let and . For , a use of (5.1), the definition and linearity of , an elementary manipulation and grouping of term lead to
[TABLE]
Set , and . A use of Remark 4.4, and yields
[TABLE]
A use of (5) and Lemma 4.8 yields that there exists a with such that
[TABLE]
The hidden constant in depends on , , and . A use of with in (5.8) implies and this completes the proof of Lemma 5.3. ∎
Remark 5.4*.*
Note that we require only to prove the discrete inf-sup conditions in Theorem 4.7 and Lemma 4.8, whereas we need with to prove Theorem 5.1 and Lemma 5.3.
Now we present the proof of results stated in Subsection 3.2.
Proof of Theorem 3.2.
Let be a regular solution of the non-linear system (2.1) and let solve (3.1). A use of Theorem 5.1 yields that maps a non-empty convex closed subset of a finite dimensional vector space to itself. Also, is continuous. Therefore an application of the Brouwer fixed point theorem [33] yields that has at least one fixed point, say in this ball (for details see A.3). That is,
[TABLE]
The contraction result in Lemma 5.3 establishes the uniqueness of the solution of (3.1) for a sufficiently small . The proof of error estimate is straightforward using Lemma 4.5 and (5.9). ∎
An alternative approach using Newton-Kantorovich theorem also provides an explicit formula for the radius of the ball and proves the existence and uniqueness of discrete solution.
The Newton scheme below is motivated by and in place of and , respectively, a substitution of in (5.1) and a use of definition of in Lemma 4.8. These substitutions yield
[TABLE]
Theorem 5.5**.**
[29, 44, 32]** Suppose that the mapping is Fréchet differentiable on a open convex set , and the derivative is Lipschitz continuous on with Lipschitz constant . For a fixed starting point the inverse exists as a continuous operator on The real numbers and are chosen such that
[TABLE]
and Also, the first approximation has a property that the closed ball lies within the domain of definition where Then the following are true.
Existence and uniqueness. There exists a solution and the solution is unique on that is on a suitable neighborhood of the initial point with 2. 2.
Convergence of Newton’s method. The Newton’s scheme with initial iterate leads to a sequence in , which converges to with error bound
[TABLE]
Theorem 5.6** (Existence and uniqueness of discrete solution).**
Let be a regular solution of the continuous non-linear system for all For a given fixed a sufficiently large and a sufficiently small discretization parameter chosen as with , the following results hold true:
there exists a solution to for all such that where with defined in Theorem 5.5. The constant depends on and , 2. 2.
there is at most one solution to for all in with where the constant depends on , , , , , and , a constant from Lipschitz continuity of 3. 3.
the sequence of iterates converges to and the error bound is given by
[TABLE]
Proof.
A use of the definition of , Lemma 4.3 and a simple manipulation leads to the fact that is Lipschitz continuous on with Lipschitz constant where is a constant independent of For a choice of , Lemma 4.8 yields
[TABLE]
with Given with (5.2) leads to
[TABLE]
A use of the estimates of from (5) yields
[TABLE]
where the constant depends on , , , and . A use of (5.14) and (5.15) yields
[TABLE]
where A sufficiently small choice of with leads to with . For a choice of with Therefore, an application of Theorem 5.5 yields the existence of the discrete solution with and . A use of the second part of Theorem 5.5 yields the error bound which justifies the choice of in Theorem 5.1. A use of triangle inequality, Lemma 4.5 and the second estimate in (5.11) for the first Newton correction leads to
[TABLE]
A substitution of and in (5.12) yields the error bound in the Newton’s convergence given by (5.13). ∎
Proof of Theorem 3.3.
Let be the best approximation of in . Then
[TABLE]
Set A use of Theorem 4.7 yields that there exists a with such that
[TABLE]
Set . A use of Taylor series expansion of around leads to
[TABLE]
A use of (3.1) and (5.2) lead to
[TABLE]
Rewrite . A use of the linearity of , (5.16) and the above equality leads to
[TABLE]
Since and a use of Lemmas 4.2 and 4.3 leads to
[TABLE]
The constant in depends on , , and . A use of (5.16) and (5.18) in (5.17) yields
[TABLE]
The triangle inequality and (5.19) leads to
[TABLE]
For a sufficiently small choice of the discretization parameter with , use in Theorem 3.2 and (5.20) to obtain
[TABLE]
where the constant depends on , , , and . Since , a sufficiently small choice of with completes the proof of Theorem 3.3 for ∎
The next two lemmas are required to prove Theorem 3.5.
Lemma 5.7**.**
For , any , and the interpolation satisfy
[TABLE]
Proof.
A use of definition of , on on and integration by parts yields
[TABLE]
We have Since for all A use of Cauchy-Schwartz inequality and Lemma 4.5 leads to,
[TABLE]
where the constant suppressed in depends on This concludes the proof. ∎
For given and that solves (1.2), consider the linear dual problem:
[TABLE]
The weak formulation that corresponds to (5.21) seeks such that
[TABLE]
A use of (2.8) establishes the well-posedness of (5.22).
Lemma 5.8**.**
A solution of (5.22) belongs to and satisfies where the hidden constant in depends on and
Proof.
A use of (2.8) and (5.22) yields
[TABLE]
A use of (2.5) and (2.7) implies that . Hence, the elliptic regularity [20] with a boot-strapping argument and (5.23) completes the proof. ∎
Proof of Theorem 3.5.
Set in (5.21). Multiply (5.21) by and integrate by parts to obtain
[TABLE]
Here, Note that the terms that involve in the definition of are zero. However, they are retained for the ease of further manipulations. A use of (3.1) and the fact that satisfies the discrete formulation (3.1) leads to
[TABLE]
Lemmas 4.2, 4.3, 4.5 and 5.7 and Theorem 3.2 yield
[TABLE]
[TABLE]
Set and estimate as in of Theorem 5.1 and use Theorem 3.2 to obtain
[TABLE]
A combination of the estimates for , , and in (5.25) and a use of Lemma 5.8 yields
[TABLE]
A use of (5.26) and triangle inequality yields
[TABLE]
where the constants suppressed in depends on , , , , and . This completes the proof of Theorem 3.5. ∎
6 Numerical Implementation
In Subsection 6.1, we prove Theorem 3.6. The second subsection discusses results of numerical experiments that justify the theoretical estimates.
6.1 Convergence of Newton’s method
Now we establish that Newton iterates in (5) converges quadratically to the discrete solution. The proof follows by modification of the approach used in [13]. While the linearized operator in [13] has a system of bilinear and trilinear forms; in this case we have system of bilinear and quadrilinear forms that leads to modification in the bounds. Moreover, the choice of the radius of the ball in which the initial guess needs to be chosen so as the Newton’s method converges depends on the non-linearity and needs to be chosen carefully. The effect of the parameter is also considered in this proof.
Proof of Theorem 3.6.
Following the proof of Lemma 4.8, for a sufficiently small choice of the discretization parameter there exists a sufficiently small constant independent of such that for each that satisfies , the bilinear form
[TABLE]
satisfies discrete inf-sup condition given by
[TABLE]
For a sufficiently small choice of the discretization parameter with , (5.9) leads to
[TABLE]
Assume that the initial guess satisfies A use of this and (6.3) along with a triangle inequality leads to
[TABLE]
Therefore, in (6.1) leads to the discrete inf-sup condition for , and this implies that there exists a unique ( which is the first Newton iterate in (5) ) satisfying the well-posed system
[TABLE]
The discrete inf-sup condition (6.2) implies the existence of a with such that
[TABLE]
A use of (6.1), (6.5) and (3.1) in (6.6) yields
[TABLE]
The right hand side of (6.1) is estimated analogous to in Theorem 5.1. This followed by a use of the triangle inequality and (6.3) leads to
[TABLE]
where the constant depends on , and A choice of yields . A use of this estimate, (6.3) and triangle inequality yields Also, where depends on , and .
Therefore, and satisfies for Assume that this holds for some Then, in (6.1) leads to the discrete inf-sup condition for which implies that there exists a unique satisfying the well-posed system
[TABLE]
Then, a use of (6.2) and following the proof for , we obtain
[TABLE]
Since , and with a quadratic convergence rate given by This completes the proof using mathematical induction. ∎
6.2 Numerical experiments
In this subsection, the computational error and convergence rate of discrete solutions for dGFEM are illustrated for some benchmark problems. We study the convergence of discrete solutions, for various values of . These numerical experiments have been implemented using FEniCS [3] library and the results support the theoretical findings (for the details of implementation procedure see A.4). Let and be the error and the mesh parameter at the -th level, respectively. The -th level experimental order of convergence is defined by for and corresponds to the final iteration considered in numerical experiments.
Example 6.2.1*.*
For the problem (1.2), set and the parameter value . Compute the right hand side for the manufactured exact solution and
We discretise the domain into triangles and in the uniform refinement process, each triangle is divided into four similar triangles. Tables 1, 2 and 3 present the numerical errors and orders of convergence in energy and norms computed using piecewise polynomials of degree and , respectively.
Remark 6.1*.*
This numerical example verifies that the theoretical convergence rates obtained in energy norm (resp. norm) are , and (resp. and ) for piecewise , and polynomial approximations. Improved rate of convergences suggest an improvement in the theoretical estimates if the exact solution is smooth. The convergence analysis for - dGFEM taking into account the effect of -- dependency is a problem of future interest.
Example 6.2.2*.*
Consider the problem (1.2) in We will approximate the system (1.2) using the Dirichlet boundary condition [37] given by
[TABLE]
where the parameter and the trapezoidal shape function is defined to be
[TABLE]
This example is motivated by the benchmark problem studied in [37]. There are two classes of stable experimentally observable configurations [see Figure (2)]: the diagonal states for which the director is aligned along the cell/square diagonals and the rotated states, for which the directors rotate by -radians across the width of cell.
We use Newton’s method to approximate the six different solutions corresponding to the D1, D2, R1, R2, R3 and R4 states. We compute six different initial conditions by solving the Laplace equation [37] with Dirichlet boundary conditions as specified in Table 4. For example, in the D1 case, the system is solved using dGFEM. Then the corresponding initial condition for Newton’s method (for the Landau-de Gennes mdodel) is defined to be
[TABLE]
where at the interior nodes and at the boundary nodes. We obtain the expected theoretical convergence rates using piecewise linear polynomial in dG and norm as and , respectively. In Tables 5 and 6, we record the computational errors and convergence rates of solutions for the diagonal state D1 and rotated state R1 respectively for . Similar errors and optimal convergence rates are obtained for D2, R2, R3 and R4 solutions. In Figure 2, we plot the converged director plots and scalar order parameter for the six states, D1, D2, R1, R2, R3 and R4, respectively. In Figures 3 - 5, we plot the level curves of the corresponding converged D1 and D2 diagonal, R1, R2, R3 and R4 rotated solutions.
Figure 6 plots the dG error vs the discretization parameter for various values of . Note that errors are sensitive to the choice of discretization parameter as decreases. It is difficult to verify the exact dependence of and from these numerical results, except that as , smaller mesh-sizes are needed for convergence.
Remark 6.2*.*
In [37], the authors study the model problem of nematic-filled square wells in the conforming FEM set up and present numerical errors and convergence rates for conforming FEM, in and norm to be of and respectively, for the six different stable states. However, they do not study the convergence trends as a function of and do not establish the theoretical order of convergence.
Example 6.2.3*.*
Consider an annular domain filled with the compound , a standard liquid crystal material [15]. We consider the weak formulation of the Euler-Lagrange equations for a reduced two-dimensional Landau-de Gennes energy as in [15]
[TABLE]
where is a constant that depends on the material parameters and of the liquid crystal. The parameter values are and for the compound . The domain has an outer radius and the inner radius , where is the characteristic length scale. The ratio () of the inner to the outer radius has been chosen to be to capture the radial solution analyzed by Bethuel et al. [8]. In [8], the authors study the Oseen-Frank radial solution in this annulus within the one-constant framework with energy given by , where is an elastic constant. The radial solution is simply given by . In the reduced Landau-de Gennes framework, the corresponding manufactured solution, , is defined by , or equivalently , is the Oseen-Frank radial solution studied in [15] and is the identity matrix. The data and are calculated by substituting this manufactured solution into the left-hand side of (6.10).
We use dGFEM formulation based on piecewise linear polynomials over triangles, to study the convergence of the discrete solution to this manufactured solution. The mesh is generated using mshr, the mesh generation component in FEniCS. The curved boundary is approximated using polygons. The errors and order of convergences in both energy and norms are tabulated in Table 7 and the results are consistent with our theoretical estimates. In Figure 7a, we plot the initial triangulation for the annular domain and in Figures 7b - 7c, we plot the level curves of the corresponding converged radial solution.
Remark 6.3*.*
In [15], (6.10) is implemented using conforming FEM and the numerical orders of convergences in and norms are observed to be of orders of and , respectively. However, the theoretical error estimates are not derived in [15].
7 Conclusion
The paper focuses on a rigorous dG formulation of the model problem studied in [37, 42]. It is not clear if the dG formulation gives us any additional physical insight for this model problem, at least for micron-sized wells. However, dG methods combined with a posteriori error analysis generally work well for problems with less regularity and with non-homogeneous boundary conditions or for singular liquid crystal potentials as proposed by Katriel et.al [31] and studied in [6], or when (sharp interface limit). Hence, we expect our work to be foundational for subsequent cutting-edge numerical studies of interfacial phenomena, higher-dimensional defects, quenching phenomena for LCs which are necessarily characterized by singular behavior. A particularly interesting application would be the dG formulation of the continuum theory of ferronematics [10]. Ferronematics in confinement naturally exhibit domain walls and interior point defects and it would be interesting to see how dG results compare to numerical results from confoming FEM, particularly near structural defects e.g. nematic vortices and boundary layers.
Acknowledgements
R.M. gratefully acknowledges support from institute Ph.D. fellowship and the Visiting Postgraduate Scholar scheme run by the University of Bath. A.M. gratefully acknowledges hospitality from IIT Bombay. A.M. is supported by an EPSRC Career Acceleration Fellowship EP/J001686/1 and EP/J001686/2, University of Bath Internationalisation schemes and an OCIAM Visiting Fellowship, the Keble Advanced Studies Centre. N.N. gratefully acknowledges support from the Faculty of Science at the University of Bath and the support by DST SERB MATRICS grant MTR/2017/000 199. The authors gratefully acknowledge Prof. M. Vanninathan for the insightful discussions and also the HPC facility of IIT Bombay for the computational resources. The authors thank the referees for the constructive comments that has improved the quality of the paper significantly.
Appendix A Appendix
A.1 Derivation of weak formulation
The Landau-de Gennes energy functional considered in this article is given by
[TABLE]
with Dirichlet boundary condition on Consider the real valued function with Since is a minimizer of and on has a minimum at Therefore, A manipulation using the definition of leads to
[TABLE]
which yields the weak formulation (2.1) in operator form. The operator form in (2.1) has a representation of the nonlinear part in terms of and this is crucial for an elegant analysis.
A.2 Regularity result
Theorem A.1**.**
[26]** [33] Let be a convex, bounded and open subset of with smooth boundary Then, for and , there exists a such that
Proof of Lemma 2.4.
Rewrite the system (1.2) as: where . Expand the expression for , where , use the Sobolev embedding result for all , and the Hölder’s inequality to prove that Now a use of Theorem A.1 and a bootstrapping argument [20] imply that the solution of (1.2) belongs to . ∎
A.3 Details of proof of Theorem 3.2
Theorem A.2** (Brouwer fixed point theorem).**
[33]** Let be a finite dimensional Hilbert space and be a continuous map from a non-empty, compact and convex subset of which maps into Then has a fixed point on .
A use of Lemma 5.3 yields that is Lipschitz continuous on the ball . Set and . Theorem 5.1 yields maps to itself. Therefore, an application of Theorem A.2 yields that has a fixed point, say . Now we prove any fixed point of is a solution of (3.1). Since is a fixed point of the map , we have
[TABLE]
A use of (5.1) on the left hand side and definition of on the right hand side leads to
[TABLE]
This implies solves (3.1). The uniqueness of the solution follows from the contraction result in Lemma 5.3.
A.4 Implementation procedure
We compute the approximate solutions using Newton’s method. To compute the initial guess in Example 6.2.2, first solve the Oseen-Frank system
[TABLE]
with the corresponding Dirichlet boundary condition, say . The details of boundary functions corresponding to each diagonal and rotated solution can be found in Table 4. The dG formulation corresponding to (A.1) seeks such that for all
[TABLE]
**Algorithm
**
In Examples 6.2.1 and 6.2.3, where the exact solutions are known, the initial guesses for the Newton’s method are chosen as the solutions of the corresponding linear systems.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. W. Cahn and S. M. Allen, A microscopic theory for domain wall motion and its experimental verification in Fe-Al alloy domain growth kinetics , Journal De Physique. Colloques 38 (1977), C 7–51–C 7–54.
- 2[2] J. H. Adler, T. J. Atherton, D. B. Emerson, and S. P. Mac Lachlan, An energy-minimization finite-element approach for the Frank-Oseen model of nematic liquid crystals , SIAM Journal on Numerical Analysis 53 (2015), no. 5, 2226–2254.
- 3[3] M. S. Alnæs, J. Blechta, J. Hake, A. Johansson, B. Kehlet, A. Logg, C. Richardson, J. Ring, M. E. Rognes, and G. N. Wells, Fenics , https://fenicsproject.org/fenics 19/.
- 4[4] D. C. Antonopoulou, Space–time discontinuous Galerkin methods for the ϵ italic-ϵ \epsilon -dependent stochastic Allen–Cahn equation with mild noise , IMA Journal of Numerical Analysis (2019).
- 5[5] D. N. Arnold, F. Brezzi, B. Cockburn, and D. Marini, Discontinuous Galerkin methods for elliptic problems , Discontinuous Galerkin methods (Newport, RI, 1999), Lect. Notes Comput. Sci. Eng., vol. 11, Springer, Berlin, 2000, pp. 89–101.
- 6[6] J. M. Ball and A. Majumdar, Nematic liquid crystals: From maier-saupe to a continuum theory , Molecular Crystals and Liquid Crystals 525 (2010), no. 1, 1–11.
- 7[7] S. Bartels, A posteriori error analysis for time-dependent Ginzburg-Landau type equations , Numerische Mathematik 99 (2005), no. 4, 557–583.
- 8[8] F. Bethuel, H. Brezis, B. D. Coleman, and F. Hélein, Bifurcation analysis of minimizing harmonic maps describing the equilibrium of nematic phases between cylinders , Archive for Rational Mechanics and Analysis 118 (1992), no. 2, 149–168.
