Fixed‐point theorem for a generalized almost Hardy‐Rogers‐type F contraction on metric‐like spaces

In this paper, we introduce some fixed‐point theorems for a generalized almost Hardy‐Rogers‐type F contraction in a metric‐like space and give an example to illustrate these main results. Moreover, we show the applications of electric circuit equations, second‐order differential equations, and fractional differential equations. Our results improve, generalize, and extend the corresponding results in literature.     

q‐Bernstein polynomials related to q‐Frobenius–Euler polynomials,l‐functions,and q‐Stirling numbers

The aim of this paper was to derive new identities and relations associated with the q‐Bernstein polynomials, q‐Frobenius–Euler polynomials, l‐functions, and q‐Stirling numbers of the second kind. We also give some applications related to theses polynomials and numbers. Copyright © 2012 John Wiley & Sons, Ltd.     

New predictor‐corrector scheme for solving nonlinear differential equations with Caputo‐Fabrizio operator

In this paper, we develop a new, simple, and accurate scheme to obtain approximate solution for nonlinear differential equation in the sense of Caputo‐Fabrizio operator. To derive this new predictor‐corrector scheme, which suits on Caputo‐Fabrizio operator, firstly, we obtain the corresponding initial value problem for the differential equation in the Caputo‐Fabrizio sense. Hence, by fractional Euler method and fractional trapeziodal rule, we obtain the predictor formula as well as corrector formula. Error analysis for this new method is derived. To test the validity and simplicity of this method, some illustrative examples for nonlinear differential equations are solved.     

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.     

A new approach by two‐dimensional wavelets operational matrix method for solving variable‐order fractional partial integro‐differential equations

In this paper, a new computational scheme based on operational matrices (OMs) of two‐dimensional wavelets is proposed for the solution of variable‐order (VO) fractional partial integro‐differential equations (PIDEs). To accomplish this method, first OMs of integration and VO fractional derivative (FD) have been derived using two‐dimensional Legendre wavelets. By implementing two‐dimensional wavelets approximations and the OMs of integration and variable‐order fractional derivative (VO‐FD) along with collocation points, the VO fractional partial PIDEs are reduced into the system of algebraic equations. In addition to this, some useful theorems are discussed to establish the convergence analysis and error estimate of the proposed numerical technique. Furthermore, computational efficiency and applicability are examined through some illustrative examples.     

An optimal sixth‐order quartic B‐spline collocation method for solving Bratu‐type and Lane‐Emden–type problems

This paper is concerned with the numerical solutions of Bratu‐type and Lane‐Emden–type boundary value problems, which describe various physical phenomena in applied science and technology. We present an optimal collocation method based on quartic B‐spine basis functions to solve such problems. This method is constructed by perturbing the original problem and on a uniform mesh. The method has been tested by four nonlinear examples. In order to show the advantage of the new method, numerical results are compared with those obtained by some of the existing methods, such as normal quartic B‐spline collocation method and the finite difference method (FDM). It has been observed that the order of convergence of the proposed method is six, which is two orders of magnitude larger than the normal quartic B‐spline collocation method. Moreover, our method gives highly accurate results than the FDM.     

Positive solutions for fourth‐order singular nonlinear differential equation with variable‐coefficient

By application of Green's function and some fixed‐point theorems, that is, Leray–Schauder alternative principle and Schauder's fixed point theorem, we establish two new existence results of positive periodic solutions for nonlinear fourth‐order singular differential equation with variable‐coefficient, which extend and improve significantly existing results in the literature. Copyright © 2016 John Wiley & Sons, Ltd.     

Estimates of the first Neumann eigenvalue and the log‐Sobolev constant on non‐convex manifolds

In this paper a number of explicit lower bounds are presented for the first Neumann eigenvalue on non‐convex manifolds. The main idea to derive these estimates is to make a conformal change of the metric such that the manifold is convex under the new metric, which enables one to apply known results obtained in the convex case. This method also works for more general functional inequalities. In particular, some explicit lower bounds are presented for the log‐Sobolev constant on non‐convex manifolds. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Semi‐invariant solutions of the Navier‐Stokes equations

We present new exact solutions and reduced differential systems of the Navier‐Stokes equations of incompressible viscous fluid flow. We apply the method of semi‐invariant manifolds, introduced earlier as a modification of the Lie invariance method. We show that many known solutions of the Navier‐Stokes equations are, in fact, semi‐invariant and that the reduced differential systems we derive using semi‐invariant manifolds generalize previously obtained results that used ad hoc methods. Many of our semi‐invariant solutions solve decoupled systems in triangular form that are effectively linear. We also obtain several new reductions of Navier‐Stokes to a single nonlinear partial differential equation. In some cases, we can solve reduced systems and generate new analytic solutions of the Navier‐Stokes equations or find their approximations, and physical interpretation.     

Clique‐coloring some classes of odd‐hole‐free graphs

We consider the problem of clique‐coloring, that is coloring the vertices of a given graph such that no maximal clique of size at least 2 is monocolored. Whereas we do not know any odd‐hole‐free graph that is not 3‐clique‐colorable, the existence of a constant C such that any perfect graph is C‐clique‐colorable is an open problem. In this paper we solve this problem for some subclasses of odd‐hole‐free graphs: those that are diamond‐free and those that are bull‐free. We also prove the NP‐completeness of 2‐clique‐coloring K₄‐free perfect graphs. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 233–249, 2006     

A non‐standard finite difference scheme for an advection‐diffusion‐reaction equation

