Two‐level discretization of the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity

The r‐Laplacian has played an important role in the development of computationally efficient models for applications, such as numerical simulation of turbulent flows. In this article, we examine two‐level finite element approximation schemes applied to the Navier‐Stokes equations with r‐Laplacian subgridscale viscosity, where r is the order of the power‐law artificial viscosity term. In the two‐level algorithm, the solution to the fully nonlinear coarse mesh problem is utilized in a single‐step linear fine mesh problem. When modeling parameters are chosen appropriately, the error in the two‐level algorithm is comparable to the error in solving the fully nonlinear problem on the fine mesh. We provide rigorous numerical analysis of the two‐level approximation scheme and derive scalings which vary based on the coefficient r, coarse mesh size H, fine mesh size h, and filter radius δ. We also investigate the two‐level algorithm in several computational settings, including the 3D numerical simulation of flow past a backward‐facing step at Reynolds number Re = 5100. In all numerical tests, the two‐level algorithm was proven to achieve the same order of accuracy as the standard one‐level algorithm, at a fraction of the computational cost. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

Subgraphs in vertex neighborhoods of Kr‐free graphs

In a K_r‐free graph, the neighborhood of every vertex induces a K_{r ? 1}‐free subgraph. The K_r‐free graphs with the converse property that every induced K_{r ? 1}‐free subgraph is contained in the neighborhood of a vertex are characterized, based on the characterization in the case r ? 3 due to Pach [ 8 ]. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 29–38, 2004     

Self‐dual and self‐petrie‐dual regular maps

Regular maps are cellular decompositions of surfaces with the “highest level of symmetry”, not necessarily orientation‐preserving. Such maps can be identified with three‐generator presentations of groups G of the form G = 〈a, b, c|a² = b² = c² = (ab)^k = (bc)^m = (ca)² = … = 1〉; the positive integers k and m are the face length and the vertex degree of the map. A regular map (G;a, b, c) is self‐dual if the assignment b?b, c?a and a?c extends to an automorphism of G, and self‐Petrie‐dual if G admits an automorphism fixing b and c and interchanging a with ca. In this note we show that for infinitely many numbers k there exist finite, self‐dual and self‐Petrie‐dual regular maps of vertex degree and face length equal to k. We also prove that no such map with odd vertex degree is a normal Cayley map. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory 69:152‐159, 2012     

Spatial behaviour of solutions of the dual‐phase‐lag heat equation

In this paper we study the spatial behaviour of solutions of some problems for the dual‐phase‐lag heat equation on a semi‐infinite cylinder. The theory of dual‐phase‐lag heat conduction leads to a hyperbolic partial differential equation with a third derivative with respect to time. First, we investigate the spatial evolution of solutions of an initial boundary‐value problem with zero boundary conditions on the lateral surface of the cylinder. Under a boundedness restriction on the initial data, an energy estimate is obtained. An upper bound for the amplitude term in this estimate in terms of the initial and boundary data is also established. For the case of zero initial conditions, a more explicit estimate is obtained which shows that solutions decay exponentially along certain spatial‐time lines. A class of non‐standard problems is also considered for which the temperature and its first two time derivatives at a fixed time T are assumed proportional to their initial values. Copyright © 2004 John Wiley & Sons, Ltd.     

Structure of planar integral self‐affine tilings

For a self‐affine tile in $\mathbf {R}^2$ generated by an expanding matrix $A\in M_2(\mathbf {Z})$ and an integral consecutive collinear digit set ${\mathcal D}$, Leung and Lau [Trans. Amer. Math. Soc. 359 , 3337–3355 (2007).] provided a necessary and sufficient algebraic condition for it to be disklike. They also characterized the neighborhood structure of all disklike tiles in terms of the algebraic data A and ${\mathcal D}$. In this paper, we completely characterize the neighborhood structure of those non‐disklike tiles. While disklike tiles can only have either six or eight edge or vertex neighbors, non‐disklike tiles have much richer neighborhood structure. In particular, other than a finite set, a Cantor set, or a set containing a nontrivial continuum, neighbors can intersect in a union of a Cantor set and a countable set.     

Viscous compressible barotropic symmetric flows with free boundary under general mass force Part I: Uniform‐in‐time bounds and stabilization

