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...

In this paper, we apply the Newton’s and He’s iteration formulas in order to solve the nonlinear algebraic equations. In this case, we use the stochastic arithmetic and the CESTAC method to validate the results. We show that the He’s iteration formula is more reliable than the Newton’s iteration formula by using the CADNA library.

Iterative methods for solving linear systems of equations can be very eecient if the structure of the coeecient matrix can be exploited to accelerate the convergence of the iterative process. However, for classes of problems for which suitable preconditioners cannot be found or for which the iteration scheme does not converge, iterative techniques may be inappropriate. This paper proposes a tec...

In this paper, a necessary and sufficient conditions for the strong convergence to a common fixed point of a finite family of continuous pseudocontractive mappings are proved in an arbitrary real Banach space using an implicit iteration scheme recently introduced by Xu and Ori [H.K. Xu, R.G. Ori, An implicit iteration process for nonexpansive mappings, Numer. Fuct. Anal. Optim. 22 (2001) 767–77...

In this paper, we introduce a modified variational iteration method for second order initial value problems by transforming the integral of iteration process. The main advantages of this modification are that it can overcome the restriction of the form of nonlinearity term in differential equations and improve the iterative speed of conventional variational iteration method. The method is appli...

In this paper we present some visualization techniques which assist in understanding the iteration process of learning algorithms for neural networks. In the case of perceptron learning, we show that the algorithm can be visualized as a search on the surface of what we call the boolean sphere. In the case of backpropagation, we show that the iteration path is not just random noise, but that und...

In this article we first discuss the existence and uniqueness of a solution for the coincidence problem: Find p ∈ X such that Tp = Sp, where X is a nonempty set, Y is a complete metric space, and T,S :X → Y are two mappings satisfying a Wardowski type condition of contractivity. Later on, we will state the convergence of the Picard-Juncgk iteration process to the above coincidence problem as we...

‎The ABS methods‎, ‎introduced by Abaffy‎, ‎Broyden and Spedicato‎, ‎are‎‎direct iteration methods for solving a linear system where the‎‎$i$-th iteration satisfies the first $i$ equations‎, ‎therefore a‎ ‎system of $m$ equations is solved in at most $m$ steps‎. ‎In this‎‎paper‎, ‎we introduce a class of ABS-type methods for solving a full row‎‎rank linear equations‎, ‎w...

this paper presents a comparison between variational iteration method (vim) and modfied variational iteration method (mvim) for approximate solution a system of volterra integral equation of the first kind. we convert a system of volterra integral equations to a system of volterra integro-di®erential equations that use vim and mvim to approximate solution of this system and hence obtain an appr...

in this paper, first a new homotopy perturbation method for solving a fractional order nonlinear telegraph equation is introduced. by applying the proposed method, the nonlinear equation is translated to linear equations for per iteration of homotopy perturbation method. then, the obtained problems are solved with separation method. in the examples, it is illustrated that the exact solution is ...