Mixed two‐grid finite difference methods for solving one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations

The aim of this paper is to propose mixed two‐grid finite difference methods to obtain the numerical solution of the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. The finite difference equations at all interior grid points form a large‐sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a family of finite difference methods for discretizing the spatial and time derivatives. The obtained system has been solved by two‐grid method, where the two‐grid method is used for solving the large‐sparse linear systems. Also, in the proposed method, the spectral radius with local Fourier analysis is calculated for different values of h and Δt. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. Copyright © 2016 John Wiley & Sons, Ltd.     

Chebyshev‐Legendre spectral method for solving the two‐dimensional vorticity equations with homogeneous Dirichlet conditions

The Chebyshev‐Legendre spectral method for the two‐dimensional vorticity equations is considered. The Legendre Galerkin Chebyshev collocation method is used with the Chebyshev‐Gauss collocation points. The numerical analysis results under the L²‐norm for the Chebyshev‐Legendre method of one‐dimensional case are generalized into that of the two‐dimensional case. The stability and optimal order convergence of the method are proved. Numerical results are given. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Asymptotic and numerical solutions of three‐dimensional boundary‐layer flow past a moving wedge

We consider a laminar boundary‐layer flow of a viscous and incompressible fluid past a moving wedge in which the wedge is moving either in the direction of the mainstream flow or opposite to it. The mainstream flows outside the boundary layer are approximated by a power of the distance from the leading boundary layer. The variable pressure gradient is imposed on the boundary layer so that the system admits similarity solutions. The model is described using 3‐dimensional boundary‐layer equations that contains 2 physical parameters: pressure gradient (β) and shear‐to‐strain‐rate ratio parameter (α). Two methods are used: a linear asymptotic analysis in the neighborhood of the edge of the boundary layer and the Keller‐box numerical method for the full nonlinear system. The results show that the flow field is divided into near‐field region (mainly dominated by viscous forces) and far‐field region (mainstream flows); the velocity profiles form through an interaction between 2 regions. Also, all simulations show that the subsequent dynamics involving overshoot and undershoot of the solutions for varying parameter characterizing 3‐dimensional flows. The pressure gradient (favorable) has a tendency of decreasing the boundary‐layer thickness in which the velocity profiles are benign. The wall shear stresses increase unboundedly for increasing α when the wedge is moving in the x‐direction, while the case is different when it is moving in the y‐direction. Further, both analysis show that 3‐dimensional boundary‐layer solutions exist in the range −1<α<∞. These are some interesting results linked to an important class of boundary‐layer flows.     

A homogeneous limit methodology and refinements of computationally efficient zigzag theory for homogeneous,laminated composite,and sandwich plates

The Refined Zigzag Theory (RZT) for homogeneous, laminated composite, and sandwich plates is revisited to offer a fresh insight into its fundamental assumptions and practical possibilities. The theory is introduced from a multiscale formalism starting with the inplane displacement field expressed as a superposition of coarse and fine contributions. The coarse displacement field is that of first‐order shear‐deformation theory, whereas the fine displacement field has a piecewise‐linear zigzag distribution through the thickness. The resulting kinematic field provides a more realistic representation of the deformation states of transverse‐shear‐flexible plates than other similar theories. The condition of limiting homogeneity of transverse‐shear properties is proposed and yields four distinct variants of zigzag functions. Analytic solutions for highly heterogeneous sandwich plates undergoing elastostatic deformations are used to identify the best‐performing zigzag functions. Unlike previously used methods, which often result in anomalous conditions and nonphysical solutions, the present theory does not rely on transverse‐shear‐stress equilibrium constraints. For all material systems, there are no requirements for use of transverse‐shear correction factors to yield accurate results. To model homogeneous plates with the full power of zigzag kinematics, infinitesimally small perturbations in the transverse shear properties are derived, thus enabling highly accurate predictions of homogeneous‐plate behavior without the use of shear correction factors. The RZT predictive capabilities to model highly heterogeneous sandwich plates are critically assessed, demonstrating its superior efficiency, accuracy, and a wide range of applicability. This theory, which is derived from the virtual work principle, is well‐suited for developing computationally efficient, C⁰ a continuous function of (x₁,x₂) coordinates whose first‐order derivatives are discontinuous along finite element interfaces and is thus appropriate for the analysis and design of high‐performance load‐bearing aerospace structures. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Finite‐time synchronization of a class of N‐coupled complex partial differential systems with time‐varying delay

