in this article we study steensen method to solve nonlinear matrix equation x+a^t x^(-1) a=q, when a is a normal matrix. we establish some conditions that generate a sequence of positive denite matrices which converges to solution of this equation.

Uniform crossover for binary strings has a natural geometric interpretation that allows us to generalize it rigorously to any search space endowed with a notion of distance and any representation [6]. In this paper, we present an analogous characterization for one-point crossover and explicitly derive formally specific one-point crossovers for a number of well-known representations.

We classify all one-point order-compactifications of a noncompact locally compact order-Hausdorff ordered topological space X. We give a necessary and sufficient condition for a one-point order-compactification of X to be a Priestley space. We show that although among the one-point order-compactifications of X there may not be a least one, there always is a largest one, which coincides with the...

Given a set A ={a1, . . . ,an} of n image points and a set B ={b1, . . . ,bn} of n model points,the problem is to find a transformation matching (a one-to-one mapping) each point a ∈ A tosome point b ∈ B such that the length of the longest edge in the matching is minimized (so-calledbottleneck distance). The geometric transformations we allow are translation, rot...