Search

The purpose of this paper is to introduce the split combination of variational inclusion problem which combines the concept of the modified variational inclusion problem introduced by Khuangsatung and Kangtunyakarn and the split variational inclusion problem introduced by Moudafi. Using a modified Halpern iterative method, we prove the strong convergence theorem for finding a common solution for the hierarchical fixed point problem and the split combination of variational inclusion problem. The result presented in this paper demonstrates the corresponding result for the split zero point problem and the split combination of variation inequality problem. Moreover, we discuss a numerical example for supporting our result and the numerical example shows that our result is not true if some conditions fail.

A mathematical chaos model for the dynamical behaviors of atmospheric acoustic-gravity waves is considered in this paper. Boundedness and globally attractive sets of this chaos model are studied by means of the generalized Lyapunov function method. The innovation of this paper is that it not only proves this system is globally bounded but also provides a series of global attraction sets of this system. The rate of trajectories entering from the exterior of the trapping domain to its interior is also obtained. Finally, the detailed numerical simulations are carried out to justify theoretical results. The results in this study can be used to study chaos control and chaos synchronization of this chaos system.

In this paper, several relations are obtained among the Riemann zeta and Hurwitz zeta functions, as well as their products. A particular case of these relations give rise to a simple re-derivation of the important results of Katsurada and Matsumoto on the mean square of the Hurwitz zeta function. Also, a relation derived here provides the starting point of a novel approach which, in a series of companion papers, yields a formal proof of the Lindel&ouml, f hypothesis. Some of the above relations motivate the need for analysing the large &alpha, behaviour of the modified Hurwitz zeta function &zeta, 1 ( s , &alpha, ) , s &isin, C , &alpha, &isin, ( 0 , &infin, ) , which is also presented here.

The paper shows that, in looking for exact solutions to nonlinear PDEs, the direct method of functional separation of variables can, in certain cases, be more effective than the method of differential constraints based on the compatibility analysis of PDEs with a single constraint (or the nonclassical method of symmetry reductions based on an invariant surface condition). This fact is illustrated by examples of nonlinear reaction-diffusion and convection-diffusion equations with variable coefficients, and nonlinear Klein&ndash, Gordon-type equations. Hydrodynamic boundary layer equations, nonlinear Schr&ouml, dinger type equations, and a few third-order PDEs are also investigated. Several new exact functional separable solutions are given. A possibility of increasing the efficiency of the Clarkson&ndash, Kruskal direct method is discussed. A generalization of the direct method of the functional separation of variables is also described. Note that all nonlinear PDEs considered in the paper include one or several arbitrary functions.

In this paper the notion of ∗ -Weyl curvature tensor on real hypersurfaces in non-flat complex space forms is introduced. It is related to the ∗ -Ricci tensor of a real hypersurface. The aim of this paper is to provide two classification theorems concerning real hypersurfaces in non-flat complex space forms in terms of ∗ -Weyl curvature tensor. More precisely, Hopf hypersurfaces of dimension greater or equal to three in non-flat complex space forms with vanishing ∗ -Weyl curvature tensor are classified. Next, all three dimensional real hypersurfaces in non-flat complex space forms, whose ∗ -Weyl curvature tensor vanishes identically are classified. The used methods are based on tools from differential geometry and solving systems of differential equations.

The fractional calculus is useful in describing the natural phenomena with memory effect. This paper addresses the fractional form of Ambartsumian equation with a delay parameter. It may be a challenge to obtain accurate approximate solution of such kinds of fractional delay equations. In the literature, several attempts have been conducted to analyze the fractional Ambartsumian equation. However, the previous approaches in the literature led to approximate power series solutions which converge in subdomains. Such difficulties are solved in this paper via the Homotopy Perturbation Method (HPM). The present approximations are expressed in terms of the Mittag-Leffler functions which converge in the whole domain of the studied model. The convergence issue is also addressed. Several comparisons with the previous published results are discussed. In particular, while the computed solution in the literature is physical in short domains, with our approach it is physical in the whole domain. The results reveal that the HPM is an effective tool to analyzing the fractional Ambartsumian equation.

The integral representation of the two-parameter Mittag-Leffler function E &rho, &mu, ( z ) is considered in the paper that expresses its value in terms of the contour integral. For this integral representation, the transition is made from integration over a complex variable to integration over real variables. It is shown that as a result of such a transition, the integral representation of the function E &rho, ( z ) has two forms: the representation &ldquo, A&rdquo, and &ldquo, B&rdquo, Each of these representations has its advantages and drawbacks. In the paper, the corresponding theorems are formulated and proved, and the advantages and disadvantages of each of the obtained representations are discussed.