In this note, a non‐standard finite difference (NSFD) scheme is proposed for an advection‐diffusion‐reaction equation with nonlinear reaction term. We first study the diffusion‐free case of this equation, that is, an advection‐reaction equation. Two exact finite difference schemes are constructed for the advection‐reaction equation by the method of characteristics. As these exact schemes are complicated and are not convenient to use, an NSFD scheme is derived from the exact scheme. Then, the NSFD scheme for the advection‐reaction equation is combined with a finite difference space‐approximation of the diffusion term to provide a NSFD scheme for the advection‐diffusion‐reaction equation. This new scheme could preserve the fixed points, the positivity, and the boundedness of the solution of the original equation. Numerical experiments verify the validity of our analytical results. Copyright © 2014 JohnWiley & Sons, Ltd.     

Non‐elementary speed‐ups in logic calculi

In this paper we show some non‐elementary speed‐ups in logic calculi: Both a predicative second‐order logic and a logic for fixed points of positive formulas are shown to have non‐elementary speed‐ups over first‐order logic. Also it is shown that eliminating second‐order cut formulas in second‐order logic has to increase sizes of proofs super‐exponentially, and the same in eliminating second‐order epsilon axioms. These are proved by relying on results due to P. Pudlák. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Combinatorial problems motivated by comma‐free codes

In the paper some combinatorial problems motivated by comma‐free codes are considered. We describe these problems, give the most significant known results and methods used, present some new results and formulate open problems. © 2004 Wiley Periodicals, Inc.     

Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs

In this article, we introduce and study the properties of some target graphs for 2‐edge‐colored homomorphism. Using these properties, we obtain in particular that the 2‐edge‐colored chromatic number of the class of triangle‐free planar graphs is at most 50. We also show that it is at least 12.     

Two‐step Newton‐type methods for solving inverse eigenvalue problems

In this paper, we apply the two‐step Newton method to solve inverse eigenvalue problems, including exact Newton, Newton‐like, and inexact Newton‐like versions. Our results show that both two‐step Newton and two‐step Newton‐like methods converge cubically, and the two‐step inexact Newton‐like method is super quadratically convergent. Numerical implementations demonstrate the effectiveness of new algorithms.     

Life‐like self‐reproducers

In order to understand the interplay among information, genetic instructions, and phenotypic variations, self‐reproducers discovered in two‐dimensional cellular automata are considered as proto‐organisms, which undergo to mutations as they were in a real environmental situation. We realized a computational model through which we have been able to discover the genetic map of the self‐reproducers and the networks they use. Identifying in these maps sets of different functional genes, we found that mutations in the genetic sequences could affect both external shapes and behavior of the self‐reproducers, thus realizing different life‐like strategies in the evolution process. The results highlight that some strategies evolution uses in selecting organisms that are fitting with changing environmental situations maintain the self‐reproducing function, whereas other variations create new self‐reproducers. These self‐reproducers in turn realize different genetic networks, which can be very different from the basic ancestors pools. The mutations that are disruptive bring self‐reproducers to disappear, while other proto‐organisms are generated. © 2004 Wiley Periodicals, Inc. Complexity 9: 38–55, 2004     

Efficient structure‐preserving schemes for good Boussinesq equation

The good Boussinesq equation is endowed with symplectic conservation law and energy conservation law. In this paper, some new highly efficient structure‐preserving methods for the good Boussinesq equation are proposed by improving the standard finite difference method (FDM). The new methods only use and calculate values at the odd (or even) nodes to reduce the computational cost. We call this kind of methods odd‐even method (OEM). Numerical results show that the OEM and the standard FDM have nearly the same numerical errors under the same mesh partition. However, the OEM is much more efficient than the standard FDM, such as the consumed CPU time and occupied memory.     

Distribution‐free precedence control charts with improved runs‐rules

Distribution‐free (nonparametric) control charts are helpful in applications where we do not have enough information about the underlying distribution. The Shewhart precedence charts is a class of Phase I nonparametric charts for location. One of these charts, called the median precedence chart (Med chart hereafter), uses the median of the test sample as the charting statistic, whereas another chart, called the minimum precedence chart (Min chart hereafter), uses the minimum. In this paper, we first study the comparative performance of the Min and the Med charts, respectively, in terms of their in‐control and out‐of‐control run‐length properties in an extensive simulation study. It is seen that neither chart is best as each has its strength in certain situations. Next, we consider enhancing their performance by adding some supplementary runs‐rules. It is seen that the new charts present very attractive run‐length properties, that is, they outperform their competitors in many situations. A summary and some concluding remarks are given. Copyright © 2016 John Wiley & Sons, Ltd.     

A new method for exact solutions of variant types of time‐fractional Korteweg‐de Vries equations in shallow water waves

The current article devoted on the new method for finding the exact solutions of some time‐fractional Korteweg–de Vries (KdV) type equations appearing in shallow water waves. We employ the new method here for time‐fractional equations viz. time‐fractional KdV‐Burgers and KdV‐mKdV equations for finding the exact solutions. We use here the fractional complex transform accompanied by properties of local fractional calculus for reduction of fractional partial differential equations to ordinary differential equations. The obtained results are demonstrated by graphs for the new solutions. Copyright © 2016 John Wiley & Sons, Ltd.     

Existence and global exponential stability of anti‐periodic solutions for delayed quaternion‐valued cellular neural networks with impulsive effects

In this paper, we consider a class of delayed quaternion‐valued cellular neural networks (DQVCNNs) with impulsive effects. By using a novel continuation theorem of coincidence degree theory, the existence of anti‐periodic solutions for DQVCNNs is obtained with or without assuming that the activation functions are bounded. Furthermore, by constructing a suitable Lyapunov function, some sufficient conditions are derived to guarantee the global exponential stability of anti‐periodic solutions for DQVCNNs. Our results are new and complementary to the known results even when DQVCNNs degenerate into real‐valued or complex‐valued neural networks. Finally, an example is given to illustrate the effectiveness of the obtained results.