In many iterative schemes, the precision of each step depends on the computational effort spent on that step. A method of specifying a suitable amount of computation at each step is described. The approach is adaptive and aimed at minimizing the overall computational cost subject to attaining a final iterate that satisfies a suitable error criterion. General and particular cost functions are co...

Interference graphs are used for performance analysis of multiprocessor interconnection networks. In order to model blocked transmissions, nodes can have three states: idle, active or blocked. The resulting steady state probability distribution has a non-product form. Macro states are introduced to calculate performance measures, and the corresponding macro state probability distribution is app...

We analyze inexact fixed point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed point iteration. Important applications are the Picard iteration and partitioned fluid structure interaction. We prove that the iteration converges irrespective of ho...

the purpose of this paper is to study the convergence and the almost sure t-stability of the modied sp-type random iterative algorithm in a separable banach spaces. the bochner in-tegrability of andom xed points of this kind of random operators, the convergence and the almost sure t-stability for this kind of generalized asymptotically quasi-nonexpansive random mappings are obtained. our resu...

This paper proposes a geometric iteration algorithm for computing point projection and inversion on planar parametric curves based on local biarc approximation. The iteration begins with initial estimation of the projection of the prescribed test point. For each iteration, we construct a biarc that locally approximates a segment on the original curve starting from the current projective point. ...

Berinde [V. Berinde, Approximating fixed points of weak contractions using the Picard iteration, Nonlinear Anal. Forum {bf 9} (2004), 43-53] introduced almost contraction mappings and proved Banach contraction principle for such mappings. The aim of this paper is to introduce the notion of multivalued almost $Theta$- contraction mappings andto prove some best proximity point results for t...

In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.

we show that the variational inequality $vi(c,a)$ has aunique solution for a relaxed $(gamma , r)$-cocoercive,$mu$-lipschitzian mapping $a: cto h$ with $r>gamma mu^2$, where$c$ is a nonempty closed convex subset of a hilbert space $h$. fromthis result, it can be derived that, for example, the recentalgorithms given in the references of this paper, despite theirbecoming more complicated, are not...

a power digraph, denoted by $g(n,k)$, is a directed graph with $z_{n}={0,1,..., n-1}$ as the set of vertices and $l={(x,y):x^{k}equiv y~(bmod , n)}$ as the edge set, where $n$ and $k$ are any positive integers. in this paper, the structure of $g(2q+1,k)$, where $q$ is a sophie germain prime is investigated. the primality tests for the integers of the form $n=2q+1$ are established in terms of th...

in this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual interior point method (ipm) based on a new kernel function with a trigonometric barrier term. iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. although our proposed kernel function is neither a self-regular (sr) function nor logarithmic barrier ...