We show that the Adomian decomposition method, the time–series expansion, the homotopy–perturbation method, and the variational– iteration method completely fail to provide a reasonable description of the dynamics of the simplest prey–predator system. In is well known that a reasonable description of the dynamics of a nonlinear system by means of a perturbation method is a difficult enterprize ...

Reverse order restoration ROR techniques have found great use in sequential automatic test pattern generation ATPG, esp. spectral and perturbation-based ATPG. This paper deals with improving ROR for that purpose. We introduce parallel-fault multipass 2-level polynomial reverse order restoration PROR algorithms with constant complexity of the form H(n)G(n) + c where H(n) is the number of vectors...

This paper considers the number of inner iterations required per outer iteration for the algorithm proposed by Conn et al. (1992a). We show that asymptotically, under suitable reasonable assumptions, a single inner iteration suces. On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bo...

This paper deals with computational algorithms for obtaining the optimal stationary policy and the minimum cost of a discounted semi-Markov decision process. Van Nunen [23) has proposed a modified policy iteration algorithm with a suboptimality test of MacQueen type, where the modified policy iteration algorithm is policy iteration method with the policy evaluation routine by a finite number of...

‎In this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎The proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the Newton equation system‎, ‎by using an inexact Newton direction‎. ‎Furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programmin...

Modification of Newtons method with higher-order convergence is presented. The modification of Newtons method is based on Frontinis three-order method. The new method requires two-step per iteration. Analysis of convergence demonstrates that the order of convergence is 6. Some numerical examples illustrate that the algorithm is more efficient and performs better than classical Newtons method and ...

in this paper robust pid control of fully-constrained cable driven parallel manipulators with elastic cables is studied in detail. in dynamic analysis, it is assumed that the dominant dynamics of cable can be approximated by linear axial spring. to develop the idea of control for cable robots with elastic cables, a robust pid control for cable driven robots with ideal rigid cables is firstly de...

0