The famous Toms effect (1948) consists of a substantial increase of the critical Reynolds number when a small amount of soluble polymer is introduced into water. The most noticeable influence of polymer additives is manifested in the boundary layer near solid surfaces. The goal of the present paper is a group analysis of the boundary layer equations in two mathematical models of the flow of aqueous polymer solutions: the second grade fluid (Rivlin and Ericksen, 1955) and the model derived by Pavlovskii (1971). The equations of the unsteady two-dimensional boundary layer in the Pavlovskii and Rivlin-Ericksen models are analyzed for the first time here. These equations have no definite type so that finding their exact solutions is very important in order to understand the mathematical nature of the above mentioned models. The problem of group classification with respect to the arbitrary function of the longitudinal coordinate and time present in the equations, which sets the pressure gradient of the external flow, arises. All functions for which an extension of the admitted Lie group occurs are found. The task includes the ratio of two characteristic length scales. One of them is the Prandtl scale, and another is defined as the square root of the normalized coefficient of relaxation viscosity (Frolovskaya and Pukhnachev, 2018) and does not depend on the characteristics of the motion. The paper contains a number of exact solutions in the Pavlovskii model including a solution describing the flow near a critical point. Among the solutions of the new model of the boundary layer, a special place is taken by the solution of the stationary problem of flow around a rectilinear plate. Within the framework of the Prandtl theory of the boundary layer, such a solution was constructed by Blasius (1908). As is well-known, this solution has a non-removable defect: the transverse velocity near the edge of the plate increases without bound. The introduction of a relaxation term into the model makes it possible to eliminate this singularity.

The Opial property of Hilbert spaces is essential in many fixed point theorems of non-expansive maps. While the Opial property does not hold in every Banach space, the Bregman&ndash, Opial property does. This suggests to study fixed point theorems for various Bregman non-expansive like maps in the general Banach space setting. In this paper, after introducing the notion of Bregman generalized hybrid sequences in a reflexive Banach space, we prove (with using the Bregman&ndash, Opial property instead of the Opial property) convergence theorems for such sequences. We also provide new fixed point theorems for Bregman generalized hybrid maps defined on an arbitrary but not necessarily convex subset of a reflexive Banach space. We end this paper with a brief discussion of the existence of Bregman absolute fixed points of such maps.

In this paper, a wind speed prediction method was proposed based on the maximum Lyapunov exponent (Le) and the fractional Levy stable motion (fLsm) iterative prediction model. First, the calculation of the maximum prediction steps was introduced based on the maximum Le. The maximum prediction steps could provide the prediction steps for subsequent prediction models. Secondly, the fLsm iterative prediction model was established by stochastic differential. Meanwhile, the parameters of the fLsm iterative prediction model were obtained by rescaled range analysis and novel characteristic function methods, thereby obtaining a wind speed prediction model. Finally, in order to reduce the error in the parameter estimation of the prediction model, we adopted the method of weighted wind speed data. The wind speed prediction model in this paper was compared with GA-BP neural network and the results of wind speed prediction proved the effectiveness of the method that is proposed in this paper. In particular, fLsm has long-range dependence (LRD) characteristics and identified LRD by estimating self-similarity index H and characteristic index &alpha, Compared with fractional Brownian motion, fLsm can describe the LRD process more flexibly. However, the two parameters are not independent because the LRD condition relates them by &alpha, H &gt, 1.

The aim of this paper is to study the Lagrange interpolation on the unit circle taking only into account the separation properties of the nodal points. The novelty of this paper is that we do not consider nodal systems connected with orthogonal or paraorthogonal polynomials, which is an interesting approach because in practical applications this connection may not exist. A detailed study of the properties satisfied by the nodal system and the corresponding nodal polynomial is presented. We obtain the relevant results of the convergence related to the process for continuous smooth functions as well as the rate of convergence. Analogous results for interpolation on the bounded interval are deduced and finally some numerical examples are presented.

