Learning formation control for fractional‐order multiagent systems

In this paper, we use 2 iterative learning control schemes (P‐type and PI‐type) with an initial learning rule to achieve the formation control of linear fractional‐order multiagent systems. To realize the finite‐time consensus, we assume repeatable operation environments as well as a fixed but directed communication topology for the fractional‐order multiagent systems. Both P‐type and PI‐type update laws are applied to generate the control commands for each agent. It is strictly proved that all agents are driven to achieve an asymptotical consensus as the iteration number increases. Two examples are simulated to verify the effectiveness of the proposed algorithms.     

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.     

Analytical and numerical solutions of a two‐dimensional multi‐term time‐fractional Oldroyd‐B model

In this paper, we consider a two‐dimensional multi‐term time‐fractional Oldroyd‐B equation on a rectangular domain. Its analytical solution is obtained by the method of separation of variables. We employ the finite difference method with a discretization of the Caputo time‐fractional derivative to obtain an implicit difference approximation for the equation. Stability and convergence of the approximation scheme are established in the L_∞ ‐norm. Two examples are given to illustrate the theoretical analysis and analytical solution. The results indicate that the present numerical method is effective for this general two‐dimensional multi‐term time‐fractional Oldroyd‐B model.     

Well‐posedness of time‐space fractional stochastic evolution equations driven by α‐stable noise

This paper is devoted to the well‐posedness for time‐space fractional Ginzburg‐Landau equation and time‐space fractional Navier‐Stokes equations by α‐stable noise. The spatial regularity and the temporal regularity of the nonlocal stochastic convolution are firstly established, and then the existence and uniqueness of the global mild solution are obtained by the Banach fixed point theorem and Mittag‐Leffler functions, respectively. Numerical simulations for time‐space fractional Ginzburg‐Landau equation are provided to verify the analysis results.     

Synchronization of memristor‐based delayed BAM neural networks with fractional‐order derivatives

This article deals with the problem of synchronization of fractional‐order memristor‐based BAM neural networks (FMBNNs) with time‐delay. We investigate the sufficient conditions for adaptive synchronization of FMBNNs with fractional‐order 0 < α < 1. The analysis is based on suitable Lyapunov functional, differential inclusions theory, and master‐slave synchronization setup. We extend the analysis to provide some useful criteria to ensure the finite‐time synchronization of FMBNNs with fractional‐order 1 < α < 2, using Mittag‐Leffler functions, Laplace transform, and linear feedback control techniques. Numerical simulations with two numerical examples are given to validate our theoretical results. Presence of time‐delay and fractional‐order in the model shows interesting dynamics. © 2016 Wiley Periodicals, Inc. Complexity 21: 412–426, 2016     

Synchronization and antisynchronization of N‐coupled fractional‐order complex chaotic systems with ring connection

This paper is devoted to investigate synchronization and antisynchronization of N‐coupled general fractional‐order complex chaotic systems described by a unified mathematical expression with ring connection. By means of the direct design method, the appropriate controllers are designed to transform the fractional‐order error dynamical system into a nonlinear system with antisymmetric structure. Thus, by using the recently established result for the Caputo fractional derivative of a quadratic function and a fractional‐order extension of the Lyapunov direct method, several stability criteria are derived to ensure the occurrence of synchronization and antisynchronization among N‐coupled fractional‐order complex chaotic systems. Moreover, numerical simulations are performed to illustrate the effectiveness of the proposed design.     

Some inequalities involving Hadamard‐type k‐fractional integral operators

In this paper, our main aim is to establish some new fractional integral inequalities involving Hadamard‐type k‐fractional integral operators recently given by Mubeen et al. Furthermore, the paper discusses some of their relevance with known results. Copyright © 2017 John Wiley & Sons, Ltd.     

Analytical solution for a generalized space‐time fractional telegraph equation

