In this paper, we present an approximate method for solving integro-differential equations of multi-fractional order by using the variational iteration method.
First, we derive the variational iteration formula related to the considered problem, then prove its convergence to the exact solution. Also we give some illustrative examples of linear and nonlinear equations.
The aim of this article, we define new iterative methods called three-step type in which Jungck resolvent CR-iteration and resolvent Jungck SP-iteration are discussed and study rate convergence and strong convergence in Banach space to reach the fixed point which is differentially solve of nonlinear equations. The studies also expanded around it to find the best solution for nonlinear operator equations in addition to the varying inequalities in Hilbert spaces and Banach spaces, as well as the use of these iterative methods to approximate the difference between algorithms and their images, where we examined the necessary conditions that guarantee the unity and existence of the solid point. Finally, the results show that resolvent CR-iter
... Show MoreThe aim of this paper is to study the convergence of an iteration scheme for multi-valued mappings which defined on a subset of a complete convex real modular. There are two main results, in the first result, we show that the convergence with respect to a multi-valued contraction mapping to a fixed point. And, in the second result, we deal with two different schemes for two multivalued mappings (one of them is a contraction and other has a fixed point) and then we show that the limit point of these two schemes is the same. Moreover, this limit will be the common fixed point the two mappings.
In this paper, a modified three-step iteration algorithm for approximating a joint fixed point of non-expansive and contraction mapping is studied. Under appropriate conditions, several strong convergence theorems and Δ-convergence theorems are established in a complete CAT (0) space. a numerical example is introduced to show that this modified iteration algorithm is faster than other iteration algorithms. Finally, we prove that the modified iteration algorithm is stable. Therefore these results are extended and improved to a novel results that are stated by other researchers. Our results are also complement to many well-known theorems in the literature. This type of research can be played a vital role in computer programming
... Show MoreBackground: Urinary incontinence (UI) is a common disorder that affects women of various ages and impacts all aspects of life. This condition negatively influences quality of life. Fractional CO2 laser (10600nm) is the recent method for treatment of stress urinary incontinence in women. Objectives: The purpose of the study was to evaluate the efficacy and safety of fractional CO2 laser (10600nm) in the treatment of female stress urinary incontinence. Materials & Methods: This study was done from July 2020 to February 2021conducted at the laser institute for postgraduate studies university of Baghdad, patients collected from a private clinic and the Department of
... Show MoreThe focus of this article is to add a new class of rank one of modified Quasi-Newton techniques to solve the problem of unconstrained optimization by updating the inverse Hessian matrix with an update of rank 1, where a diagonal matrix is the first component of the next inverse Hessian approximation, The inverse Hessian matrix is generated by the method proposed which is symmetric and it satisfies the condition of modified quasi-Newton, so the global convergence is retained. In addition, it is positive definite that guarantees the existence of the minimizer at every iteration of the objective function. We use the program MATLAB to solve an algorithm function to introduce the feasibility of
... Show MoreIn many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an
... Show MoreThe aim of this article is to study the solution of Elliptic Euler-Poisson-Darboux equation, by using the symmetry of Lie Algebra of orders two and three, as a contribution in partial differential equations and their solutions.
Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the cont
... Show More