Probabilistic evolution theory (PREVTH) forms a framework for the solution of explicit ODEs. The purpose of the paper is two-fold: (1) conversion of multinomial right-hand sides of the ODEs to purely second degree multinomial right-hand sides by space extension, (2) decrease the computational burden of probabilistic evolution theory by using the condensed Kronecker product. A first order ODE set with multinomial right-hand side functions may be converted to a first order ODE set with purely second degree multinomial right-hand side functions at the expense of an increase in the number of equations and unknowns. Obtaining purely second degree multinomial right-hand side functions is important because the solution of such equation set may be approximated by probabilistic evolution theory. A recent article by the authors states that the ODE set with the smallest number of unknowns can be found by searching. This paper gives the details of a way to search for the optimal space extension. As for the second purpose of the paper, the computational burden can be reduced by considering the properties of the Kronecker product of vectors and how the Kronecker product appears within the recursion of PREVTH: as a Cauchy product structure.

This paper focuses on the problem of finite-time stabilization of homogeneous, non-Lipschitz systems with dilations. A key contribution of this paper is the design of a virtual recursive Hölder, non-Lipschitz state feedback which renders the non-Lipschitz systems in the special case dominated by a lower-triangular nonlinear system, finite-time stable. The proof is based on a recursive design algorithm developed recently, to construct the virtual Hölder continuous, finite-time stabilizer as well as a C1 positive definite and proper Lyapunov function that guarantees finite-time stability of the non-Lipschitz non-linear systems.

Using some of the extended fixed point results for Geraghty contractions in b-metric spaces given by Faraji, Savić and Radenović and their idea to apply these results to nonlinear integral equations, in this paper we present some existence and uniqueness conditions for the solution of a nonlinear Fredholm&ndash, Volterra integral equation with a modified argument.

In applications, many states given for a system can be expressed by orthonormal elements, called “state elements,” taken in a separable Hilbert space (called “state space”). The exact nature of the Hilbert space depends on the system, for example, the state space for position and momentum states is the space of square-integrable functions. The symmetries of a quantum system can be represented by a class of unitary operators that act in the Hilbert space. The operators called ladder operators have the effect of lowering or raising the energy of the state. In this paper, we study the spectral properties of a self-adjoint, fourth-order differential operator with a bounded operator coefficient and establish a second regularized trace formula for this operator.

In this paper, a symmetric eight-step predictor method (explicit) of 10th order is presented for the numerical integration of IVPs of second-order ordinary differential equations. This scheme has variable coefficients and can be used as a predictor stage for other implicit schemes. First, we showed the singular P-stability property of the new method, both algebraically and by plotting the stability region. Then, having applied it to well-known problems like Mathieu equation, we showed the advantage of the proposed method in terms of efficiency and consistency over other methods with the same order.

In this paper, we mainly investigate the weak convergence analysis about the error terms which are determined by the discretization for solving the stochastic differential equation (SDE, for short) in forward-backward stochastic differential equations (FBSDEs, for short), which is on the basis of Itô Taylor expansion, the numerical SDE theory, and numerical FBSDEs theory. Under the weak convergence analysis of FBSDEs, we further establish better error estimates of recent numerical schemes for solving FBSDEs.

In this paper, we discuss the approximate controllability for a class of retarded semilinear neutral control systems of fractional order by investigating the relations between the reachable set of the semilinear retarded neutral system of fractional order and that of its corresponding linear system. The research direction used here is to find the conditions for nonlinear terms so that controllability is maintained even in perturbations. Finally, we will show a simple example to which the main result can be applied.

In previous work, we considered a four-quadrant Riemann problem for a 2×2 hyperbolic system in which delta shock appears at the initial discontinuity without assuming that each jump of the initial data projects exactly one plane elementary wave. In this paper, we consider the case that does not involve a delta shock at the initial discontinuity. We classified 18 topologically distinct solutions and constructed analytic and numerical solutions for each case. The constructed analytic solutions show the rich structure of wave interactions in the Riemann problem, which coincide with the computed numerical solutions.

Discrete Gaussian sampling is one of the fundamental mathematical tools for lattice-based cryptography. In this paper, we revisit the Bernoulli(-type) sampling for centered discrete Gaussian distributions over the integers, which was proposed by Ducas et al. in 2013. Combining the idea of Karney’s algorithm for sampling from the Bernoulli distribution Be−1/2, we present an improved Bernoulli sampling algorithm. It does not require the use of floating-point arithmetic to generate a precomputed table, as the original Bernoulli sampling algorithm did. It only needs a fixed look-up table of very small size (e.g., 128 bits) that stores the binary expansion of ln2. We also propose a noncentered version of Bernoulli sampling algorithm for discrete Gaussian distributions with varying centers over the integers. It requires no floating-point arithmetic and can support centers of precision up to 52 bits. The experimental results show that our proposed algorithms have a significant improvement in the sampling efficiency as compared to other rejection algorithms.