We consider symmetric flows of a viscous compressible barotropic fluid with a free boundary, under a general mass force depending both on the Eulerian and Lagrangian co‐ordinates, with arbitrarily large initial data. For a general non‐monotone state function p, we prove uniform‐in‐time energy bound and the uniform bounds for the density ρ, together with the stabilization as t → ∞ of the kinetic and potential energies. We also obtain H¹‐stabilization of the velocity v to zero provided that the second viscosity is zero. For either increasing or non‐decreasing p, we study the L^λ‐stabilization of ρ and the stabilization of the free boundary together with the corresponding ω‐limit set in the general case of non‐unique stationary solution possibly with zones of vacuum. In the case of increasing p and stationary densities ρ_S separated from zero, we establish the uniform‐in‐time H¹‐bounds and the uniform stabilization for ρ and v. All these results are stated and mainly proved in the Eulerian co‐ordinates. They are supplemented with the corresponding stabilization results in the Lagrangian co‐ordinates in the case of ρ_S separated from zero. Copyright © 2005 John Wiley & Sons, Ltd.     

Relaxation‐time limit of the three‐dimensional hydrodynamic model with boundary effects

In this paper, we study three‐dimensional (3D) unipolar and bipolar hydrodynamic models and corresponding drift‐diffusion models from semiconductor devices on bounded domain. Based on the asymptotic behavior of the solutions to the initial boundary value problems with slip boundary condition, we investigate the relation between the 3D hydrodynamic semiconductor models and the corresponding drift‐diffusion models. That is, we discuss the relation‐time limit from the 3D hydrodynamic semiconductor models to the corresponding drift‐diffusion models by comparing the large‐time behavior of these two models. These results can be showed by energy arguments. Copyrightcopyright 2011 John Wiley & Sons, Ltd.     

Inverse spectral problem for the operators with non‐local potential

The main object under consideration in the paper is the second derivative operator on a finite interval with zero boundary conditions perturbed by a self‐adjoint integral operator with the degenerate kernel (non‐local potential). The inverse problem, i.e., the reconstruction of the perturbation from the spectral data, is solved by means of the step‐by‐step procedure based on the n‐interlacing property of the spectrum.     

Eigenvalue problems for a non‐self‐adjoint Bessel‐type operators in limit‐point case

It is shown in the Weyl limit‐point case that system of root functions of the non‐self‐adjoint Bessel operator and its perturbation Sturm–Liouville operator form a complete system in the Hilbert space. Furthermore, asymptotic behavior of the eigenvalues of the non‐self‐adjoint Bessel operators is investigated, and it is proved that system of root functions form a Bari basis in the same Hilbert space. Copyright © 2013 John Wiley & Sons, Ltd.     

Nowhere‐zero 3‐flows in locally connected graphs

Let G be a graph. For each vertex v ∈V(G), N_v denotes the subgraph induces by the vertices adjacent to v in G. The graph G is locally k‐edge‐connected if for each vertex v ∈V(G), N_v is k‐edge‐connected. In this paper we study the existence of nowhere‐zero 3‐flows in locally k‐edge‐connected graphs. In particular, we show that every 2‐edge‐connected, locally 3‐edge‐connected graph admits a nowhere‐zero 3‐flow. This result is best possible in the sense that there exists an infinite family of 2‐edge‐connected, locally 2‐edge‐connected graphs each of which does not have a 3‐NZF. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 211–219, 2003     

Agent‐based simulation of an N‐person game with parabolic payoff functions

We report computer simulation experiments based on our agent‐based simulation tool to model a new N‐person game based on John Conway's Game of Life. The individual agents may choose between two behavior options: cooperation or defection. The payoff (reward/penalty) functions are given as two parabolas: one for each option. After a certain number of iterations, the behavior of the agents stabilizes to either a constant value or oscillates around such a value. The simulation's goal is to investigate the effects of intermediate behavior on a society of agents. We have performed a systematic investigation of this game for all six possible cases of the mutual positions of parabolic payoff functions crossing each other at two points: x = 0.3 and 0.7 where x is the ratio of the cooperation choice to the total number of agents in the agent's neighborhood. The global ratios X(t) of the total number of cooperators in the entire array of agents as functions of time (iterations) and the solutions of the game X_final as functions of X₀ were observed for each case for Pavlovian, greedy, and conformist agents. The solutions have predictable tendencies only when the neighborhood is the entire array of greedy or conformist agents. In all other cases unexpected properties emerge. © 2009 Wiley Periodicals, Inc. Complexity, 2010     

