Many authors have proposed fixed-point algorithms for obtaining a fixed point of G-nonexpansive mappings without using inertial techniques. To improve convergence behavior, some accelerated methods been introduced. The main aim this paper is to use coordinate affine structure create an algorithm with technique countable family in Hilbert space symmetric directed graph G and prove the weak theor...

We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...

In this paper, we have proposed a new iterative method for finding the solution of ordinary differential equations of the first order. In this method we have extended the idea of variational iteration method by changing the general Lagrange multiplier which is defined in the context of the variational iteration method.This causes the convergent rate of the method increased compared with the var...

Model construction is usually guided by a trial-error process, where each iteration is divided into two steps: (i) collect or refine the set of equations that direct the system behaviour, normally in differential form, solving them using, most of the time, the S transform, and (ii) fit a set of properties (parameters) in the model obtained using observations taken from the real system. There ha...

Most of the work on automated composition of web services has focused so far on the problem of composition at the functional level, i.e., composition of atomic services that can be executed in a single request-response step. In this paper, we address the problem of automated composition at the process level, i.e., a composition that takes into account that executing a web service requires inter...

In this paper we present a model for the bias values associated with linear characteristics of substitution-permutation networks (SPN's). The rst iteration of the model is based on our observation that for suuciently large s-boxes, the best linear characteristic usually involves one active s-box per round. We obtain a result which allows us to compute an upper bound on the probability that line...

in this paper, he's highly prolic variational iteration method is applied ef-fectively for showing the existence, uniqueness and solving a class of singularsecond order two point boundary value problems. the process of nding solu-tion involves generation of a sequence of appropriate and approximate iterativesolution function equally likely to converge to the exact solution of the givenpr...

The Haar wavelet collocation with iteration technique is applied for solving a class of time-fractional physical equations. The approximate solutions obtained by two dimensional Haar wavelet with iteration technique are compared with those obtained by analytical methods such as Adomian decomposition method (ADM) and variational iteration method (VIM). The results show that the present scheme is...

In this paper, we present a comparative study between the modified variational iteration method (MVIM) and a hybrid of Fourier transform and variational iteration method (FTVIM). The study outlines the efficiencyand convergence of the two methods. The analysis is illustrated by investigating four singular partial differential equations with variable coefficients. The solution of singular partia...

Woodin proved the theorem in perhaps 1986 or 1987, using stationary tower forcing and (through the work of Martin and the author) iteration trees. The proof we give here uses only iteration trees. Stationary tower forcing is replaced by “genericity iterations”, as it can be in certain related contexts as well. We believe that the unity of method in the resulting proof gives it some interest. Th...