In this paper, we are concerned with the singular elliptic problems driven by the double phase operator and and Dirichlet boundary conditions. In view of the variational approach, we establish the existence of at least one nontrivial solution and two distinct nontrivial solutions under some general assumptions on the nonlinearity f. Here we use Ricceri’s variational principle and Bonanno’s three critical points theorem in order to overcome the lack of compactness.

Fourier series is a well-established subject and widely applied in various fields. However, there is much less work on double Fourier coefficients in relation to spaces of general double sequences. We understand the space of double Fourier coefficients as an abstract space of sequences and examine relationships to spaces of general double sequences: p-power summable sequences for p = 1, 2, and the Hilbert space of double sequences. Using uniform convergence in the sense of a Cesa`ro mean, we verify the inclusion relationships between the four spaces of double sequences, they are nested as proper subsets. The completions of two spaces of them are found to be identical and equal to the largest one. We prove that the two-parameter Wiener space is isomorphic to the space of Cesa`ro means associated with double Fourier coefficients. Furthermore, we establish that the Hilbert space of double sequence is an abstract Wiener space. We think that the relationships of sequence spaces verified at an intermediate stage in this paper will provide a basis for the structures of those spaces and expect to be developed further as in the spaces of single-indexed sequences.

In this paper, we introduce two novel extragradient-like methods to solve variational inequalities in a real Hilbert space. The variational inequality problem is a general mathematical problem in the sense that it unifies several mathematical models, such as optimization problems, Nash equilibrium models, fixed point problems, and saddle point problems. The designed methods are analogous to the two-step extragradient method that is used to solve variational inequality problems in real Hilbert spaces that have been previously established. The proposed iterative methods use a specific type of step size rule based on local operator information rather than its Lipschitz constant or any other line search procedure. Under mild conditions, such as the Lipschitz continuity and monotonicity of a bi-function (including pseudo-monotonicity), strong convergence results of the described methods are established. Finally, we provide many numerical experiments to demonstrate the performance and superiority of the designed methods.

In this paper, we will consider the problem of constructing stable maps between two closed orientable surfaces M and N with a given branch set of curves immersed on N. We will study, from a global point of view, the behavior of its families in different isotopies classes on the space of smooth maps. The main goal is to obtain different relationships between invariants. We will provide a new proof of Quine&rsquo, s Theorem.

Logit, probit and complementary log-log models are the most widely used models when binary dependent variables are available. Conventionally, these models have been frequentists. This paper aims to demonstrate how such models can be implemented relatively quickly and easily from a Bayesian framework using Gibbs sampling Markov chain Monte Carlo simulation methods in WinBUGS. We focus on the modeling and prediction of Down syndrome (DS) and Mental retardation (MR) data from an observational study at Kuwait Medical Genetic Center over a 30-year time period between 1979 and 2009. Modeling algorithms were used in two distinct ways; firstly, using three different methods at the disease level, including logistic, probit and cloglog models, and, secondly, using bivariate logistic regression to study the association between the two diseases in question. The models are compared in terms of their predictive ability via R2, adjusted R2, root mean square error (RMSE) and Bayesian Deviance Information Criterion (DIC). In the univariate analysis, the logistic model performed best, with R2 (0.1145), adjusted R2 (0.114), RMSE (0.3074) and DIC (7435.98) for DS, and R2 (0.0626), adjusted R2 (0.0621), RMSE (0.4676) and DIC (23120) for MR. In the bivariate case, results revealed that 7 and 8 out of the 10 selected covariates were significantly associated with DS and MR respectively, whilst none were associated with the interaction between the two outcomes. Bayesian methods are more flexible in handling complex non-standard models as well as they allow model fit and complexity to be assessed straightforwardly for non-nested hierarchical models.

In this paper, we derive a number of interesting results concerning subordination and superordination relations for certain analytic functions associated with an extension of the Mittag–Leffler function.