In this paper, we consider a nonhomogeneous space‐time fractional telegraph equation defined in a bounded space domain, which is obtained from the standard telegraph equation by replacing the first‐order or second‐order time derivative by the Caputo fractional derivative , α > 0 and the Laplacian operator by the fractional Laplacian ( ? Δ)^{β ∕ 2}, β ∈ (0,2]. We discuss and derive the analytical solutions under nonhomogeneous Dirichlet and Neumann boundary conditions by using the method of separation of variables. The obtained solutions are expressed through multivariate Mittag‐Leffler type functions. Special cases of solutions are also discussed. Copyright © 2013 John Wiley & Sons, Ltd.     

A mixed‐type Galerkin variational formulation and fast algorithms for variable‐coefficient fractional diffusion equations

We consider the variable‐coefficient fractional diffusion equations with two‐sided fractional derivative. By introducing an intermediate variable, we propose a mixed‐type Galerkin variational formulation and prove the existence and uniqueness of the variational solution over . On the basis of the formulation, we develop a mixed‐type finite element procedure on commonly used finite element spaces and derive the solvability of the finite element solution and the error bounds for the unknown and the intermediate variable. For the Toeplitz‐like linear system generated by discretization, we design a fast conjugate gradient normal residual method to reduce the storage from O(N²) to O(N) and the computing cost from O(N³) to O(NlogN). Numerical experiments are included to verify our theoretical findings. Copyright © 2017 John Wiley & Sons, Ltd.     

Numerical solution of nonlinear partial quadratic integro‐differential equations of fractional order via hybrid of block‐pulse and parabolic functions

In this paper, an effective numerical approach based on a new two‐dimensional hybrid of parabolic and block‐pulse functions (2D‐PBPFs) is presented for solving nonlinear partial quadratic integro‐differential equations of fractional order. Our approach is based on 2D‐PBPFs operational matrix method together with the fractional integral operator, described in the Riemann–Liouville sense. The main characteristic behind this approach is to reduce such problems to those of solving systems of algebraic equations, which greatly simplifies the problem. By using Newton's iterative method, this system is solved, and the solution of fractional nonlinear partial quadratic integro‐differential equations is achieved. Convergence analysis and an error estimate associated with the proposed method is obtained, and it is proved that the numerical convergence order of the suggested numerical method is O(h³) . The validity and applicability of the method are demonstrated by solving three numerical examples. Numerical examples are presented in the form of tables and graphs to make comparisons with the exact solutions much easier.     

Fractional Crank–Nicolson–Galerkin finite element scheme for the time‐fractional nonlinear diffusion equation

This article presents a finite element scheme with Newton's method for solving the time‐fractional nonlinear diffusion equation. For time discretization, we use the fractional Crank–Nicolson scheme based on backward Euler convolution quadrature. We discuss the existence‐uniqueness results for the fully discrete problem. A new discrete fractional Gronwall type inequality for the backward Euler convolution quadrature is established. A priori error estimate for the fully discrete problem in L²(Ω) norm is derived. Numerical results based on finite element scheme are provided to validate theoretical estimates on time‐fractional nonlinear Fisher equation and Huxley equation.     

Stability of the fractional Volterra integro‐differential equation by means of ψ‐Hilfer operator

In this paper, using the Riemann‐Liouville fractional integral with respect to another function and the ψ?Hilfer fractional derivative, we propose a fractional Volterra integral equation and the fractional Volterra integro‐differential equation. In this sense, for this new fractional Volterra integro‐differential equation, we study the Ulam‐Hyers stability and, also, the fractional Volterra integral equation in the Banach space, by means of the Banach fixed‐point theorem. As an application, we present the Ulam‐Hyers stability using the α‐resolvent operator in the Sobolev space .     

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     

Time‐weighted blow‐up rates and pointwise profile for single‐point blow‐up solutions in reaction–diffusion equations