This study examines finite‐time synchronization for a class of N‐coupled complex partial differential systems (PDSs) with time‐varying delay. The problem of finite‐time synchronization for coupled drive‐response PDSs with time‐varying delay is similarly considered. The synchronization error dynamic of the PDSs is defined in the q‐dimensional spatial domain. We construct a feedback controller to achieve finite‐time synchronization. Sufficient conditions are derived by using the Lyapunov‐Krasoviskii stability approach and inequalities technology to ensure that the proposed networks achieve synchronization in finite time. The proposed systems demonstrate extensive application. Finally, an example is used to verify the theoretical results.     

On measure‐valued solutions to a two‐dimensional gravity‐driven avalanche flow model

This paper concerns measure‐valued solutions for the two‐dimensional granular avalanche flow model introduced by Savage and Hutter. The system is similar to the isentropic compressible Euler equations, except for a Coulomb–Mohr friction law in the source term. We will partially follow the study of measure‐valued solutions given by DiPerna and Majda. However, due to the multi‐valued nature of the friction law, new more sensitive measures must be introduced. The main idea is to consider the class of x‐dependent maximal monotone graphs of non‐single‐valued operators and their relation with 1‐Lipschitz, Carathéodory functions. This relation allows to introduce generalized Young measures for x‐dependent maximal monotone graph. Copyright © 2005 John Wiley & Sons, Ltd.     

Analysis of the energy‐conserved S‐FDTD scheme for variable coefficient Maxwell's equations in disk domains

In this paper, we analyze the energy‐conserved splitting finite‐difference time‐domain (FDTD) scheme for variable coefficient Maxwell's equations in two‐dimensional disk domains. The approach is energy‐conserved, unconditionally stable, and effective. We strictly prove that the EC‐S‐FDTD scheme for the variable coefficient Maxwell's equations in disk domains is of second order accuracy both in time and space. It is also strictly proved that the scheme is energy‐conserved, and the discrete divergence‐free is of second order convergence. Numerical experiments confirm the theoretical results, and practical test is simulated as well to demonstrate the efficiency of the proposed EC‐S‐FDTD scheme. Copyright © 2015 John Wiley & Sons, Ltd.     

On a boundary value problem for a p‐Dirac equation

The p‐Laplace equation is a nonlinear generalization of the Laplace equation. This generalization is often used as a model problem for special types of nonlinearities. The p‐Laplace equation can be seen as a bridge between very general nonlinear equations and the linear Laplace equation. The aim of this paper is to solve the p‐Laplace equation for 1 < p < 2 and to find strong solutions. The idea is to apply a hypercomplex integral operator and spatial function theoretic methods to transform the p‐Laplace equation into the p‐Dirac equation. This equation will be solved iteratively by using a fixed‐point theorem. Applying operator‐theoretical methods for the p‐Dirac equation and p‐Laplace equation, the existence and uniqueness of solutions in certain Sobolev spaces will be proved. Copyright © 2016 John Wiley & Sons, Ltd.     

A new technique for proving realisability and consistency theorems using finite paraconsistent models of cut‐free logic

A new technique for proving realisability results is presented, and is illustrated in detail for the simple case of arithmetic minus induction. CL is a Gentzen formulation of classical logic. CPQ is CL minus the Cut Rule. The basic proof theory and model theory of CPQ and CL is developed. For the semantics presented CPQ is a paraconsistent logic, i.e. there are non‐trivial CPQ models in which some sentences are both true and false. Two systems of arithmetic minus induction are introduced, CL‐A and CPQ‐A based on CL and CPQ, respectively. The realisability theorem for CPQ‐A is proved: It is shown constructively that to each theorem A of CPQ‐A there is a formula A *, a so‐called “realised disjunctive form of A ”, such that variables bound by essentially existential quantifiers in A * can be written as recursive functions of free variables and variables bound by essentially universal quantifiers. Realisability is then applied to prove the consistency of CL‐A, making use of certain finite non‐trivial inconsistent models of CPQ‐A. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Finding a subdivision of a prescribed digraph of order 4

The problem of when a given digraph contains a subdivision of a fixed digraph F is considered. Bang‐Jensen et al. [4] laid out foundations for approaching this problem from the algorithmic point of view. In this article, we give further support to several open conjectures and speculations about algorithmic complexity of finding F‐subdivisions. In particular, up to five exceptions, we completely classify for which 4‐vertex digraphs F, the F‐subdivision problem is polynomial‐time solvable and for which it is NP‐complete. While all NP‐hardness proofs are made by reduction from some version of the 2‐linkage problem in digraphs, some of the polynomial‐time solvable cases involve relatively complicated algorithms.     