The aim of this paper is to present a new method and the tool to validate the numerical results of the Volterra integral equation with discontinuous kernels in linear and non-linear forms obtained from the Adomian decomposition method. Because of disadvantages of the traditional absolute error to show the accuracy of the mathematical methods which is based on the floating point arithmetic, we apply the stochastic arithmetic and new condition to study the efficiency of the method which is based on two successive approximations. Thus the CESTAC method (Controle et Estimation Stochastique des Arrondis de Calculs) and the CADNA (Control of Accuracy and Debugging for Numerical Applications) library are employed. Finding the optimal iteration of the method, optimal approximation and the optimal error are some of advantages of the stochastic arithmetic, the CESTAC method and the CADNA library in comparison with the floating point arithmetic and usual packages. The theorems are proved to show the convergence analysis of the Adomian decomposition method for solving the mentioned problem. Also, the main theorem of the CESTAC method is presented which shows the equality between the number of common significant digits between exact and approximate solutions and two successive approximations.This makes in possible to apply the new termination criterion instead of absolute error. Several examples in both linear and nonlinear cases are solved and the numerical results for the stochastic arithmetic and the floating-point arithmetic are compared to demonstrate the accuracy of the novel method.

In this paper, we further study the generating function involving a variety of special numbers and ploynomials constructed by the second author. Applying the Mellin transformation to this generating function, we define a new class of zeta type functions, which is related to the interpolation functions of the Apostol&ndash, Bernoulli polynomials, the Bernoulli polynomials, and the Euler polynomials. This new class of zeta type functions is related to the Hurwitz zeta function, the alternating Hurwitz zeta function, and the Lerch zeta function. Furthermore, by using these functions, we derive some identities and combinatorial sums involving the Bernoulli numbers and polynomials and the Euler numbers and polynomials.

In this field of research, in order to solve fuzzy fractional differential equations, they are normally transformed to their corresponding crisp problems. This transformation is called the embedding method. The aim of this paper is to present a new direct method to solve the fuzzy fractional differential equations using fuzzy calculations and without this transformation. In this work, the fuzzy generalized Taylor expansion by using the sense of fuzzy Caputo fractional derivative for fuzzy-valued functions is presented. For solving fuzzy fractional differential equations, the fuzzy generalized Euler’s method is introduced and applied. In order to show the accuracy and efficiency of the presented method, the local and global truncation errors are determined. Moreover, the consistency, convergence, and stability of the generalized Euler’s method are proved in detail. Eventually, the numerical examples, especially in the switching point case, show the flexibility and the capability of the presented method The work of J.J. Nieto has been partially supported by Agencia Estatal de Investigación (AEI) of Spain under grant MTM2016-75140-P, co-financed by the European Community fund FEDER, and XUNTA de Galicia under grants GRC2015-004 and ED431C 2019/02 SI

In this paper, we introduce a general procedure to construct the Taylor series development of the inverse of an analytical function, in other words, given y=f(x), we provide the power series that defines its inverse x=hf(y). We apply the obtained results to solve nonlinear equations in an analytic way, and generalize Catalan and Fuss&ndash, Catalan numbers.

In this paper, we obtain the existence, uniqueness, and positivity of the solution to delayed stochastic differential equations with jumps. This equation is then applied to model the price movement of the risky asset in a financial market and the Black&ndash, Scholes formula for the price of European option is obtained together with the hedging portfolios. The option price is evaluated analytically at the last delayed period by using the Fourier transformation technique. However, in general, there is no analytical expression for the option price. To evaluate the price numerically, we then use the Monte-Carlo method. To this end, we need to simulate the delayed stochastic differential equations with jumps. We propose a logarithmic Euler&ndash, Maruyama scheme to approximate the equation and prove that all the approximations remain positive and the rate of convergence of the scheme is proved to be 0.5.

Let Fn be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest positive integer k such that Fk&equiv, 0(modn). In this paper, we shall find all positive solutions of the Diophantine equation z(&phi, (n))=n, where &phi, is the Euler totient function.

Kim and Kim (Russ. J. Math. Phys. 26, 2019, 40-49) introduced polyexponential function as an inverse to the polylogarithm function and by this, constructed a new type poly-Bernoulli polynomials. Recently, by using the polyexponential function, a number of generalizations of some polynomials and numbers have been presented and investigated. Motivated by these researches, in this paper, multi-poly-Euler polynomials are considered utilizing the degenerate multiple polyexponential functions and then, their properties and relations are investigated and studied. That the type 2 degenerate multi-poly-Euler polynomials equal a linear combination of the degenerate Euler polynomials of higher order and the degenerate Stirling numbers of the first kind is proved. Moreover, an addition formula and a derivative formula are derived. Furthermore, in a special case, a correlation between the type 2 degenerate multi-poly-Euler polynomials and degenerate Whitney numbers is shown.

