In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.

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.

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

for solving large sparse non-hermitian positive definite linear equations, bai et al. proposed the hermitian and skew-hermitian splitting methods (hss). they recently generalized this technique to the normal and skew-hermitian splitting methods (nss). in this paper, we present an accelerated normal and skew-hermitian splitting methods (anss) which involve two parameters for the nss iteration. w...

In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.