Numerical and asymptotic study of non‐axisymmetric magnetohydrodynamic boundary layer stagnation‐point flows

Both numerical and asymptotic analyses are performed to study the similarity solutions of three‐dimensional boundary‐layer viscous stagnation point flow in the presence of a uniform magnetic field. The three‐dimensional boundary‐layer is analyzed in a non‐axisymmetric stagnation point flow, in which the flow is developed because of influence of both applied magnetic field and external mainstream flow. Two approaches for the governing equations are employed: the Keller‐box numerical simulations solving full nonlinear coupled system and a corresponding linearized system that is obtained under a far‐field behavior and in the limit of large shear‐to‐strain‐rate parameter (λ). From these two approaches, the flow phenomena reveals a rich structure of new family of solutions for various values of the magnetic number and λ. The various results for the wall stresses and the displacement thicknesses are presented along with some velocity profiles in both directions. The analysis discovered that the flow separation occurs in the secondary flow direction in the absence of magnetic field, and the flow separation disappears when the applied magnetic field is increased. The flow field is divided into a near‐field (due to viscous forces) and far‐field (due to mainstream flows), and the velocity profiles form because of an interaction between two regions. The magnetic field plays an important role in reducing the thickness of the boundary‐layer. A physical explanation for all observed phenomena is discussed. Copyright © 2017 John Wiley & Sons, Ltd.     

A lower‐epiperimetric inequality for area‐minimizing surfaces

The epiperimetric inequality introduced by E. R. Reifenberg in [3] gives a rate of decay at a point for the decreasing k‐density of area of an area‐minimizing integral k‐cycle. While dilating the cycle at that point, this rate of decay holds once the configuration is close to a tangent cone configuration and above the limiting density corresponding to that configuration. This is why we propose to call the Reifenberg epiperimetric inequality an upper‐epiperimetric inequality. A direct consequence of this upper‐epiperimetric inequality is the statement that any point possesses a unique tangent cone. The upper‐epiperimetric inequality was proven by B. White in [5] for area‐minimizing 2‐cycles in ?ⁿ. In the present paper we introduce the notion of a lower‐epiperimetric inequality. This inequality gives this time a rate of decay for the decreasing k‐density of area of an area‐minimizing integral k‐cycle, while dilating the cycle at a point once the configuration is close to a tangent cone configuration and below the limiting density corresponding to that configuration. Our main result in the present paper is to prove the lower‐epiperimetric inequality for area‐minimizing 2‐cycles in ?ⁿ. As a consequence of this inequality we prove the “splitting before tilting” phenomenon for calibrated 2‐rectifiable cycles, which plays a crucial role in the proof of the regularity of 1‐1 integral currents in [4]. © 2004 Wiley Periodicals, Inc.     

Monte Carlo approximate tensor moment simulations

An algorithm to generate samples with approximate first‐order, second‐order, third‐order, and fourth‐order moments is presented by extending the Cholesky matrix decomposition to a Cholesky tensor decomposition of an arbitrary order. The tensor decomposition of the first‐order, second‐order, third‐order, and fourth‐order objective moments generates a non‐linear system of equations. The algorithm solves these equations by numerical methods. The results show that the optimization algorithm delivers samples with an approximate residual error of less than 10¹⁶ between the components of the objective and the sample moments. The algorithm is extended for a n‐th‐order approximate tensor moment version, and simulations of non‐normal samples replicated from distributions with asymmetries and heavy tails are presented. An application for sensitivity analysis of portfolio risk assessment with Value‐at‐Risk (VaR) is provided. A comparison with previous methods available in the literature suggests that the methodology proposed reduces the error of the objective moments in the generated samples. ? ? JEL Classification: C14, C15, G32.
Copyright © 2016 John Wiley & Sons, Ltd.     

Hyper‐Archimedean BL‐algebras are MV‐algebras

Generalizations of Boolean elements of a BL‐algebra L are studied. By utilizing the MV‐center MV(L) of L, it is reproved that an element x ∈ L is Boolean iff x ∨ x * = 1 . L is called semi‐Boolean if for all x ∈ L, x * is Boolean. An MV‐algebra L is semi‐Boolean iff L is a Boolean algebra. A BL‐algebra L is semi‐Boolean iff L is an SBL‐algebra. A BL‐algebra L is called hyper‐Archimedean if for all x ∈ L, xⁿ is Boolean for some finite n ≥ 1. It is proved that hyper‐Archimedean BL‐algebras are MV‐algebras. The study has application in mathematical fuzzy logics whose Lindenbaum algebras are MV‐algebras or BL‐algebras. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