This paper proposes a new approach based on the regression framework employing a pivotal quantity to estimate unknown parameters of a Weibull distribution under the progressive Type-II censoring scheme, which provides a closed form solution for the shape parameter, unlike its maximum likelihood estimator counterpart. To resolve serious rounding errors for the exact mean and variance of the pivotal quantity, two different types of Taylor series expansion are applied, and the resulting performance is enhanced in terms of the mean square error and bias obtained through the Monte Carlo simulation. Finally, an actual application example, including a simple goodness-of-fit analysis of the actual test data based on the pivotal quantity, proves the feasibility and applicability of the proposed approach.

The purpose of this paper is to propose an iterative algorithm for solving the split equality common null point problem (SECNP), which is to find an element of the set of common zero points for a finite family of maximal monotone operators in Hilbert spaces. We introduce the concept of bounded linear regularity for the SECNP and construct several sufficient conditions to ensure the linear convergence of the algorithm. Moreover, some numerical experiments are given to test the validity of our results.

In this paper, a discrete-time model for Babesiosis disease, given by means of nonstandard finite difference (NSFD) schemes, is first provided and analyzed. Mathematical analyses show that the provided NSFD schemes preserve the essential (qualitative) dynamical properties of the continuous-time model, namely, positivity and boundedness of the solutions, equilibria, and their stability properties. In particular, the global stability of the disease free equilibrium point is proved by using an appropriate Lyapunov function. As a relevant consequence, we get the dynamic consistency of NSFD schemes in relation to the continuous-time model. Numerical simulations are presented to support the validity of the established theoretical results.

In actuarial mathematics, the claims of an insurance portfolio are often modeled using the collective risk model, which consists of a random number of claims of independent, identically distributed (i.i.d.) random variables (r.v.s) that represent cost per claim. To facilitate computations, there is a classical assumption of independence between the random number of such random variables (i.e., the claims frequency) and the random variables themselves (i.e., the claim severities). However, recent studies showed that, in practice, this assumption does not always hold, hence, introducing dependence in the collective model becomes a necessity. In this sense, one trend consists of assuming dependence between the number of claims and their average severity. Alternatively, we can consider heterogeneity between the individual cost of claims associated with a given number of claims. Using the Sarmanov distribution, in this paper we aim at introducing dependence between the number of claims and the individual claim severities. As marginal models, we use the Poisson and Negative Binomial (NB) distributions for the number of claims, and the Gamma and Lognormal distributions for the cost of claims. The maximum likelihood estimation of the proposed Sarmanov distribution is discussed. We present a numerical study using a real data set from a Spanish insurance portfolio.

In this paper, a comparative study has been made between different algorithms to find the numerical solutions of the fractional-order clock chemical model (FOCCM). The spectral collocation method (SCM) with the shifted Legendre polynomials, the two-stage fractional Runge–Kutta method (TSFRK) and the four-stage fractional Runge–Kutta method (FSFRK) are used to approximate the numerical solutions of FOCCM. Our results are compared with the results obtained for the numerical solutions that are based upon the fundamental theorem of fractional calculus as well as the Lagrange polynomial interpolation (LPI). Firstly, the accuracy of the results is checked by computing the absolute error between the numerical solutions by using SCM, TSFRK, FSFRK, and LPI and the exact solution in the case of the fractional-order logistic equation (FOLE). The numerical results demonstrate the accuracy of the proposed method. It is observed that the FSFRK is better than those by SCM, TSFRK and LPI in the case of an integer order. However, the non-integer orders in the cases of the SCM and LPI are better than those obtained by using the TSFRK and FSFRK. Secondly, the absolute error between the numerical solutions of FOCCM based upon SCM, TSFFRK, FSFRK, and LPI for integer order and non-integer order has been computed. The absolute error in the case of the integer order by using the three methods of the third order is considered. For the non-integer order, the order of the absolute error in the case of SCM is found to be the best. Finally, these results are graphically illustrated by means of different figures.