A high‐order B‐spline collocation scheme for solving a nonhomogeneous time‐fractional diffusion equation

A high‐accuracy numerical approach for a nonhomogeneous time‐fractional diffusion equation with Neumann and Dirichlet boundary conditions is described in this paper. The time‐fractional derivative is described in the sense of Riemann‐Liouville and discretized by the backward Euler scheme. A fourth‐order optimal cubic B‐spline collocation (OCBSC) method is used to discretize the space variable. The stability analysis with respect to time discretization is carried out, and it is shown that the method is unconditionally stable. Convergence analysis of the method is performed. Two numerical examples are considered to demonstrate the performance of the method and validate the theoretical results. It is shown that the proposed method is of order O(Δx⁴ + Δt^{2 ? α}) convergence, where α ∈ (0,1) . Moreover, the impact of fractional‐order derivative on the solution profile is investigated. Numerical results obtained by the present method are compared with those obtained by the method based on standard cubic B‐spline collocation method. The CPU time for present numerical method and the method based on cubic B‐spline collocation method are provided.     

Non‐Cayley‐isomorphic self‐complementary circulant graphs

Non‐CI self‐complementary circulant graphs of prime‐squared order are constructed and enumerated. It is shown that for prime p, there exists a self‐complementary circulant graph of order p² not Cayley isomorphic to its complement if and only if p ≡ 1 (mod 8). Such graphs are also enumerated. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 128–141, 2000     

Singularity of Lotka‐Volterra models under unfoldings

In this paper, we classify the singularity of a Lotka‐Volterra competitive model with a Gaussian competition function and non‐Gaussian carrying capacity functions. These functions need not be completely different to affect adaptive dynamics of the model. For instance, it will be seen how ostensibly similar models can actually give rise to quite different behaviors due to their properties under unfolding. The use of Gaussian‐like carrying capacity functions can also show the sensitivity of the model to assumptions on the carrying capacity function's shapes. The classification is achieved using singularity theory of fitness functions under dimorphism equivalence. We also investigate the effect of the presence of unfolding and bifurcation parameters on the evolution of the system near its singular points. Particularly, we study the adaptive dynamics of the system near the singularity by focusing on ESS and CvSS types, and dimorphisms. Mutual invasibility plots are used to show regions of coexistence.     

Zero‐sum flows in designs

Let D be a t ‐ ( v, k , λ) design and let N _i (D) , for 1 ≤ i ≤ t , be the higher incidence matrix of D , a ( 0 , 1 )‐matrix of size , where b is the number of blocks of D . A zero‐sum flow of D is a nowhere‐zero real vector in the null space of N ₁ ( D ). A zero‐sum k‐flow of D is a zero‐sum flow with values in { 1 , …, ±( k ? 1 )}. In this article, we show that every non‐symmetric design admits an integral zero‐sum flow, and consequently we conjecture that every non‐symmetric design admits a zero‐sum 5‐flow. Similarly, the definition of zero‐sum flow can be extended to N _i ( D ), 1 ≤ i ≤ t . Let be the complete design. We conjecture that N _t ( D ) admits a zero‐sum 3‐flow and prove this conjecture for t = 2 . © 2011 Wiley Periodicals, Inc. J Combin Designs 19:355‐364, 2011     

Representations of MV‐algebras by sheaves

