Abstract A new algorithm for the estimation of robustness a dynamical system’s equilibrium is presented. Unlike standard approaches, does not aim to identify entire basin attraction solution. Instead, it iteratively estimates so-called local integrity measure, that is, radius largest hypersphere entirely included in solution and centred The procedure completely overlooks intermingled fractal re...

Approximate deconvolution forms a mathematical framework for the structural modeling of turbulence. The sub-filter scale flow quantities are typically recovered by using the Van Cittert iterative procedure. In this paper, however, we put forth a generalized approach for the iterative deconvolution process of sub-filter scale recovery of turbulent flows by introducing Krylov space iterative meth...

Abstract: This paper presents new LMI characterizations for stability, H2 and H∞ norms of discrete-time descriptor systems. Based on these characterizations, an iterative design procedure for multiobjective and structurally constrained feedback control are proposed. The first key idea of the iterative design procedure is embedding the previously designed feedback gain K̂ in the descriptor repres...

‎In a real Hilbert space‎, ‎an iterative scheme is considered to‎ ‎obtain strong convergence which is an essential tool to find a‎ ‎common fixed point for a countable family of nonexpansive mappings‎ ‎and the solution of a variational inequality problem governed by a‎ ‎monotone mapping‎. ‎In this paper‎, ‎we give a procedure which results‎ ‎in developing Shehu's result to solve equilibrium prob...

.-\.0. iterative approximation algorithm for analyzing a closed queueing system with a K-sibling fork/ join queue is presented. The iterative procedure is based on a combination of nearly complete decomposability and the Gauss-Seidel method. The approximation procedure gives good results for the mean response time and the system throughput. However, it gives results which are an upper bound of ...

An iterative procedure for the game of Matching Pennies is examined in which players use Nash’s map to respond to mixed strategies of the other players. It is shown that even though the game of Matching Pennies is a game with a unique Nash equilibrium point, the iterative procedure does not lead to convergence to the Nash equilibrium. In fact we find that if the game is played using this iterat...

The Miettinen & Nurminen (1985) method is often used for constructing confidence intervals of the difference in binomial proportions from stratified 2x2 samples. However, the weighting strategy proposed in their paper requires an iterative procedure to implement, which is nested within another iterative procedure for finding the confidence limits. This paper examines the Cochran-Mantel-Haenszel...