in this study, we modify an iterative non-optimal without memory method, in such a way that is becomes optimal. therefore, we obtain convergence order eight with the some functional evaluations. to justify our proposed method, some numerical examples are given.

lsmr (least squares minimal residual) is an iterative method for the solution of the linear system of equations and leastsquares problems. this paper presents a block version of the lsmr algorithm for solving linear systems with multiple right-hand sides. the new algorithm is based on the block bidiagonalization and derived by minimizing the frobenius norm of the resid ual matrix of normal equa...

In this paper, the Kadomtsev-Petviashvili equation is solved by using the Adomian’s decomposition method , modified Adomian’s decomposition method , variational iteration method , modified variational iteration method, homotopy perturbation method, modified homotopy perturbation method and homotopy analysis method. The existence and uniqueness of the solution and convergence of the proposed...

In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...

We consider the formulation and local analysis of various quadratically convergent methods for solving the symmetric matrix inverse eigenvalue problem. One of these methods is new. We study the case where multiple eigenvalues are given: we show how to state the problem so that it is not overdetermined, and describe how to modify the numerical methods to retain quadratic convergence on the modif...

We propose three time-splitting schemes for nonlinear time-fractional differential equations with smooth solutions, where the order of the fractional derivative is 0 < α < 1. While one of the schemes is of order α, the other two schemes are of order 1 + α and 2 − α and thus they can be combined to provide flexible numerical methods with convergence order no less than 3/2. We prove the convergen...

A version of the fundamental mean-square convergence theorem is proved for stochastic differential equations (SDEs) in which coefficients are allowed to grow polynomially at infinity and which satisfy a one-sided Lipschitz condition. The theorem is illustrated on a number of particular numerical methods, including a special balanced scheme and fully implicit methods. The proposed special balanc...

A numerical method for solving nonlinear Fredholm-Volterra integral equations of general type is presented. This method is based on replacement of unknown function by truncated series of well known Chebyshev expansion of functions. The quadrature formulas which we use to calculate integral terms have been imated by Fast Fourier Transform (FFT). This is a grate advantage of this method which has...