The modified Hermitian and skew-Hermitian splitting (MHSS) iteration method and preconditioned MHSS (PMHSS) iteration method were introduced respectively. In the paper, on the basis of the MHSS iteration method, we present a PMHSS iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and complex symmetric positive definite/semi-definite matrices. Under suit...

In this paper, we apply the local fractional Laplace transform method (or Yang-Laplace transform) on Volterra integro-differential equations of the second kind within the local fractional integral operators to obtain the analytical approximate solutions. The iteration procedure is based on local fractional derivative operators. This approach provides us with a convenient way to find a solution ...

In our papers [Inverse Problems, 15, 309-327,1999] and [Numer. Math., 88, 347-365, 2001] we proposed algorithm REGINN being an inexact Newton iteration for the stable solution of nonlinear ill-posed problems. REGINN consists of two components: the outer iteration, which is a Newton iteration stopped by the discrepancy principle, and an inner iteration, which computes the Newton correction by so...

This paper compares fault position and Monte Carlo methods as the most common methods in stochastic assessment of voltage sags. To compare their abilities, symmetrical and unsymmetrical faults with different probability distribution of fault positions along the lines are applied in a test system. The voltage sag magnitude in different nodes of test system is calculated. The problem with the...

In this paper, we apply the variational iteration method (VIM) for solving telegraph equations, which arise in the propagation of electrical signals along a telegraph line. The suggested algorithm is more efficient and easier to handle as compare to the decomposition method. Numerical results show the efficiency and accuracy of the proposed VIM.

In this paper, we apply the Variational Iteration Method (VIM) for solving evolution equations. The method proved to be fully compatible for the solution of such equations. The higher accuracy of the numerical results shows complete reliability and efficiency of the suggested algorithm. Several examples are given to re-confirm the reliability of the VIM.

Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

In this paper, we import interval method to the iteration for computing Moore-Penrose inverse of the full row (or column) rank matrix. Through modifying the classical Newton iteration by interval method, we can get better numerical results. The convergence of the interval iteration is proven. We also give some numerical examples to compare interval iteration with classical Newton iteration.

An asymptotic interation method for solving second-order homogeneous linear differential equations of the form y = λ0(x)y ′ + s0(x)y is introduced, where λ0(x) 6= 0 and s0(x) are C∞ functions. Applications to Schrödinger type problems, including some with highly singular potentials, are presented. PACS 03.65.Ge Asymptotic iteration method for eigenvalue problems page 2