When a straight cylindrical conductor of finite length is electrostatically charged, its electrostatic potential ϕ depends on the electrostatic charge qe, as expressed by the equation L(qe)=ϕ, where L is an integral operator. Method of moments (MoM) is an excellent candidate for solving L(qe)=ϕ numerically. In fact, considering qe as a piece-wise constant over the length of the conductor, it can be expressed as a finite series of weighted basis functions, qe=&sum, n=1N&alpha, nfn (with weights &alpha, n and N, number of the subsections of the conductor) defined in the L domain so that ϕ becomes a finite sum of integrals from which, considering testing functions suitably combined with the basis functions, one obtains an algebraic system Lmn&alpha, n=gm with dense matrix, equivalent to L(qe)=ϕ. Once solved, the linear algebraic system gets &alpha, n and therefore qe is obtainable so that the electrostatic capacitance C=qe/V, where V is the external electrical tension applied, can give the corresponding electrostatic capacitance. In this paper, a comparison was made among some Krylov subspace method-based procedures to solve Lmn&alpha, n=gm. These methods have, as a basic idea, the projection of a problem related to a matrix A&isin, Rn&times, n, having a number of non-null elements of the order of n, in a subspace of lower order. This reduces the computational complexity of the algorithms for solving linear algebraic systems in which the matrix is dense. Five cases were identified to determine Lmn according to the type of basis-testing functions pair used. In particular: (1) pulse function as the basis function and delta function as the testing function, (2) pulse function as the basis function as well as testing function, (3) triangular function as the basis function and delta function as the testing function, (4) triangular function as the basis function and pulse function as the testing function, (5) triangular function as the basis function with the Galerkin Procedure. Therefore, five Lmn and five pair qe and C were computed. For each case, for the resolution of Lmn&alpha, n=gm obtained, GMRES, CGS, and BicGStab algorithms (based on Krylov subspaces approach) were implemented in the MatLab&reg, Toolbox to evaluate qe and C as N increases, highlighting asymptotical behaviors of the procedures. Then, a particular value for N is obtained, exploiting both the conditioning number of Lmn and considerations on C, to avoid instability phenomena. The performances of the exploited procedures have been evaluated in terms of convergence speed and CPU-times as the length/diameter and N increase. The results show the superiority of BcGStab, compared to the other procedures used, since even if the number of iterations increases significantly, the CPU-time decreases (more than 50%) when the asymptotic behavior of all the procedures is in place. This superiority is much more evident when the CPU-time of BicGStab is compared with that achieved by exploiting Gauss elimination and Gauss&ndash, Seidel approaches.

A (legal) knight&rsquo, s move is the result of moving the knight two squares horizontally or vertically on the board and then turning and moving one square in the perpendicular direction. A closed knight&rsquo, s tour is a knight&rsquo, s move that visits every square on a given chessboard exactly once and returns to its start square. A closed knight&rsquo, s tour and its variations are studied widely over the rectangular chessboard or a three-dimensional rectangular box. For m , n &gt, 2 r , an ( m , n , r ) -ringboard or ( m , n , r ) -annulus-board is defined to be an m &times, n chessboard with the middle part missing and the rim contains r rows and r columns. In this paper, we obtain that a ( m , n , r ) -ringboard with m , n &ge, 3 and m , n &gt, 2 r has a closed knight&rsquo, s tour if and only if (a) m = n = 3 and r = 1 or (b) m , n &ge, 7 and r &ge, 3 . If a closed knight&rsquo, s tour on an ( m , n , r ) -ringboard exists, then it has symmetries along two diagonals.

This paper uses a locking-free nonconforming Crouzeix&ndash, Raviart finite element to solve the planar linear elastic eigenvalue problem with homogeneous pure displacement boundary condition. Making full use of the Poincar&eacute, inequality, we obtain the guaranteed lower bounds for eigenvalues. Besides, we also use the nonconforming Crouzeix&ndash, Raviart finite element to the planar linear elastic eigenvalue problem with the pure traction boundary condition, and obtain the guaranteed lower eigenvalue bounds. Finally, numerical experiments with MATLAB program are reported.

The purpose of this paper is to introduce two different kinds of iterative algorithms with inertial effects for solving variational inequalities. The iterative processes are based on the extragradient method, the Mann-type method and the viscosity method. Convergence theorems of strong convergence are established in Hilbert spaces under mild assumption that the associated mapping is Lipschitz continuous, pseudo-monotone and sequentially weakly continuous. Numerical experiments are performed to illustrate the behaviors of our proposed methods, as well as comparing them with the existing one in literature.