This paper deals with asymptotic behavior for blow‐up solutions to time‐weighted reaction–diffusion equations u_t=Δu+e^αtv^p and v_t=Δv+e^βtu^q, subject to homogeneous Dirichlet boundary. The time‐weighted blow‐up rates are defined and obtained by ways of the scaling or auxiliary‐function methods for all α, . Aiding by key inequalities between components of solutions, we give lower pointwise blow‐up profiles for single‐point blow‐up solutions. We also study the solutions of the system with variable exponents instead of constant ones, where blow‐up rates and new blow‐up versus global existence criteria are obtained. Time‐weighted functions influence critical Fujita exponent, critical Fujita coefficient and formulae of blow‐up rates, but they do not limit the order of time‐weighted blow‐up rates and pointwise profile near blow‐up time. Copyright © 2017 John Wiley & Sons, Ltd.     

On cubic non‐Cayley vertex‐transitive graphs

In 1983, the second author [D. Maru?i?, Ars Combinatoria 16B (1983), 297–302] asked for which positive integers n there exists a non‐Cayley vertex‐transitive graph on n vertices. (The term non‐Cayley numbers has later been given to such integers.) Motivated by this problem, Feng [Discrete Math 248 (2002), 265–269] asked to determine the smallest valency ?(n) among valencies of non‐Cayley vertex‐transitive graphs of order n. As cycles are clearly Cayley graphs, ?(n)?3 for any non‐Cayley number n. In this paper a goal is set to determine those non‐Cayley numbers n for which ?(n) = 3, and among the latter to determine those for which the generalized Petersen graphs are the only non‐Cayley vertex‐transitive graphs of order n. It is known that for a prime p every vertex‐transitive graph of order p, p² or p³ is a Cayley graph, and that, with the exception of the Coxeter graph, every cubic non‐Cayley vertex‐transitive graph of order 2p, 4p or 2p² is a generalized Petersen graph. In this paper the next natural step is taken by proving that every cubic non‐Cayley vertex‐transitive graph of order 4p², p>7 a prime, is a generalized Petersen graph. In addition, cubic non‐Cayley vertex‐transitive graphs of order 2p^k, where p>7 is a prime and k?p, are characterized. © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 77–95, 2012     

Consensus protocol design for discrete‐time networks of multiagent with time‐varying delay via logarithmic quantizer

This article considers the problem of consensus for discrete‐time networks of multiagent with time‐varying delays and quantization. It is assumed that the logarithmic quantizer is utilized between the information flow through the sensor of each agent, and its quantization error is included in the proposed method. By constructing a suitable Lyapunov‐Krasovskii functional and utilizing matrix theory, a new consensus criterion for the concerned systems is established in terms of linear matrix inequalities (LMIs) which can be easily solved by various effective optimization algorithms. Based on the consensus criterion, a designing method of consensus protocol is introduced. One numerical example is given to illustrate the effectiveness of the proposed method. © 2014 Wiley Periodicals, Inc. Complexity 21: 163–176, 2015     

Asymptotic behavior of solutions to space‐time fractional diffusion‐reaction equations

This article discusses the analyticity and the long‐time asymptotic behavior of solutions to space‐time fractional diffusion‐reaction equations in . By a Laplace transform argument, we prove that the decay rate of the solution as t→∞ is dominated by the order of the time‐fractional derivative. We consider the decay rate also in a bounded domain. Copyright © 2016 John Wiley & Sons, Ltd.     

Global regularity for the 2D Oldroyd‐B model in the corotational case

This paper is dedicated to the Oldroyd‐B model with fractional dissipation (?Δ)^ατ for any α > 0. We establish the global smooth solutions to the Oldroyd‐B model in the corotational case with arbitrarily small fractional powers of the Laplacian in two spatial dimensions. Moreover, in the Appendix, we provide some a priori estimates to the Oldroyd‐B model in the critical case, which may be useful and of interest for future improvement. Therefore, our result is closer to the resolution of the well‐known global regularity issue on the critical 2D Oldroyd‐B model. 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)