Flat iteration is a variation on the original binary version of the Kleene star operation P Q, obtained by restricting the rst argument to be a sum of atomic actions. It generalizes pre x iteration, in which the rst argument is a single action. Complete nite equational axiomatizations are given for ve notions of bisimulation congruence over basic CCS with at iteration, viz. strong congruence, b...

In this paper we propose a new iteration process, called AK iteration process, for approximation of fixed points for contraction mappings. We show that our iteration process is faster than the leading Vatan Two-step iteration process for contraction mappings. Numerical examples are given to support the analytic proofs. Stability of AK iteration process and data dependence result for contraction...

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.

this paper presents an efficient modification of the variational iteration method for solvingboundary value problems using the chebyshev polynomials. the proposed method can be applied to linearand nonlinear models. the scheme is tested for some examples and the obtained results demonstrate thereliability and efficiency of the proposed method.

0

The power iteration is a classical method for computing the eigenvector associated with the largest eigenvalue of a matrix. The subspace iteration is an extension of the power iteration where the subspace spanned by n largest eigenvectors of a matrix, is determined. The natural power iteration is an exemplary instance of the subspace iteration, providing a general framework for many principal s...

The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...

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

The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...