The main goal of this paper is to define a simple but effective method for approximating solutions of multi-order fractional differential equations relying on Caputo fractional derivative and under supplementary conditions. Our basis functions are based on some original generalization of the Bessel polynomials, which satisfy many properties shared by the classical orthogonal polynomials as given by Hermit, Laguerre, and Jacobi. The main advantages of our polynomials are two-fold: All the coefficients are positive and any collocation matrix of Bessel polynomials at positive points is strictly totally positive. By expanding the unknowns in a (truncated) series of basis functions at the collocation points, the solution of governing differential equation can be easily converted into the solution of a system of algebraic equations, thus reducing the computational complexities considerably. Several practical test problems also with some symmetries are given to show the validity and utility of the proposed technique. Comparisons with available exact solutions as well as with several alternative algorithms are also carried out. The main feature of our approach is the good performance both in terms of accuracy and simplicity for obtaining an approximation to the solution of differential equations of fractional order.

In our recent work we have introduced and studied a notion of a generalized nonexpansive mapping. In the definition of this notion the norm has been replaced by a general function satisfying certain conditions. For this new class of mappings, we have established the existence of unique fixed points and the convergence of iterates. In the present paper we construct an example of a generalized nonexpansive self-mapping of a bounded, closed and convex set in a Hilbert space, which is not nonexpansive in the classical sense.

In this paper, we find a solution of an open problem posed by Alzer, Berg, and Koumandos: determine ( &alpha, m ) &isin, R + &times, N such that the function x &alpha, &psi, ( m ) ( x ) | is completely monotonic on ( 0 , &infin, ) , where &psi, ( x ) denotes the logarithmic derivative of Euler&rsquo, s gamma function.

In this paper, we propose a new method, which is set up by incorporating an inertial step with the extragradient method for solving a strongly pseudomonotone equilibrium problems. This method had to comply with a strongly pseudomonotone property and a certain Lipschitz-type condition of a bifunction. A strong convergence result is provided under some mild conditions, and an iterative sequence is accomplished without previous knowledge of the Lipschitz-type constants of a cost bifunction. A sufficient explanation is that the method operates with a slow-moving stepsize sequence that converges to zero and non-summable. For numerical explanations, we analyze a well-known equilibrium model to support our well-established convergence result, and we can see that the proposed method seems to have a significant consistent improvement over the performance of the existing methods.

In this paper, we study such combinatorial objects as labeled binary trees of size n with m ascents on the left branch and labeled Dyck n-paths with m ascents on return steps. For these combinatorial objects, we present the relation of the generated number triangle to Catalan&rsquo, s and Euler&rsquo, s triangles. On the basis of properties of Catalan&rsquo, s triangles, we obtain an explicit formula that counts the total number of such combinatorial objects and a bivariate generating function. Combining the properties of these two number triangles allows us to obtain different combinatorial objects that may have a symmetry, for example, in their form or in their formulas.

This paper is concerned with the stability of an age-structured susceptible&ndash, exposed&ndash, infective&ndash, recovered&ndash, susceptible (SEIRS) model with time delay. Firstly, the traveling wave solution of system can be obtained by using the method of characteristic. The existence and uniqueness of the continuous traveling wave solution is investigated under some hypotheses. Moreover, the age-structured SEIRS system is reduced to the nonlinear autonomous system of delay ODE using some insignificant simplifications. It is studied that the dimensionless indexes for the existence of one disease-free equilibrium point and one endemic equilibrium point of the model. Furthermore, the local stability for the disease-free equilibrium point and the endemic equilibrium point of the infection-induced disease model is established. Finally, some numerical simulations were carried out to illustrate our theoretical results.

In this paper, we define cosine Bernoulli polynomials and sine Bernoulli polynomials related to the q-number. Furthermore, we intend to find the properties of these polynomials and check the structure of the roots. Through numerical experimentation, we look for various assumptions about the polynomials above.

In the recent literature, some fractional one-point Newton-type methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper, we introduce a new fractional Newton-type method with order of convergence &alpha, + 1 and compare it with the existing fractional Newton method with order 2 &alpha, Moreover, we also introduce a multipoint fractional Traub-type method with order 2 &alpha, + 1 and compare its performance with that of its first step. Some numerical tests and analysis of the dependence on the initial estimations are made for each case, including a comparison with classical Newton ( &alpha, = 1 of the first step of the class) and classical Traub&rsquo, s scheme ( &alpha, = 1 of fractional proposed multipoint method). In this comparison, some cases are found where classical Newton and Traub&rsquo, s methods do not converge and the proposed methods do, among other advantages.