Design of an Optimal Grid for Finite Element Methods

ABSTRACT Finite element solutions of improved quality are obtained by optimizing the location of nodes of the finite element grid, while keeping the number of degrees of freedom fixed. The formulation of the grid optimization problem is based on the reduction of error associated with interpolation of the exact solution, using functions from the finite element space. Element sizes are selected as design variables: length in R1 and area in R2. Analytically derived optimality conditions are presented and an approximation to these conditions is introduced to obtain a set of operationally useful equations that can be used as guidelines for construction of improved grids. Example problems are given for illustration.     

Existence and stability of spatially localized patterns

Spatially localized patterns have been observed in numerous physical contexts, and their bifurcation diagrams often exhibit similar snaking behavior: symmetric solution branches, connected by bifurcating asymmetric solution branches, wind back and forth in an appropriate parameter. Previous papers have addressed existence of such solutions; here we address their stability, taking the necessary first step of unifying existence and uniqueness proofs for symmetric and asymmetric solutions. We then show that, under appropriate assumptions, temporal eigenvalues of the front and back underlying a localized solution are added with multiplicity in the right half plane. In a companion paper, we analyze the behavior of eigenvalues at $\lambda =0$ and inside the essential spectrum. Our results show that localized snaking solutions are stable if, and only if, the underlying fronts and backs are stable: unlike localized non-oscillatory solutions, no interaction eigenvalues are present. We use the planar Swift–Hohenberg system to illustrate our results.     

Gallai’s path decomposition conjecture for triangle-free planar graphs

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most $?(n+1)∕2?$. Gallai’s Conjecture has been verified for many classes of graphs. In particular, Lovász (1968) verified this conjecture for graphs with at most one vertex with even degree, and Pyber (1996) verified it for graphs in which every cycle contains a vertex with odd degree. Recently, Bonamy and Perrett (2016) verified Gallai’s Conjecture for graphs with maximum degree at most 5, and Botler et al. (2017) verified it for graphs with treewidth at most 3. In this paper, we verify Gallai’s Conjecture for triangle-free planar graphs.     

Vertex partitions of (C3,C4,C6)-free planar graphs

A graph is $(k_1,k_2)$-colorable if it admits a vertex partition into a graph with maximum degree at most $k_1$ and a graph with maximum degree at most $k_2$. We show that every $(C_3,C_4,C_6)$-free planar graph is $(0,6)$-colorable. We also show that deciding whether a $(C_3,C_4,C_6)$-free planar graph is $(0,3)$-colorable is NP-complete.     

Strong edge-coloring for planar graphs with large girth

A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. Let $G$ be a connected planar graph with girth $k\ge 26$ and maximum degree $\Delta$. We show that either $G$ is isomorphic to a subgraph of a very special $\Delta$-regular graph with girth $k$, or $G$ has a strong edge-coloring using at most $2\Delta +\lceil \frac{12(\Delta -2)}{k}\rceil$ colors.     

Chaotic motions for a perturbed nonlinear Schrödinger equation with the power-law nonlinearity in a nano optical fiber

Perturbed nonlinear Schrödinger (NLS) equation with the power-law nonlinearity in a nano optical fiber is studied with the help of its equivalent two-dimensional planar dynamic system and Hamiltonian. Via the bifurcation theory and qualitative theory, equilibrium points for the two-dimensional planar dynamic system are obtained. With the external perturbation taken into consideration, chaotic motions for the perturbed NLS equation with the power-law nonlinearity are derived based on the equilibrium points.     

Universal point sets for planar three-trees

For every $n\in \mathbb{N}$, we present a set $S_n$ of $O(n^{3/2}\log n)$ points in the plane such that every planar 3-tree with n vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of $S_n$. This is the first subquadratic upper bound on the cardinality of universal point sets for planar 3-trees, as well as for the class of 2-trees and serial parallel graphs.     

A bound on the treewidth of planar even-hole-free graphs

The class of planar graphs has unbounded treewidth, since the k×k grid, ∀k∈N, is planar and has treewidth k. So, it is of interest to determine subclasses of planar graphs which have bounded treewidth. In this paper, we show that if G is an even-hole-free planar graph, then it does not contain a 9×9 grid minor. As a result, we have that even-hole-free planar graphs have treewidth at most 49.     

A graph-theoretic approach to a partial order of knots and links

We say that a link L₁ is an s-major of a link L₂ if any diagram of L₁ can be transformed into a diagram of L₂ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime alternating links. We determine this partial order for all prime alternating knots and links with the crossing number less than or equal to six. The proofs are given by graph-theoretic methods.