In this paper, inspired by methods of Bigard, Keimel, and Wolfenstein ([2]), we develop an approach to sheaf representations of MV‐algebras which combines two techniques for the representation of MV‐algebras devised by Filipoiu and Georgescu ([18]) and by Dubuc and Poveda ([16]). Following Davey approach ([12]), we use a subdirect representation of MV‐algebras that is based on local MV‐algebras. This allowed us to obtain: (a) a representation of any MV‐algebras as MV‐algebra of all global sections of a sheaf of local MV‐algebras on the spectruum of its prime ideals; (b) a representation of MV‐algebras, having the space of minimal prime ideals compact, as MV‐algebra of all global sections of a Hausdorff sheaf of MV‐chains on the space of minimal prime ideals, which is a Stone space; (c) an adjunction between the category of all MV‐algebras and the category of MV‐algebraic spaces, where an MV‐algebraic space is a pair (X, F), where X is a compact topological space and F is a sheaf of MV‐algebras with stalks that are local (© 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Chaos control of uncertain time‐delay chaotic systems with input dead‐zone nonlinearity

This article presents an adaptive sliding mode control (SMC) scheme for the stabilization problem of uncertain time‐delay chaotic systems with input dead‐zone nonlinearity. The algorithm is based on SMC, adaptive control, and linear matrix inequality technique. Using Lyapunov stability theorem, the proposed control scheme guarantees the stability of overall closed‐loop uncertain time‐delay chaotic system with input dead‐zone nonlinearity. It is shown that the state trajectories converge to zero asymptotically in the presence of input dead‐zone nonlinearity, time‐delays, nonlinear real‐valued functions, parameter uncertainties, and external disturbances simultaneously. The selection of sliding surface and the design of control law are two important issues, which have been addressed. Moreover, the knowledge of upper bound of uncertainties is not required. The reaching phase and chattering phenomenon are eliminated. Simulation results demonstrate the effectiveness and robustness of the proposed scheme. © 2014 Wiley Periodicals, Inc. Complexity 21: 13–20, 2016     

Two‐strata rotatability in split‐plot central composite designs

A rotatable design (Ann. Math. Stat. 1957; 28 :195–241) for k factors is one such that the prediction variance is purely a function of distance from the design center. Of special interest in this paper is the rotatable central composite design (CCD), which most software packages use as the typical default choice for a second‐order design. In many cases some factors are hard to change while others are easy to change, which creates a split‐plot experiment. This paper establishes that the split‐plot structure precludes the possibility of any second‐order design being rotatable in the traditional sense. As an alternative this paper proposes the two‐strata rotatable split‐plot CCD, where the resulting prediction variance is a function of the whole plot (WP) distance and the subplot (SP) distance separately instead of the sum of them. The resulting design is rotatable in the WP space when the SP factors are held fixed, and vice versa. In the special case where the WP variance component is zero, the two‐strata rotatable split‐plot CCD becomes the standard rotatable CCD. Copyright © 2009 John Wiley & Sons, Ltd.     

A linearization‐based approach of homotopy analysis method for non‐linear time‐fractional parabolic PDEs

In this paper, a novel approach, namely, the linearization‐based approach of homotopy analysis method, to analytically treat non‐linear time‐fractional PDEs is proposed. The presented approach suggests a new optimized structure of the homotopy series solution based on a linear approximation of the non‐linear problem. A comparative study between the proposed approach and standard homotopy analysis approach is illustrated by solving two examples involving non‐linear time‐fractional parabolic PDEs. The performed numerical simulations demonstrate that the linearization‐based approach reduces the computational complexity and improves the performance of the homotopy analysis method.     

High‐order characteristic‐tracking strategy for simulation of a nonlinear advection–diffusion equation

In this study, new high‐order backward semi‐Lagrangian methods are developed to solve nonlinear advection–diffusion type problems, which are realized using high‐order characteristic‐tracking strategies. The proposed characteristic‐tracking strategies are second‐order L‐stable and third‐order L(α)‐stable methods, which are based on a classical implicit multistep method combined with a error‐correction method. We also use backward differentiation formulas and the fourth‐order finite‐difference scheme for diffusion problem discretization in the temporal and spatial domains, respectively. To demonstrate the adaptability and efficiency of these time‐discretization strategies, we apply these methods to nonlinear advection–diffusion type problems such as the viscous Burgers' equation. Through simulations, not only the temporal and spatial accuracies are numerically evaluated but also the proposed methods are shown to be superior to the compared existing characteristic‐tracking methods under the same rates of convergence in terms of accuracy and efficiency. Finally, we have shown that the proposed method well preserves the energy and mass when the viscosity coefficient becomes zero.