In this study a convergence analysis for a fast multi-step Chebyshe-Halley-type method for solving nonlinear equations involving Banach space valued operator is presented. We introduce a more precise convergence region containing the iterates leading to tighter Lipschitz constants and functions. This way advantages are obtained in both the local as well as the semi-local convergence case under the same computational cost such as: extended convergence domain, tighter error bounds on the distances involved and a more precise information on the location of the solution. The new technique can be used to extend the applicability of other iterative methods. The numerical examples further validate the theoretical results.
Graph labeling plays an important role in different branches of sciences. It gives useable information in the study of radar, missile and rocket theory. In scheme theory, coding theory and computer networking graph labeling is widely employed. In the present paper, we find necessary conditions for the octagonal planner map and multiple wheel graph to be super cyclic antimagic cover and then discuss their super cyclic antimagic covering.
This paper presents the development of a new numerical scheme for the solution of exponential growth and decay models emanated from biological sciences. The scheme has been derived via the combination of two interpolants namely, polynomial and exponential functions. The analysis of the local truncation error of the derived scheme is investigated by means of the Taylor’s series expansion. In order to test the performance of the scheme in terms of accuracy in the context of the exact solution, four biological models were solved numerically. The absolute error has been computed successfully at each mesh point of the integration interval under consideration. The numerical results generated via the scheme agree with the exact solution and with the fifth order convergence based upon the analysis carried out. Hence, the scheme is found to be of order five, accurate and is a good approach to be included in the class of linear explicit numerical methods for the solution of initial value problems in ordinary differential equations.
A new series representation of the modified Bessel function of the second kind \(K_0(x)\) in terms of simple elementary functions (Kummer’s function) is obtained. The accuracy of different orders in this expansion is analysed and has been shown not to be so good as those of different approximations found in the literature. In the sequel, new polynomial approximations for \(K_0(x)\), in the limits \(0<x\leq 2\) and \(2\leq x < \infty\), are obtained. They are shown to be much more accurate than the two best classical approximations given by the Abramowitz and Stegun’s Handbook, for those intervals.
The aim of this paper is to study the fractional Hadamard inequalities for Caputo fractional derivatives of strongly convex functions. We obtain refinements of two known fractional versions of the Hadamard inequality for convex functions. By applying identities for Caputo fractional derivatives we get refinements of error bounds of these inequalities. The given results simultaneously provide refinements as well as generalizations of already known inequalities.