An adaptive sampling method for high‐dimensional shift‐invariant signals

In this paper, an adaptive method for sampling and reconstructing high‐dimensional shift‐invariant signals is proposed. First, the integrate‐and‐fire sampling scheme and an approximate reconstruction algorithm for one‐dimensional bandlimited signals are generalized to shift‐invariant signals. Then, a high‐dimensional shift‐invariant signal is reduced to be a sequence of one‐dimensional shift‐invariant signals along the trajectories parallel to some coordinate axis, which can be approximately reconstructed by the generalized integrate‐and‐fire sampling scheme. Finally, an approximate reconstruction for the high‐dimensional shift‐invariant signal is obtained by solving a series of stable linear systems of equations. The main result shows that the final reconstructed error is completely determined by the initial threshold in integrate‐and‐fire sampling scheme, which is generally very small. Copyright © 2017 John Wiley & Sons, Ltd.     

Blow‐up profiles of solutions for the exponential reaction‐diffusion equation

We consider the blow‐up of solutions for a semilinear reaction‐diffusion equation with exponential reaction term. It is known that certain solutions that can be continued beyond the blow‐up time possess a non‐constant self‐similar blow‐up profile. Our aim is to find the final time blow‐up profile for such solutions. The proof is based on general ideas using semigroup estimates. The same approach works also for the power nonlinearity. Copyright © 2011 John Wiley & Sons, Ltd.     

2‐ and 3‐factors of graphs on surfaces

It has been conjectured that any 5‐connected graph embedded in a surface Σ with sufficiently large face‐width is hamiltonian. This conjecture was verified by Yu for the triangulation case, but it is still open in general. The conjecture is not true for 4‐connected graphs. In this article, we shall study the existence of 2‐ and 3‐factors in a graph embedded in a surface Σ. A hamiltonian cycle is a special case of a 2‐factor. Thus, it is quite natural to consider the existence of these factors. We give an evidence to the conjecture in a sense of the existence of a 2‐factor. In fact, we only need the 4‐connectivity with minimum degree at least 5. In addition, our face‐width condition is not huge. Specifically, we prove the following two results. Let G be a graph embedded in a surface Σ of Euler genus g.

• (1) If G is 4‐connected and minimum degree of G is at least 5, and furthermore, face‐width of G is at least 4g?12, then G has a 2‐factor.
• (2) If G is 5‐connected and face‐width of G is at least max{44g?117, 5}, then G has a 3‐factor.

The connectivity condition for both results are best possible. In addition, the face‐width conditions are necessary too. Copyright © 2010 Wiley Periodicals, Inc. J Graph Theory 67:306‐315, 2011     

A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions.     

Symmetries for the Ablowitz–Ladik Hierarchy: Part I. Four‐Potential Case

In the paper, we first investigate symmetries of isospectral and non‐isospectral four‐potential Ablowitz–Ladik hierarchies. We express these hierarchies in the form of u_n,t= L^mH⁽⁰⁾ , where m is an arbitrary integer (instead of a nature number) and L is the recursion operator. Then by means of the zero‐curvature representations of the isospectral and non‐isospectral flows, we construct symmetries for the isospectral equation hierarchy as well as non‐isospectral equation hierarchy, respectively. The symmetries, respectively, form two centerless Kac‐Moody‐Virasoro algebras. The recursion operator L is proved to be hereditary and a strong symmetry for this isospectral equation hierarchy. Besides, we make clear for the relation between four‐potential and two‐potential Ablowitz–Ladik hierarchies. The even order members in the four‐potential Ablowitz–Ladik hierarchies together with their symmetries and algebraic structures can be reduced to two‐potential case. The reduction keeps invariant for the algebraic structures and the recursion operator for two potential case becomes L² .     

Finite element method for two‐dimensional time‐fractional tricomi‐type equations

In this article, we consider the finite element method (FEM) for two‐dimensional linear time‐fractional Tricomi‐type equations, which is obtained from the standard two‐dimensional linear Tricomi‐type equation by replacing the first‐order time derivative with a fractional derivative (of order α, with 1 <α< 2 ). The method is based on finite element method for space and finite difference method for time. We prove that the method is unconditionally stable, and the error estimate is presented. The comparison of the FEM results with the exact solutions is made, and numerical experiments reveal that the FEM is very effective. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013